fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r202-smll-167840348600366
Last Updated
May 14, 2023

About the Execution of Marcie+red for HealthRecord-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6608.384 102742.00 127978.00 681.00 TFTFFFFTTFFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348600366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
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 r202-smll-167840348600366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 175K Mar 5 18:22 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-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678732766772

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:39:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:39:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:39:30] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-13 18:39:30] [INFO ] Transformed 624 places.
[2023-03-13 18:39:30] [INFO ] Transformed 828 transitions.
[2023-03-13 18:39:30] [INFO ] Found NUPN structural information;
[2023-03-13 18:39:30] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-17-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 940 ms. (steps per millisecond=10 ) properties (out of 12) seen :4
FORMULA HealthRecord-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 828 rows 624 cols
[2023-03-13 18:39:32] [INFO ] Computed 18 place invariants in 23 ms
[2023-03-13 18:39:32] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 18:39:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2023-03-13 18:39:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-13 18:39:34] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-13 18:39:34] [INFO ] Deduced a trap composed of 128 places in 359 ms of which 11 ms to minimize.
[2023-03-13 18:39:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2023-03-13 18:39:35] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 1 ms to minimize.
[2023-03-13 18:39:35] [INFO ] Deduced a trap composed of 130 places in 204 ms of which 2 ms to minimize.
[2023-03-13 18:39:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 584 ms
[2023-03-13 18:39:36] [INFO ] After 2544ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-13 18:39:36] [INFO ] After 3457ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA HealthRecord-PT-17-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 76 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 582 edges and 624 vertex of which 48 / 624 are part of one of the 17 SCC in 6 ms
Free SCC test removed 31 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 1246 edges and 593 vertex of which 584 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 584 transition count 565
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 232 rules applied. Total rules applied 445 place count 373 transition count 544
Reduce places removed 8 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 38 rules applied. Total rules applied 483 place count 365 transition count 514
Reduce places removed 30 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 32 rules applied. Total rules applied 515 place count 335 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 516 place count 334 transition count 512
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 516 place count 334 transition count 502
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 536 place count 324 transition count 502
Discarding 70 places :
Symmetric choice reduction at 5 with 70 rule applications. Total rules 606 place count 254 transition count 378
Iterating global reduction 5 with 70 rules applied. Total rules applied 676 place count 254 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 678 place count 254 transition count 376
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 688 place count 244 transition count 357
Iterating global reduction 6 with 10 rules applied. Total rules applied 698 place count 244 transition count 357
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 770 place count 208 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 771 place count 208 transition count 319
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 797 place count 195 transition count 386
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 804 place count 195 transition count 379
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 834 place count 195 transition count 349
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 855 place count 195 transition count 328
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 876 place count 174 transition count 328
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 878 place count 174 transition count 326
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 879 place count 174 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 880 place count 173 transition count 326
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 881 place count 173 transition count 326
Applied a total of 881 rules in 228 ms. Remains 173 /624 variables (removed 451) and now considering 326/828 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 173/624 places, 326/828 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 676723 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 676723 steps, saw 120081 distinct states, run finished after 3005 ms. (steps per millisecond=225 ) properties seen :2
FORMULA HealthRecord-PT-17-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-13 18:39:40] [INFO ] Flow matrix only has 322 transitions (discarded 4 similar events)
// Phase 1: matrix 322 rows 173 cols
[2023-03-13 18:39:40] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 18:39:40] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:39:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-13 18:39:40] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-13 18:39:40] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:39:40] [INFO ] After 144ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:41] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2023-03-13 18:39:41] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2023-03-13 18:39:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-03-13 18:39:41] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-13 18:39:41] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 23 ms.
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 326/326 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 172 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 172 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 171 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 170 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 170 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 169 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 169 transition count 318
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 169 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 168 transition count 317
Applied a total of 10 rules in 80 ms. Remains 168 /173 variables (removed 5) and now considering 317/326 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 168/173 places, 317/326 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 693412 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 693412 steps, saw 128199 distinct states, run finished after 3003 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 18:39:44] [INFO ] Flow matrix only has 313 transitions (discarded 4 similar events)
// Phase 1: matrix 313 rows 168 cols
[2023-03-13 18:39:44] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-13 18:39:44] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:39:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-13 18:39:45] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-13 18:39:45] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:39:45] [INFO ] After 153ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:45] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2023-03-13 18:39:45] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-13 18:39:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-13 18:39:45] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-13 18:39:46] [INFO ] After 1051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 73 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 317/317 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 168/168 places, 317/317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 317/317 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2023-03-13 18:39:46] [INFO ] Flow matrix only has 313 transitions (discarded 4 similar events)
[2023-03-13 18:39:46] [INFO ] Invariant cache hit.
[2023-03-13 18:39:46] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-13 18:39:46] [INFO ] Flow matrix only has 313 transitions (discarded 4 similar events)
[2023-03-13 18:39:46] [INFO ] Invariant cache hit.
[2023-03-13 18:39:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:39:46] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-13 18:39:46] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-13 18:39:46] [INFO ] Flow matrix only has 313 transitions (discarded 4 similar events)
[2023-03-13 18:39:46] [INFO ] Invariant cache hit.
[2023-03-13 18:39:46] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 168/168 places, 317/317 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 313
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 168 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 167 transition count 309
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 167 transition count 308
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 167 transition count 308
Applied a total of 24 rules in 36 ms. Remains 167 /168 variables (removed 1) and now considering 308/317 (removed 9) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 308 rows 167 cols
[2023-03-13 18:39:46] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 18:39:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:39:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-13 18:39:46] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-13 18:39:47] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 18:39:47] [INFO ] After 107ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:47] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2023-03-13 18:39:47] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-03-13 18:39:47] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-13 18:39:47] [INFO ] After 930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:39:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-13 18:39:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 317 transitions and 1062 arcs took 2 ms.
[2023-03-13 18:39:48] [INFO ] Flatten gal took : 89 ms
Total runtime 17922 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: HealthRecord_PT_17
(NrP: 168 NrTr: 317 NrArc: 1062)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.009sec

