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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 19:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 19:54 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 51K 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 1716474425164

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 14:27:06] [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:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:27:06] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-23 14:27:06] [INFO ] Transformed 125 places.
[2024-05-23 14:27:06] [INFO ] Transformed 246 transitions.
[2024-05-23 14:27:06] [INFO ] Found NUPN structural information;
[2024-05-23 14:27:06] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 154 ms.
Graph (trivial) has 194 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Structural test allowed to assert that 26 places are NOT stable. Took 24 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
[2024-05-23 14:27:06] [INFO ] Flatten gal took : 73 ms
[2024-05-23 14:27:07] [INFO ] Flatten gal took : 55 ms
[2024-05-23 14:27:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14756016023185293115.gal : 36 ms
RANDOM walk for 40000 steps (3677 resets) in 1793 ms. (22 steps per ms) remains 36/99 properties
[2024-05-23 14:27:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17065347918097786630.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/ReachabilityCardinality14756016023185293115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17065347918097786630.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (50 resets) in 69 ms. (57 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (47 resets) in 67 ms. (58 steps per ms) remains 36/36 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17065347918097786630.prop.
BEST_FIRST walk for 4003 steps (44 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 80 ms. (49 steps per ms) remains 36/36 properties
SDD proceeding with computation,36 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,36 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,36 properties remain. new max is 16
SDD size :13 after 109
SDD proceeding with computation,36 properties remain. new max is 32
SDD size :109 after 730
SDD proceeding with computation,36 properties remain. new max is 64
SDD size :730 after 4296
BEST_FIRST walk for 4004 steps (49 resets) in 81 ms. (48 steps per ms) remains 36/36 properties
SDD proceeding with computation,36 properties remain. new max is 128
SDD size :4296 after 4506
SDD proceeding with computation,36 properties remain. new max is 256
SDD size :4506 after 5074
BEST_FIRST walk for 4003 steps (49 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
SDD proceeding with computation,36 properties remain. new max is 512
SDD size :5074 after 7240
BEST_FIRST walk for 4003 steps (50 resets) in 68 ms. (58 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (46 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (49 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (47 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
SDD proceeding with computation,36 properties remain. new max is 1024
SDD size :7240 after 31576
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (44 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
SDD proceeding with computation,36 properties remain. new max is 2048
SDD size :31576 after 39520
BEST_FIRST walk for 4001 steps (49 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (50 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (49 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (48 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
Invariant property smplace_91 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_64 does not hold.
Invariant property smplace_7 does not hold.
SDD proceeding with computation,32 properties remain. new max is 2048
SDD size :39520 after 70036
[2024-05-23 14:27:07] [INFO ] Flow matrix only has 223 transitions (discarded 11 similar events)
// Phase 1: matrix 223 rows 122 cols
[2024-05-23 14:27:07] [INFO ] Computed 14 invariants in 10 ms
[2024-05-23 14:27:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Invariant property smplace_94 does not hold.
Invariant property smplace_8 does not hold.
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :70036 after 98587
Invariant property smplace_99 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_66 does not hold.
Invariant property smplace_56 does not hold.
Invariant property smplace_6 does not hold.
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :98587 after 146177
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Invariant property smplace_102 does not hold.
Invariant property smplace_9 does not hold.
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :146177 after 173929
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 46/78 variables, 8/40 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 46/86 constraints. Problems are: Problem set: 10 solved, 22 unsolved
Invariant property smplace_114 does not hold.
Invariant property smplace_14 does not hold.
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :173929 after 246443
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 44/122 variables, 6/92 constraints. Problems are: Problem set: 12 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :246443 after 275526
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 44/136 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 222/344 variables, 122/258 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/258 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/259 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/259 constraints. Problems are: Problem set: 12 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :275526 after 363878
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/259 constraints. Problems are: Problem set: 12 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 259 constraints, problems are : Problem set: 12 solved, 20 unsolved in 988 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 54/74 variables, 8/28 constraints. Problems are: Problem set: 12 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 54/82 constraints. Problems are: Problem set: 12 solved, 20 unsolved
[2024-05-23 14:27:08] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 10 ms to minimize.
[2024-05-23 14:27:08] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-23 14:27:08] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:27:08] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:27:08] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 2 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 13/95 constraints. Problems are: Problem set: 12 solved, 20 unsolved
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 7 ms to minimize.
Invariant property smplace_113 does not hold.
Invariant property smplace_55 does not hold.
SDD proceeding with computation,18 properties remain. new max is 8192
SDD size :363878 after 593830
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 3/98 constraints. Problems are: Problem set: 14 solved, 18 unsolved
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/99 constraints. Problems are: Problem set: 14 solved, 18 unsolved
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/100 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/100 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 48/122 variables, 6/106 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 48/154 constraints. Problems are: Problem set: 14 solved, 18 unsolved
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:27:09] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
Invariant property smplace_83 does not hold.
Invariant property smplace_57 does not hold.
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :593830 after 704104
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 5/159 constraints. Problems are: Problem set: 16 solved, 16 unsolved
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 7/166 constraints. Problems are: Problem set: 16 solved, 16 unsolved
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-23 14:27:10] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 5/171 constraints. Problems are: Problem set: 16 solved, 16 unsolved
Invariant property smplace_109 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_60 does not hold.
Invariant property smplace_59 does not hold.
Invariant property smplace_58 does not hold.
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :704104 after 1.13113e+06
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/171 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 222/344 variables, 122/293 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 9/302 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 0/302 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/345 variables, 1/303 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/345 variables, 0/303 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/345 variables, 0/303 constraints. Problems are: Problem set: 23 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 303 constraints, problems are : Problem set: 23 solved, 9 unsolved in 2551 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/32 constraints, Known Traps: 35/35 constraints]
After SMT, in 3592ms problems are : Problem set: 23 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 8 properties in 125 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 234/234 transitions.
Graph (complete) has 457 edges and 122 vertex of which 114 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 114 transition count 220
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 112 transition count 216
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 110 transition count 215
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 74 place count 52 transition count 99
Iterating global reduction 3 with 58 rules applied. Total rules applied 132 place count 52 transition count 99
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 142 place count 42 transition count 79
Iterating global reduction 3 with 10 rules applied. Total rules applied 152 place count 42 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 156 place count 42 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 159 place count 39 transition count 66
Iterating global reduction 4 with 3 rules applied. Total rules applied 162 place count 39 transition count 66
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 165 place count 36 transition count 60
Iterating global reduction 4 with 3 rules applied. Total rules applied 168 place count 36 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 171 place count 36 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 181 place count 31 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 31 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 185 place count 31 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 188 place count 28 transition count 76
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 191 place count 28 transition count 137
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 196 place count 25 transition count 135
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 197 place count 24 transition count 101
Iterating global reduction 7 with 1 rules applied. Total rules applied 198 place count 24 transition count 101
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 199 place count 23 transition count 99
Iterating global reduction 7 with 1 rules applied. Total rules applied 200 place count 23 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 204 place count 23 transition count 95
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 211 place count 23 transition count 95
Applied a total of 211 rules in 89 ms. Remains 23 /122 variables (removed 99) and now considering 95/234 (removed 139) transitions.
Running 79 sub problems to find dead transitions.
[2024-05-23 14:27:11] [INFO ] Flow matrix only has 69 transitions (discarded 26 similar events)
// Phase 1: matrix 69 rows 23 cols
[2024-05-23 14:27:11] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 14:27:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 3 (OVERLAPS) 69/92 variables, 23/29 constraints. Problems are: Problem set: 8 solved, 71 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 11/40 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/40 constraints. Problems are: Problem set: 10 solved, 69 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :1.13113e+06 after 1.52873e+06
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/40 constraints. Problems are: Problem set: 10 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 40 constraints, problems are : Problem set: 10 solved, 69 unsolved in 688 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 69/92 variables, 23/29 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 11/40 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 69/109 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/109 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/109 constraints. Problems are: Problem set: 10 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 109 constraints, problems are : Problem set: 10 solved, 69 unsolved in 1030 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 69/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 1855ms problems are : Problem set: 10 solved, 69 unsolved
Search for dead transitions found 10 dead transitions in 1861ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/122 places, 85/234 transitions.
Graph (complete) has 74 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1986 ms. Remains : 22/122 places, 85/234 transitions.
RANDOM walk for 9452 steps (1487 resets) in 201 ms. (46 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 101 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 7096 ms.

BK_STOP 1716474433467

--------------------
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-05"
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-05, 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-171640617900458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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