fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889203700762
Last Updated
May 14, 2023

About the Execution of Marcie+red for ResAllocation-PT-R050C002

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10152.039 3600000.00 3654576.00 8755.70 FF??T??T?T?FTT?F 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.r330-tall-167889203700762.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 ResAllocation-PT-R050C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700762
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 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 ResAllocation-PT-R050C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679181853865

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:24:15] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-18 23:24:15] [INFO ] Transformed 200 places.
[2023-03-18 23:24:15] [INFO ] Transformed 102 transitions.
[2023-03-18 23:24:15] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 144 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2023-03-18 23:24:15] [INFO ] Computed 100 place invariants in 12 ms
[2023-03-18 23:24:15] [INFO ] Implicit Places using invariants in 225 ms returned [103, 107, 111, 113, 121, 129, 133, 135, 141, 145, 155, 159, 163, 167, 173, 179, 183, 187]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 250 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/200 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 182/200 places, 102/102 transitions.
Support contains 144 out of 182 places after structural reductions.
[2023-03-18 23:24:16] [INFO ] Flatten gal took : 36 ms
[2023-03-18 23:24:16] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:24:16] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 142 out of 182 places (down from 144) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 80) seen :50
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 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 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 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 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 102 rows 182 cols
[2023-03-18 23:24:17] [INFO ] Computed 82 place invariants in 8 ms
[2023-03-18 23:24:17] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned sat
[2023-03-18 23:24:17] [INFO ] After 273ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:28
[2023-03-18 23:24:17] [INFO ] After 324ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-18 23:24:17] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-18 23:24:17] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-18 23:24:18] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-18 23:24:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 9 ms to minimize.
[2023-03-18 23:24:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 68 ms
[2023-03-18 23:24:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-18 23:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-18 23:24:18] [INFO ] After 746ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :29
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-18 23:24:18] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :29
Fused 30 Parikh solutions to 28 different solutions.
Parikh walk visited 26 properties in 196 ms.
Support contains 14 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 102/102 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 181 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 180 transition count 100
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 180 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 177 transition count 99
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 10 place count 176 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 176 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 173 transition count 97
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 16 place count 172 transition count 96
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 172 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 169 transition count 95
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 4 with 2 rules applied. Total rules applied 22 place count 168 transition count 94
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 168 transition count 93
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 26 place count 165 transition count 93
Applied a total of 26 rules in 94 ms. Remains 165 /182 variables (removed 17) and now considering 93/102 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 165/182 places, 93/102 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 871116 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 871116 steps, saw 190726 distinct states, run finished after 3002 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 93 rows 165 cols
[2023-03-18 23:24:22] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-18 23:24:22] [INFO ] [Real]Absence check using 74 positive place invariants in 9 ms returned sat
[2023-03-18 23:24:22] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 23:24:22] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:24:22] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:24:22] [INFO ] [Nat]Absence check using 74 positive place invariants in 40 ms returned sat
[2023-03-18 23:24:22] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:24:22] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-18 23:24:22] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 14 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 93/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 165/165 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 93/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-18 23:24:22] [INFO ] Invariant cache hit.
[2023-03-18 23:24:23] [INFO ] Implicit Places using invariants in 203 ms returned [92, 95, 98, 102, 104, 106, 109, 111, 116, 120, 122, 125, 130, 132, 134, 137, 140, 143, 146, 148, 151, 153, 156, 159, 162, 164]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 205 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/165 places, 93/93 transitions.
Applied a total of 0 rules in 10 ms. Remains 139 /139 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 220 ms. Remains : 139/165 places, 93/93 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1043163 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043163 steps, saw 222828 distinct states, run finished after 3002 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 93 rows 139 cols
[2023-03-18 23:24:26] [INFO ] Computed 48 place invariants in 3 ms
[2023-03-18 23:24:26] [INFO ] [Real]Absence check using 48 positive place invariants in 5 ms returned sat
[2023-03-18 23:24:26] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:24:26] [INFO ] [Nat]Absence check using 48 positive place invariants in 5 ms returned sat
[2023-03-18 23:24:26] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:24:26] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 23:24:26] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 14 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 93/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 139/139 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-18 23:24:26] [INFO ] Invariant cache hit.
[2023-03-18 23:24:26] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-18 23:24:26] [INFO ] Invariant cache hit.
[2023-03-18 23:24:27] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-18 23:24:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:24:27] [INFO ] Invariant cache hit.
[2023-03-18 23:24:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 139/139 places, 93/93 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 139 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 138 transition count 92
Applied a total of 2 rules in 8 ms. Remains 138 /139 variables (removed 1) and now considering 92/93 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 92 rows 138 cols
[2023-03-18 23:24:27] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-18 23:24:27] [INFO ] [Real]Absence check using 48 positive place invariants in 5 ms returned sat
[2023-03-18 23:24:27] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:24:27] [INFO ] [Nat]Absence check using 48 positive place invariants in 5 ms returned sat
[2023-03-18 23:24:27] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:24:27] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 23:24:27] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 102/102 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 179 transition count 100
Applied a total of 5 rules in 7 ms. Remains 179 /182 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 179/182 places, 100/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 102/102 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 180 transition count 101
Applied a total of 3 rules in 7 ms. Remains 180 /182 variables (removed 2) and now considering 101/102 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 180/182 places, 101/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 182/182 places, 102/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 102/102 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 179 transition count 100
Applied a total of 5 rules in 7 ms. Remains 179 /182 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 179/182 places, 100/102 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Input system was already deterministic with 100 transitions.
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:27] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:27] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 23:24:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 102 transitions and 464 arcs took 17 ms.
Total runtime 12684 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 182 NrTr: 102 NrArc: 464)

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

