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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10078.899 652108.00 670770.00 2148.10 FTTTFTFTTTTTTTTT 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-167840348500329.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-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 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 71K 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-13-CTLCardinality-00
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-01
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-02
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-03
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-04
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-05
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-06
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-07
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-08
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-09
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-10
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-11
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-12
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-13
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-14
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678705485980

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 11:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:04:49] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-13 11:04:49] [INFO ] Transformed 161 places.
[2023-03-13 11:04:49] [INFO ] Transformed 341 transitions.
[2023-03-13 11:04:49] [INFO ] Found NUPN structural information;
[2023-03-13 11:04:49] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Initial state reduction rules removed 4 formulas.
FORMULA HealthRecord-PT-13-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 103 transition count 199
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 103 transition count 199
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 100 transition count 193
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 100 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 100 transition count 192
Applied a total of 123 rules in 53 ms. Remains 100 /161 variables (removed 61) and now considering 192/313 (removed 121) transitions.
[2023-03-13 11:04:50] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
// Phase 1: matrix 182 rows 100 cols
[2023-03-13 11:04:50] [INFO ] Computed 16 place invariants in 29 ms
[2023-03-13 11:04:50] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-13 11:04:50] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
[2023-03-13 11:04:50] [INFO ] Invariant cache hit.
[2023-03-13 11:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:04:50] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-13 11:04:50] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
[2023-03-13 11:04:50] [INFO ] Invariant cache hit.
[2023-03-13 11:04:51] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/161 places, 192/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 100/161 places, 192/313 transitions.
Support contains 62 out of 100 places after structural reductions.
[2023-03-13 11:04:51] [INFO ] Flatten gal took : 90 ms
[2023-03-13 11:04:51] [INFO ] Flatten gal took : 40 ms
[2023-03-13 11:04:51] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 53 out of 100 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 767 resets, run finished after 1126 ms. (steps per millisecond=8 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-13 11:04:53] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
[2023-03-13 11:04:53] [INFO ] Invariant cache hit.
[2023-03-13 11:04:53] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-13 11:04:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-13 11:04:53] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-13 11:04:53] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-13 11:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:04:54] [INFO ] After 227ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :16
[2023-03-13 11:04:54] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 10 ms to minimize.
[2023-03-13 11:04:54] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-13 11:04:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-03-13 11:04:54] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2023-03-13 11:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-13 11:04:54] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2023-03-13 11:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-13 11:04:54] [INFO ] After 1014ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-13 11:04:55] [INFO ] After 1860ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 37 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 63 edges and 100 vertex of which 6 / 100 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 447 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 96 transition count 174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 95 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 94 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 17 place count 84 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 27 place count 84 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 84 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 83 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 83 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 82 transition count 148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 78 transition count 165
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 78 transition count 163
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 61 place count 78 transition count 163
Applied a total of 61 rules in 95 ms. Remains 78 /100 variables (removed 22) and now considering 163/192 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 78/100 places, 163/192 transitions.
Incomplete random walk after 10000 steps, including 762 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 11:04:56] [INFO ] Flow matrix only has 160 transitions (discarded 3 similar events)
// Phase 1: matrix 160 rows 78 cols
[2023-03-13 11:04:56] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-13 11:04:56] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 11:04:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-13 11:04:56] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 11:04:56] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 11:04:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 11:04:56] [INFO ] After 41ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 11:04:56] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-03-13 11:04:56] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2023-03-13 11:04:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-13 11:04:56] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-13 11:04:56] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 10 ms.
Support contains 14 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 163/163 transitions.
Graph (complete) has 475 edges and 78 vertex of which 73 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 62 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 62 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 62 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 61 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 58 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 58 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 56 transition count 146
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 56 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 55 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 55 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 55 transition count 140
Applied a total of 46 rules in 54 ms. Remains 55 /78 variables (removed 23) and now considering 140/163 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 55/78 places, 140/163 transitions.
Incomplete random walk after 10000 steps, including 859 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:04:57] [INFO ] Flow matrix only has 129 transitions (discarded 11 similar events)
// Phase 1: matrix 129 rows 55 cols
[2023-03-13 11:04:57] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-13 11:04:57] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:04:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 11:04:57] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:04:57] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-13 11:04:57] [INFO ] After 52ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:04:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-13 11:04:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-13 11:04:57] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-13 11:04:57] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 13 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 140/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 136
Applied a total of 4 rules in 20 ms. Remains 53 /55 variables (removed 2) and now considering 136/140 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 53/55 places, 136/140 transitions.
Incomplete random walk after 10000 steps, including 839 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Finished probabilistic random walk after 6281 steps, run visited all 3 properties in 84 ms. (steps per millisecond=74 )
Probabilistic random walk after 6281 steps, saw 1764 distinct states, run finished after 85 ms. (steps per millisecond=73 ) properties seen :3
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA HealthRecord-PT-13-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 26 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 28 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 192 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 71 transition count 139
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 71 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 71 transition count 135
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 67 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 67 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 67 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 65 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 65 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 63 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 63 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 63 transition count 109
Applied a total of 86 rules in 20 ms. Remains 63 /100 variables (removed 37) and now considering 109/192 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 63/100 places, 109/192 transitions.
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 14 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 15 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 67 transition count 132
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 67 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 67 transition count 128
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 63 transition count 120
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 63 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 63 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 61 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 61 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 59 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 59 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 59 transition count 102
Applied a total of 94 rules in 21 ms. Remains 59 /100 variables (removed 41) and now considering 102/192 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 59/100 places, 102/192 transitions.
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 13 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 14 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 66 transition count 130
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 66 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 66 transition count 126
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 61 transition count 116
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 61 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 61 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 59 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 59 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 58 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 58 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 58 transition count 102
Applied a total of 94 rules in 23 ms. Remains 58 /100 variables (removed 42) and now considering 102/192 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 58/100 places, 102/192 transitions.
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 13 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 14 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 96 edges and 100 vertex of which 8 / 100 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 62 transition count 124
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 62 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 73 place count 62 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 58 transition count 110
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 55 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 53 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 53 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 97 place count 53 transition count 91
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 53 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 52 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 51 transition count 87
Applied a total of 102 rules in 39 ms. Remains 51 /100 variables (removed 49) and now considering 87/192 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 51/100 places, 87/192 transitions.
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 125 edges and 100 vertex of which 8 / 100 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 58 transition count 120
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 58 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 80 place count 58 transition count 115
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 53 transition count 105
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 53 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 50 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 50 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 47 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 47 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 113 place count 47 transition count 79
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 47 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 46 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 45 transition count 75
Applied a total of 118 rules in 30 ms. Remains 45 /100 variables (removed 55) and now considering 75/192 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 45/100 places, 75/192 transitions.
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 75 transitions.
Incomplete random walk after 10000 steps, including 1006 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 1512 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=756 )
FORMULA HealthRecord-PT-13-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 122 edges and 100 vertex of which 8 / 100 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 61 transition count 125
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 61 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 73 place count 61 transition count 123
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 57 transition count 115
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 57 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 57 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 55 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 55 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 53 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 53 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 53 transition count 96
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 53 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 51 transition count 92
Applied a total of 104 rules in 25 ms. Remains 51 /100 variables (removed 49) and now considering 92/192 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 51/100 places, 92/192 transitions.
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:04:58] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:04:58] [INFO ] Input system was already deterministic with 92 transitions.
Finished random walk after 5192 steps, including 470 resets, run visited all 1 properties in 12 ms. (steps per millisecond=432 )
FORMULA HealthRecord-PT-13-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 62 transition count 123
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 62 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 81 place count 62 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 58 transition count 110
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 58 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 56 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 56 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 55 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 55 transition count 96
Applied a total of 101 rules in 8 ms. Remains 55 /100 variables (removed 45) and now considering 96/192 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 55/100 places, 96/192 transitions.
[2023-03-13 11:04:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:04:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:04:59] [INFO ] Input system was already deterministic with 96 transitions.
[2023-03-13 11:04:59] [INFO ] Flatten gal took : 11 ms
[2023-03-13 11:04:59] [INFO ] Flatten gal took : 11 ms
[2023-03-13 11:04:59] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 11:04:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 192 transitions and 587 arcs took 2 ms.
Total runtime 9436 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 100 NrTr: 192 NrArc: 587)

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