net check time: 0m 0.000sec

init dd package: 0m 3.538sec


RS generation: 0m33.510sec


-> reachability set: #nodes 21238 (2.1e+04) #states 17,469,697,743 (10)



starting MCC model checker
--------------------------

checking: EF [[p108<=1 & 1<=p108]]
normalized: E [true U [p108<=1 & 1<=p108]]

abstracting: (1<=p108)
states: 36
abstracting: (p108<=1)
states: 17,469,697,743 (10)
-> the formula is TRUE

FORMULA HealthRecord-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.440sec

checking: EF [[[p96<=1 & 1<=p96] & [[[p148<=1 & 1<=p148] | [[p48<=0 & 0<=p48] | [[[p96<=0 & 0<=p96] & [[p134<=0 & 0<=p134] | [p100<=1 & 1<=p100]]] & [[[p115<=1 & 1<=p115] | [p56<=0 & 0<=p56]] & [[[p31<=0 & 0<=p31] | [p22<=0 & 0<=p22]] | [[p18<=1 & 1<=p18] | [[p54<=1 & 1<=p54] & [[p165<=0 & 0<=p165] | [p61<=1 & 1<=p61]]]]]]]]] & [[[[p107<=0 & 0<=p107] & [p39<=1 & 1<=p39]] | [[p68<=0 & 0<=p68] & [p146<=1 & 1<=p146]]] | [[[p93<=0 & 0<=p93] & [p36<=1 & 1<=p36]] | [[[[p146<=0 & 0<=p146] & [p88<=1 & 1<=p88]] & [[[p136<=1 & 1<=p136] | [[p16<=1 & 1<=p16] & [p53<=1 & 1<=p53]]] & [[[p4<=0 & 0<=p4] & [p58<=1 & 1<=p58]] | [[[p40<=0 & 0<=p40] & [[p34<=1 & 1<=p34] & [p139<=1 & 1<=p139]]] | [[p32<=0 & 0<=p32] & [[p65<=1 & 1<=p65] & [p5<=0 & 0<=p5]]]]]]] | [[p47<=0 & 0<=p47] & [[p141<=0 & 0<=p141] | [p128<=1 & 1<=p128]]]]]]]]]
normalized: E [true U [[[[[[[[[[[p61<=1 & 1<=p61] | [p165<=0 & 0<=p165]] & [p54<=1 & 1<=p54]] | [p18<=1 & 1<=p18]] | [[p22<=0 & 0<=p22] | [p31<=0 & 0<=p31]]] & [[p56<=0 & 0<=p56] | [p115<=1 & 1<=p115]]] & [[[p100<=1 & 1<=p100] | [p134<=0 & 0<=p134]] & [p96<=0 & 0<=p96]]] | [p48<=0 & 0<=p48]] | [p148<=1 & 1<=p148]] & [[[[p36<=1 & 1<=p36] & [p93<=0 & 0<=p93]] | [[[p47<=0 & 0<=p47] & [[p141<=0 & 0<=p141] | [p128<=1 & 1<=p128]]] | [[[[[[[p5<=0 & 0<=p5] & [p65<=1 & 1<=p65]] & [p32<=0 & 0<=p32]] | [[p40<=0 & 0<=p40] & [[p34<=1 & 1<=p34] & [p139<=1 & 1<=p139]]]] | [[p58<=1 & 1<=p58] & [p4<=0 & 0<=p4]]] & [[[p16<=1 & 1<=p16] & [p53<=1 & 1<=p53]] | [p136<=1 & 1<=p136]]] & [[p88<=1 & 1<=p88] & [p146<=0 & 0<=p146]]]]] | [[[p146<=1 & 1<=p146] & [p68<=0 & 0<=p68]] | [[p39<=1 & 1<=p39] & [p107<=0 & 0<=p107]]]]] & [p96<=1 & 1<=p96]]]

