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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10338.688 3600000.00 3635459.00 9289.20 F?FFF?TFTTTFFTTF 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-167840348500305.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-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 26 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 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 69K 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-10-CTLCardinality-00
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-01
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-02
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-03
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-04
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-05
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-06
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-07
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-08
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-09
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-10
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-11
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-12
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-13
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-14
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678693675405

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-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 07:47:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:47:58] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-13 07:47:58] [INFO ] Transformed 158 places.
[2023-03-13 07:47:58] [INFO ] Transformed 333 transitions.
[2023-03-13 07:47:58] [INFO ] Found NUPN structural information;
[2023-03-13 07:47:58] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 113 transition count 218
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 113 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 112 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 112 transition count 216
Applied a total of 92 rules in 52 ms. Remains 112 /158 variables (removed 46) and now considering 216/306 (removed 90) transitions.
[2023-03-13 07:47:58] [INFO ] Flow matrix only has 206 transitions (discarded 10 similar events)
// Phase 1: matrix 206 rows 112 cols
[2023-03-13 07:47:59] [INFO ] Computed 16 place invariants in 17 ms
[2023-03-13 07:47:59] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-13 07:47:59] [INFO ] Flow matrix only has 206 transitions (discarded 10 similar events)
[2023-03-13 07:47:59] [INFO ] Invariant cache hit.
[2023-03-13 07:47:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 07:47:59] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-13 07:47:59] [INFO ] Flow matrix only has 206 transitions (discarded 10 similar events)
[2023-03-13 07:47:59] [INFO ] Invariant cache hit.
[2023-03-13 07:47:59] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/158 places, 216/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1088 ms. Remains : 112/158 places, 216/306 transitions.
Support contains 76 out of 112 places after structural reductions.
[2023-03-13 07:48:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 07:48:00] [INFO ] Flatten gal took : 95 ms
[2023-03-13 07:48:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA HealthRecord-PT-10-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:48:00] [INFO ] Flatten gal took : 46 ms
[2023-03-13 07:48:00] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 72 out of 112 places (down from 76) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 631 resets, run finished after 816 ms. (steps per millisecond=12 ) properties (out of 61) seen :31
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-13 07:48:01] [INFO ] Flow matrix only has 206 transitions (discarded 10 similar events)
[2023-03-13 07:48:01] [INFO ] Invariant cache hit.
[2023-03-13 07:48:01] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-13 07:48:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-13 07:48:02] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 27 ms returned sat
[2023-03-13 07:48:02] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :28
[2023-03-13 07:48:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 07:48:03] [INFO ] After 351ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :28
[2023-03-13 07:48:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 10 ms to minimize.
[2023-03-13 07:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-13 07:48:03] [INFO ] After 1011ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :28
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-13 07:48:03] [INFO ] After 2139ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :28
Fused 30 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 36 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 216/216 transitions.
Graph (trivial) has 90 edges and 112 vertex of which 2 / 112 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 497 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 202
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 202
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 27 place count 84 transition count 156
Iterating global reduction 0 with 23 rules applied. Total rules applied 50 place count 84 transition count 156
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 80 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 80 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 65 place count 80 transition count 141
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 74 transition count 189
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 74 transition count 187
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 74 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 72 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 72 transition count 185
Applied a total of 84 rules in 101 ms. Remains 72 /112 variables (removed 40) and now considering 185/216 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 72/112 places, 185/216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Finished probabilistic random walk after 74468 steps, run visited all 28 properties in 384 ms. (steps per millisecond=193 )
Probabilistic random walk after 74468 steps, saw 11580 distinct states, run finished after 387 ms. (steps per millisecond=192 ) properties seen :28
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA HealthRecord-PT-10-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:48:05] [INFO ] Flatten gal took : 27 ms
[2023-03-13 07:48:05] [INFO ] Flatten gal took : 22 ms
[2023-03-13 07:48:05] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 9 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 132
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 63 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 63 transition count 122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 63 transition count 113
Applied a total of 107 rules in 8 ms. Remains 63 /112 variables (removed 49) and now considering 113/216 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 63/112 places, 113/216 transitions.
[2023-03-13 07:48:05] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:48:05] [INFO ] Flatten gal took : 9 ms
[2023-03-13 07:48:05] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 56 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 54 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 53 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 53 transition count 88
Applied a total of 133 rules in 13 ms. Remains 53 /112 variables (removed 59) and now considering 88/216 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 53/112 places, 88/216 transitions.
[2023-03-13 07:48:05] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:05] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:05] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Graph (trivial) has 142 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 63 transition count 130
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 63 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 93 place count 57 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 99 place count 57 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 104 place count 57 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 56 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 56 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 55 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 55 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 55 transition count 105
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 55 transition count 101
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 2 with 4 rules applied. Total rules applied 119 place count 53 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 52 transition count 98
Applied a total of 120 rules in 49 ms. Remains 52 /112 variables (removed 60) and now considering 98/216 (removed 118) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 52/112 places, 98/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 71 transition count 141
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 71 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 64 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 104 place count 64 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 62 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 62 transition count 113
Applied a total of 108 rules in 10 ms. Remains 62 /112 variables (removed 50) and now considering 113/216 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 62/112 places, 113/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 57 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 57 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 57 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 54 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 54 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 52 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 52 transition count 85
Applied a total of 135 rules in 11 ms. Remains 52 /112 variables (removed 60) and now considering 85/216 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 52/112 places, 85/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 65 transition count 128
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 65 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 57 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 57 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 55 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 53 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 53 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 131 place count 53 transition count 88
Applied a total of 131 rules in 7 ms. Remains 53 /112 variables (removed 59) and now considering 88/216 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 53/112 places, 88/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 135
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 92 place count 63 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 98 place count 63 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 63 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 61 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 61 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 59 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 59 transition count 104
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 120 place count 59 transition count 99
Applied a total of 120 rules in 8 ms. Remains 59 /112 variables (removed 53) and now considering 99/216 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 59/112 places, 99/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 57 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 57 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 55 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 55 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 55 transition count 96
Applied a total of 125 rules in 7 ms. Remains 55 /112 variables (removed 57) and now considering 96/216 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 55/112 places, 96/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 57 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 57 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 57 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 54 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 54 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 52 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 52 transition count 86
Applied a total of 134 rules in 19 ms. Remains 52 /112 variables (removed 60) and now considering 86/216 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 52/112 places, 86/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 20 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 57 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 57 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 57 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 54 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 54 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 52 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 52 transition count 85
Applied a total of 135 rules in 25 ms. Remains 52 /112 variables (removed 60) and now considering 85/216 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 52/112 places, 85/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 216/216 transitions.
Graph (trivial) has 146 edges and 112 vertex of which 8 / 112 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 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 61 transition count 126
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 61 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 100 place count 54 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 107 place count 54 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 116 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 52 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 50 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 50 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 129 place count 50 transition count 88
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 50 transition count 86
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 133 place count 49 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 48 transition count 84
Applied a total of 134 rules in 23 ms. Remains 48 /112 variables (removed 64) and now considering 84/216 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 48/112 places, 84/216 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 20 ms
[2023-03-13 07:48:06] [INFO ] Input system was already deterministic with 84 transitions.
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 31 ms
[2023-03-13 07:48:06] [INFO ] Flatten gal took : 17 ms
[2023-03-13 07:48:06] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 07:48:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 216 transitions and 635 arcs took 5 ms.
Total runtime 8114 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: 112 NrTr: 216 NrArc: 635)

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