net check time: 0m 0.000sec

init dd package: 0m 3.636sec


RS generation: 0m18.355sec


-> reachability set: #nodes 281541 (2.8e+05) #states 76,936,342 (7)



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

checking: AF [EX [[EF [[p62<=1 & 1<=p62]] & E [[p59<=0 & 0<=p59] U ~ [[p0<=1 & 1<=p0]]]]]]
normalized: ~ [EG [~ [EX [[E [[p59<=0 & 0<=p59] U ~ [[p0<=1 & 1<=p0]]] & E [true U [p62<=1 & 1<=p62]]]]]]]

abstracting: (1<=p62)
states: 8,464,584 (6)
abstracting: (p62<=1)
states: 76,936,342 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 76,936,342 (7)
abstracting: (0<=p59)
states: 76,936,342 (7)
abstracting: (p59<=0)
states: 76,058,722 (7)
..
EG iterations: 1
-> the formula is TRUE

FORMULA HealthRecord-PT-13-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m40.775sec

checking: [EF [AG [AX [[[0<=p9 & p9<=0] | [[p69<=1 & 1<=p69] | [[p52<=0 & 0<=p52] & [p24<=1 & 1<=p24]]]]]]] | AG [[[[[p43<=0 & 0<=p43] & [p1<=1 & 1<=p1]] & [[p35<=0 & 0<=p35] & [p60<=1 & 1<=p60]]] | [[p98<=0 & 0<=p98] & [p84<=1 & 1<=p84]]]]]
normalized: [~ [E [true U ~ [[[[p84<=1 & 1<=p84] & [p98<=0 & 0<=p98]] | [[[p60<=1 & 1<=p60] & [p35<=0 & 0<=p35]] & [[p1<=1 & 1<=p1] & [p43<=0 & 0<=p43]]]]]]] | E [true U ~ [E [true U EX [~ [[[[[p24<=1 & 1<=p24] & [p52<=0 & 0<=p52]] | [p69<=1 & 1<=p69]] | [0<=p9 & p9<=0]]]]]]]]

