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 |
10146.892 | 3600000.00 | 3635036.00 | 10824.10 | TT?T?T?FFF?TFFFF | 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-167889203700761.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700761
=====================================================================
--------------------
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-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679181845996
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:24:07] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-18 23:24:07] [INFO ] Transformed 200 places.
[2023-03-18 23:24:07] [INFO ] Transformed 102 transitions.
[2023-03-18 23:24:07] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 99 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 14 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:07] [INFO ] Computed 100 place invariants in 13 ms
[2023-03-18 23:24:08] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-18 23:24:08] [INFO ] Invariant cache hit.
[2023-03-18 23:24:08] [INFO ] Implicit Places using invariants and state equation in 168 ms returned [107, 109, 111, 113, 115, 117, 119, 123, 125, 127, 133, 139, 141, 147, 149, 151, 153, 157, 159, 167, 183, 189, 191, 195, 199]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 601 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 175/200 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 620 ms. Remains : 175/200 places, 102/102 transitions.
Support contains 99 out of 175 places after structural reductions.
[2023-03-18 23:24:08] [INFO ] Flatten gal took : 32 ms
[2023-03-18 23:24:08] [INFO ] Flatten gal took : 20 ms
[2023-03-18 23:24:08] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 98 out of 175 places (down from 99) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 74) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 102 rows 175 cols
[2023-03-18 23:24:09] [INFO ] Computed 75 place invariants in 2 ms
[2023-03-18 23:24:09] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-18 23:24:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-18 23:24:09] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :13
[2023-03-18 23:24:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
[2023-03-18 23:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-18 23:24:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-18 23:24:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:24:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-18 23:24:09] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :13
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-18 23:24:09] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :13
Fused 27 Parikh solutions to 13 different solutions.
Parikh walk visited 12 properties in 99 ms.
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 173 transition count 101
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 173 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 170 transition count 99
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 168 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 168 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 166 transition count 97
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 164 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 164 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 162 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 161 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 161 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 159 transition count 93
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 4 with 2 rules applied. Total rules applied 27 place count 158 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 158 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 30 place count 156 transition count 91
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 5 with 2 rules applied. Total rules applied 32 place count 155 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 155 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 35 place count 153 transition count 89
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 6 with 2 rules applied. Total rules applied 37 place count 152 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 152 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 40 place count 150 transition count 87
Applied a total of 40 rules in 78 ms. Remains 150 /175 variables (removed 25) and now considering 87/102 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 150/175 places, 87/102 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1828693 steps, run timeout after 3001 ms. (steps per millisecond=609 ) properties seen :{}
Probabilistic random walk after 1828693 steps, saw 372662 distinct states, run finished after 3002 ms. (steps per millisecond=609 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 150 cols
[2023-03-18 23:24:13] [INFO ] Computed 65 place invariants in 5 ms
[2023-03-18 23:24:13] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:24:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 7 ms returned sat
[2023-03-18 23:24:13] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:24:13] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 23:24:13] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 87/87 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 150/150 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 87/87 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-18 23:24:13] [INFO ] Invariant cache hit.
[2023-03-18 23:24:13] [INFO ] Implicit Places using invariants in 97 ms returned [90, 95, 97, 100, 106, 108, 114, 118, 120, 122, 125, 127, 129, 131, 133, 135, 137, 140, 142, 146, 149]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 98 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/150 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 109 ms. Remains : 129/150 places, 87/87 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1989709 steps, run timeout after 3001 ms. (steps per millisecond=663 ) properties seen :{}
Probabilistic random walk after 1989709 steps, saw 401092 distinct states, run finished after 3001 ms. (steps per millisecond=663 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 129 cols
[2023-03-18 23:24:16] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-18 23:24:16] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:24:16] [INFO ] [Nat]Absence check using 44 positive place invariants in 5 ms returned sat
[2023-03-18 23:24:16] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:24:16] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 23:24:16] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 216 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=108 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R050C002-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:24:16] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:24:16] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:24:16] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 56 out of 175 places (down from 71) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 173 transition count 101
Applied a total of 3 rules in 7 ms. Remains 173 /175 variables (removed 2) and now considering 101/102 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 173/175 places, 101/102 transitions.
[2023-03-18 23:24:16] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:16] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:16] [INFO ] Input system was already deterministic with 101 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1776078 steps, run timeout after 3001 ms. (steps per millisecond=591 ) properties seen :{}
Probabilistic random walk after 1776078 steps, saw 402183 distinct states, run finished after 3001 ms. (steps per millisecond=591 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 173 cols
[2023-03-18 23:24:19] [INFO ] Computed 74 place invariants in 16 ms
[2023-03-18 23:24:19] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:24:19] [INFO ] [Nat]Absence check using 74 positive place invariants in 8 ms returned sat
[2023-03-18 23:24:19] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:24:19] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:24:19] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 101/101 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 173 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 170 transition count 99
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 168 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 168 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 166 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 164 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 164 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 162 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 161 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 161 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 159 transition count 93
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 4 with 2 rules applied. Total rules applied 24 place count 158 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 158 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 156 transition count 91
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 5 with 2 rules applied. Total rules applied 29 place count 155 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 155 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 32 place count 153 transition count 89
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 6 with 2 rules applied. Total rules applied 34 place count 152 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 35 place count 152 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 37 place count 150 transition count 87
Applied a total of 37 rules in 60 ms. Remains 150 /173 variables (removed 23) and now considering 87/101 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 150/173 places, 87/101 transitions.
Incomplete random walk after 1000000 steps, including 2113 resets, run finished after 2430 ms. (steps per millisecond=411 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 434 resets, run finished after 1171 ms. (steps per millisecond=853 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6097928 steps, run timeout after 9001 ms. (steps per millisecond=677 ) properties seen :{}
Probabilistic random walk after 6097928 steps, saw 1116254 distinct states, run finished after 9001 ms. (steps per millisecond=677 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 150 cols
[2023-03-18 23:24:32] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-18 23:24:32] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:24:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 7 ms returned sat
[2023-03-18 23:24:32] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:24:32] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 23:24:32] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 270 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=135 )
FORMULA ResAllocation-PT-R050C002-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:32] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:32] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:24:32] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 172 transition count 100
Applied a total of 5 rules in 16 ms. Remains 172 /175 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 172/175 places, 100/102 transitions.
[2023-03-18 23:24:32] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:32] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:32] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:32] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:32] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:32] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 4 out of 175 places (down from 7) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 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 172 transition count 100
Applied a total of 5 rules in 5 ms. Remains 172 /175 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 172/175 places, 100/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 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 172 transition count 100
Applied a total of 5 rules in 5 ms. Remains 172 /175 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 172/175 places, 100/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 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 172 transition count 100
Applied a total of 5 rules in 5 ms. Remains 172 /175 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 172/175 places, 100/102 transitions.
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:33] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:33] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1823290 steps, run timeout after 3001 ms. (steps per millisecond=607 ) properties seen :{}
Probabilistic random walk after 1823290 steps, saw 403156 distinct states, run finished after 3001 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 172 cols
[2023-03-18 23:24:36] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-18 23:24:36] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-18 23:24:36] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:24:36] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 23:24:36] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 100/100 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 168 transition count 98
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 1 with 5 rules applied. Total rules applied 11 place count 165 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 163 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 161 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 161 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 159 transition count 93
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 22 place count 158 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 158 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 156 transition count 91
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 27 place count 155 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 155 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 30 place count 153 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 32 place count 152 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 152 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 35 place count 150 transition count 87
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 6 with 2 rules applied. Total rules applied 37 place count 149 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 149 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 40 place count 147 transition count 85
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 7 with 2 rules applied. Total rules applied 42 place count 146 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 43 place count 146 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 45 place count 144 transition count 83
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 8 with 2 rules applied. Total rules applied 47 place count 143 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 48 place count 143 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 50 place count 141 transition count 81
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 9 with 2 rules applied. Total rules applied 52 place count 140 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 53 place count 140 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 55 place count 138 transition count 79
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 10 with 3 rules applied. Total rules applied 58 place count 136 transition count 78
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 59 place count 136 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 61 place count 134 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 63 place count 133 transition count 76
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 64 place count 133 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 66 place count 131 transition count 75
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 12 with 2 rules applied. Total rules applied 68 place count 130 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 69 place count 130 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 71 place count 128 transition count 73
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 13 with 2 rules applied. Total rules applied 73 place count 127 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 74 place count 127 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 76 place count 125 transition count 71
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 14 with 3 rules applied. Total rules applied 79 place count 123 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 80 place count 123 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 82 place count 121 transition count 69
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 15 with 3 rules applied. Total rules applied 85 place count 119 transition count 68
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 86 place count 119 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 88 place count 117 transition count 67
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 16 with 2 rules applied. Total rules applied 90 place count 116 transition count 66
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 91 place count 116 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 93 place count 114 transition count 65
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 17 with 3 rules applied. Total rules applied 96 place count 112 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 97 place count 112 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 99 place count 110 transition count 63
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 18 with 3 rules applied. Total rules applied 102 place count 108 transition count 62
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 103 place count 108 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 105 place count 106 transition count 61
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 19 with 2 rules applied. Total rules applied 107 place count 105 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 108 place count 105 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 110 place count 103 transition count 59
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 20 with 2 rules applied. Total rules applied 112 place count 102 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 113 place count 102 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 115 place count 100 transition count 57
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 21 with 3 rules applied. Total rules applied 118 place count 98 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 119 place count 98 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 121 place count 96 transition count 55
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 22 with 3 rules applied. Total rules applied 124 place count 94 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 125 place count 94 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 127 place count 92 transition count 53
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 23 with 2 rules applied. Total rules applied 129 place count 91 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 130 place count 91 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 132 place count 89 transition count 51
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 24 with 2 rules applied. Total rules applied 134 place count 88 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 135 place count 88 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 137 place count 86 transition count 49
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 25 with 2 rules applied. Total rules applied 139 place count 85 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 140 place count 85 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 142 place count 83 transition count 47
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 26 with 2 rules applied. Total rules applied 144 place count 82 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 145 place count 82 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 147 place count 80 transition count 45
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 27 with 3 rules applied. Total rules applied 150 place count 78 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 151 place count 78 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 153 place count 76 transition count 43
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 28 with 2 rules applied. Total rules applied 155 place count 75 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 156 place count 75 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 158 place count 73 transition count 41
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 29 with 2 rules applied. Total rules applied 160 place count 72 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 161 place count 72 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 163 place count 70 transition count 39
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 30 with 3 rules applied. Total rules applied 166 place count 68 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 167 place count 68 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 169 place count 66 transition count 37
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 31 with 3 rules applied. Total rules applied 172 place count 64 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 173 place count 64 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 175 place count 62 transition count 35
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 32 with 3 rules applied. Total rules applied 178 place count 60 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 179 place count 60 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 181 place count 58 transition count 33
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 33 with 2 rules applied. Total rules applied 183 place count 57 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 184 place count 57 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 186 place count 55 transition count 31
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 34 with 3 rules applied. Total rules applied 189 place count 53 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 190 place count 53 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 192 place count 51 transition count 29
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 35 with 3 rules applied. Total rules applied 195 place count 49 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 196 place count 49 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 198 place count 47 transition count 27
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 36 with 3 rules applied. Total rules applied 201 place count 45 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 202 place count 45 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 204 place count 43 transition count 25
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 37 with 3 rules applied. Total rules applied 207 place count 41 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 208 place count 41 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 210 place count 39 transition count 23
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 38 with 3 rules applied. Total rules applied 213 place count 37 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 214 place count 37 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 216 place count 35 transition count 21
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 39 with 3 rules applied. Total rules applied 219 place count 33 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 220 place count 33 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 222 place count 31 transition count 19
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 40 with 3 rules applied. Total rules applied 225 place count 29 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 226 place count 29 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 228 place count 27 transition count 17
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 41 with 2 rules applied. Total rules applied 230 place count 26 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 231 place count 26 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 233 place count 24 transition count 15
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 42 with 3 rules applied. Total rules applied 236 place count 22 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 237 place count 22 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 239 place count 20 transition count 13
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 43 with 3 rules applied. Total rules applied 242 place count 18 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 243 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 43 with 2 rules applied. Total rules applied 245 place count 16 transition count 11
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 44 with 2 rules applied. Total rules applied 247 place count 15 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 248 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 250 place count 13 transition count 9
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 45 with 2 rules applied. Total rules applied 252 place count 12 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 253 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 45 with 2 rules applied. Total rules applied 255 place count 10 transition count 7
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 46 with 3 rules applied. Total rules applied 258 place count 8 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 259 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 261 place count 6 transition count 5
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 47 with 2 rules applied. Total rules applied 263 place count 5 transition count 4
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 47 with 1 rules applied. Total rules applied 264 place count 5 transition count 3
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 268 place count 2 transition count 2
Applied a total of 268 rules in 119 ms. Remains 2 /172 variables (removed 170) and now considering 2/100 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 2/172 places, 2/100 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA ResAllocation-PT-R050C002-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:36] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 175/175 places, 102/102 transitions.
[2023-03-18 23:24:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:36] [INFO ] Input system was already deterministic with 102 transitions.
[2023-03-18 23:24:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:36] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:24:36] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:24:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 102 transitions and 450 arcs took 1 ms.
Total runtime 29283 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 175 NrTr: 102 NrArc: 450)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.693sec
RS generation: 0m 0.143sec
-> reachability set: #nodes 477 (4.8e+02) #states 29,273,397,577,908,224 (16)
starting MCC model checker
--------------------------
checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]
abstracting: (0<=0)
states: 29,273,397,577,908,224 (16)
.-> the formula is FALSE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.604sec
checking: AF [EG [1<=p3]]
normalized: ~ [EG [~ [EG [1<=p3]]]]
abstracting: (1<=p3)
states: 14,355,223,812,243,456 (16)
........................................................................................................................................................................
before gc: list nodes free: 1787128
after gc: idd nodes used:1679732, unused:62320268; list nodes free:292038814
..................................................................
before gc: list nodes free: 325281
after gc: idd nodes used:1906807, unused:62093193; list nodes free:290987526
...........................................................
before gc: list nodes free: 1887024
after gc: idd nodes used:1841996, unused:62158004; list nodes free:293123682
..............................................................................
before gc: list nodes free: 1925107
after gc: idd nodes used:1076439, unused:62923561; list nodes free:296976867
....................................................................................................................................................................................................
before gc: list nodes free: 2750539
after gc: idd nodes used:159562, unused:63840438; list nodes free:301259201
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 2355
EG iterations: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m55.289sec
checking: EX [AF [AX [AG [p58<=0]]]]
normalized: EX [~ [EG [EX [E [true U ~ [p58<=0]]]]]]
abstracting: (p58<=0)
states: 23,080,948,090,273,792 (16)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1225
.-> the formula is FALSE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.995sec
checking: EG [p97<=p33]
normalized: EG [p97<=p33]
abstracting: (p97<=p33)
states: 21,955,048,183,431,168 (16)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 5352387
after gc: idd nodes used:210910, unused:63789090; list nodes free:301036481
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1189
-> the formula is TRUE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m41.101sec
checking: AG [EF [AX [EG [~ [p172<=p165]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [EG [~ [p172<=p165]]]]]]]]]
abstracting: (p172<=p165)
states: 21,532,835,718,365,184 (16)
.......................................................................................................................
before gc: list nodes free: 11394615
after gc: idd nodes used:2082840, unused:61917160; list nodes free:292631065
.........................................
before gc: list nodes free: 12896941
after gc: idd nodes used:2976827, unused:61023173; list nodes free:288479927
..................................
before gc: list nodes free: 12672104
after gc: idd nodes used:2970803, unused:61029197; list nodes free:288638281
...........................................MC time: 6m47.011sec
checking: AX [[EG [[E [p58<=0 U p157<=0] | [~ [1<=p3] & ~ [p170<=0]]]] & AX [1<=0]]]
normalized: ~ [EX [~ [[~ [EX [~ [1<=0]]] & EG [[[~ [p170<=0] & ~ [1<=p3]] | E [p58<=0 U p157<=0]]]]]]]
abstracting: (p157<=0)
states: 11,258,999,068,426,240 (16)
abstracting: (p58<=0)
states: 23,080,948,090,273,792 (16)
abstracting: (1<=p3)
states: 14,355,223,812,243,456 (16)
abstracting: (p170<=0)
states: 13,510,798,882,111,488 (16)
.................
before gc: list nodes free: 12396435
after gc: idd nodes used:86348, unused:63913652; list nodes free:301597042
.............................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 8182428
after gc: idd nodes used:271000, unused:63729000; list nodes free:300745155
................................................................................................................
EG iterations: 542
abstracting: (1<=0)
states: 0
..-> the formula is FALSE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m18.115sec
checking: [EG [1<=p170] & EG [[EX [[~ [p73<=0] | ~ [p132<=p133]]] & [p56<=0 & EG [1<=p138]]]]]
normalized: [EG [[[p56<=0 & EG [1<=p138]] & EX [[~ [p132<=p133] | ~ [p73<=0]]]]] & EG [1<=p170]]
abstracting: (1<=p170)
states: 15,762,598,695,796,736 (16)
..................................................................................................................
before gc: list nodes free: 11792530
after gc: idd nodes used:2495314, unused:61504686; list nodes free:290722675
.............................
before gc: list nodes free: 12795353
after gc: idd nodes used:3467984, unused:60532016; list nodes free:286393322
................
before gc: list nodes free: 12739169
after gc: idd nodes used:3953628, unused:60046372; list nodes free:284197083
.MC time: 6m36.186sec
checking: EX [~ [E [EX [~ [EG [1<=p77]]] U [~ [EF [p155<=p66]] | [[p23<=p116 | EX [1<=p67]] & AG [1<=p97]]]]]]
normalized: EX [~ [E [EX [~ [EG [1<=p77]]] U [[~ [E [true U ~ [1<=p97]]] & [p23<=p116 | EX [1<=p67]]] | ~ [E [true U p155<=p66]]]]]]
abstracting: (p155<=p66)
states: 15,340,386,230,730,752 (16)
abstracting: (1<=p67)
states: 14,355,223,812,243,456 (16)
.abstracting: (p23<=p116)
states: 16,747,761,114,284,032 (16)
abstracting: (1<=p97)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p77)
states: 14,355,223,812,243,456 (16)
................................................................................
before gc: list nodes free: 12246250
after gc: idd nodes used:1691013, unused:62308987; list nodes free:294398756
.....................................
before gc: list nodes free: 13248538
after gc: idd nodes used:3356569, unused:60643431; list nodes free:286921599
.................
before gc: list nodes free: 13315805
after gc: idd nodes used:4170052, unused:59829948; list nodes free:283036634
MC time: 5m46.873sec
checking: E [0<=0 U A [EG [[EG [1<=p162] & ~ [AG [p41<=p140]]]] U EX [A [[1<=p112 & p48<=1] U ~ [p160<=p6]]]]]
normalized: E [0<=0 U [~ [EG [~ [EX [[~ [E [p160<=p6 U [p160<=p6 & ~ [[1<=p112 & p48<=1]]]]] & ~ [EG [p160<=p6]]]]]]] & ~ [E [~ [EX [[~ [E [p160<=p6 U [p160<=p6 & ~ [[1<=p112 & p48<=1]]]]] & ~ [EG [p160<=p6]]]]] U [~ [EG [[E [true U ~ [p41<=p140]] & EG [1<=p162]]]] & ~ [EX [[~ [E [p160<=p6 U [p160<=p6 & ~ [[1<=p112 & p48<=1]]]]] & ~ [EG [p160<=p6]]]]]]]]]]
abstracting: (p160<=p6)
states: 22,799,473,113,563,136 (16)
..........................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 410
abstracting: (p48<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (1<=p112)
states: 3,096,224,743,817,216 (15)
abstracting: (p160<=p6)
states: 22,799,473,113,563,136 (16)
abstracting: (p160<=p6)
states: 22,799,473,113,563,136 (16)
.abstracting: (1<=p162)
states: 12,103,423,998,558,208 (16)
...............
before gc: list nodes free: 7751120
after gc: idd nodes used:55076, unused:63944924; list nodes free:301740569
..................................................................................................
before gc: list nodes free: 12965362
after gc: idd nodes used:2910302, unused:61089698; list nodes free:288916412
......MC time: 4m49.058sec
checking: AX [E [1<=p121 U [[[AX [p101<=p108] & 1<=p69] | [AG [1<=p128] & EX [p146<=0]]] | [AF [p29<=0] | AG [EX [1<=p174]]]]]]
normalized: ~ [EX [~ [E [1<=p121 U [[~ [E [true U ~ [EX [1<=p174]]]] | ~ [EG [~ [p29<=0]]]] | [[EX [p146<=0] & ~ [E [true U ~ [1<=p128]]]] | [1<=p69 & ~ [EX [~ [p101<=p108]]]]]]]]]]
abstracting: (p101<=p108)
states: 2,251,799,813,685,248 (15)
.abstracting: (1<=p69)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p128)
states: 6,192,449,487,634,432 (15)
abstracting: (p146<=0)
states: 9,570,149,208,162,304 (15)
.abstracting: (p29<=0)
states: 14,918,173,765,664,768 (16)
............................................................................................................
before gc: list nodes free: 10853098
after gc: idd nodes used:881720, unused:63118280; list nodes free:297868160
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 6480384
after gc: idd nodes used:50738, unused:63949262; list nodes free:301757462
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1367
abstracting: (1<=p174)
states: 14,355,223,812,243,456 (16)
.abstracting: (1<=p121)
states: 24,488,322,973,827,072 (16)
.-> the formula is TRUE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m11.495sec
checking: AF [[~ [p60<=p85] | [~ [p95<=p172] & [[~ [1<=p66] | ~ [1<=p117]] & [~ [1<=p45] | ~ [p37<=p153]]]]]]
normalized: ~ [EG [~ [[[[[~ [p37<=p153] | ~ [1<=p45]] & [~ [1<=p117] | ~ [1<=p66]]] & ~ [p95<=p172]] | ~ [p60<=p85]]]]]
abstracting: (p60<=p85)
states: 26,177,172,834,091,008 (16)
abstracting: (p95<=p172)
states: 21,814,310,695,075,840 (16)
abstracting: (1<=p66)
states: 5,066,549,580,791,808 (15)
abstracting: (1<=p117)
states: 4,222,124,650,659,840 (15)
abstracting: (1<=p45)
states: 14,355,223,812,243,456 (16)
abstracting: (p37<=p153)
states: 24,066,110,508,761,088 (16)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1153
-> the formula is FALSE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m26.329sec
checking: AF [[[EF [~ [p41<=p67]] & AX [p162<=p74]] & [AG [~ [1<=p27]] & [1<=p153 & E [~ [[AX [p104<=p98] & [~ [p28<=p145] & [1<=p18 | [p81<=0 & p96<=p49]]]]] U A [p154<=0 U 1<=p1]]]]]]
normalized: ~ [EG [~ [[[[1<=p153 & E [~ [[[[1<=p18 | [p81<=0 & p96<=p49]] & ~ [p28<=p145]] & ~ [EX [~ [p104<=p98]]]]] U [~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [p154<=0] & ~ [1<=p1]]]]]]] & ~ [E [true U 1<=p27]]] & [~ [EX [~ [p162<=p74]]] & E [true U ~ [p41<=p67]]]]]]]
abstracting: (p41<=p67)
states: 21,955,048,183,431,168 (16)
abstracting: (p162<=p74)
states: 17,873,661,021,126,656 (16)
.abstracting: (1<=p27)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p1)
states: 14,355,223,812,243,456 (16)
abstracting: (p154<=0)
states: 18,295,873,486,192,640 (16)
abstracting: (1<=p1)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=p1)
states: 14,355,223,812,243,456 (16)
...................................................................................................................
before gc: list nodes free: 5381222
after gc: idd nodes used:1210783, unused:62789217; list nodes free:296360213
............................................................................
before gc: list nodes free: 2481773
after gc: idd nodes used:1959525, unused:62040475; list nodes free:292769576
...................................................
before gc: list nodes free: 2022443
after gc: idd nodes used:1071515, unused:62928485; list nodes free:296986916
..............................................
before gc: list nodes free: 1687120
after gc: idd nodes used:2110074, unused:61889926; list nodes free:291816022
MC time: 5m15.158sec
checking: AG [EF [AX [EG [~ [p172<=p165]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [EG [~ [p172<=p165]]]]]]]]]
abstracting: (p172<=p165)
states: 21,532,835,718,365,184 (16)
.................................................................................................................................
before gc: list nodes free: 11706512
after gc: idd nodes used:2358975, unused:61641025; list nodes free:291389814
......................................
before gc: list nodes free: 12878959
after gc: idd nodes used:2966951, unused:61033049; list nodes free:288656107
..................................
before gc: list nodes free: 12692651
after gc: idd nodes used:2930120, unused:61069880; list nodes free:288791277
...........................................................
before gc: list nodes free: 12255396
after gc: idd nodes used:1466194, unused:62533806; list nodes free:295395227
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 2030
.-> the formula is TRUE
FORMULA ResAllocation-PT-R050C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5998124 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097628 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:9034 (88), effective:2550 (25)
initing FirstDep: 0m 0.000sec
iterations count:80700 (791), effective:22003 (215)
iterations count:1643 (16), effective:495 (4)
net_ddint.h:600: Timeout: after 406 sec
iterations count:406 (3), effective:90 (0)
ctl_mc.icc:221: Timeout: after 394 sec
iterations count:588 (5), effective:138 (1)
iterations count:108 (1), effective:3 (0)
net_ddint.h:600: Timeout: after 338 sec
iterations count:132 (1), effective:10 (0)
ctl_mc.icc:221: Timeout: after 288 sec
iterations count:167 (1), effective:21 (0)
iterations count:8681 (85), effective:2450 (24)
iterations count:102 (1), effective:0 (0)
iterations count:939 (9), effective:237 (2)
iterations count:283 (2), effective:51 (0)
iterations count:456 (4), effective:104 (1)
net_ddint.h:600: Timeout: after 314 sec
iterations count:8947 (87), effective:2589 (25)
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="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ResAllocation-PT-R050C002, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203700761"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;