About the Execution of Marcie+red for ResAllocation-PT-R020C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6073.352 | 23850.00 | 39138.00 | 331.10 | FFFFTFFTTTTFTFFF | 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-167889203700754.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-R020C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700754
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:33 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.4K 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:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:35 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 85K 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-R020C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679181766611
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-R020C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:22:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:22:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:22:48] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-18 23:22:48] [INFO ] Transformed 80 places.
[2023-03-18 23:22:48] [INFO ] Transformed 42 transitions.
[2023-03-18 23:22:48] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 76 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 80 cols
[2023-03-18 23:22:48] [INFO ] Computed 40 place invariants in 10 ms
[2023-03-18 23:22:48] [INFO ] Implicit Places using invariants in 173 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 198 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 79/80 places, 42/42 transitions.
Support contains 76 out of 79 places after structural reductions.
[2023-03-18 23:22:48] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:22:48] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:22:48] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 52) seen :38
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 42 rows 79 cols
[2023-03-18 23:22:49] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-18 23:22:49] [INFO ] [Real]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-18 23:22:49] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :3 sat :3 real:2
[2023-03-18 23:22:49] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 23:22:49] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :2 real:3
[2023-03-18 23:22:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-18 23:22:50] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-18 23:22:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-18 23:22:50] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 23:22:50] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 16 ms.
Support contains 16 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 42/42 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 77 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 77 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 75 transition count 40
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 75 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 73 transition count 39
Applied a total of 9 rules in 16 ms. Remains 73 /79 variables (removed 6) and now considering 39/42 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 73/79 places, 39/42 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1068407 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1068407 steps, saw 187368 distinct states, run finished after 3002 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 39 rows 73 cols
[2023-03-18 23:22:53] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-18 23:22:53] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-18 23:22:53] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-18 23:22:53] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 23:22:53] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-18 23:22:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-18 23:22:53] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:22:53] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 23:22:53] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 16 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-18 23:22:53] [INFO ] Invariant cache hit.
[2023-03-18 23:22:53] [INFO ] Implicit Places using invariants in 48 ms returned [41, 43, 45, 47, 53, 55, 57, 59, 61, 63, 65, 68, 70, 72]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 50 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/73 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55 ms. Remains : 59/73 places, 39/39 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1206825 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :{}
Probabilistic random walk after 1206825 steps, saw 212052 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 39 rows 59 cols
[2023-03-18 23:22:57] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-18 23:22:57] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-18 23:22:57] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:22:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-18 23:22:57] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:22:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-18 23:22:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-18 23:22:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2023-03-18 23:22:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-18 23:22:57] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 23:22:57] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 19 ms.
Support contains 16 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 59/59 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-18 23:22:57] [INFO ] Invariant cache hit.
[2023-03-18 23:22:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 23:22:57] [INFO ] Invariant cache hit.
[2023-03-18 23:22:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-18 23:22:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:22:57] [INFO ] Invariant cache hit.
[2023-03-18 23:22:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 59/59 places, 39/39 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 38
Applied a total of 2 rules in 20 ms. Remains 58 /59 variables (removed 1) and now considering 38/39 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 38 rows 58 cols
[2023-03-18 23:22:57] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 23:22:57] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-18 23:22:57] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:22:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 23:22:57] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:22:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 23:22:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-18 23:22:57] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 23:22:57] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:22:57] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:57] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:57] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:57] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:57] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 42/42 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 76 transition count 40
Applied a total of 5 rules in 6 ms. Remains 76 /79 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 76/79 places, 40/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 42/42 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 76 transition count 40
Applied a total of 5 rules in 6 ms. Remains 76 /79 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 76/79 places, 40/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 41
Applied a total of 2 rules in 5 ms. Remains 78 /79 variables (removed 1) and now considering 41/42 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 78/79 places, 41/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 42/42 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 76 transition count 40
Applied a total of 5 rules in 4 ms. Remains 76 /79 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 76/79 places, 40/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/79 places, 42/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 42/42 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 76 transition count 40
Applied a total of 5 rules in 3 ms. Remains 76 /79 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 76/79 places, 40/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 42/42 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 76 transition count 40
Applied a total of 5 rules in 3 ms. Remains 76 /79 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 76/79 places, 40/42 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:58] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:58] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-18 23:22:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 42 transitions and 198 arcs took 1 ms.
Total runtime 10097 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: 79 NrTr: 42 NrArc: 198)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.692sec
RS generation: 0m 0.012sec
-> reachability set: #nodes 224 (2.2e+02) #states 11,534,336 (7)
starting MCC model checker
--------------------------
checking: EG [[p17<=0 | [p57<=0 | p58<=0]]]
normalized: EG [[[p57<=0 | p58<=0] | p17<=0]]
abstracting: (p17<=0)
states: 6,029,312 (6)
abstracting: (p58<=0)
states: 8,650,752 (6)
abstracting: (p57<=0)
states: 2,621,440 (6)
........................................................................................
EG iterations: 88
-> the formula is TRUE
FORMULA ResAllocation-PT-R020C002-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.279sec
checking: AG [AF [[1<=p21 & [1<=p61 & 1<=p62]]]]
normalized: ~ [E [true U EG [~ [[[1<=p61 & 1<=p62] & 1<=p21]]]]]
abstracting: (1<=p21)
states: 5,505,024 (6)
abstracting: (1<=p62)
states: 3,407,872 (6)
abstracting: (1<=p61)
states: 8,388,608 (6)
..................................................................................
EG iterations: 82
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.398sec
checking: AG [AF [[[1<=p16 & 1<=p19] | [1<=p0 & 1<=p3]]]]
normalized: ~ [E [true U EG [~ [[[1<=p0 & 1<=p3] | [1<=p16 & 1<=p19]]]]]]
abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
.............................................................................................................................................................................................................................
EG iterations: 221
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.000sec
checking: EG [[EF [p1<=0] | [1<=p35 & [1<=p74 & 1<=p75]]]]
normalized: EG [[E [true U p1<=0] | [[1<=p74 & 1<=p75] & 1<=p35]]]
abstracting: (1<=p35)
states: 5,505,024 (6)
abstracting: (1<=p75)
states: 5,242,880 (6)
abstracting: (1<=p74)
states: 6,553,600 (6)
abstracting: (p1<=0)
states: 6,029,312 (6)
EG iterations: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R020C002-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [EG [~ [EF [[1<=p7 & [1<=p47 & 1<=p48]]]]] U AG [EF [[1<=p5 & [1<=p45 & 1<=p46]]]]]
normalized: E [EG [~ [E [true U [[1<=p47 & 1<=p48] & 1<=p7]]]] U ~ [E [true U ~ [E [true U [[1<=p45 & 1<=p46] & 1<=p5]]]]]]
abstracting: (1<=p5)
states: 5,505,024 (6)
abstracting: (1<=p46)
states: 1,310,720 (6)
abstracting: (1<=p45)
states: 10,485,760 (7)
abstracting: (1<=p7)
states: 5,505,024 (6)
abstracting: (1<=p48)
states: 1,572,864 (6)
abstracting: (1<=p47)
states: 10,223,616 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EG [EF [[AG [[[AF [[1<=p24 & 1<=p27]] & 1<=p7] & [1<=p47 & 1<=p48]]] & [p10<=0 | p13<=0]]]]
normalized: EG [E [true U [[p10<=0 | p13<=0] & ~ [E [true U ~ [[[1<=p47 & 1<=p48] & [~ [EG [~ [[1<=p24 & 1<=p27]]]] & 1<=p7]]]]]]]]
abstracting: (1<=p7)
states: 5,505,024 (6)
abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p24)
states: 2,359,296 (6)
......................................................................................................
EG iterations: 102
abstracting: (1<=p48)
states: 1,572,864 (6)
abstracting: (1<=p47)
states: 10,223,616 (7)
abstracting: (p13<=0)
states: 6,029,312 (6)
abstracting: (p10<=0)
states: 7,340,032 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.081sec
checking: EG [~ [A [[AF [[1<=p26 & 1<=p29]] | [EX [~ [[p6<=0 | p9<=0]]] & EF [1<=p38]]] U [1<=p22 & 1<=p25]]]]
normalized: EG [~ [[~ [EG [~ [[1<=p22 & 1<=p25]]]] & ~ [E [~ [[1<=p22 & 1<=p25]] U [~ [[[E [true U 1<=p38] & EX [~ [[p6<=0 | p9<=0]]]] | ~ [EG [~ [[1<=p26 & 1<=p29]]]]]] & ~ [[1<=p22 & 1<=p25]]]]]]]]
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
abstracting: (1<=p29)
states: 5,505,024 (6)
abstracting: (1<=p26)
states: 2,097,152 (6)
................................................................................................................
EG iterations: 112
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (p6<=0)
states: 6,815,744 (6)
.abstracting: (1<=p38)
states: 524,288 (5)
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
..............................................................................................
EG iterations: 94
..............................................................................................
EG iterations: 94
-> the formula is TRUE
FORMULA ResAllocation-PT-R020C002-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.267sec
checking: AG [[AG [EF [[1<=p6 & 1<=p9]]] & EX [AF [[1<=p22 & [1<=p25 & [p15<=0 | [p55<=0 | p56<=0]]]]]]]]
normalized: ~ [E [true U ~ [[EX [~ [EG [~ [[[[[p55<=0 | p56<=0] | p15<=0] & 1<=p25] & 1<=p22]]]]] & ~ [E [true U ~ [E [true U [1<=p6 & 1<=p9]]]]]]]]]
abstracting: (1<=p9)
states: 5,505,024 (6)
abstracting: (1<=p6)
states: 4,718,592 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (p15<=0)
states: 6,029,312 (6)
abstracting: (p56<=0)
states: 8,912,896 (6)
abstracting: (p55<=0)
states: 2,359,296 (6)
..............................................................................................
EG iterations: 94
.-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
checking: AG [A [[p6<=0 | [p9<=0 | AX [[EX [[1<=p29 & [1<=p69 & 1<=p70]]] & [[1<=p6 & 1<=p9] | [1<=p30 & 1<=p33]]]]]] U AG [EF [EX [[1<=p10 & 1<=p13]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [E [true U ~ [E [true U EX [[1<=p10 & 1<=p13]]]]]]] & ~ [E [E [true U ~ [E [true U EX [[1<=p10 & 1<=p13]]]]] U [~ [[[~ [EX [~ [[[[1<=p30 & 1<=p33] | [1<=p6 & 1<=p9]] & EX [[[1<=p69 & 1<=p70] & 1<=p29]]]]]] | p9<=0] | p6<=0]] & E [true U ~ [E [true U EX [[1<=p10 & 1<=p13]]]]]]]]]]]]
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p10)
states: 4,194,304 (6)
.abstracting: (p6<=0)
states: 6,815,744 (6)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (1<=p29)
states: 5,505,024 (6)
abstracting: (1<=p70)
states: 4,456,448 (6)
abstracting: (1<=p69)
states: 7,340,032 (6)
.abstracting: (1<=p9)
states: 5,505,024 (6)
abstracting: (1<=p6)
states: 4,718,592 (6)
abstracting: (1<=p33)
states: 5,505,024 (6)
abstracting: (1<=p30)
states: 1,572,864 (6)
.abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p10)
states: 4,194,304 (6)
.abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p10)
states: 4,194,304 (6)
.
EG iterations: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.077sec
checking: [EX [[AF [[[p37<=0 | [p76<=0 | p77<=0]] & [p12<=0 | p15<=0]]] & [[p0<=0 | p3<=0] & [p0<=0 | p3<=0]]]] & EF [[1<=p39 & 1<=p78]]]
normalized: [E [true U [1<=p39 & 1<=p78]] & EX [[[[p0<=0 | p3<=0] & [p0<=0 | p3<=0]] & ~ [EG [~ [[[p12<=0 | p15<=0] & [[p76<=0 | p77<=0] | p37<=0]]]]]]]]
abstracting: (p37<=0)
states: 6,029,312 (6)
abstracting: (p77<=0)
states: 6,029,312 (6)
abstracting: (p76<=0)
states: 5,242,880 (6)
abstracting: (p15<=0)
states: 6,029,312 (6)
abstracting: (p12<=0)
states: 7,602,176 (6)
..........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 346
abstracting: (p3<=0)
states: 6,029,312 (6)
abstracting: (p0<=0)
states: 6,029,312 (6)
abstracting: (p3<=0)
states: 6,029,312 (6)
abstracting: (p0<=0)
states: 6,029,312 (6)
.abstracting: (1<=p78)
states: 6,029,312 (6)
abstracting: (1<=p39)
states: 5,505,024 (6)
-> the formula is TRUE
FORMULA ResAllocation-PT-R020C002-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.887sec
checking: [EX [AF [AG [[p1<=0 | [p41<=0 | p42<=0]]]]] & EG [[[EG [[p6<=0 | p9<=0]] | p12<=0] | [p15<=0 | [[p30<=0 | p33<=0] & [p5<=0 | [p45<=0 | p46<=0]]]]]]]
normalized: [EG [[[[[[p45<=0 | p46<=0] | p5<=0] & [p30<=0 | p33<=0]] | p15<=0] | [EG [[p6<=0 | p9<=0]] | p12<=0]]] & EX [~ [EG [E [true U ~ [[[p41<=0 | p42<=0] | p1<=0]]]]]]]
abstracting: (p1<=0)
states: 6,029,312 (6)
abstracting: (p42<=0)
states: 10,747,904 (7)
abstracting: (p41<=0)
states: 524,288 (5)
.
EG iterations: 1
.abstracting: (p12<=0)
states: 7,602,176 (6)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (p6<=0)
states: 6,815,744 (6)
................................................................................................................
EG iterations: 112
abstracting: (p15<=0)
states: 6,029,312 (6)
abstracting: (p33<=0)
states: 6,029,312 (6)
abstracting: (p30<=0)
states: 9,961,472 (6)
abstracting: (p5<=0)
states: 6,029,312 (6)
abstracting: (p46<=0)
states: 10,223,616 (7)
abstracting: (p45<=0)
states: 1,048,576 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.399sec
checking: E [A [[AF [[1<=p29 & [1<=p69 & 1<=p70]]] | [1<=p39 & 1<=p78]] U ~ [[p6<=0 | p9<=0]]] U ~ [E [[~ [EX [[1<=p24 & 1<=p27]]] & ~ [[1<=p25 & [1<=p65 & 1<=p66]]]] U [~ [E [[1<=p7 & [1<=p47 & 1<=p48]] U [1<=p5 & [1<=p45 & 1<=p46]]]] & ~ [EX [[1<=p18 & 1<=p21]]]]]]]
normalized: E [[~ [EG [[p6<=0 | p9<=0]]] & ~ [E [[p6<=0 | p9<=0] U [~ [[[1<=p39 & 1<=p78] | ~ [EG [~ [[[1<=p69 & 1<=p70] & 1<=p29]]]]]] & [p6<=0 | p9<=0]]]]] U ~ [E [[~ [[[1<=p65 & 1<=p66] & 1<=p25]] & ~ [EX [[1<=p24 & 1<=p27]]]] U [~ [EX [[1<=p18 & 1<=p21]]] & ~ [E [[[1<=p47 & 1<=p48] & 1<=p7] U [[1<=p45 & 1<=p46] & 1<=p5]]]]]]]
abstracting: (1<=p5)
states: 5,505,024 (6)
abstracting: (1<=p46)
states: 1,310,720 (6)
abstracting: (1<=p45)
states: 10,485,760 (7)
abstracting: (1<=p7)
states: 5,505,024 (6)
abstracting: (1<=p48)
states: 1,572,864 (6)
abstracting: (1<=p47)
states: 10,223,616 (7)
abstracting: (1<=p21)
states: 5,505,024 (6)
abstracting: (1<=p18)
states: 3,145,728 (6)
.abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p24)
states: 2,359,296 (6)
.abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p66)
states: 3,932,160 (6)
abstracting: (1<=p65)
states: 7,864,320 (6)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (p6<=0)
states: 6,815,744 (6)
abstracting: (1<=p29)
states: 5,505,024 (6)
abstracting: (1<=p70)
states: 4,456,448 (6)
abstracting: (1<=p69)
states: 7,340,032 (6)
......................................................................................................
EG iterations: 102
abstracting: (1<=p78)
states: 6,029,312 (6)
abstracting: (1<=p39)
states: 5,505,024 (6)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (p6<=0)
states: 6,815,744 (6)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (p6<=0)
states: 6,815,744 (6)
................................................................................................................
EG iterations: 112
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.532sec
checking: [EX [~ [A [EX [AF [[[1<=p67 & 1<=p68] & 1<=p27]]] U A [[1<=p28 & 1<=p31] U [1<=p13 & [1<=p53 & 1<=p54]]]]]] & E [[[1<=p34 & 1<=p37] | AG [[[AX [[1<=p16 & 1<=p19]] | [1<=p39 & 1<=p78]] | [[1<=p30 & 1<=p33] | [1<=p24 & 1<=p27]]]]] U [~ [EG [[1<=p20 & 1<=p23]]] & ~ [E [~ [AG [1<=p1]] U AX [[1<=p29 & [1<=p69 & 1<=p70]]]]]]]]
normalized: [E [[[1<=p34 & 1<=p37] | ~ [E [true U ~ [[[~ [EX [~ [[1<=p16 & 1<=p19]]]] | [1<=p39 & 1<=p78]] | [[1<=p30 & 1<=p33] | [1<=p24 & 1<=p27]]]]]]] U [~ [EG [[1<=p20 & 1<=p23]]] & ~ [E [E [true U ~ [1<=p1]] U ~ [EX [~ [[[1<=p69 & 1<=p70] & 1<=p29]]]]]]]] & EX [~ [[~ [EG [~ [[~ [EG [~ [[1<=p13 & [1<=p53 & 1<=p54]]]]] & ~ [E [~ [[1<=p13 & [1<=p53 & 1<=p54]]] U [~ [[1<=p28 & 1<=p31]] & ~ [[1<=p13 & [1<=p53 & 1<=p54]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p13 & [1<=p53 & 1<=p54]]]]] & ~ [E [~ [[1<=p13 & [1<=p53 & 1<=p54]]] U [~ [[1<=p28 & 1<=p31]] & ~ [[1<=p13 & [1<=p53 & 1<=p54]]]]]]]] U [~ [EX [~ [EG [~ [[[1<=p67 & 1<=p68] & 1<=p27]]]]]] & ~ [[~ [EG [~ [[1<=p13 & [1<=p53 & 1<=p54]]]]] & ~ [E [~ [[1<=p13 & [1<=p53 & 1<=p54]]] U [~ [[1<=p28 & 1<=p31]] & ~ [[1<=p13 & [1<=p53 & 1<=p54]]]]]]]]]]]]]]]
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p31)
states: 5,505,024 (6)
abstracting: (1<=p28)
states: 1,835,008 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p68)
states: 4,194,304 (6)
abstracting: (1<=p67)
states: 7,602,176 (6)
..............................................................................................
EG iterations: 94
.abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p31)
states: 5,505,024 (6)
abstracting: (1<=p28)
states: 1,835,008 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p31)
states: 5,505,024 (6)
abstracting: (1<=p28)
states: 1,835,008 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
......................................................................................................
EG iterations: 102
.abstracting: (1<=p29)
states: 5,505,024 (6)
abstracting: (1<=p70)
states: 4,456,448 (6)
abstracting: (1<=p69)
states: 7,340,032 (6)
.abstracting: (1<=p1)
states: 5,505,024 (6)
abstracting: (1<=p23)
states: 5,505,024 (6)
abstracting: (1<=p20)
states: 2,883,584 (6)
.................................................................................................................................
EG iterations: 129
abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p24)
states: 2,359,296 (6)
abstracting: (1<=p33)
states: 5,505,024 (6)
abstracting: (1<=p30)
states: 1,572,864 (6)
abstracting: (1<=p78)
states: 6,029,312 (6)
abstracting: (1<=p39)
states: 5,505,024 (6)
abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
.abstracting: (1<=p37)
states: 5,505,024 (6)
abstracting: (1<=p34)
states: 1,048,576 (6)
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.879sec
checking: E [[~ [[p6<=0 | p9<=0]] | [EG [[1<=p0 & 1<=p3]] & [~ [[[AX [[1<=p14 & 1<=p17]] | AX [[1<=p26 & 1<=p29]]] | [[1<=p3 & [1<=p43 & 1<=p44]] | [1<=p12 & 1<=p15]]]] | [1<=p19 & [1<=p59 & 1<=p60]]]]] U AG [~ [[EG [E [[1<=p23 & [1<=p63 & 1<=p64]] U [1<=p16 & 1<=p19]]] & [1<=p40 | AX [[1<=p7 & [1<=p47 & 1<=p48]]]]]]]]
normalized: E [[[[[1<=p19 & [1<=p59 & 1<=p60]] | ~ [[[[1<=p12 & 1<=p15] | [1<=p3 & [1<=p43 & 1<=p44]]] | [~ [EX [~ [[1<=p26 & 1<=p29]]]] | ~ [EX [~ [[1<=p14 & 1<=p17]]]]]]]] & EG [[1<=p0 & 1<=p3]]] | ~ [[p6<=0 | p9<=0]]] U ~ [E [true U [[1<=p40 | ~ [EX [~ [[1<=p7 & [1<=p47 & 1<=p48]]]]]] & EG [E [[1<=p23 & [1<=p63 & 1<=p64]] U [1<=p16 & 1<=p19]]]]]]]
abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
abstracting: (1<=p64)
states: 3,670,016 (6)
abstracting: (1<=p63)
states: 8,126,464 (6)
abstracting: (1<=p23)
states: 5,505,024 (6)
.................................................................................................................................................................
EG iterations: 161
abstracting: (1<=p48)
states: 1,572,864 (6)
abstracting: (1<=p47)
states: 10,223,616 (7)
abstracting: (1<=p7)
states: 5,505,024 (6)
.abstracting: (1<=p40)
states: 524,288 (5)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (p6<=0)
states: 6,815,744 (6)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 344
abstracting: (1<=p17)
states: 5,505,024 (6)
abstracting: (1<=p14)
states: 3,670,016 (6)
.abstracting: (1<=p29)
states: 5,505,024 (6)
abstracting: (1<=p26)
states: 2,097,152 (6)
.abstracting: (1<=p44)
states: 1,048,576 (6)
abstracting: (1<=p43)
states: 10,747,904 (7)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p15)
states: 5,505,024 (6)
abstracting: (1<=p12)
states: 3,932,160 (6)
abstracting: (1<=p60)
states: 3,145,728 (6)
abstracting: (1<=p59)
states: 8,650,752 (6)
abstracting: (1<=p19)
states: 5,505,024 (6)
-> the formula is TRUE
FORMULA ResAllocation-PT-R020C002-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.681sec
checking: EG [~ [A [[[A [[1<=p9 & [1<=p49 & 1<=p50]] U [1<=p19 & [1<=p59 & 1<=p60]]] | [[EF [[1<=p11 & [1<=p51 & 1<=p52]]] & [1<=p28 & 1<=p31]] & [1<=p15 & [1<=p55 & 1<=p56]]]] | [[EX [[1<=p17 & [1<=p57 & 1<=p58]]] & [[1<=p5 & [1<=p45 & 1<=p46]] | [1<=p11 & [1<=p51 & 1<=p52]]]] | [[1<=p32 & [1<=p35 & 1<=p38]] | [[1<=p32 & 1<=p35] & [1<=p26 & 1<=p29]]]]] U [[1<=p13 & 1<=p53] & [1<=p54 & [1<=p22 & 1<=p25]]]]]]
normalized: EG [~ [[~ [EG [~ [[[1<=p54 & [1<=p22 & 1<=p25]] & [1<=p13 & 1<=p53]]]]] & ~ [E [~ [[[1<=p54 & [1<=p22 & 1<=p25]] & [1<=p13 & 1<=p53]]] U [~ [[[[[[1<=p26 & 1<=p29] & [1<=p32 & 1<=p35]] | [1<=p32 & [1<=p35 & 1<=p38]]] | [[[1<=p11 & [1<=p51 & 1<=p52]] | [1<=p5 & [1<=p45 & 1<=p46]]] & EX [[1<=p17 & [1<=p57 & 1<=p58]]]]] | [[[1<=p15 & [1<=p55 & 1<=p56]] & [[1<=p28 & 1<=p31] & E [true U [1<=p11 & [1<=p51 & 1<=p52]]]]] | [~ [EG [~ [[1<=p19 & [1<=p59 & 1<=p60]]]]] & ~ [E [~ [[1<=p19 & [1<=p59 & 1<=p60]]] U [~ [[1<=p9 & [1<=p49 & 1<=p50]]] & ~ [[1<=p19 & [1<=p59 & 1<=p60]]]]]]]]]] & ~ [[[1<=p54 & [1<=p22 & 1<=p25]] & [1<=p13 & 1<=p53]]]]]]]]]
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p60)
states: 3,145,728 (6)
abstracting: (1<=p59)
states: 8,650,752 (6)
abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (1<=p50)
states: 1,835,008 (6)
abstracting: (1<=p49)
states: 9,961,472 (6)
abstracting: (1<=p9)
states: 5,505,024 (6)
abstracting: (1<=p60)
states: 3,145,728 (6)
abstracting: (1<=p59)
states: 8,650,752 (6)
abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (1<=p60)
states: 3,145,728 (6)
abstracting: (1<=p59)
states: 8,650,752 (6)
abstracting: (1<=p19)
states: 5,505,024 (6)
....................................................................................
EG iterations: 84
abstracting: (1<=p52)
states: 2,097,152 (6)
abstracting: (1<=p51)
states: 9,699,328 (6)
abstracting: (1<=p11)
states: 5,505,024 (6)
abstracting: (1<=p31)
states: 5,505,024 (6)
abstracting: (1<=p28)
states: 1,835,008 (6)
abstracting: (1<=p56)
states: 2,621,440 (6)
abstracting: (1<=p55)
states: 9,175,040 (6)
abstracting: (1<=p15)
states: 5,505,024 (6)
abstracting: (1<=p58)
states: 2,883,584 (6)
abstracting: (1<=p57)
states: 8,912,896 (6)
abstracting: (1<=p17)
states: 5,505,024 (6)
.abstracting: (1<=p46)
states: 1,310,720 (6)
abstracting: (1<=p45)
states: 10,485,760 (7)
abstracting: (1<=p5)
states: 5,505,024 (6)
abstracting: (1<=p52)
states: 2,097,152 (6)
abstracting: (1<=p51)
states: 9,699,328 (6)
abstracting: (1<=p11)
states: 5,505,024 (6)
abstracting: (1<=p38)
states: 524,288 (5)
abstracting: (1<=p35)
states: 5,505,024 (6)
abstracting: (1<=p32)
states: 1,310,720 (6)
abstracting: (1<=p35)
states: 5,505,024 (6)
abstracting: (1<=p32)
states: 1,310,720 (6)
abstracting: (1<=p29)
states: 5,505,024 (6)
abstracting: (1<=p26)
states: 2,097,152 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
abstracting: (1<=p53)
states: 9,437,184 (6)
abstracting: (1<=p13)
states: 5,505,024 (6)
abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p22)
states: 2,621,440 (6)
abstracting: (1<=p54)
states: 2,359,296 (6)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R020C002-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.364sec
checking: A [[[1<=p0 & 1<=p3] | [[~ [AX [[1<=p35 & [1<=p74 & 1<=p75]]]] & A [[[[1<=p11 & [1<=p51 & 1<=p52]] & [1<=p23 & [1<=p63 & 1<=p64]]] | [1<=p0 & [1<=p3 & 1<=p38]]] U ~ [[[1<=p3 & 1<=p43] & [1<=p44 & [1<=p24 & 1<=p27]]]]]] | [[~ [[AF [EG [[1<=p2 & 1<=p5]]] | ~ [EG [[1<=p28 & 1<=p31]]]]] & [EG [[[1<=p30 & 1<=p33] | [1<=p1 & [1<=p41 & 1<=p42]]]] & 1<=p21]] & [1<=p61 & [1<=p62 & ~ [[[1<=p20 & 1<=p23] | [1<=p16 & 1<=p19]]]]]]]] U [1<=p20 & 1<=p23]]
normalized: [~ [EG [~ [[1<=p20 & 1<=p23]]]] & ~ [E [~ [[1<=p20 & 1<=p23]] U [~ [[[[[1<=p61 & [1<=p62 & ~ [[[1<=p16 & 1<=p19] | [1<=p20 & 1<=p23]]]]] & [[1<=p21 & EG [[[1<=p1 & [1<=p41 & 1<=p42]] | [1<=p30 & 1<=p33]]]] & ~ [[~ [EG [[1<=p28 & 1<=p31]]] | ~ [EG [~ [EG [[1<=p2 & 1<=p5]]]]]]]]] | [[~ [EG [[[1<=p44 & [1<=p24 & 1<=p27]] & [1<=p3 & 1<=p43]]]] & ~ [E [[[1<=p44 & [1<=p24 & 1<=p27]] & [1<=p3 & 1<=p43]] U [~ [[[1<=p0 & [1<=p3 & 1<=p38]] | [[1<=p23 & [1<=p63 & 1<=p64]] & [1<=p11 & [1<=p51 & 1<=p52]]]]] & [[1<=p44 & [1<=p24 & 1<=p27]] & [1<=p3 & 1<=p43]]]]]] & EX [~ [[1<=p35 & [1<=p74 & 1<=p75]]]]]] | [1<=p0 & 1<=p3]]] & ~ [[1<=p20 & 1<=p23]]]]]]
abstracting: (1<=p23)
states: 5,505,024 (6)
abstracting: (1<=p20)
states: 2,883,584 (6)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (1<=p75)
states: 5,242,880 (6)
abstracting: (1<=p74)
states: 6,553,600 (6)
abstracting: (1<=p35)
states: 5,505,024 (6)
.abstracting: (1<=p43)
states: 10,747,904 (7)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p24)
states: 2,359,296 (6)
abstracting: (1<=p44)
states: 1,048,576 (6)
abstracting: (1<=p52)
states: 2,097,152 (6)
abstracting: (1<=p51)
states: 9,699,328 (6)
abstracting: (1<=p11)
states: 5,505,024 (6)
abstracting: (1<=p64)
states: 3,670,016 (6)
abstracting: (1<=p63)
states: 8,126,464 (6)
abstracting: (1<=p23)
states: 5,505,024 (6)
abstracting: (1<=p38)
states: 524,288 (5)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (1<=p43)
states: 10,747,904 (7)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p24)
states: 2,359,296 (6)
abstracting: (1<=p44)
states: 1,048,576 (6)
abstracting: (1<=p43)
states: 10,747,904 (7)
abstracting: (1<=p3)
states: 5,505,024 (6)
abstracting: (1<=p27)
states: 5,505,024 (6)
abstracting: (1<=p24)
states: 2,359,296 (6)
abstracting: (1<=p44)
states: 1,048,576 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 5,505,024 (6)
abstracting: (1<=p2)
states: 5,242,880 (6)
.....................................................................................................................................................................................................................................................................................................................
EG iterations: 309
EG iterations: 0
abstracting: (1<=p31)
states: 5,505,024 (6)
abstracting: (1<=p28)
states: 1,835,008 (6)
...............................................................................................................................
EG iterations: 127
abstracting: (1<=p33)
states: 5,505,024 (6)
abstracting: (1<=p30)
states: 1,572,864 (6)
abstracting: (1<=p42)
states: 786,432 (5)
abstracting: (1<=p41)
states: 11,010,048 (7)
abstracting: (1<=p1)
states: 5,505,024 (6)
.............................................................................................................................................................................
EG iterations: 173
abstracting: (1<=p21)
states: 5,505,024 (6)
abstracting: (1<=p23)
states: 5,505,024 (6)
abstracting: (1<=p20)
states: 2,883,584 (6)
abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
abstracting: (1<=p62)
states: 3,407,872 (6)
abstracting: (1<=p61)
states: 8,388,608 (6)
abstracting: (1<=p23)
states: 5,505,024 (6)
abstracting: (1<=p20)
states: 2,883,584 (6)
abstracting: (1<=p23)
states: 5,505,024 (6)
abstracting: (1<=p20)
states: 2,883,584 (6)
........................................................................................
EG iterations: 88
-> the formula is FALSE
FORMULA ResAllocation-PT-R020C002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.352sec
totally nodes used: 8758675 (8.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3778658 13139935 16918593
used/not used/entry size/cache size: 17728886 49379978 16 1024MB
basic ops cache: hits/miss/sum: 796403 2676718 3473121
used/not used/entry size/cache size: 4655158 12122058 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1953 5883 7836
used/not used/entry size/cache size: 5881 8382727 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 59363504
1 6853404
2 783338
3 97016
4 10543
5 981
6 76
7 2
8 0
9 0
>= 10 0
Total processing time: 0m11.315sec
BK_STOP 1679181790461
--------------------
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:1579 (37), effective:420 (10)
initing FirstDep: 0m 0.000sec
iterations count:447 (10), effective:126 (3)
iterations count:1991 (47), effective:531 (12)
iterations count:779 (18), effective:211 (5)
iterations count:703 (16), effective:191 (4)
iterations count:172 (4), effective:43 (1)
iterations count:636 (15), effective:173 (4)
iterations count:42 (1), effective:0 (0)
iterations count:738 (17), effective:230 (5)
iterations count:177 (4), effective:45 (1)
iterations count:158 (3), effective:35 (0)
iterations count:3330 (79), effective:977 (23)
iterations count:42 (1), effective:0 (0)
iterations count:242 (5), effective:61 (1)
iterations count:2471 (58), effective:724 (17)
iterations count:242 (5), effective:61 (1)
iterations count:2471 (58), effective:724 (17)
iterations count:158 (3), effective:35 (0)
iterations count:242 (5), effective:61 (1)
iterations count:2471 (58), effective:724 (17)
iterations count:42 (1), effective:0 (0)
iterations count:104 (2), effective:21 (0)
iterations count:850 (20), effective:230 (5)
iterations count:53 (1), effective:4 (0)
iterations count:298 (7), effective:85 (2)
iterations count:555 (13), effective:158 (3)
iterations count:264 (6), effective:68 (1)
iterations count:86 (2), effective:16 (0)
iterations count:86 (2), effective:16 (0)
iterations count:387 (9), effective:102 (2)
iterations count:86 (2), effective:16 (0)
iterations count:779 (18), effective:211 (5)
iterations count:5149 (122), effective:1503 (35)
iterations count:173 (4), effective:44 (1)
iterations count:238 (5), effective:65 (1)
iterations count:42 (1), effective:0 (0)
iterations count:45 (1), effective:1 (0)
iterations count:514 (12), effective:140 (3)
iterations count:77 (1), effective:13 (0)
iterations count:2547 (60), effective:788 (18)
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-R020C002"
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-R020C002, 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-167889203700754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 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 '
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 ;