abstracting: (p9<=0)
states: 68,991,910 (7)
abstracting: (0<=p9)
states: 76,936,342 (7)
abstracting: (1<=p69)
states: 13,694,436 (7)
abstracting: (p69<=1)
states: 76,936,342 (7)
abstracting: (0<=p52)
states: 76,936,342 (7)
abstracting: (p52<=0)
states: 59,429,842 (7)
abstracting: (1<=p24)
states: 9,416,916 (6)
abstracting: (p24<=1)
states: 76,936,342 (7)
.
before gc: list nodes free: 859569

after gc: idd nodes used:899054, unused:63100946; list nodes free:289573350
abstracting: (0<=p43)
states: 76,936,342 (7)
abstracting: (p43<=0)
states: 63,588,366 (7)
abstracting: (1<=p1)
states: 2,828,604 (6)
abstracting: (p1<=1)
states: 76,936,342 (7)
abstracting: (0<=p35)
states: 76,936,342 (7)
abstracting: (p35<=0)
states: 76,936,333 (7)
abstracting: (1<=p60)
states: 877,620 (5)
abstracting: (p60<=1)
states: 76,936,342 (7)
abstracting: (0<=p98)
states: 76,936,342 (7)
abstracting: (p98<=0)
states: 71,839,366 (7)
abstracting: (1<=p84)
states: 124,416 (5)
abstracting: (p84<=1)
states: 76,936,342 (7)
-> the formula is TRUE

FORMULA HealthRecord-PT-13-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m20.101sec

checking: ~ [E [AG [[[p5<=0 & 0<=p5] | [p2<=1 & 1<=p2]]] U ~ [[EX [AF [[[p42<=0 & 0<=p42] | [p68<=1 & 1<=p68]]]] | [[[[p43<=1 & 1<=p43] & [p83<=1 & 1<=p83]] | EX [[[p89<=0 & 0<=p89] | [p16<=1 & 1<=p16]]]] & AX [[[p12<=0 & 0<=p12] | [p25<=1 & 1<=p25]]]]]]]]
normalized: ~ [E [~ [E [true U ~ [[[p2<=1 & 1<=p2] | [p5<=0 & 0<=p5]]]]] U ~ [[[~ [EX [~ [[[p25<=1 & 1<=p25] | [p12<=0 & 0<=p12]]]]] & [EX [[[p16<=1 & 1<=p16] | [p89<=0 & 0<=p89]]] | [[p83<=1 & 1<=p83] & [p43<=1 & 1<=p43]]]] | EX [~ [EG [~ [[[p68<=1 & 1<=p68] | [p42<=0 & 0<=p42]]]]]]]]]]