net check time: 0m 0.000sec

init dd package: 0m 3.480sec


RS generation: 0m35.974sec


-> reachability set: #nodes 577918 (5.8e+05) #states 95,575,295 (7)



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

checking: EF [EX [A [[[p48<=0 & 0<=p48] | [p97<=1 & 1<=p97]] U [p59<=1 & 1<=p59]]]]
normalized: E [true U EX [[~ [E [~ [[p59<=1 & 1<=p59]] U [~ [[p59<=1 & 1<=p59]] & ~ [[[p48<=0 & 0<=p48] | [p97<=1 & 1<=p97]]]]]] & ~ [EG [~ [[p59<=1 & 1<=p59]]]]]]]

abstracting: (1<=p59)
states: 21,750,624 (7)
abstracting: (p59<=1)
states: 95,575,295 (7)
.
EG iterations: 1
abstracting: (1<=p97)
states: 2,267,568 (6)
abstracting: (p97<=1)
states: 95,575,295 (7)
abstracting: (0<=p48)
states: 95,575,295 (7)
abstracting: (p48<=0)
states: 77,918,303 (7)
abstracting: (1<=p59)
states: 21,750,624 (7)
abstracting: (p59<=1)
states: 95,575,295 (7)
abstracting: (1<=p59)
states: 21,750,624 (7)
abstracting: (p59<=1)
states: 95,575,295 (7)
.
before gc: list nodes free: 1646297

after gc: idd nodes used:1440666, unused:62559334; list nodes free:293639307
-> the formula is TRUE

FORMULA HealthRecord-PT-10-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m35.413sec

checking: EG [AX [[~ [E [[p42<=1 & 1<=p42] U AG [[[p29<=0 & 0<=p29] | [p47<=1 & 1<=p47]]]]] | [p72<=1 & 1<=p72]]]]
normalized: EG [~ [EX [~ [[[p72<=1 & 1<=p72] | ~ [E [[p42<=1 & 1<=p42] U ~ [E [true U ~ [[[p47<=1 & 1<=p47] | [p29<=0 & 0<=p29]]]]]]]]]]]]