abstracting: (1<=p96)
states: 32
abstracting: (p96<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p107)
states: 17,469,697,743 (10)
abstracting: (p107<=0)
states: 13,979,853,479 (10)
abstracting: (1<=p39)
states: 347,155,720 (8)
abstracting: (p39<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p68)
states: 17,469,697,743 (10)
abstracting: (p68<=0)
states: 16,081,330,111 (10)
abstracting: (1<=p146)
states: 1,091,062,671 (9)
abstracting: (p146<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p146)
states: 17,469,697,743 (10)
abstracting: (p146<=0)
states: 16,378,635,072 (10)
abstracting: (1<=p88)
states: 1,765,256,320 (9)
abstracting: (p88<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p136)
states: 2,039,857,222 (9)
abstracting: (p136<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p53)
states: 36
abstracting: (p53<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p16)
states: 487,872,858 (8)
abstracting: (p16<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p4)
states: 17,469,697,743 (10)
abstracting: (p4<=0)
states: 17,469,697,711 (10)
abstracting: (1<=p58)
states: 1,388,367,632 (9)
abstracting: (p58<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p139)
states: 5,428,731 (6)
abstracting: (p139<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p34)
states: 498,717,952 (8)
abstracting: (p34<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p40)
states: 17,469,697,743 (10)
abstracting: (p40<=0)
states: 17,122,542,023 (10)
abstracting: (0<=p32)
states: 17,469,697,743 (10)
abstracting: (p32<=0)
states: 16,486,858,201 (10)
abstracting: (1<=p65)
states: 499,807,060 (8)
abstracting: (p65<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p5)
states: 17,469,697,743 (10)
abstracting: (p5<=0)
states: 17,291,765,782 (10)
abstracting: (1<=p128)
states: 1,137,246,855 (9)
abstracting: (p128<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p141)
states: 17,469,697,743 (10)
abstracting: (p141<=0)
states: 17,464,269,012 (10)
abstracting: (0<=p47)
states: 17,469,697,743 (10)
abstracting: (p47<=0)
states: 16,289,160,217 (10)
abstracting: (0<=p93)
states: 17,469,697,743 (10)
abstracting: (p93<=0)
states: 15,479,148,183 (10)
abstracting: (1<=p36)
states: 485,493,988 (8)
abstracting: (p36<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p148)
states: 404,914,364 (8)
abstracting: (p148<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p48)
states: 17,469,697,743 (10)
abstracting: (p48<=0)
states: 16,479,083,739 (10)
abstracting: (0<=p96)
states: 17,469,697,743 (10)
abstracting: (p96<=0)
states: 17,469,697,711 (10)
abstracting: (0<=p134)
states: 17,469,697,743 (10)
abstracting: (p134<=0)
states: 17,064,237,723 (10)
abstracting: (1<=p100)
states: 1,587,487,620 (9)
abstracting: (p100<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p115)
states: 36
abstracting: (p115<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p56)
states: 17,469,697,743 (10)
abstracting: (p56<=0)
states: 16,081,330,111 (10)
abstracting: (0<=p31)
states: 17,469,697,743 (10)
abstracting: (p31<=0)
states: 16,289,160,217 (10)
abstracting: (0<=p22)
states: 17,469,697,743 (10)
abstracting: (p22<=0)
states: 16,229,685,780 (10)
abstracting: (1<=p18)
states: 345,536,228 (8)
abstracting: (p18<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p54)
states: 1,138,672,298 (9)
abstracting: (p54<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p165)
states: 17,469,697,743 (10)
abstracting: (p165<=0)
states: 16,244,358,873 (10)
abstracting: (1<=p61)
states: 600,338,260 (8)
abstracting: (p61<=1)
states: 17,469,697,743 (10)
-> the formula is TRUE

FORMULA HealthRecord-PT-17-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.935sec