net check time: 0m 0.000sec

init dd package: 0m 2.760sec


RS generation: 0m 0.154sec


-> reachability set: #nodes 508 (5.1e+02) #states 29,273,397,577,908,224 (16)



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

checking: AX [EG [EF [[1<=p94 & 1<=p97]]]]
normalized: ~ [EX [~ [EG [E [true U [1<=p94 & 1<=p97]]]]]]

abstracting: (1<=p97)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p94)
states: 1,125,899,906,842,624 (15)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1177
.-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.760sec

checking: EG [EX [[p26<=0 | p29<=0]]]
normalized: EG [EX [[p26<=0 | p29<=0]]]

abstracting: (p29<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p26<=0)
states: 18,577,348,462,903,296 (16)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 62557

after gc: idd nodes used:225399, unused:63774601; list nodes free:298840566
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1225
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 5.932sec

checking: A [~ [[1<=p27 & 1<=p24]] U AF [[1<=p72 & 1<=p75]]]
normalized: [~ [EG [EG [~ [[1<=p72 & 1<=p75]]]]] & ~ [E [EG [~ [[1<=p72 & 1<=p75]]] U [[1<=p27 & 1<=p24] & EG [~ [[1<=p72 & 1<=p75]]]]]]]

abstracting: (1<=p75)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p72)
states: 4,222,124,650,659,840 (15)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 759
abstracting: (1<=p24)
states: 10,977,524,091,715,584 (16)
abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p75)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p72)
states: 4,222,124,650,659,840 (15)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 759
abstracting: (1<=p75)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p72)
states: 4,222,124,650,659,840 (15)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 759
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.078sec

checking: EF [EX [EG [[[p24<=0 | AG [[p51<=0 | [p141<=0 | p142<=0]]]] | [p27<=0 | [p66<=0 | p69<=0]]]]]]
normalized: E [true U EX [EG [[[[p66<=0 | p69<=0] | p27<=0] | [~ [E [true U ~ [[[p141<=0 | p142<=0] | p51<=0]]]] | p24<=0]]]]]

abstracting: (p24<=0)
states: 18,295,873,486,192,640 (16)
abstracting: (p51<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p142<=0)
states: 21,392,098,230,009,856 (16)
abstracting: (p141<=0)
states: 7,599,824,371,187,712 (15)
abstracting: (p27<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p69<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p66<=0)
states: 24,206,847,997,116,416 (16)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

checking: EG [AG [[AG [[1<=p19 & [1<=p115 & 1<=p116]]] | E [EF [[1<=p85 & [1<=p168 & 1<=p169]]] U [1<=p20 & 1<=p23]]]]]
normalized: EG [~ [E [true U ~ [[E [E [true U [[1<=p168 & 1<=p169] & 1<=p85]] U [1<=p20 & 1<=p23]] | ~ [E [true U ~ [[[1<=p115 & 1<=p116] & 1<=p19]]]]]]]]]

abstracting: (1<=p19)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p116)
states: 3,377,699,720,527,872 (15)
abstracting: (1<=p115)
states: 26,177,172,834,091,008 (16)
abstracting: (1<=p23)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p20)
states: 11,540,474,045,136,896 (16)
abstracting: (1<=p85)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p169)
states: 12,666,373,951,979,520 (16)
abstracting: (1<=p168)
states: 16,888,498,602,639,360 (16)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.503sec

checking: E [AF [[1<=p81 & [1<=p165 & 1<=p166]]] U E [EF [EX [EF [[1<=p93 & [1<=p175 & 1<=p176]]]]] U [1<=p23 & [1<=p118 & 1<=p119]]]]
normalized: E [~ [EG [~ [[1<=p81 & [1<=p165 & 1<=p166]]]]] U E [E [true U EX [E [true U [1<=p93 & [1<=p175 & 1<=p176]]]]] U [1<=p23 & [1<=p118 & 1<=p119]]]]

abstracting: (1<=p119)
states: 3,940,649,673,949,184 (15)
abstracting: (1<=p118)
states: 25,614,222,880,669,696 (16)
abstracting: (1<=p23)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p176)
states: 13,792,273,858,822,144 (16)
abstracting: (1<=p175)
states: 15,762,598,695,796,736 (16)
abstracting: (1<=p93)
states: 14,355,223,812,243,456 (16)
.abstracting: (1<=p166)
states: 12,103,423,998,558,208 (16)
abstracting: (1<=p165)
states: 17,451,448,556,060,672 (16)
abstracting: (1<=p81)
states: 14,355,223,812,243,456 (16)
................................................................................
before gc: list nodes free: 6233589

after gc: idd nodes used:1645913, unused:62354087; list nodes free:292494903
......................................
before gc: list nodes free: 10742061

after gc: idd nodes used:3299000, unused:60701000; list nodes free:284913530
..................
before gc: list nodes free: 10773070

after gc: idd nodes used:3867514, unused:60132486; list nodes free:282513465
MC time: 5m20.109sec

