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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 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 125K 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 1716474719226

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 14:32:00] [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:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:32:00] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-23 14:32:00] [INFO ] Transformed 453 places.
[2024-05-23 14:32:00] [INFO ] Transformed 594 transitions.
[2024-05-23 14:32:00] [INFO ] Found NUPN structural information;
[2024-05-23 14:32:00] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 188 ms.
Graph (trivial) has 535 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 11 ms
Free SCC test removed 32 places
Structural test allowed to assert that 201 places are NOT stable. Took 30 ms.
Ensure Unique test removed 35 transitions
Reduce redundant transitions removed 35 transitions.
[2024-05-23 14:32:01] [INFO ] Flatten gal took : 154 ms
RANDOM walk for 40000 steps (403 resets) in 2117 ms. (18 steps per ms) remains 217/252 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 24 ms. (16 steps per ms) remains 217/217 properties
[2024-05-23 14:32:01] [INFO ] Flatten gal took : 50 ms
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 162 ms. (2 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 217/217 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 217/217 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 217/217 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 217/217 properties
[2024-05-23 14:32:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15350526338654031363.gal : 32 ms
[2024-05-23 14:32:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality272102961586910644.prop : 2 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/ReachabilityCardinality15350526338654031363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality272102961586910644.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
[2024-05-23 14:32:01] [INFO ] Flow matrix only has 543 transitions (discarded 16 similar events)
Loading property file /tmp/ReachabilityCardinality272102961586910644.prop.
// Phase 1: matrix 543 rows 421 cols
[2024-05-23 14:32:01] [INFO ] Computed 14 invariants in 23 ms
[2024-05-23 14:32:01] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,217 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,217 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,217 properties remain. new max is 16
SDD size :11 after 24
SDD proceeding with computation,217 properties remain. new max is 32
SDD size :24 after 48
SDD proceeding with computation,217 properties remain. new max is 64
SDD size :48 after 138
SDD proceeding with computation,217 properties remain. new max is 128
SDD size :138 after 2442
SDD proceeding with computation,217 properties remain. new max is 256
SDD size :2442 after 1.40863e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 58/275 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 58/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 146/421 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 146/435 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/964 variables, and 435 constraints, problems are : Problem set: 0 solved, 217 unsolved in 5063 ms.
Refiners :[Domain max(s): 421/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 58/275 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 58/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 14:32:07] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 14 ms to minimize.
[2024-05-23 14:32:08] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 88 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 113 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 1 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 2 ms to minimize.
[2024-05-23 14:32:09] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 2 ms to minimize.
[2024-05-23 14:32:10] [INFO ] Deduced a trap composed of 113 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:32:10] [INFO ] Deduced a trap composed of 90 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:32:10] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 6 ms to minimize.
[2024-05-23 14:32:10] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:32:10] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 18/301 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 14:32:11] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:32:11] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/964 variables, and 303 constraints, problems are : Problem set: 0 solved, 217 unsolved in 5041 ms.
Refiners :[Domain max(s): 275/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/217 constraints, Known Traps: 20/20 constraints]
After SMT, in 10257ms problems are : Problem set: 0 solved, 217 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 217 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 559/559 transitions.
Graph (complete) has 820 edges and 421 vertex of which 414 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 414 transition count 428
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 126 rules applied. Total rules applied 251 place count 300 transition count 416
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 257 place count 294 transition count 416
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 257 place count 294 transition count 407
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 275 place count 285 transition count 407
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 303 place count 271 transition count 393
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 315 place count 265 transition count 443
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 327 place count 265 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 335 place count 265 transition count 423
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 345 place count 265 transition count 413
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 355 place count 255 transition count 413
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 357 place count 255 transition count 411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 359 place count 253 transition count 411
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 369 place count 253 transition count 411
Applied a total of 369 rules in 130 ms. Remains 253 /421 variables (removed 168) and now considering 411/559 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 253/421 places, 411/559 transitions.
RANDOM walk for 4000000 steps (418169 resets) in 30449 ms. (131 steps per ms) remains 22/217 properties
BEST_FIRST walk for 400002 steps (6933 resets) in 497 ms. (803 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6920 resets) in 793 ms. (503 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6953 resets) in 813 ms. (491 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6964 resets) in 563 ms. (709 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (6921 resets) in 544 ms. (733 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (6889 resets) in 822 ms. (486 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (6952 resets) in 808 ms. (494 steps per ms) remains 17/22 properties
BEST_FIRST walk for 400003 steps (6903 resets) in 605 ms. (660 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (6922 resets) in 495 ms. (806 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (6920 resets) in 717 ms. (557 steps per ms) remains 15/17 properties
BEST_FIRST walk for 400003 steps (6929 resets) in 599 ms. (666 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6946 resets) in 468 ms. (852 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (6964 resets) in 678 ms. (589 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (7011 resets) in 686 ms. (582 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6923 resets) in 508 ms. (785 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (6923 resets) in 477 ms. (836 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (6967 resets) in 645 ms. (619 steps per ms) remains 15/15 properties
// Phase 1: matrix 411 rows 253 cols
[2024-05-23 14:32:25] [INFO ] Computed 7 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 54/69 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 184/253 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 184/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 411/664 variables, 253/513 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/664 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 513 constraints, problems are : Problem set: 0 solved, 15 unsolved in 516 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 54/69 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 184/253 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 184/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 411/664 variables, 253/513 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 15/528 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 14:32:26] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 1 ms to minimize.
[2024-05-23 14:32:26] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-23 14:32:26] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 1 ms to minimize.
[2024-05-23 14:32:26] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 17 ms to minimize.
[2024-05-23 14:32:26] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 1 ms to minimize.
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 2 ms to minimize.
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 2 ms to minimize.
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 2 ms to minimize.
[2024-05-23 14:32:27] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 6/540 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:32:28] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 5/547 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/664 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/664 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 547 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3616 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 19/19 constraints]
After SMT, in 4144ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 856 ms.
Support contains 9 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 411/411 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 253 transition count 310
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 117 rules applied. Total rules applied 218 place count 152 transition count 294
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 223 place count 147 transition count 294
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 223 place count 147 transition count 289
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 233 place count 142 transition count 289
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 284 place count 91 transition count 167
Iterating global reduction 3 with 51 rules applied. Total rules applied 335 place count 91 transition count 167
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 345 place count 81 transition count 147
Iterating global reduction 3 with 10 rules applied. Total rules applied 355 place count 81 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 359 place count 81 transition count 143
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 362 place count 78 transition count 140
Iterating global reduction 4 with 3 rules applied. Total rules applied 365 place count 78 transition count 140
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 368 place count 75 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 371 place count 75 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 374 place count 72 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 377 place count 72 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 380 place count 69 transition count 122
Iterating global reduction 4 with 3 rules applied. Total rules applied 383 place count 69 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 386 place count 69 transition count 119
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 402 place count 61 transition count 111
Performed 10 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 422 place count 51 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 424 place count 51 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 426 place count 51 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 427 place count 51 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 428 place count 50 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 429 place count 50 transition count 162
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 435 place count 50 transition count 162
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 440 place count 50 transition count 162
Applied a total of 440 rules in 51 ms. Remains 50 /253 variables (removed 203) and now considering 162/411 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 50/253 places, 162/411 transitions.
RANDOM walk for 1978284 steps (202073 resets) in 63503 ms. (31 steps per ms) remains 0/9 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 254 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 59970 ms.

BK_STOP 1716474780361

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

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