checking: AG [[[[p59<=0 & 0<=p59] | [[[p44<=1 & 1<=p44] & [[[p81<=1 & 1<=p81] | [[p7<=0 & 0<=p7] & [p45<=1 & 1<=p45]]] & [[[[p132<=0 & 0<=p132] | [p14<=0 & 0<=p14]] | [[p122<=1 & 1<=p122] | [p38<=0 & 0<=p38]]] | [[[p159<=1 & 1<=p159] | [p80<=1 & 1<=p80]] | [[p86<=0 & 0<=p86] | [[p33<=1 & 1<=p33] | [[[p90<=0 & 0<=p90] & [p124<=1 & 1<=p124]] & [[p26<=0 & 0<=p26] & [[p1<=1 & 1<=p1] & [p147<=0 & 0<=p147]]]]]]]]]] | [[p126<=1 & 1<=p126] & [[[p11<=0 & 0<=p11] | [p151<=1 & 1<=p151]] & [[p83<=0 & 0<=p83] | [p28<=1 & 1<=p28]]]]]] | [[[[p130<=0 & 0<=p130] & [p94<=1 & 1<=p94]] & [[[p77<=0 & 0<=p77] | [p142<=1 & 1<=p142]] & [[p141<=1 & 1<=p141] | [p128<=0 & 0<=p128]]]] | [[[p71<=1 & 1<=p71] & [[p118<=0 & 0<=p118] & [[p144<=0 & 0<=p144] | [p98<=1 & 1<=p98]]]] | [[[p24<=0 & 0<=p24] & [[p63<=0 & 0<=p63] & [p42<=1 & 1<=p42]]] & [[p65<=1 & 1<=p65] & [[p74<=0 & 0<=p74] & [[p78<=0 & 0<=p78] | [[p116<=0 & 0<=p116] & [p104<=1 & 1<=p104]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p104<=1 & 1<=p104] & [p116<=0 & 0<=p116]] | [p78<=0 & 0<=p78]] & [p74<=0 & 0<=p74]] & [p65<=1 & 1<=p65]] & [[[p42<=1 & 1<=p42] & [p63<=0 & 0<=p63]] & [p24<=0 & 0<=p24]]] | [[[[p98<=1 & 1<=p98] | [p144<=0 & 0<=p144]] & [p118<=0 & 0<=p118]] & [p71<=1 & 1<=p71]]] | [[[[p128<=0 & 0<=p128] | [p141<=1 & 1<=p141]] & [[p142<=1 & 1<=p142] | [p77<=0 & 0<=p77]]] & [[p94<=1 & 1<=p94] & [p130<=0 & 0<=p130]]]] | [[[[[[p28<=1 & 1<=p28] | [p83<=0 & 0<=p83]] & [[p151<=1 & 1<=p151] | [p11<=0 & 0<=p11]]] & [p126<=1 & 1<=p126]] | [[[[[[[[[[p147<=0 & 0<=p147] & [p1<=1 & 1<=p1]] & [p26<=0 & 0<=p26]] & [[p124<=1 & 1<=p124] & [p90<=0 & 0<=p90]]] | [p33<=1 & 1<=p33]] | [p86<=0 & 0<=p86]] | [[p80<=1 & 1<=p80] | [p159<=1 & 1<=p159]]] | [[[p38<=0 & 0<=p38] | [p122<=1 & 1<=p122]] | [[p14<=0 & 0<=p14] | [p132<=0 & 0<=p132]]]] & [[[p45<=1 & 1<=p45] & [p7<=0 & 0<=p7]] | [p81<=1 & 1<=p81]]] & [p44<=1 & 1<=p44]]] | [p59<=0 & 0<=p59]]]]]]