checking: AG [[A [[[AF [[1<=p19 & [1<=p115 & 1<=p116]]] | A [[1<=p16 & 1<=p19] U [1<=p2 & 1<=p5]]] & AG [~ [[1<=p47 & [1<=p137 & 1<=p138]]]]] U EX [AX [[1<=p76 & 1<=p79]]]] | [1<=p78 & 1<=p81]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [EX [~ [EX [~ [[1<=p76 & 1<=p79]]]]]]]] & ~ [E [~ [EX [~ [EX [~ [[1<=p76 & 1<=p79]]]]]] U [~ [EX [~ [EX [~ [[1<=p76 & 1<=p79]]]]]] & ~ [[~ [E [true U [1<=p47 & [1<=p137 & 1<=p138]]]] & [[~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[1<=p16 & 1<=p19]] & ~ [[1<=p2 & 1<=p5]]]]]] | ~ [EG [~ [[[1<=p115 & 1<=p116] & 1<=p19]]]]]]]]]]] | [1<=p78 & 1<=p81]]]]]

abstracting: (1<=p81)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p78)
states: 3,377,699,720,527,872 (15)
abstracting: (1<=p19)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p116)
states: 3,377,699,720,527,872 (15)
abstracting: (1<=p115)
states: 26,177,172,834,091,008 (16)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 849
abstracting: (1<=p5)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p2)
states: 14,073,748,835,532,800 (16)
abstracting: (1<=p19)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p16)
states: 12,103,423,998,558,208 (16)
abstracting: (1<=p5)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p2)
states: 14,073,748,835,532,800 (16)
abstracting: (1<=p5)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p2)
states: 14,073,748,835,532,800 (16)
...............................................
before gc: list nodes free: 8290128

after gc: idd nodes used:375043, unused:63624957; list nodes free:298150925
.....................................................................................................................
before gc: list nodes free: 494400

after gc: idd nodes used:1647402, unused:62352598; list nodes free:292183158
........................................................
before gc: list nodes free: 1301126

after gc: idd nodes used:1944594, unused:62055406; list nodes free:292906484
................................................
before gc: list nodes free: 980490

after gc: idd nodes used:972487, unused:63027513; list nodes free:297444895
.................MC time: 4m51.005sec

checking: AF [[EX [AG [~ [E [[1<=p99 & 1<=p181] U [1<=p97 & [1<=p179 & 1<=p180]]]]]] & [E [~ [EG [[1<=p5 & [1<=p104 & 1<=p105]]]] U AG [[[1<=p99 & 1<=p181] | [1<=p12 & 1<=p15]]]] | [1<=p69 & [1<=p155 & 1<=p156]]]]]
normalized: ~ [EG [~ [[EX [~ [E [true U E [[1<=p99 & 1<=p181] U [1<=p97 & [1<=p179 & 1<=p180]]]]]] & [[1<=p69 & [1<=p155 & 1<=p156]] | E [~ [EG [[1<=p5 & [1<=p104 & 1<=p105]]]] U ~ [E [true U ~ [[[1<=p99 & 1<=p181] | [1<=p12 & 1<=p15]]]]]]]]]]]

abstracting: (1<=p15)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p12)
states: 12,666,373,951,979,520 (16)
abstracting: (1<=p181)
states: 14,918,173,765,664,768 (16)
abstracting: (1<=p99)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p105)
states: 1,407,374,883,553,280 (15)
abstracting: (1<=p104)
states: 28,147,497,671,065,600 (16)
abstracting: (1<=p5)
states: 14,355,223,812,243,456 (16)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1089
abstracting: (1<=p156)
states: 10,414,574,138,294,272 (16)
abstracting: (1<=p155)
states: 19,140,298,416,324,608 (16)
abstracting: (1<=p69)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p180)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p179)
states: 15,199,648,742,375,424 (16)
abstracting: (1<=p97)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p181)
states: 14,918,173,765,664,768 (16)
abstracting: (1<=p99)
states: 14,355,223,812,243,456 (16)
..
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.592sec

checking: ~ [A [AX [[[1<=p23 & [1<=p118 & 1<=p119]] | [1<=p39 & [1<=p131 & 1<=p132]]]] U AG [AF [[[[1<=p12 & 1<=p15] | [1<=p97 & [1<=p179 & 1<=p180]]] & A [[1<=p32 & 1<=p35] U [1<=p4 & 1<=p7]]]]]]]
normalized: ~ [[~ [EG [E [true U EG [~ [[[~ [EG [~ [[1<=p4 & 1<=p7]]]] & ~ [E [~ [[1<=p4 & 1<=p7]] U [~ [[1<=p32 & 1<=p35]] & ~ [[1<=p4 & 1<=p7]]]]]] & [[1<=p97 & [1<=p179 & 1<=p180]] | [1<=p12 & 1<=p15]]]]]]]] & ~ [E [E [true U EG [~ [[[~ [EG [~ [[1<=p4 & 1<=p7]]]] & ~ [E [~ [[1<=p4 & 1<=p7]] U [~ [[1<=p32 & 1<=p35]] & ~ [[1<=p4 & 1<=p7]]]]]] & [[1<=p97 & [1<=p179 & 1<=p180]] | [1<=p12 & 1<=p15]]]]]] U [EX [~ [[[1<=p39 & [1<=p131 & 1<=p132]] | [1<=p23 & [1<=p118 & 1<=p119]]]]] & E [true U EG [~ [[[~ [EG [~ [[1<=p4 & 1<=p7]]]] & ~ [E [~ [[1<=p4 & 1<=p7]] U [~ [[1<=p32 & 1<=p35]] & ~ [[1<=p4 & 1<=p7]]]]]] & [[1<=p97 & [1<=p179 & 1<=p180]] | [1<=p12 & 1<=p15]]]]]]]]]]]

