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.r180-tall-171640604300822.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604300822
=====================================================================

--------------------
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

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

=== Now, execution of the tool begins

BK_START 1716521240130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 03:27:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:27:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:27:21] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-24 03:27:21] [INFO ] Transformed 453 places.
[2024-05-24 03:27:21] [INFO ] Transformed 594 transitions.
[2024-05-24 03:27:21] [INFO ] Found NUPN structural information;
[2024-05-24 03:27:21] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:27:22] [INFO ] Flatten gal took : 164 ms
[2024-05-24 03:27:22] [INFO ] Flatten gal took : 82 ms
RANDOM walk for 40000 steps (165 resets) in 1948 ms. (20 steps per ms) remains 12/15 properties
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:27:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5881142373481483454.gal : 40 ms
BEST_FIRST walk for 40003 steps (69 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
[2024-05-24 03:27:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7366131558103239575.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/ReachabilityCardinality5881142373481483454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7366131558103239575.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (71 resets) in 146 ms. (272 steps per ms) remains 12/12 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 ...328
Loading property file /tmp/ReachabilityCardinality7366131558103239575.prop.
BEST_FIRST walk for 40004 steps (104 resets) in 497 ms. (80 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :11 after 24
SDD proceeding with computation,12 properties remain. new max is 32
BEST_FIRST walk for 40004 steps (65 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
SDD size :24 after 48
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :48 after 138
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :138 after 2550
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :2550 after 1.53612e+06
BEST_FIRST walk for 40003 steps (57 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (84 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 168 ms. (236 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (70 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (70 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (68 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (84 resets) in 1092 ms. (36 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (59 resets) in 58 ms. (677 steps per ms) remains 11/11 properties
// Phase 1: matrix 594 rows 453 cols
[2024-05-24 03:27:23] [INFO ] Computed 14 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 146/253 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 146/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-16-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 200/453 variables, 6/267 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 200/467 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-24 03:27:24] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 1/468 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 594/1047 variables, 453/921 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1047 variables, 0/921 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1047 variables, 0/921 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 921 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1628 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem HealthRecord-PT-16-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 158/229 variables, 8/79 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 158/237 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 119 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 10 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 16 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 4 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 3 ms to minimize.
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 13/250 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 117 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 102 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 3/253 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 98 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/254 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 224/453 variables, 6/261 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 224/485 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/486 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:27] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:27:27] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:27:27] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:27:27] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:27:27] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 5/491 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/491 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 594/1047 variables, 453/944 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1047 variables, 9/953 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:28] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1047 variables, 1/954 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:28] [INFO ] Deduced a trap composed of 187 places in 121 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1047 variables, 1/955 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1047 variables, 0/955 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1047 variables, 0/955 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 955 constraints, problems are : Problem set: 2 solved, 9 unsolved in 4755 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 26/26 constraints]
After SMT, in 6526ms problems are : Problem set: 2 solved, 9 unsolved
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 2457 ms.
Support contains 9 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 492 edges and 453 vertex of which 32 / 453 are part of one of the 16 SCC in 7 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 840 edges and 437 vertex of which 424 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 210 place count 424 transition count 349
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 232 rules applied. Total rules applied 442 place count 216 transition count 325
Reduce places removed 11 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 21 rules applied. Total rules applied 463 place count 205 transition count 315
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 475 place count 195 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 476 place count 194 transition count 313
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 476 place count 194 transition count 304
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 494 place count 185 transition count 304
Discarding 66 places :
Symmetric choice reduction at 5 with 66 rule applications. Total rules 560 place count 119 transition count 189
Iterating global reduction 5 with 66 rules applied. Total rules applied 626 place count 119 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 631 place count 119 transition count 184
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 647 place count 103 transition count 152
Iterating global reduction 6 with 16 rules applied. Total rules applied 663 place count 103 transition count 152
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 668 place count 98 transition count 147
Iterating global reduction 6 with 5 rules applied. Total rules applied 673 place count 98 transition count 147
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 676 place count 95 transition count 141
Iterating global reduction 6 with 3 rules applied. Total rules applied 679 place count 95 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 680 place count 95 transition count 140
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 681 place count 94 transition count 138
Iterating global reduction 7 with 1 rules applied. Total rules applied 682 place count 94 transition count 138
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 683 place count 93 transition count 136
Iterating global reduction 7 with 1 rules applied. Total rules applied 684 place count 93 transition count 136
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 734 place count 68 transition count 111
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 739 place count 68 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 741 place count 67 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 742 place count 67 transition count 104
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 754 place count 61 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 757 place count 61 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 758 place count 61 transition count 131
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 759 place count 60 transition count 128
Iterating global reduction 10 with 1 rules applied. Total rules applied 760 place count 60 transition count 128
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 761 place count 59 transition count 127
Iterating global reduction 10 with 1 rules applied. Total rules applied 762 place count 59 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 763 place count 59 transition count 126
Free-agglomeration rule applied 16 times.
Iterating global reduction 10 with 16 rules applied. Total rules applied 779 place count 59 transition count 110
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 796 place count 43 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 799 place count 43 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 800 place count 43 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 801 place count 42 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 802 place count 42 transition count 105
Applied a total of 802 rules in 120 ms. Remains 42 /453 variables (removed 411) and now considering 105/594 (removed 489) transitions.
Running 103 sub problems to find dead transitions.
[2024-05-24 03:27:32] [INFO ] Flow matrix only has 94 transitions (discarded 11 similar events)
// Phase 1: matrix 94 rows 42 cols
[2024-05-24 03:27:32] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 03:27:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD103 is UNSAT
At refinement iteration 3 (OVERLAPS) 94/136 variables, 42/48 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/136 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 53 constraints, problems are : Problem set: 1 solved, 102 unsolved in 1177 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 3/42 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 94/136 variables, 42/48 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 102/155 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 155 constraints, problems are : Problem set: 1 solved, 102 unsolved in 1472 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 102/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 2725ms problems are : Problem set: 1 solved, 102 unsolved
Search for dead transitions found 1 dead transitions in 2726ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 42/453 places, 104/594 transitions.
Graph (complete) has 156 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 40 transition count 100
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 40 transition count 100
Applied a total of 9 rules in 5 ms. Remains 40 /42 variables (removed 2) and now considering 100/104 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2868 ms. Remains : 40/453 places, 100/594 transitions.
RANDOM walk for 40000 steps (4524 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (916 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (982 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 38176 steps, run visited all 2 properties in 92 ms. (steps per millisecond=414 )
Probabilistic random walk after 38176 steps, saw 9516 distinct states, run finished after 95 ms. (steps per millisecond=401 ) properties seen :2
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 14074 ms.

BK_STOP 1716521255404

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640604300822"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;