abstracting: (0<=p59)
states: 17,469,697,743 (10)
abstracting: (p59<=0)
states: 16,855,595,351 (10)
abstracting: (1<=p44)
states: 988,880,318 (8)
abstracting: (p44<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p81)
states: 1,588,622,988 (9)
abstracting: (p81<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p7)
states: 17,469,697,743 (10)
abstracting: (p7<=0)
states: 16,229,685,780 (10)
abstracting: (1<=p45)
states: 984,853,134 (8)
abstracting: (p45<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p132)
states: 17,469,697,743 (10)
abstracting: (p132<=0)
states: 17,064,237,723 (10)
abstracting: (0<=p14)
states: 17,469,697,743 (10)
abstracting: (p14<=0)
states: 16,971,096,660 (10)
abstracting: (1<=p122)
states: 121,050 (5)
abstracting: (p122<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p38)
states: 17,469,697,743 (10)
abstracting: (p38<=0)
states: 16,984,203,755 (10)
abstracting: (1<=p159)
states: 75,475,680 (7)
abstracting: (p159<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p80)
states: 1,786,173,040 (9)
abstracting: (p80<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p86)
states: 17,469,697,743 (10)
abstracting: (p86<=0)
states: 15,684,281,615 (10)
abstracting: (1<=p33)
states: 498,717,952 (8)
abstracting: (p33<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p90)
states: 17,469,697,743 (10)
abstracting: (p90<=0)
states: 15,479,148,183 (10)
abstracting: (1<=p124)
states: 1,259,077,022 (9)
abstracting: (p124<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p26)
states: 17,469,697,743 (10)
abstracting: (p26<=0)
states: 17,291,765,782 (10)
abstracting: (1<=p1)
states: 1
abstracting: (p1<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p147)
states: 17,469,697,743 (10)
abstracting: (p147<=0)
states: 17,064,783,379 (10)
abstracting: (1<=p126)
states: 1,243,631,391 (9)
abstracting: (p126<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p11)
states: 17,469,697,743 (10)
abstracting: (p11<=0)
states: 16,229,685,780 (10)
abstracting: (1<=p151)
states: 90,748,224 (7)
abstracting: (p151<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p83)
states: 17,469,697,743 (10)
abstracting: (p83<=0)
states: 15,683,524,703 (10)
abstracting: (1<=p28)
states: 290,038,932 (8)
abstracting: (p28<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p130)
states: 17,469,697,743 (10)
abstracting: (p130<=0)
states: 17,081,830,259 (10)
abstracting: (1<=p94)
states: 1,990,549,560 (9)
abstracting: (p94<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p77)
states: 17,469,697,743 (10)
abstracting: (p77<=0)
states: 15,684,281,615 (10)
abstracting: (1<=p142)
states: 5,428,731 (6)
abstracting: (p142<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p141)
states: 5,428,731 (6)
abstracting: (p141<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p128)
states: 17,469,697,743 (10)
abstracting: (p128<=0)
states: 16,332,450,888 (10)
abstracting: (1<=p71)
states: 260,590,158 (8)
abstracting: (p71<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p118)
states: 17,469,697,743 (10)
abstracting: (p118<=0)
states: 13,781,633,914 (10)
abstracting: (0<=p144)
states: 17,469,697,743 (10)
abstracting: (p144<=0)
states: 17,464,269,012 (10)
abstracting: (1<=p98)
states: 1,786,173,040 (9)
abstracting: (p98<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p24)
states: 17,469,697,743 (10)
abstracting: (p24<=0)
states: 17,291,765,782 (10)
abstracting: (0<=p63)
states: 17,469,697,743 (10)
abstracting: (p63<=0)
states: 16,969,890,683 (10)
abstracting: (1<=p42)
states: 500,167,080 (8)
abstracting: (p42<=1)
states: 17,469,697,743 (10)
abstracting: (1<=p65)
states: 499,807,060 (8)
abstracting: (p65<=1)
states: 17,469,697,743 (10)
abstracting: (0<=p74)
states: 17,469,697,743 (10)
abstracting: (p74<=0)
states: 17,469,041,066 (10)
abstracting: (0<=p78)
states: 17,469,697,743 (10)
abstracting: (p78<=0)
states: 17,469,697,711 (10)
abstracting: (0<=p116)
states: 17,469,697,743 (10)
abstracting: (p116<=0)
states: 14,267,601,329 (10)
abstracting: (1<=p104)
states: 1,786,173,040 (9)
abstracting: (p104<=1)
states: 17,469,697,743 (10)
-> the formula is FALSE

FORMULA HealthRecord-PT-17-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.919sec

totally nodes used: 16645096 (1.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 63150590 173906484 237057074
used/not used/entry size/cache size: 63279453 3829411 16 1024MB
basic ops cache: hits/miss/sum: 6496080 14914864 21410944
used/not used/entry size/cache size: 13586882 3190334 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 119338 322814 442152
used/not used/entry size/cache size: 317663 8070945 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 53859636
1 10516296
2 2180897
3 456934
4 81222
5 12169
6 1518
7 173
8 19
9 0
>= 10 0

Total processing time: 1m20.317sec


BK_STOP 1678732869514

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

18385 21344 19395 18901 19106 19129 19532 19840 20972 21210
iterations count:1006942 (3176), effective:37254 (117)

initing FirstDep: 0m 0.000sec

28489
iterations count:195621 (617), effective:6791 (21)
28406
iterations count:168231 (530), effective:5834 (18)

iterations count:30450 (96), effective:984 (3)

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="marciexred"
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-5348"
echo " Executing tool marciexred"
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 r202-smll-167840348600366"
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 ;