abstracting: (1<=p15)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p12)
states: 12,666,373,951,979,520 (16)
abstracting: (1<=p180)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p179)
states: 15,199,648,742,375,424 (16)
abstracting: (1<=p97)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p7)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p4)
states: 13,792,273,858,822,144 (16)
abstracting: (1<=p35)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p32)
states: 9,851,624,184,872,960 (15)
abstracting: (1<=p7)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p4)
states: 13,792,273,858,822,144 (16)
abstracting: (1<=p7)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p4)
states: 13,792,273,858,822,144 (16)
......................................................................
before gc: list nodes free: 2117591

after gc: idd nodes used:631353, unused:63368647; list nodes free:299048301
.....................................................................................................
before gc: list nodes free: 2252970

after gc: idd nodes used:1657126, unused:62342874; list nodes free:294235680
..........................................................
before gc: list nodes free: 1409124

after gc: idd nodes used:1852608, unused:62147392; list nodes free:293333187
.....................................................
before gc: list nodes free: 917704

after gc: idd nodes used:1724531, unused:62275469; list nodes free:293930681
.....MC time: 4m51.011sec

checking: EF [[[A [[[1<=p49 & [1<=p139 & 1<=p140]] | [1<=p17 & [1<=p113 & 1<=p114]]] U ~ [[1<=p99 & 1<=p181]]] | AG [[p38<=0 | p41<=0]]] & [[AG [[p70<=0 | p73<=0]] | EG [[1<=p94 & 1<=p97]]] | [[1<=p58 & 1<=p61] | [1<=p62 & 1<=p65]]]]]
normalized: E [true U [[[~ [E [true U ~ [[p70<=0 | p73<=0]]]] | EG [[1<=p94 & 1<=p97]]] | [[1<=p58 & 1<=p61] | [1<=p62 & 1<=p65]]] & [[~ [E [[1<=p99 & 1<=p181] U [~ [[[1<=p17 & [1<=p113 & 1<=p114]] | [1<=p49 & [1<=p139 & 1<=p140]]]] & [1<=p99 & 1<=p181]]]] & ~ [EG [[1<=p99 & 1<=p181]]]] | ~ [E [true U ~ [[p38<=0 | p41<=0]]]]]]]

abstracting: (p41<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p38<=0)
states: 20,266,198,323,167,232 (16)
abstracting: (1<=p181)
states: 14,918,173,765,664,768 (16)
abstracting: (1<=p99)
states: 14,355,223,812,243,456 (16)
.....................................................................................
before gc: list nodes free: 6571956

after gc: idd nodes used:1544890, unused:62455110; list nodes free:295033483
.........................................
before gc: list nodes free: 12513193

after gc: idd nodes used:3474752, unused:60525248; list nodes free:286136487
.MC time: 4m22.016sec

checking: AX [[EF [AG [EF [[p36<=0 | p39<=0]]]] | [[~ [E [[[[1<=p66 & 1<=p69] | [1<=p77 & [1<=p162 & 1<=p163]]] & AF [[1<=p10 & 1<=p13]]] U [AF [[1<=p51 & [1<=p141 & 1<=p142]]] & AF [[1<=p17 & [1<=p113 & 1<=p114]]]]]] & AX [EF [[p38<=0 | p41<=0]]]] & [EX [[p15<=0 | [p111<=0 | p112<=0]]] & [p92<=0 | p95<=0]]]]]
normalized: ~ [EX [~ [[E [true U ~ [E [true U ~ [E [true U [p36<=0 | p39<=0]]]]]] | [[[p92<=0 | p95<=0] & EX [[[p111<=0 | p112<=0] | p15<=0]]] & [~ [EX [~ [E [true U [p38<=0 | p41<=0]]]]] & ~ [E [[~ [EG [~ [[1<=p10 & 1<=p13]]]] & [[1<=p77 & [1<=p162 & 1<=p163]] | [1<=p66 & 1<=p69]]] U [~ [EG [~ [[[1<=p141 & 1<=p142] & 1<=p51]]]] & ~ [EG [~ [[1<=p17 & [1<=p113 & 1<=p114]]]]]]]]]]]]]]

abstracting: (1<=p114)
states: 3,096,224,743,817,216 (15)
abstracting: (1<=p113)
states: 26,458,647,810,801,664 (16)
abstracting: (1<=p17)
states: 14,355,223,812,243,456 (16)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 883
abstracting: (1<=p51)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p142)
states: 7,881,299,347,898,368 (15)
abstracting: (1<=p141)
states: 21,673,573,206,720,512 (16)
......................................
before gc: list nodes free: 11655333

after gc: idd nodes used:194469, unused:63805531; list nodes free:301114008
...........................................................................................................................
before gc: list nodes free: 13526960

after gc: idd nodes used:822218, unused:63177782; list nodes free:298293509
.........................................................MC time: 3m56.042sec