abstracting: (0<=p29)
states: 95,575,295 (7)
abstracting: (p29<=0)
states: 89,952,623 (7)
abstracting: (1<=p47)
states: 17,655,048 (7)
abstracting: (p47<=1)
states: 95,575,295 (7)
abstracting: (1<=p42)
states: 23,893,821 (7)
abstracting: (p42<=1)
states: 95,575,295 (7)

before gc: list nodes free: 16420438

after gc: idd nodes used:1432226, unused:62567774; list nodes free:293664242
abstracting: (1<=p72)
states: 1
abstracting: (p72<=1)
states: 95,575,295 (7)
...
EG iterations: 2
-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m12.501sec

checking: A [[p65<=0 & 0<=p65] U ~ [EX [EG [E [[[p94<=0 & 0<=p94] | [p63<=1 & 1<=p63]] U [p20<=1 & 1<=p20]]]]]]
normalized: [~ [EG [EX [EG [E [[[p63<=1 & 1<=p63] | [p94<=0 & 0<=p94]] U [p20<=1 & 1<=p20]]]]]] & ~ [E [EX [EG [E [[[p63<=1 & 1<=p63] | [p94<=0 & 0<=p94]] U [p20<=1 & 1<=p20]]]] U [~ [[p65<=0 & 0<=p65]] & EX [EG [E [[[p63<=1 & 1<=p63] | [p94<=0 & 0<=p94]] U [p20<=1 & 1<=p20]]]]]]]]

abstracting: (1<=p20)
states: 8,438,400 (6)
abstracting: (p20<=1)
states: 95,575,295 (7)
abstracting: (0<=p94)
states: 95,575,295 (7)
abstracting: (p94<=0)
states: 90,912,959 (7)
abstracting: (1<=p63)
states: 820,512 (5)
abstracting: (p63<=1)
states: 95,575,295 (7)
.........
EG iterations: 9
.abstracting: (0<=p65)
states: 95,575,295 (7)
abstracting: (p65<=0)
states: 84,511,631 (7)
abstracting: (1<=p20)
states: 8,438,400 (6)
abstracting: (p20<=1)
states: 95,575,295 (7)
abstracting: (0<=p94)
states: 95,575,295 (7)
abstracting: (p94<=0)
states: 90,912,959 (7)
abstracting: (1<=p63)
states: 820,512 (5)
abstracting: (p63<=1)
states: 95,575,295 (7)
.........
EG iterations: 9
.
before gc: list nodes free: 7139009

after gc: idd nodes used:2288751, unused:61711249; list nodes free:289893777
abstracting: (1<=p20)
states: 8,438,400 (6)
abstracting: (p20<=1)
states: 95,575,295 (7)
abstracting: (0<=p94)
states: 95,575,295 (7)
abstracting: (p94<=0)
states: 90,912,959 (7)
abstracting: (1<=p63)
states: 820,512 (5)
abstracting: (p63<=1)
states: 95,575,295 (7)
.........
EG iterations: 9
.
before gc: list nodes free: 13037284

after gc: idd nodes used:2592021, unused:61407979; list nodes free:288499217
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m16.746sec

checking: EX [AF [[~ [A [[p67<=1 & 1<=p67] U [p68<=0 & 0<=p68]]] | EF [[[p108<=0 & 0<=p108] & [p98<=1 & 1<=p98]]]]]]
normalized: EX [~ [EG [~ [[E [true U [[p98<=1 & 1<=p98] & [p108<=0 & 0<=p108]]] | ~ [[~ [EG [~ [[p68<=0 & 0<=p68]]]] & ~ [E [~ [[p68<=0 & 0<=p68]] U [~ [[p67<=1 & 1<=p67]] & ~ [[p68<=0 & 0<=p68]]]]]]]]]]]]

abstracting: (0<=p68)
states: 95,575,295 (7)
abstracting: (p68<=0)
states: 95,575,294 (7)
abstracting: (1<=p67)
states: 11,026,944 (7)
abstracting: (p67<=1)
states: 95,575,295 (7)
abstracting: (0<=p68)
states: 95,575,295 (7)
abstracting: (p68<=0)
states: 95,575,294 (7)
abstracting: (0<=p68)
states: 95,575,295 (7)
abstracting: (p68<=0)
states: 95,575,294 (7)
.
EG iterations: 1
abstracting: (0<=p108)
states: 95,575,295 (7)
abstracting: (p108<=0)
states: 90,289,343 (7)
abstracting: (1<=p98)
states: 4,662,336 (6)
abstracting: (p98<=1)
states: 95,575,295 (7)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 2m53.132sec

