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

About the Execution of ITS-Tools for HealthRecord-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
506.340 14737.00 44580.00 45.20 TTFTTTTTFTTFTFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604300830.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-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604300830
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 26K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 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 175K 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716521823196

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 03:37:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:37:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:37:04] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-24 03:37:04] [INFO ] Transformed 624 places.
[2024-05-24 03:37:04] [INFO ] Transformed 828 transitions.
[2024-05-24 03:37:04] [INFO ] Found NUPN structural information;
[2024-05-24 03:37:04] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 198 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-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (346 resets) in 1966 ms. (20 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 350 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (61 resets) in 324 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 246 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (58 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 362 ms
BEST_FIRST walk for 40004 steps (55 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 109 ms. (363 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 106 ms
BEST_FIRST walk for 40004 steps (55 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (57 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (54 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
[2024-05-24 03:37:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15405708563661699064.gal : 63 ms
[2024-05-24 03:37:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9798548797283276478.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/ReachabilityCardinality15405708563661699064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9798548797283276478.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 828 rows 624 cols
Loading property file /tmp/ReachabilityCardinality9798548797283276478.prop.
[2024-05-24 03:37:06] [INFO ] Computed 18 invariants in 38 ms
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :27 after 55
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :55 after 363
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :363 after 4.29006e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 173/275 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 173/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 349/624 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 349/642 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 828/1452 variables, 624/1266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 1266 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1641 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 173/275 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 173/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 03:37:08] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 16 ms to minimize.
[2024-05-24 03:37:08] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:37:08] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:37:08] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 3 ms to minimize.
[2024-05-24 03:37:08] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:37:08] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-17-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 349/624 variables, 8/299 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 349/648 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:37:09] [INFO ] Deduced a trap composed of 134 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:37:09] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 2/650 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/650 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 828/1452 variables, 624/1274 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1452 variables, 9/1283 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:37:10] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:37:10] [INFO ] Deduced a trap composed of 133 places in 94 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1452 variables, 2/1285 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:37:11] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1452 variables, 1/1286 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1452 variables, 0/1286 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:37:12] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1452 variables, 1/1287 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 1287 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5012 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 12/12 constraints]
After SMT, in 6826ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 593 edges and 624 vertex of which 73 / 624 are part of one of the 20 SCC in 7 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 1217 edges and 571 vertex of which 557 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 557 transition count 545
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 229 rules applied. Total rules applied 430 place count 358 transition count 515
Reduce places removed 10 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 41 rules applied. Total rules applied 471 place count 348 transition count 484
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 502 place count 317 transition count 484
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 502 place count 317 transition count 474
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 522 place count 307 transition count 474
Discarding 72 places :
Symmetric choice reduction at 4 with 72 rule applications. Total rules 594 place count 235 transition count 364
Iterating global reduction 4 with 72 rules applied. Total rules applied 666 place count 235 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 667 place count 235 transition count 363
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 686 place count 216 transition count 326
Iterating global reduction 5 with 19 rules applied. Total rules applied 705 place count 216 transition count 326
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 707 place count 214 transition count 322
Iterating global reduction 5 with 2 rules applied. Total rules applied 709 place count 214 transition count 322
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 775 place count 181 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 777 place count 181 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 791 place count 174 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 794 place count 174 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 808 place count 174 transition count 297
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 173 transition count 296
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 173 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 812 place count 172 transition count 304
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 828 place count 172 transition count 288
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 844 place count 156 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 846 place count 156 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 848 place count 154 transition count 293
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 849 place count 154 transition count 293
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 853 place count 154 transition count 293
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 854 place count 153 transition count 292
Iterating global reduction 9 with 1 rules applied. Total rules applied 855 place count 153 transition count 292
Applied a total of 855 rules in 194 ms. Remains 153 /624 variables (removed 471) and now considering 292/828 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 153/624 places, 292/828 transitions.
RANDOM walk for 40000 steps (1496 resets) in 463 ms. (86 steps per ms) remains 8/9 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (251 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (255 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (263 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (268 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (251 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (257 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (265 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (259 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
[2024-05-24 03:37:13] [INFO ] Flow matrix only has 290 transitions (discarded 2 similar events)
// Phase 1: matrix 290 rows 153 cols
[2024-05-24 03:37:13] [INFO ] Computed 9 invariants in 12 ms
[2024-05-24 03:37:13] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 94/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 290/443 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 14/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/443 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 176 constraints, problems are : Problem set: 0 solved, 8 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 153/153 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 94/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 3 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:37:14] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 290/443 variables, 153/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 14/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:37:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/443 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 205 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 153/153 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 21/21 constraints]
After SMT, in 2856ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 985 ms.
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 292/292 transitions.
Graph (trivial) has 145 edges and 153 vertex of which 5 / 153 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 496 edges and 150 vertex of which 148 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 148 transition count 256
Reduce places removed 29 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 1 with 31 rules applied. Total rules applied 62 place count 119 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 118 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 63 place count 118 transition count 246
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 110 transition count 246
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 98 place count 91 transition count 206
Iterating global reduction 3 with 19 rules applied. Total rules applied 117 place count 91 transition count 206
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 86 transition count 191
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 86 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 86 transition count 190
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 150 place count 75 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 156 place count 75 transition count 172
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 159 place count 72 transition count 165
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 72 transition count 165
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 164 place count 70 transition count 158
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 70 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 172 place count 70 transition count 152
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 175 place count 67 transition count 148
Iterating global reduction 6 with 3 rules applied. Total rules applied 178 place count 67 transition count 148
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 179 place count 66 transition count 144
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 66 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 182 place count 66 transition count 142
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 196 place count 59 transition count 189
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 199 place count 56 transition count 179
Iterating global reduction 7 with 3 rules applied. Total rules applied 202 place count 56 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 203 place count 56 transition count 178
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 204 place count 55 transition count 174
Iterating global reduction 8 with 1 rules applied. Total rules applied 205 place count 55 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 210 place count 55 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 230 place count 55 transition count 149
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 231 place count 54 transition count 146
Iterating global reduction 9 with 1 rules applied. Total rules applied 232 place count 54 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 233 place count 54 transition count 145
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 235 place count 52 transition count 141
Iterating global reduction 10 with 2 rules applied. Total rules applied 237 place count 52 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 238 place count 52 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 239 place count 52 transition count 139
Free-agglomeration rule applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 253 place count 52 transition count 125
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 269 place count 38 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 274 place count 38 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 275 place count 38 transition count 118
Applied a total of 275 rules in 45 ms. Remains 38 /153 variables (removed 115) and now considering 118/292 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 38/153 places, 118/292 transitions.
RANDOM walk for 40000 steps (6160 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (726 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 209530 steps, run visited all 1 properties in 291 ms. (steps per millisecond=720 )
Probabilistic random walk after 209530 steps, saw 39228 distinct states, run finished after 295 ms. (steps per millisecond=710 ) properties seen :1
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-14 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 13578 ms.

BK_STOP 1716521837933

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-17"
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-17, 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-171640604300830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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