checking: AF [[AF [[EX [EF [[1<=p60 & 1<=p63]]] & [[[[1<=p20 & 1<=p23] & [1<=p40 & 1<=p43]] | [p14<=0 | p17<=0]] & ~ [A [[1<=p43 & [1<=p134 & 1<=p135]] U [1<=p34 & 1<=p37]]]]]] & [~ [E [[[1<=p88 & 1<=p91] | [1<=p95 & [1<=p177 & 1<=p178]]] U [[1<=p27 & 1<=p122] & [1<=p123 & [1<=p34 & 1<=p37]]]]] | [1<=p36 & 1<=p39]]]]
normalized: ~ [EG [~ [[[~ [E [[[1<=p95 & [1<=p177 & 1<=p178]] | [1<=p88 & 1<=p91]] U [[1<=p27 & 1<=p122] & [1<=p123 & [1<=p34 & 1<=p37]]]]] | [1<=p36 & 1<=p39]] & ~ [EG [~ [[[~ [[~ [EG [~ [[1<=p34 & 1<=p37]]]] & ~ [E [~ [[1<=p34 & 1<=p37]] U [~ [[[1<=p134 & 1<=p135] & 1<=p43]] & ~ [[1<=p34 & 1<=p37]]]]]]] & [[p14<=0 | p17<=0] | [[1<=p40 & 1<=p43] & [1<=p20 & 1<=p23]]]] & EX [E [true U [1<=p60 & 1<=p63]]]]]]]]]]]

abstracting: (1<=p63)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p60)
states: 5,910,974,510,923,776 (15)
.abstracting: (1<=p23)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p20)
states: 11,540,474,045,136,896 (16)
abstracting: (1<=p43)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p40)
states: 8,725,724,278,030,336 (15)
abstracting: (p17<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p14<=0)
states: 16,888,498,602,639,360 (16)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p34)
states: 9,570,149,208,162,304 (15)
abstracting: (1<=p43)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p135)
states: 6,755,399,441,055,744 (15)
abstracting: (1<=p134)
states: 22,799,473,113,563,136 (16)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p34)
states: 9,570,149,208,162,304 (15)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p34)
states: 9,570,149,208,162,304 (15)
.................................................................................................................................................................................................
before gc: list nodes free: 9034623

after gc: idd nodes used:1518022, unused:62481978; list nodes free:294903748
..........................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 619
................................................................................................................................................................................................................................................................
EG iterations: 256
abstracting: (1<=p39)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p36)
states: 9,288,674,231,451,648 (15)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p34)
states: 9,570,149,208,162,304 (15)
abstracting: (1<=p123)
states: 4,503,599,627,370,496 (15)
abstracting: (1<=p122)
states: 25,051,272,927,248,384 (16)
abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p178)
states: 14,073,748,835,532,800 (16)
abstracting: (1<=p177)
states: 15,481,123,719,086,080 (16)
abstracting: (1<=p95)
states: 14,355,223,812,243,456 (16)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.969sec

checking: A [[A [[1<=p9 & [1<=p107 & 1<=p108]] U EX [[[[1<=p37 & 1<=p129] & [1<=p130 & 1<=p15]] & [[1<=p111 & 1<=p112] & [1<=p49 & [1<=p139 & 1<=p140]]]]]] & [1<=p90 & 1<=p93]] U [~ [AF [[1<=p93 & [1<=p175 & 1<=p176]]]] | EG [[[~ [AG [[1<=p94 & 1<=p97]]] & [AF [[1<=p1 & [1<=p101 & 1<=p102]]] & EF [1<=p1]]] & [1<=p49 & [1<=p139 & 1<=p140]]]]]]
normalized: [~ [EG [~ [[EG [[[1<=p49 & [1<=p139 & 1<=p140]] & [[E [true U 1<=p1] & ~ [EG [~ [[1<=p1 & [1<=p101 & 1<=p102]]]]]] & E [true U ~ [[1<=p94 & 1<=p97]]]]]] | EG [~ [[1<=p93 & [1<=p175 & 1<=p176]]]]]]]] & ~ [E [~ [[EG [[[1<=p49 & [1<=p139 & 1<=p140]] & [[E [true U 1<=p1] & ~ [EG [~ [[1<=p1 & [1<=p101 & 1<=p102]]]]]] & E [true U ~ [[1<=p94 & 1<=p97]]]]]] | EG [~ [[1<=p93 & [1<=p175 & 1<=p176]]]]]] U [~ [[[1<=p90 & 1<=p93] & [~ [EG [~ [EX [[[[1<=p49 & [1<=p139 & 1<=p140]] & [1<=p111 & 1<=p112]] & [[1<=p130 & 1<=p15] & [1<=p37 & 1<=p129]]]]]]] & ~ [E [~ [EX [[[[1<=p49 & [1<=p139 & 1<=p140]] & [1<=p111 & 1<=p112]] & [[1<=p130 & 1<=p15] & [1<=p37 & 1<=p129]]]]] U [~ [[1<=p9 & [1<=p107 & 1<=p108]]] & ~ [EX [[[[1<=p49 & [1<=p139 & 1<=p140]] & [1<=p111 & 1<=p112]] & [[1<=p130 & 1<=p15] & [1<=p37 & 1<=p129]]]]]]]]]]] & ~ [[EG [[[1<=p49 & [1<=p139 & 1<=p140]] & [[E [true U 1<=p1] & ~ [EG [~ [[1<=p1 & [1<=p101 & 1<=p102]]]]]] & E [true U ~ [[1<=p94 & 1<=p97]]]]]] | EG [~ [[1<=p93 & [1<=p175 & 1<=p176]]]]]]]]]]