checking: [~ [A [[AG [[p6<=0 & 0<=p6]] | AF [[p86<=1 & 1<=p86]]] U [p68<=0 & 0<=p68]]] | AF [[p87<=1 & 1<=p87]]]
normalized: [~ [EG [~ [[p87<=1 & 1<=p87]]]] | ~ [[~ [EG [~ [[p68<=0 & 0<=p68]]]] & ~ [E [~ [[p68<=0 & 0<=p68]] U [~ [[~ [EG [~ [[p86<=1 & 1<=p86]]]] | ~ [E [true U ~ [[p6<=0 & 0<=p6]]]]]] & ~ [[p68<=0 & 0<=p68]]]]]]]]

abstracting: (0<=p68)
states: 95,575,295 (7)
abstracting: (p68<=0)
states: 95,575,294 (7)
abstracting: (0<=p6)
states: 95,575,295 (7)
abstracting: (p6<=0)
states: 85,815,227 (7)

before gc: list nodes free: 12685732

after gc: idd nodes used:2552692, unused:61447308; list nodes free:288695986
abstracting: (1<=p86)
states: 97,200 (4)
abstracting: (p86<=1)
states: 95,575,295 (7)
.
EG iterations: 1
abstracting: (0<=p68)
states: 95,575,295 (7)
abstracting: (p68<=0)
states: 95,575,294 (7)
abstracting: (0<=p68)
states: 95,575,295 (7)
abstracting: (p68<=0)
states: 95,575,294 (7)
.
EG iterations: 1
abstracting: (1<=p87)
states: 2,267,568 (6)
abstracting: (p87<=1)
states: 95,575,295 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m44.885sec

checking: AF [[~ [E [EG [[[p88<=0 & 0<=p88] | [p41<=1 & 1<=p41]]] U AX [[[p16<=0 & 0<=p16] | [p20<=1 & 1<=p20]]]]] | EX [EX [[p32<=0 & 0<=p32]]]]]
normalized: ~ [EG [~ [[EX [EX [[p32<=0 & 0<=p32]]] | ~ [E [EG [[[p41<=1 & 1<=p41] | [p88<=0 & 0<=p88]]] U ~ [EX [~ [[[p20<=1 & 1<=p20] | [p16<=0 & 0<=p16]]]]]]]]]]]

abstracting: (0<=p16)
states: 95,575,295 (7)
abstracting: (p16<=0)
states: 90,641,615 (7)
abstracting: (1<=p20)
states: 8,438,400 (6)
abstracting: (p20<=1)
states: 95,575,295 (7)
.abstracting: (0<=p88)
states: 95,575,295 (7)
abstracting: (p88<=0)
states: 90,953,759 (7)
abstracting: (1<=p41)
states: 10
abstracting: (p41<=1)
states: 95,575,295 (7)
.
EG iterations: 1
abstracting: (0<=p32)
states: 95,575,295 (7)
abstracting: (p32<=0)
states: 86,078,591 (7)
...
EG iterations: 1
-> the formula is TRUE

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

MC time: 1m54.586sec

checking: AG [[AF [~ [A [[p104<=1 & 1<=p104] U [p44<=1 & 1<=p44]]]] | [[p21<=0 & 0<=p21] | AX [[[p47<=0 & 0<=p47] | [p76<=1 & 1<=p76]]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [~ [[[p76<=1 & 1<=p76] | [p47<=0 & 0<=p47]]]]] | [p21<=0 & 0<=p21]] | ~ [EG [[~ [EG [~ [[p44<=1 & 1<=p44]]]] & ~ [E [~ [[p44<=1 & 1<=p44]] U [~ [[p104<=1 & 1<=p104]] & ~ [[p44<=1 & 1<=p44]]]]]]]]]]]]

abstracting: (1<=p44)
states: 23,893,821 (7)
abstracting: (p44<=1)
states: 95,575,295 (7)
abstracting: (1<=p104)
states: 93,312 (4)
abstracting: (p104<=1)
states: 95,575,295 (7)
abstracting: (1<=p44)
states: 23,893,821 (7)
abstracting: (p44<=1)
states: 95,575,295 (7)
abstracting: (1<=p44)
states: 23,893,821 (7)
abstracting: (p44<=1)
states: 95,575,295 (7)
.
EG iterations: 1
...
EG iterations: 3
abstracting: (0<=p21)
states: 95,575,295 (7)
abstracting: (p21<=0)
states: 87,136,895 (7)
abstracting: (0<=p47)
states: 95,575,295 (7)
abstracting: (p47<=0)
states: 77,920,247 (7)
abstracting: (1<=p76)
states: 2,267,568 (6)
abstracting: (p76<=1)
states: 95,575,295 (7)

before gc: list nodes free: 1908467

after gc: idd nodes used:3240783, unused:60759217; list nodes free:291943108
.-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 5.016sec