abstracting: (0<=p42)
states: 76,936,342 (7)
abstracting: (p42<=0)
states: 65,187,134 (7)
abstracting: (1<=p68)
states: 1
abstracting: (p68<=1)
states: 76,936,342 (7)
.........
EG iterations: 9
.abstracting: (1<=p43)
states: 13,347,976 (7)
abstracting: (p43<=1)
states: 76,936,342 (7)
abstracting: (1<=p83)
states: 4,469,976 (6)
abstracting: (p83<=1)
states: 76,936,342 (7)
abstracting: (0<=p89)
states: 76,936,342 (7)
abstracting: (p89<=0)
states: 74,436,466 (7)
abstracting: (1<=p16)
states: 8,550,744 (6)
abstracting: (p16<=1)
states: 76,936,342 (7)
.abstracting: (0<=p12)
states: 76,936,342 (7)
abstracting: (p12<=0)
states: 73,795,354 (7)
abstracting: (1<=p25)
states: 6,566,424 (6)
abstracting: (p25<=1)
states: 76,936,342 (7)
.abstracting: (0<=p5)
states: 76,936,342 (7)
abstracting: (p5<=0)
states: 71,232,142 (7)
abstracting: (1<=p2)
states: 9
abstracting: (p2<=1)
states: 76,936,342 (7)
-> the formula is TRUE

FORMULA HealthRecord-PT-13-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m44.577sec

checking: EF [[AG [[p30<=1 & 1<=p30]] | [~ [E [[[p11<=0 & 0<=p11] | [p70<=1 & 1<=p70]] U [[p47<=0 & 0<=p47] | [p19<=1 & 1<=p19]]]] & A [[E [[p71<=1 & 1<=p71] U [p78<=0 & 0<=p78]] | EF [[p20<=1 & 1<=p20]]] U [AG [[[p2<=0 & 0<=p2] | [p54<=1 & 1<=p54]]] | [[p70<=0 & 0<=p70] | [p63<=1 & 1<=p63]]]]]]]
normalized: E [true U [[[~ [EG [~ [[[[p63<=1 & 1<=p63] | [p70<=0 & 0<=p70]] | ~ [E [true U ~ [[[p54<=1 & 1<=p54] | [p2<=0 & 0<=p2]]]]]]]]] & ~ [E [~ [[[[p63<=1 & 1<=p63] | [p70<=0 & 0<=p70]] | ~ [E [true U ~ [[[p54<=1 & 1<=p54] | [p2<=0 & 0<=p2]]]]]]] U [~ [[E [true U [p20<=1 & 1<=p20]] | E [[p71<=1 & 1<=p71] U [p78<=0 & 0<=p78]]]] & ~ [[[[p63<=1 & 1<=p63] | [p70<=0 & 0<=p70]] | ~ [E [true U ~ [[[p54<=1 & 1<=p54] | [p2<=0 & 0<=p2]]]]]]]]]]] & ~ [E [[[p70<=1 & 1<=p70] | [p11<=0 & 0<=p11]] U [[p19<=1 & 1<=p19] | [p47<=0 & 0<=p47]]]]] | ~ [E [true U ~ [[p30<=1 & 1<=p30]]]]]]

abstracting: (1<=p30)
states: 9
abstracting: (p30<=1)
states: 76,936,342 (7)
abstracting: (0<=p47)
states: 76,936,342 (7)
abstracting: (p47<=0)
states: 76,936,333 (7)
abstracting: (1<=p19)
states: 8,653,320 (6)
abstracting: (p19<=1)
states: 76,936,342 (7)
abstracting: (0<=p11)
states: 76,936,342 (7)
abstracting: (p11<=0)
states: 65,871,106 (7)
abstracting: (1<=p70)
states: 13,694,437 (7)
abstracting: (p70<=1)
states: 76,936,342 (7)
abstracting: (0<=p2)
states: 76,936,342 (7)
abstracting: (p2<=0)
states: 76,936,333 (7)
abstracting: (1<=p54)
states: 19,827,536 (7)
abstracting: (p54<=1)
states: 76,936,342 (7)