abstracting: (1<=p176)
states: 13,792,273,858,822,144 (16)
abstracting: (1<=p175)
states: 15,762,598,695,796,736 (16)
abstracting: (1<=p93)
states: 14,355,223,812,243,456 (16)
..........................................................................
before gc: list nodes free: 6582443

after gc: idd nodes used:1141159, unused:62858841; list nodes free:296854533
..................................................
before gc: list nodes free: 12602804

after gc: idd nodes used:3034197, unused:60965803; list nodes free:288347453
MC time: 3m47.226sec

checking: [AF [[EG [E [~ [[1<=p54 & 1<=p57]] U ~ [[1<=p91 & [1<=p173 & 1<=p174]]]]] & [EG [1<=p100] | AG [[[p5<=0 | [p104<=0 | p105<=0]] & [p2<=0 | p5<=0]]]]]] | E [EG [A [~ [[[1<=p82 & 1<=p85] & [1<=p92 & 1<=p95]]] U [[A [[1<=p6 & 1<=p9] U [1<=p88 & 1<=p91]] & 1<=p100] & [1<=p24 & 1<=p27]]]] U [[[1<=p86 & 1<=p89] | [~ [EF [[1<=p14 & 1<=p17]]] & EX [EF [[1<=p28 & 1<=p31]]]]] & [1<=p68 & 1<=p71]]]]
normalized: [~ [EG [~ [[EG [E [~ [[1<=p54 & 1<=p57]] U ~ [[1<=p91 & [1<=p173 & 1<=p174]]]]] & [~ [E [true U ~ [[[p2<=0 | p5<=0] & [p5<=0 | [p104<=0 | p105<=0]]]]]] | EG [1<=p100]]]]]] | E [EG [[~ [EG [~ [[[1<=p24 & 1<=p27] & [1<=p100 & [~ [EG [~ [[1<=p88 & 1<=p91]]]] & ~ [E [~ [[1<=p88 & 1<=p91]] U [~ [[1<=p6 & 1<=p9]] & ~ [[1<=p88 & 1<=p91]]]]]]]]]]] & ~ [E [~ [[[1<=p24 & 1<=p27] & [1<=p100 & [~ [EG [~ [[1<=p88 & 1<=p91]]]] & ~ [E [~ [[1<=p88 & 1<=p91]] U [~ [[1<=p6 & 1<=p9]] & ~ [[1<=p88 & 1<=p91]]]]]]]]] U [~ [[[1<=p24 & 1<=p27] & [1<=p100 & [~ [EG [~ [[1<=p88 & 1<=p91]]]] & ~ [E [~ [[1<=p88 & 1<=p91]] U [~ [[1<=p6 & 1<=p9]] & ~ [[1<=p88 & 1<=p91]]]]]]]]] & [[1<=p82 & 1<=p85] & [1<=p92 & 1<=p95]]]]]]] U [[1<=p68 & 1<=p71] & [[~ [E [true U [1<=p14 & 1<=p17]]] & EX [E [true U [1<=p28 & 1<=p31]]]] | [1<=p86 & 1<=p89]]]]]

abstracting: (1<=p89)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p86)
states: 2,251,799,813,685,248 (15)
abstracting: (1<=p31)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p28)
states: 10,414,574,138,294,272 (16)
.abstracting: (1<=p17)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p14)
states: 12,384,898,975,268,864 (16)
abstracting: (1<=p71)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p68)
states: 4,785,074,604,081,152 (15)
abstracting: (1<=p95)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p92)
states: 1,407,374,883,553,280 (15)
abstracting: (1<=p85)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p82)
states: 2,814,749,767,106,560 (15)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p9)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p6)
states: 13,510,798,882,111,488 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1039
abstracting: (1<=p100)
states: 562,949,953,421,312 (14)
abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p24)
states: 10,977,524,091,715,584 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p9)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p6)
states: 13,510,798,882,111,488 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1039
abstracting: (1<=p100)
states: 562,949,953,421,312 (14)
abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p24)
states: 10,977,524,091,715,584 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p9)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p6)
states: 13,510,798,882,111,488 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1039
abstracting: (1<=p100)
states: 562,949,953,421,312 (14)
abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p24)
states: 10,977,524,091,715,584 (16)

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p100)
states: 562,949,953,421,312 (14)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1227
abstracting: (p105<=0)
states: 27,866,022,694,354,944 (16)
abstracting: (p104<=0)
states: 1,125,899,906,842,624 (15)
abstracting: (p5<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p5<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (p2<=0)
states: 15,199,648,742,375,424 (16)
abstracting: (1<=p174)
states: 13,510,798,882,111,488 (16)
abstracting: (1<=p173)
states: 16,044,073,672,507,392 (16)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p57)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p54)
states: 6,755,399,441,055,744 (15)
.
EG iterations: 1
.................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 9988904

after gc: idd nodes used:263434, unused:63736566; list nodes free:300775504
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1223
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m32.897sec