checking: AG [A [E [EF [[[p48<=0 & 0<=p48] | [p28<=1 & 1<=p28]]] U [p78<=0 & 0<=p78]] U ~ [A [~ [[[p1<=0 & 0<=p1] | [p5<=1 & 1<=p5]]] U ~ [[[p79<=0 & 0<=p79] | [p3<=1 & 1<=p3]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [[~ [EG [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]] & ~ [E [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]] U [[[p5<=1 & 1<=p5] | [p1<=0 & 0<=p1]] & [[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]]]]]] & ~ [E [[~ [EG [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]] & ~ [E [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]] U [[[p5<=1 & 1<=p5] | [p1<=0 & 0<=p1]] & [[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]]]] U [~ [E [E [true U [[p28<=1 & 1<=p28] | [p48<=0 & 0<=p48]]] U [p78<=0 & 0<=p78]]] & [~ [EG [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]] & ~ [E [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]] U [[[p5<=1 & 1<=p5] | [p1<=0 & 0<=p1]] & [[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]]]]]]]]]]]

abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
abstracting: (0<=p1)
states: 95,575,295 (7)
abstracting: (p1<=0)
states: 95,575,285 (7)
abstracting: (1<=p5)
states: 5,934,336 (6)
abstracting: (p5<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
.
EG iterations: 1
abstracting: (0<=p78)
states: 95,575,295 (7)
abstracting: (p78<=0)
states: 93,307,727 (7)
abstracting: (0<=p48)
states: 95,575,295 (7)
abstracting: (p48<=0)
states: 77,918,303 (7)
abstracting: (1<=p28)
states: 5,908,176 (6)
abstracting: (p28<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
abstracting: (0<=p1)
states: 95,575,295 (7)
abstracting: (p1<=0)
states: 95,575,285 (7)
abstracting: (1<=p5)
states: 5,934,336 (6)
abstracting: (p5<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
.
EG iterations: 1
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
abstracting: (0<=p1)
states: 95,575,295 (7)
abstracting: (p1<=0)
states: 95,575,285 (7)
abstracting: (1<=p5)
states: 5,934,336 (6)
abstracting: (p5<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
abstracting: (0<=p79)
states: 95,575,295 (7)
abstracting: (p79<=0)
states: 90,932,159 (7)
abstracting: (1<=p3)
states: 9,760,068 (6)
abstracting: (p3<=1)
states: 95,575,295 (7)
.
EG iterations: 1
......
EG iterations: 6

before gc: list nodes free: 10985667

after gc: idd nodes used:3585992, unused:60414008; list nodes free:290360107
-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m55.407sec

checking: A [[p57<=0 & 0<=p57] U [~ [E [~ [[[p107<=0 & 0<=p107] | [p52<=1 & 1<=p52]]] U [~ [[[p30<=0 & 0<=p30] | [p7<=1 & 1<=p7]]] & [AX [[p33<=1 & 1<=p33]] | [[p75<=0 & 0<=p75] | [p60<=1 & 1<=p60]]]]]] & EF [[p70<=1 & 1<=p70]]]]
normalized: [~ [EG [~ [[~ [E [~ [[[p52<=1 & 1<=p52] | [p107<=0 & 0<=p107]]] U [[[[p60<=1 & 1<=p60] | [p75<=0 & 0<=p75]] | ~ [EX [~ [[p33<=1 & 1<=p33]]]]] & ~ [[[p7<=1 & 1<=p7] | [p30<=0 & 0<=p30]]]]]] & E [true U [p70<=1 & 1<=p70]]]]]] & ~ [E [~ [[~ [E [~ [[[p52<=1 & 1<=p52] | [p107<=0 & 0<=p107]]] U [[[[p60<=1 & 1<=p60] | [p75<=0 & 0<=p75]] | ~ [EX [~ [[p33<=1 & 1<=p33]]]]] & ~ [[[p7<=1 & 1<=p7] | [p30<=0 & 0<=p30]]]]]] & E [true U [p70<=1 & 1<=p70]]]] U [~ [[~ [E [~ [[[p52<=1 & 1<=p52] | [p107<=0 & 0<=p107]]] U [[[[p60<=1 & 1<=p60] | [p75<=0 & 0<=p75]] | ~ [EX [~ [[p33<=1 & 1<=p33]]]]] & ~ [[[p7<=1 & 1<=p7] | [p30<=0 & 0<=p30]]]]]] & E [true U [p70<=1 & 1<=p70]]]] & ~ [[p57<=0 & 0<=p57]]]]]]

abstracting: (0<=p57)
states: 95,575,295 (7)
abstracting: (p57<=0)
states: 76,444,571 (7)
abstracting: (1<=p70)
states: 1
abstracting: (p70<=1)
states: 95,575,295 (7)
abstracting: (0<=p30)
states: 95,575,295 (7)
abstracting: (p30<=0)
states: 89,055,887 (7)
abstracting: (1<=p7)
states: 9,760,068 (6)
abstracting: (p7<=1)
states: 95,575,295 (7)
abstracting: (1<=p33)
states: 9,496,704 (6)
abstracting: (p33<=1)
states: 95,575,295 (7)

before gc: list nodes free: 19226524

after gc: idd nodes used:4920991, unused:59079009; list nodes free:283756222
.abstracting: (0<=p75)
states: 95,575,295 (7)
abstracting: (p75<=0)
states: 95,575,289 (7)
abstracting: (1<=p60)
states: 24,727,836 (7)
abstracting: (p60<=1)
states: 95,575,295 (7)
abstracting: (0<=p107)
states: 95,575,295 (7)
abstracting: (p107<=0)
states: 92,534,015 (7)
abstracting: (1<=p52)
states: 10
abstracting: (p52<=1)
states: 95,575,295 (7)
abstracting: (1<=p70)
states: 1
abstracting: (p70<=1)
states: 95,575,295 (7)
abstracting: (0<=p30)
states: 95,575,295 (7)
abstracting: (p30<=0)
states: 89,055,887 (7)
abstracting: (1<=p7)
states: 9,760,068 (6)
abstracting: (p7<=1)
states: 95,575,295 (7)
abstracting: (1<=p33)
states: 9,496,704 (6)
abstracting: (p33<=1)
states: 95,575,295 (7)
.abstracting: (0<=p75)
states: 95,575,295 (7)
abstracting: (p75<=0)
states: 95,575,289 (7)
abstracting: (1<=p60)
states: 24,727,836 (7)
abstracting: (p60<=1)
states: 95,575,295 (7)
abstracting: (0<=p107)
states: 95,575,295 (7)
abstracting: (p107<=0)
states: 92,534,015 (7)
abstracting: (1<=p52)
states: 10
abstracting: (p52<=1)
states: 95,575,295 (7)
abstracting: (1<=p70)
states: 1
abstracting: (p70<=1)
states: 95,575,295 (7)
abstracting: (0<=p30)
states: 95,575,295 (7)
abstracting: (p30<=0)
states: 89,055,887 (7)
abstracting: (1<=p7)
states: 9,760,068 (6)
abstracting: (p7<=1)
states: 95,575,295 (7)
abstracting: (1<=p33)
states: 9,496,704 (6)
abstracting: (p33<=1)
states: 95,575,295 (7)
.abstracting: (0<=p75)
states: 95,575,295 (7)
abstracting: (p75<=0)
states: 95,575,289 (7)
abstracting: (1<=p60)
states: 24,727,836 (7)
abstracting: (p60<=1)
states: 95,575,295 (7)
abstracting: (0<=p107)
states: 95,575,295 (7)
abstracting: (p107<=0)
states: 92,534,015 (7)
abstracting: (1<=p52)
states: 10
abstracting: (p52<=1)
states: 95,575,295 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HealthRecord-PT-10-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m 9.295sec

checking: [AF [EG [[[0<=p46 & p46<=0] & AG [[p52<=0 & 0<=p52]]]]] & [AX [[EX [[[p9<=1 & 1<=p9] & EX [[[p48<=0 & 0<=p48] | [p91<=1 & 1<=p91]]]]] & [AF [[[p17<=0 & 0<=p17] | [p34<=1 & 1<=p34]]] & EF [AX [[p25<=1 & 1<=p25]]]]]] | [AG [EX [EG [[p60<=1 & 1<=p60]]]] & [AX [EX [EX [[p60<=1 & 1<=p60]]]] | EF [[[p37<=0 & 0<=p37] | [p83<=1 & 1<=p83]]]]]]]
normalized: [[[[E [true U [[p83<=1 & 1<=p83] | [p37<=0 & 0<=p37]]] | ~ [EX [~ [EX [EX [[p60<=1 & 1<=p60]]]]]]] & ~ [E [true U ~ [EX [EG [[p60<=1 & 1<=p60]]]]]]] | ~ [EX [~ [[[E [true U ~ [EX [~ [[p25<=1 & 1<=p25]]]]] & ~ [EG [~ [[[p34<=1 & 1<=p34] | [p17<=0 & 0<=p17]]]]]] & EX [[EX [[[p91<=1 & 1<=p91] | [p48<=0 & 0<=p48]]] & [p9<=1 & 1<=p9]]]]]]]] & ~ [EG [~ [EG [[~ [E [true U ~ [[p52<=0 & 0<=p52]]]] & [0<=p46 & p46<=0]]]]]]]

abstracting: (p46<=0)
states: 95,575,285 (7)
abstracting: (0<=p46)
states: 95,575,295 (7)
abstracting: (0<=p52)
states: 95,575,295 (7)
abstracting: (p52<=0)
states: 95,575,285 (7)

before gc: list nodes free: 10869582

after gc: idd nodes used:4716497, unused:59283503; list nodes free:285449881
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p9)
states: 14,896,836 (7)
abstracting: (p9<=1)
states: 95,575,295 (7)
abstracting: (0<=p48)
states: 95,575,295 (7)
abstracting: (p48<=0)
states: 77,918,303 (7)
abstracting: (1<=p91)
states: 97,200 (4)
abstracting: (p91<=1)
states: 95,575,295 (7)
..abstracting: (0<=p17)
states: 95,575,295 (7)
abstracting: (p17<=0)
states: 90,710,831 (7)
abstracting: (1<=p34)
states: 9,256,968 (6)
abstracting: (p34<=1)
states: 95,575,295 (7)
.........
EG iterations: 9
abstracting: (1<=p25)
states: 2,972,268 (6)
abstracting: (p25<=1)
states: 95,575,295 (7)
.
before gc: list nodes free: 334100

after gc: idd nodes used:5006802, unused:58993198; list nodes free:284065782
.abstracting: (1<=p60)
states: 24,727,836 (7)
abstracting: (p60<=1)
states: 95,575,295 (7)
...
EG iterations: 3
.
before gc: list nodes free: 15361828

after gc: idd nodes used:5228304, unused:58771696; list nodes free:283136695
abstracting: (1<=p60)
states: 24,727,836 (7)
abstracting: (p60<=1)
states: 95,575,295 (7)
.
before gc: list nodes free: 15747075

after gc: idd nodes used:5213582, unused:58786418; list nodes free:283166439
..abstracting: (0<=p37)
states: 95,575,295 (7)
abstracting: (p37<=0)
states: 95,575,285 (7)
abstracting: (1<=p83)
states: 97,200 (4)
abstracting: (p83<=1)
states: 95,575,295 (7)
MC time: 14m17.182sec

checking: [EF [~ [A [E [[p54<=0 & 0<=p54] U [[p22<=0 & 0<=p22] | [p11<=1 & 1<=p11]]] U EG [[p100<=0 & 0<=p100]]]]] & [EF [[EG [[[p32<=1 & 1<=p32] & EX [0<=0]]] | E [AG [[[p111<=0 & 0<=p111] | [p65<=1 & 1<=p65]]] U [p86<=1 & 1<=p86]]]] & EX [[EX [EF [[[p45<=0 & 0<=p45] & [p74<=1 & 1<=p74]]]] | [[[p82<=1 & 1<=p82] & EF [[p90<=0 & 0<=p90]]] | AX [[[p66<=0 & 0<=p66] & [p51<=1 & 1<=p51]]]]]]]]
normalized: [[E [true U [E [~ [E [true U ~ [[[p111<=0 & 0<=p111] | [p65<=1 & 1<=p65]]]]] U [p86<=1 & 1<=p86]] | EG [[EX [0<=0] & [p32<=1 & 1<=p32]]]]] & EX [[[~ [EX [~ [[[p51<=1 & 1<=p51] & [p66<=0 & 0<=p66]]]]] | [E [true U [p90<=0 & 0<=p90]] & [p82<=1 & 1<=p82]]] | EX [E [true U [[p74<=1 & 1<=p74] & [p45<=0 & 0<=p45]]]]]]] & E [true U ~ [[~ [EG [~ [EG [[p100<=0 & 0<=p100]]]]] & ~ [E [~ [EG [[p100<=0 & 0<=p100]]] U [~ [E [[p54<=0 & 0<=p54] U [[p11<=1 & 1<=p11] | [p22<=0 & 0<=p22]]]] & ~ [EG [[p100<=0 & 0<=p100]]]]]]]]]]

abstracting: (0<=p100)
states: 95,575,295 (7)
abstracting: (p100<=0)
states: 90,080,687 (7)
.
EG iterations: 1
abstracting: (0<=p22)
states: 95,575,295 (7)
abstracting: (p22<=0)
states: 86,944,847 (7)
abstracting: (1<=p11)
states: 2,741,364 (6)
abstracting: (p11<=1)
states: 95,575,295 (7)
abstracting: (0<=p54)
states: 95,575,295 (7)
abstracting: (p54<=0)
states: 76,283,231 (7)
abstracting: (0<=p100)
states: 95,575,295 (7)
abstracting: (p100<=0)
states: 90,080,687 (7)
.
EG iterations: 1
abstracting: (0<=p100)
states: 95,575,295 (7)
abstracting: (p100<=0)
states: 90,080,687 (7)
.
EG iterations: 1
......
EG iterations: 6

before gc: list nodes free: 7367386

after gc: idd nodes used:6035265, unused:57964735; list nodes free:279587450
abstracting: (0<=p45)
states: 95,575,295 (7)
abstracting: (p45<=0)
states: 71,681,474 (7)
abstracting: (1<=p74)
states: 21,049,837 (7)
abstracting: (p74<=1)
states: 95,575,295 (7)

before gc: list nodes free: 24063797

after gc: idd nodes used:5944122, unused:58055878; list nodes free:280052006
MC time: 7m 9.113sec

checking: [AF [EG [[[0<=p46 & p46<=0] & AG [[p52<=0 & 0<=p52]]]]] & [AX [[EX [[[p9<=1 & 1<=p9] & EX [[[p48<=0 & 0<=p48] | [p91<=1 & 1<=p91]]]]] & [AF [[[p17<=0 & 0<=p17] | [p34<=1 & 1<=p34]]] & EF [AX [[p25<=1 & 1<=p25]]]]]] | [AG [EX [EG [[p60<=1 & 1<=p60]]]] & [AX [EX [EX [[p60<=1 & 1<=p60]]]] | EF [[[p37<=0 & 0<=p37] | [p83<=1 & 1<=p83]]]]]]]
normalized: [[[[E [true U [[p83<=1 & 1<=p83] | [p37<=0 & 0<=p37]]] | ~ [EX [~ [EX [EX [[p60<=1 & 1<=p60]]]]]]] & ~ [E [true U ~ [EX [EG [[p60<=1 & 1<=p60]]]]]]] | ~ [EX [~ [[[E [true U ~ [EX [~ [[p25<=1 & 1<=p25]]]]] & ~ [EG [~ [[[p34<=1 & 1<=p34] | [p17<=0 & 0<=p17]]]]]] & EX [[EX [[[p91<=1 & 1<=p91] | [p48<=0 & 0<=p48]]] & [p9<=1 & 1<=p9]]]]]]]] & ~ [EG [~ [EG [[~ [E [true U ~ [[p52<=0 & 0<=p52]]]] & [0<=p46 & p46<=0]]]]]]]

abstracting: (p46<=0)
states: 95,575,285 (7)
abstracting: (0<=p46)
states: 95,575,295 (7)
abstracting: (0<=p52)
states: 95,575,295 (7)
abstracting: (p52<=0)
states: 95,575,285 (7)
.
EG iterations: 1

before gc: list nodes free: 16280124

after gc: idd nodes used:6069984, unused:57930016; list nodes free:279283168
.
EG iterations: 1
abstracting: (1<=p9)
states: 14,896,836 (7)
abstracting: (p9<=1)
states: 95,575,295 (7)
abstracting: (0<=p48)
states: 95,575,295 (7)
abstracting: (p48<=0)
states: 77,918,303 (7)
abstracting: (1<=p91)
states: 97,200 (4)
abstracting: (p91<=1)
states: 95,575,295 (7)
..abstracting: (0<=p17)
states: 95,575,295 (7)
abstracting: (p17<=0)
states: 90,710,831 (7)
abstracting: (1<=p34)
states: 9,256,968 (6)
abstracting: (p34<=1)
states: 95,575,295 (7)
.........
EG iterations: 9
abstracting: (1<=p25)
states: 2,972,268 (6)
abstracting: (p25<=1)
states: 95,575,295 (7)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5809036 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101092 kB

BK_TIME_CONFINEMENT_REACHED

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

5939
iterations count:192856 (892), effective:9388 (43)

initing FirstDep: 0m 0.000sec


iterations count:2025 (9), effective:151 (0)

iterations count:2012 (9), effective:150 (0)

iterations count:3672 (17), effective:281 (1)

iterations count:5517 (25), effective:412 (1)

iterations count:2669 (12), effective:194 (0)

iterations count:2669 (12), effective:194 (0)

iterations count:5046 (23), effective:379 (1)

iterations count:2669 (12), effective:194 (0)

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

iterations count:5352 (24), effective:437 (2)

iterations count:2182 (10), effective:154 (0)

iterations count:916 (4), effective:80 (0)

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

iterations count:3586 (16), effective:270 (1)

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

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

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

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

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

iterations count:5361 (24), effective:443 (2)

iterations count:17441 (80), effective:1056 (4)

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

iterations count:17441 (80), effective:1056 (4)

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

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

iterations count:17441 (80), effective:1056 (4)

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

iterations count:30128 (139), effective:1989 (9)

iterations count:13712 (63), effective:718 (3)

iterations count:12993 (60), effective:769 (3)

sat_reach.icc:155: Timeout: after 856 sec


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

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

iterations count:3171 (14), effective:259 (1)

sat_reach.icc:155: Timeout: after 428 sec


iterations count:30128 (139), effective:1989 (9)

iterations count:13712 (63), effective:718 (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-10"
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-10, 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-167840348500305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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