before gc: list nodes free: 509188

after gc: idd nodes used:1702690, unused:62297310; list nodes free:285989373
abstracting: (0<=p70)
states: 76,936,342 (7)
abstracting: (p70<=0)
states: 63,241,905 (7)
abstracting: (1<=p63)
states: 8,423,112 (6)
abstracting: (p63<=1)
states: 76,936,342 (7)
abstracting: (0<=p78)
states: 76,936,342 (7)
abstracting: (p78<=0)
states: 72,426,430 (7)
abstracting: (1<=p71)
states: 5
abstracting: (p71<=1)
states: 76,936,342 (7)
abstracting: (1<=p20)
states: 12,121,812 (7)
abstracting: (p20<=1)
states: 76,936,342 (7)
abstracting: (0<=p2)
states: 76,936,342 (7)
abstracting: (p2<=0)
states: 76,936,333 (7)
abstracting: (1<=p54)
states: 19,827,536 (7)
abstracting: (p54<=1)
states: 76,936,342 (7)
abstracting: (0<=p70)
states: 76,936,342 (7)
abstracting: (p70<=0)
states: 63,241,905 (7)
abstracting: (1<=p63)
states: 8,423,112 (6)
abstracting: (p63<=1)
states: 76,936,342 (7)
abstracting: (0<=p2)
states: 76,936,342 (7)
abstracting: (p2<=0)
states: 76,936,333 (7)
abstracting: (1<=p54)
states: 19,827,536 (7)
abstracting: (p54<=1)
states: 76,936,342 (7)
abstracting: (0<=p70)
states: 76,936,342 (7)
abstracting: (p70<=0)
states: 63,241,905 (7)
abstracting: (1<=p63)
states: 8,423,112 (6)
abstracting: (p63<=1)
states: 76,936,342 (7)
.........
EG iterations: 9
-> the formula is TRUE

FORMULA HealthRecord-PT-13-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m10.056sec

checking: AX [E [[~ [[[[0<=p58 & p58<=0] | [p16<=1 & 1<=p16]] & [[p40<=0 & 0<=p40] & ~ [[[p61<=0 & 0<=p61] | [p49<=1 & 1<=p49]]]]]] | [A [[p5<=0 & 0<=p5] U E [[p1<=1 & 1<=p1] U [p29<=1 & 1<=p29]]] | EG [AG [[[p56<=0 & 0<=p56] | [p76<=1 & 1<=p76]]]]]] U AF [[[p91<=1 & 1<=p91] & [[[p7<=0 & 0<=p7] | [p93<=1 & 1<=p93]] | [[p17<=1 & 1<=p17] | [p37<=0 & 0<=p37]]]]]]]
normalized: ~ [EX [~ [E [[~ [[[~ [[[p49<=1 & 1<=p49] | [p61<=0 & 0<=p61]]] & [p40<=0 & 0<=p40]] & [[p16<=1 & 1<=p16] | [0<=p58 & p58<=0]]]] | [EG [~ [E [true U ~ [[[p76<=1 & 1<=p76] | [p56<=0 & 0<=p56]]]]]] | [~ [EG [~ [E [[p1<=1 & 1<=p1] U [p29<=1 & 1<=p29]]]]] & ~ [E [~ [E [[p1<=1 & 1<=p1] U [p29<=1 & 1<=p29]]] U [~ [[p5<=0 & 0<=p5]] & ~ [E [[p1<=1 & 1<=p1] U [p29<=1 & 1<=p29]]]]]]]]] U ~ [EG [~ [[[[[p93<=1 & 1<=p93] | [p7<=0 & 0<=p7]] | [[p37<=0 & 0<=p37] | [p17<=1 & 1<=p17]]] & [p91<=1 & 1<=p91]]]]]]]]]