checking: E [[~ [[[[[[1<=p10 & 1<=p13] | [1<=p4 & 1<=p7]] & EG [[1<=p58 & 1<=p61]]] | [~ [[1<=p23 & [1<=p118 & 1<=p119]]] | EF [1<=p100]]] | [E [[[1<=p71 & 1<=p157] & [1<=p158 & [1<=p62 & 1<=p65]]] U [[1<=p48 & 1<=p51] | [1<=p70 & 1<=p73]]] | [EF [[[1<=p69 & [1<=p155 & 1<=p156]] & [1<=p95 & [1<=p177 & 1<=p178]]]] | E [~ [[1<=p95 & [1<=p177 & 1<=p178]]] U [[1<=p27 & [1<=p122 & 1<=p123]] | [1<=p2 & 1<=p5]]]]]]] | [1<=p14 & 1<=p17]] U AX [[EF [EG [[1<=p89 & [1<=p171 & 1<=p172]]]] | [1<=p61 & [1<=p149 & 1<=p150]]]]]
normalized: E [[~ [[[[E [~ [[1<=p95 & [1<=p177 & 1<=p178]]] U [[1<=p2 & 1<=p5] | [1<=p27 & [1<=p122 & 1<=p123]]]] | E [true U [[[1<=p177 & 1<=p178] & 1<=p95] & [[1<=p155 & 1<=p156] & 1<=p69]]]] | E [[[[1<=p62 & 1<=p65] & 1<=p158] & [1<=p71 & 1<=p157]] U [[1<=p70 & 1<=p73] | [1<=p48 & 1<=p51]]]] | [[E [true U 1<=p100] | ~ [[[1<=p118 & 1<=p119] & 1<=p23]]] | [EG [[1<=p58 & 1<=p61]] & [[1<=p4 & 1<=p7] | [1<=p10 & 1<=p13]]]]]] | [1<=p14 & 1<=p17]] U ~ [EX [~ [[[1<=p61 & [1<=p149 & 1<=p150]] | E [true U EG [[1<=p89 & [1<=p171 & 1<=p172]]]]]]]]]

abstracting: (1<=p172)
states: 13,229,323,905,400,832 (16)
abstracting: (1<=p171)
states: 16,325,548,649,218,048 (16)
abstracting: (1<=p89)
states: 14,355,223,812,243,456 (16)
...................................................
before gc: list nodes free: 3154162

after gc: idd nodes used:547003, unused:63452997; list nodes free:299502371
.........................................................................
before gc: list nodes free: 12663745

after gc: idd nodes used:2760366, unused:61239634; list nodes free:289579792
.MC time: 3m35.454sec

checking: [~ [E [[[[~ [E [[[1<=p93 & [1<=p175 & 1<=p176]] | [1<=p31 & [1<=p125 & 1<=p126]]] U E [[1<=p72 & 1<=p75] U [1<=p19 & [1<=p115 & 1<=p116]]]]] & AG [[1<=p24 & 1<=p27]]] & [AX [[1<=p30 & 1<=p33]] & [1<=p47 & 1<=p137]]] & [[1<=p138 & 1<=p88] & [1<=p91 & [1<=p76 & 1<=p79]]]] U [EX [~ [[[1<=p96 & 1<=p99] | [1<=p52 & 1<=p55]]]] & AF [E [[1<=p25 & [1<=p120 & 1<=p121]] U [1<=p53 & [1<=p143 & 1<=p144]]]]]]] | [AF [AG [~ [E [[1<=p57 & [1<=p146 & 1<=p147]] U [1<=p65 & [1<=p152 & 1<=p153]]]]]] & ~ [A [[1<=p100 & ~ [[1<=p49 & [1<=p139 & 1<=p140]]]] U AG [[1<=p37 & [1<=p129 & 1<=p130]]]]]]]
normalized: [[~ [[~ [EG [E [true U ~ [[1<=p37 & [1<=p129 & 1<=p130]]]]]] & ~ [E [E [true U ~ [[1<=p37 & [1<=p129 & 1<=p130]]]] U [E [true U ~ [[1<=p37 & [1<=p129 & 1<=p130]]]] & ~ [[1<=p100 & ~ [[1<=p49 & [1<=p139 & 1<=p140]]]]]]]]]] & ~ [EG [E [true U E [[1<=p57 & [1<=p146 & 1<=p147]] U [1<=p65 & [1<=p152 & 1<=p153]]]]]]] | ~ [E [[[[1<=p91 & [1<=p76 & 1<=p79]] & [1<=p138 & 1<=p88]] & [[[1<=p47 & 1<=p137] & ~ [EX [~ [[1<=p30 & 1<=p33]]]]] & [~ [E [true U ~ [[1<=p24 & 1<=p27]]]] & ~ [E [[[1<=p31 & [1<=p125 & 1<=p126]] | [1<=p93 & [1<=p175 & 1<=p176]]] U E [[1<=p72 & 1<=p75] U [1<=p19 & [1<=p115 & 1<=p116]]]]]]]] U [~ [EG [~ [E [[1<=p25 & [1<=p120 & 1<=p121]] U [1<=p53 & [1<=p143 & 1<=p144]]]]]] & EX [~ [[[1<=p52 & 1<=p55] | [1<=p96 & 1<=p99]]]]]]]]

abstracting: (1<=p99)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p96)
states: 844,424,930,131,968 (14)
abstracting: (1<=p55)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p52)
states: 7,036,874,417,766,400 (15)
.abstracting: (1<=p144)
states: 8,162,774,324,609,024 (15)
abstracting: (1<=p143)
states: 21,392,098,230,009,856 (16)
abstracting: (1<=p53)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p121)
states: 4,222,124,650,659,840 (15)
abstracting: (1<=p120)
states: 25,332,747,903,959,040 (16)
abstracting: (1<=p25)
states: 14,355,223,812,243,456 (16)
...............................................................................................................................................................................................................................................
before gc: list nodes free: 12700802

after gc: idd nodes used:414609, unused:63585391; list nodes free:300118098
................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 671
abstracting: (1<=p116)
states: 3,377,699,720,527,872 (15)
abstracting: (1<=p115)
states: 26,177,172,834,091,008 (16)
abstracting: (1<=p19)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p75)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p72)
states: 4,222,124,650,659,840 (15)
abstracting: (1<=p176)
states: 13,792,273,858,822,144 (16)
abstracting: (1<=p175)
states: 15,762,598,695,796,736 (16)
abstracting: (1<=p93)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p126)
states: 5,066,549,580,791,808 (15)
abstracting: (1<=p125)
states: 24,488,322,973,827,072 (16)
abstracting: (1<=p31)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p24)
states: 10,977,524,091,715,584 (16)
abstracting: (1<=p33)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p30)
states: 10,133,099,161,583,616 (16)
.abstracting: (1<=p137)
states: 22,236,523,160,141,824 (16)
abstracting: (1<=p47)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p88)
states: 1,970,324,836,974,592 (15)
abstracting: (1<=p138)
states: 7,318,349,394,477,056 (15)
abstracting: (1<=p79)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p76)
states: 3,659,174,697,238,528 (15)
abstracting: (1<=p91)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p153)
states: 9,851,624,184,872,960 (15)
abstracting: (1<=p152)
states: 19,703,248,369,745,920 (16)
abstracting: (1<=p65)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p147)
states: 8,725,724,278,030,336 (15)
abstracting: (1<=p146)
states: 20,829,148,276,588,544 (16)
abstracting: (1<=p57)
states: 14,355,223,812,243,456 (16)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1208
abstracting: (1<=p140)
states: 7,599,824,371,187,712 (15)
abstracting: (1<=p139)
states: 21,955,048,183,431,168 (16)
abstracting: (1<=p49)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p100)
states: 562,949,953,421,312 (14)
abstracting: (1<=p130)
states: 5,910,974,510,923,776 (15)
abstracting: (1<=p129)
states: 23,643,898,043,695,104 (16)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p130)
states: 5,910,974,510,923,776 (15)
abstracting: (1<=p129)
states: 23,643,898,043,695,104 (16)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p130)
states: 5,910,974,510,923,776 (15)
abstracting: (1<=p129)
states: 23,643,898,043,695,104 (16)
abstracting: (1<=p37)
states: 14,355,223,812,243,456 (16)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m16.525sec

checking: E [AF [[1<=p81 & [1<=p165 & 1<=p166]]] U E [EF [EX [EF [[1<=p93 & [1<=p175 & 1<=p176]]]]] U [1<=p23 & [1<=p118 & 1<=p119]]]]
normalized: E [~ [EG [~ [[1<=p81 & [1<=p165 & 1<=p166]]]]] U E [E [true U EX [E [true U [1<=p93 & [1<=p175 & 1<=p176]]]]] U [1<=p23 & [1<=p118 & 1<=p119]]]]

abstracting: (1<=p119)
states: 3,940,649,673,949,184 (15)
abstracting: (1<=p118)
states: 25,614,222,880,669,696 (16)
abstracting: (1<=p23)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p176)
states: 13,792,273,858,822,144 (16)
abstracting: (1<=p175)
states: 15,762,598,695,796,736 (16)
abstracting: (1<=p93)
states: 14,355,223,812,243,456 (16)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5997492 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098392 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 CTLFireability -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


iterations count:9166 (89), effective:2550 (25)

initing FirstDep: 0m 0.000sec


iterations count:4067 (39), effective:1275 (12)

iterations count:547 (5), effective:141 (1)

iterations count:1432 (14), effective:375 (3)

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

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

iterations count:371 (3), effective:86 (0)

iterations count:517 (5), effective:128 (1)

iterations count:5285 (51), effective:1529 (14)

iterations count:283 (2), effective:60 (0)

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

iterations count:3142 (30), effective:830 (8)

net_ddint.h:600: Timeout: after 319 sec


iterations count:3271 (32), effective:862 (8)

net_ddint.h:600: Timeout: after 290 sec


iterations count:3595 (35), effective:949 (9)

iterations count:259 (2), effective:50 (0)

iterations count:259 (2), effective:52 (0)

iterations count:2145 (21), effective:562 (5)

net_ddint.h:600: Timeout: after 290 sec


iterations count:985 (9), effective:281 (2)

net_ddint.h:600: Timeout: after 261 sec


ctl_mc.icc:221: Timeout: after 235 sec


iterations count:1902 (18), effective:578 (5)

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

net_ddint.h:600: Timeout: after 226 sec


iterations count:693 (6), effective:186 (1)

iterations count:419 (4), effective:95 (0)

iterations count:292 (2), effective:62 (0)

iterations count:292 (2), effective:62 (0)

iterations count:4102 (40), effective:1275 (12)

iterations count:292 (2), effective:62 (0)

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

iterations count:4646 (45), effective:1228 (12)

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

ctl_mc.icc:221: Timeout: after 214 sec


iterations count:212 (2), effective:35 (0)

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

iterations count:332 (3), effective:74 (0)

iterations count:2678 (26), effective:704 (6)

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

iterations count:163 (1), effective:19 (0)

iterations count:860 (8), effective:221 (2)

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

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

iterations count:256 (2), effective:49 (0)

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

iterations count:283 (2), effective:60 (0)

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

iterations count:3142 (30), effective:830 (8)

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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="CTLFireability"
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 ResAllocation-PT-R050C002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203700762"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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