abstracting: (1<=p91)
states: 1
abstracting: (p91<=1)
states: 76,936,342 (7)
abstracting: (1<=p17)
states: 6,328,896 (6)
abstracting: (p17<=1)
states: 76,936,342 (7)
abstracting: (0<=p37)
states: 76,936,342 (7)
abstracting: (p37<=0)
states: 59,428,870 (7)
abstracting: (0<=p7)
states: 76,936,342 (7)
abstracting: (p7<=0)
states: 69,006,370 (7)
abstracting: (1<=p93)
states: 1
abstracting: (p93<=1)
states: 76,936,342 (7)
.
EG iterations: 1
abstracting: (1<=p29)
states: 13,446,996 (7)
abstracting: (p29<=1)
states: 76,936,342 (7)
abstracting: (1<=p1)
states: 2,828,604 (6)
abstracting: (p1<=1)
states: 76,936,342 (7)
abstracting: (0<=p5)
states: 76,936,342 (7)
abstracting: (p5<=0)
states: 71,232,142 (7)
abstracting: (1<=p29)
states: 13,446,996 (7)
abstracting: (p29<=1)
states: 76,936,342 (7)
abstracting: (1<=p1)
states: 2,828,604 (6)
abstracting: (p1<=1)
states: 76,936,342 (7)
abstracting: (1<=p29)
states: 13,446,996 (7)
abstracting: (p29<=1)
states: 76,936,342 (7)
abstracting: (1<=p1)
states: 2,828,604 (6)
abstracting: (p1<=1)
states: 76,936,342 (7)
..
EG iterations: 2
abstracting: (0<=p56)
states: 76,936,342 (7)
abstracting: (p56<=0)
states: 76,936,338 (7)
abstracting: (1<=p76)
states: 124,416 (5)
abstracting: (p76<=1)
states: 76,936,342 (7)
.
EG iterations: 1
abstracting: (p58<=0)
states: 75,909,730 (7)
abstracting: (0<=p58)
states: 76,936,342 (7)
abstracting: (1<=p16)
states: 8,550,744 (6)
abstracting: (p16<=1)
states: 76,936,342 (7)
abstracting: (0<=p40)
states: 76,936,342 (7)
abstracting: (p40<=0)
states: 76,936,333 (7)
abstracting: (0<=p61)
states: 76,936,342 (7)
abstracting: (p61<=0)
states: 68,471,758 (7)
abstracting: (1<=p49)
states: 19,173,456 (7)
abstracting: (p49<=1)
states: 76,936,342 (7)

before gc: list nodes free: 589947

after gc: idd nodes used:2465491, unused:61534509; list nodes free:282556809
.-> the formula is TRUE

FORMULA HealthRecord-PT-13-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m16.333sec

totally nodes used: 201339395 (2.0e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 221392466 687311182 908703648
used/not used/entry size/cache size: 37189719 29919145 16 1024MB
basic ops cache: hits/miss/sum: 65384414 201458620 266843034
used/not used/entry size/cache size: 8690037 8087179 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: 1105056 3107708 4212764
used/not used/entry size/cache size: 0 8388608 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 55110520
1 9980492
2 1682084
3 287589
4 42383
5 5168
6 572
7 50
8 5
9 1
>= 10 0

Total processing time: 10m38.072sec


BK_STOP 1678706138088

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

5735
iterations count:189464 (986), effective:11262 (58)

initing FirstDep: 0m 0.000sec


iterations count:5613 (29), effective:413 (2)

iterations count:229 (1), effective:1 (0)

iterations count:4319 (22), effective:296 (1)

iterations count:13209 (68), effective:1009 (5)

iterations count:202 (1), effective:1 (0)

iterations count:3943 (20), effective:292 (1)

iterations count:10296 (53), effective:563 (2)

iterations count:192 (1), effective:0 (0)

iterations count:192 (1), effective:0 (0)

iterations count:30110 (156), effective:1981 (10)

iterations count:192 (1), effective:0 (0)

iterations count:901 (4), effective:55 (0)

iterations count:30110 (156), effective:1981 (10)

iterations count:30110 (156), effective:1981 (10)

iterations count:30110 (156), effective:1981 (10)

iterations count:1993 (10), effective:109 (0)

iterations count:1993 (10), effective:109 (0)

iterations count:3288 (17), effective:243 (1)

iterations count:1993 (10), effective:109 (0)

iterations count:18588 (96), effective:1306 (6)

iterations count:18230 (94), effective:1238 (6)

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-13"
export BK_EXAMINATION="CTLCardinality"
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-13, examination is CTLCardinality"
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-167840348500329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;