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-167889203700770.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-R100C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700770
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 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 4.0K 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 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 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 422K 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-R100C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679182114085

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:28:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:28:35] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-18 23:28:35] [INFO ] Transformed 400 places.
[2023-03-18 23:28:35] [INFO ] Transformed 202 transitions.
[2023-03-18 23:28:35] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 212 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 27 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2023-03-18 23:28:36] [INFO ] Computed 200 place invariants in 13 ms
[2023-03-18 23:28:36] [INFO ] Implicit Places using invariants in 329 ms returned [201, 207, 209, 213, 215, 217, 225, 229, 231, 239, 241, 245, 249, 251, 253, 255, 259, 261, 267, 269, 271, 281, 283, 289, 293, 305, 313, 317, 319, 323, 325, 329, 333, 337, 343, 345, 347, 349, 355, 359, 361, 365, 369, 371, 375, 377, 379, 381, 391, 393, 399]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 584 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 349/400 places, 202/202 transitions.
Applied a total of 0 rules in 16 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 628 ms. Remains : 349/400 places, 202/202 transitions.
Support contains 212 out of 349 places after structural reductions.
[2023-03-18 23:28:36] [INFO ] Flatten gal took : 50 ms
[2023-03-18 23:28:36] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:28:36] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 87) seen :45
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) 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 42) 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 42) 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 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) 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 42) 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 42) 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 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) 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 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) 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 42) 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 42) 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 42) 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 42) 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 42) seen :0
Running SMT prover for 42 properties.
// Phase 1: matrix 202 rows 349 cols
[2023-03-18 23:28:37] [INFO ] Computed 149 place invariants in 11 ms
[2023-03-18 23:28:38] [INFO ] [Real]Absence check using 149 positive place invariants in 27 ms returned sat
[2023-03-18 23:28:38] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:40
[2023-03-18 23:28:38] [INFO ] After 199ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-18 23:28:38] [INFO ] After 789ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-18 23:28:38] [INFO ] [Nat]Absence check using 149 positive place invariants in 46 ms returned sat
[2023-03-18 23:28:39] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2023-03-18 23:28:39] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 6 ms to minimize.
[2023-03-18 23:28:39] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
[2023-03-18 23:28:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2023-03-18 23:28:40] [INFO ] After 1743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
Attempting to minimize the solution found.
Minimization took 574 ms.
[2023-03-18 23:28:41] [INFO ] After 2905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
Parikh walk visited 39 properties in 546 ms.
Support contains 19 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 347 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 347 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 343 transition count 198
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 13 place count 341 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 341 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 339 transition count 196
Applied a total of 16 rules in 70 ms. Remains 339 /349 variables (removed 10) and now considering 196/202 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 339/349 places, 196/202 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 458017 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458017 steps, saw 122077 distinct states, run finished after 3004 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 196 rows 339 cols
[2023-03-18 23:28:45] [INFO ] Computed 145 place invariants in 2 ms
[2023-03-18 23:28:45] [INFO ] [Real]Absence check using 145 positive place invariants in 19 ms returned sat
[2023-03-18 23:28:45] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:28:45] [INFO ] [Nat]Absence check using 145 positive place invariants in 17 ms returned sat
[2023-03-18 23:28:45] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:28:45] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-18 23:28:45] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 22 ms.
Support contains 10 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 196/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 338 transition count 195
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 338 transition count 194
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 335 transition count 194
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 1 with 2 rules applied. Total rules applied 8 place count 334 transition count 193
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 334 transition count 192
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 331 transition count 192
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 2 with 2 rules applied. Total rules applied 14 place count 330 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 330 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 328 transition count 190
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 19 place count 327 transition count 189
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 327 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 325 transition count 188
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 24 place count 324 transition count 187
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 324 transition count 186
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 28 place count 321 transition count 186
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 30 place count 320 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 320 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 34 place count 317 transition count 184
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 36 place count 316 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 37 place count 316 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 40 place count 313 transition count 182
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 312 transition count 181
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 43 place count 312 transition count 180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 46 place count 309 transition count 180
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 48 place count 308 transition count 179
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 49 place count 308 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 51 place count 306 transition count 178
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 9 with 2 rules applied. Total rules applied 53 place count 305 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 54 place count 305 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 56 place count 303 transition count 176
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 10 with 2 rules applied. Total rules applied 58 place count 302 transition count 175
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 59 place count 302 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 61 place count 300 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 63 place count 299 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 64 place count 299 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 66 place count 297 transition count 172
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 296 transition count 171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 69 place count 296 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 72 place count 293 transition count 170
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 74 place count 292 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 75 place count 292 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 77 place count 290 transition count 168
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 14 with 2 rules applied. Total rules applied 79 place count 289 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 80 place count 289 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 82 place count 287 transition count 166
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 15 with 2 rules applied. Total rules applied 84 place count 286 transition count 165
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 85 place count 286 transition count 164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 88 place count 283 transition count 164
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 282 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 91 place count 282 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 93 place count 280 transition count 162
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 17 with 2 rules applied. Total rules applied 95 place count 279 transition count 161
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 96 place count 279 transition count 160
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 99 place count 276 transition count 160
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 18 with 2 rules applied. Total rules applied 101 place count 275 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 102 place count 275 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 104 place count 273 transition count 158
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 106 place count 272 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 107 place count 272 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 109 place count 270 transition count 156
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 111 place count 269 transition count 155
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 112 place count 269 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 115 place count 266 transition count 154
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 21 with 2 rules applied. Total rules applied 117 place count 265 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 118 place count 265 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 120 place count 263 transition count 152
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 22 with 2 rules applied. Total rules applied 122 place count 262 transition count 151
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 123 place count 262 transition count 150
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 126 place count 259 transition count 150
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 23 with 2 rules applied. Total rules applied 128 place count 258 transition count 149
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 129 place count 258 transition count 148
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 132 place count 255 transition count 148
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 254 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 135 place count 254 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 137 place count 252 transition count 146
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 25 with 2 rules applied. Total rules applied 139 place count 251 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 140 place count 251 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 142 place count 249 transition count 144
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 248 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 145 place count 248 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 147 place count 246 transition count 142
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 27 with 2 rules applied. Total rules applied 149 place count 245 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 150 place count 245 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 152 place count 243 transition count 140
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 154 place count 242 transition count 139
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 155 place count 242 transition count 138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 28 with 3 rules applied. Total rules applied 158 place count 239 transition count 138
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 238 transition count 137
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 161 place count 238 transition count 136
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 164 place count 235 transition count 136
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 30 with 2 rules applied. Total rules applied 166 place count 234 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 167 place count 234 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 169 place count 232 transition count 134
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 31 with 2 rules applied. Total rules applied 171 place count 231 transition count 133
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 172 place count 231 transition count 132
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 31 with 3 rules applied. Total rules applied 175 place count 228 transition count 132
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 32 with 2 rules applied. Total rules applied 177 place count 227 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 178 place count 227 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 180 place count 225 transition count 130
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 182 place count 224 transition count 129
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 183 place count 224 transition count 128
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 33 with 3 rules applied. Total rules applied 186 place count 221 transition count 128
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 34 with 2 rules applied. Total rules applied 188 place count 220 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 189 place count 220 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 191 place count 218 transition count 126
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 35 with 2 rules applied. Total rules applied 193 place count 217 transition count 125
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 194 place count 217 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 35 with 3 rules applied. Total rules applied 197 place count 214 transition count 124
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 36 with 2 rules applied. Total rules applied 199 place count 213 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 200 place count 213 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 202 place count 211 transition count 122
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 37 with 2 rules applied. Total rules applied 204 place count 210 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 205 place count 210 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 207 place count 208 transition count 120
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 38 with 2 rules applied. Total rules applied 209 place count 207 transition count 119
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 210 place count 207 transition count 118
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 38 with 3 rules applied. Total rules applied 213 place count 204 transition count 118
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 39 with 2 rules applied. Total rules applied 215 place count 203 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 216 place count 203 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 218 place count 201 transition count 116
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 40 with 2 rules applied. Total rules applied 220 place count 200 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 221 place count 200 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 223 place count 198 transition count 114
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 41 with 2 rules applied. Total rules applied 225 place count 197 transition count 113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 226 place count 197 transition count 112
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 41 with 3 rules applied. Total rules applied 229 place count 194 transition count 112
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 42 with 2 rules applied. Total rules applied 231 place count 193 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 232 place count 193 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 234 place count 191 transition count 110
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 43 with 2 rules applied. Total rules applied 236 place count 190 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 237 place count 190 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 43 with 3 rules applied. Total rules applied 240 place count 187 transition count 108
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 242 place count 186 transition count 107
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 243 place count 186 transition count 106
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 44 with 3 rules applied. Total rules applied 246 place count 183 transition count 106
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 248 place count 182 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 249 place count 182 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 45 with 3 rules applied. Total rules applied 252 place count 179 transition count 104
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 46 with 2 rules applied. Total rules applied 254 place count 178 transition count 103
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 255 place count 178 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 257 place count 176 transition count 102
Applied a total of 257 rules in 414 ms. Remains 176 /339 variables (removed 163) and now considering 102/196 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 176/339 places, 102/196 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1073685 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :{}
Probabilistic random walk after 1073685 steps, saw 234844 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 176 cols
[2023-03-18 23:28:49] [INFO ] Computed 76 place invariants in 1 ms
[2023-03-18 23:28:49] [INFO ] [Real]Absence check using 76 positive place invariants in 9 ms returned sat
[2023-03-18 23:28:49] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-18 23:28:49] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:28:49] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:28:49] [INFO ] [Nat]Absence check using 76 positive place invariants in 8 ms returned sat
[2023-03-18 23:28:49] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:28:49] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:28:49] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 176/176 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 23:28:49] [INFO ] Invariant cache hit.
[2023-03-18 23:28:49] [INFO ] Implicit Places using invariants in 120 ms returned [105, 110, 112, 114, 117, 121, 123, 125, 129, 132, 138, 142, 144, 151, 153, 155, 159, 161, 164, 167, 169, 171, 173, 175]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 121 ms to find 24 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/176 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 125 ms. Remains : 152/176 places, 102/102 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1083516 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :{}
Probabilistic random walk after 1083516 steps, saw 236981 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 152 cols
[2023-03-18 23:28:53] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-18 23:28:53] [INFO ] [Real]Absence check using 52 positive place invariants in 5 ms returned sat
[2023-03-18 23:28:53] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-18 23:28:53] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 23:28:53] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 10 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 152/152 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-18 23:28:53] [INFO ] Invariant cache hit.
[2023-03-18 23:28:53] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 23:28:53] [INFO ] Invariant cache hit.
[2023-03-18 23:28:53] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-18 23:28:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:28:53] [INFO ] Invariant cache hit.
[2023-03-18 23:28:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 152/152 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 23:28:53] [INFO ] Invariant cache hit.
[2023-03-18 23:28:53] [INFO ] [Real]Absence check using 52 positive place invariants in 5 ms returned sat
[2023-03-18 23:28:53] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-18 23:28:53] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 23:28:53] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 18 ms
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:28:53] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 202/202 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 347 transition count 200
Applied a total of 4 rules in 18 ms. Remains 347 /349 variables (removed 2) and now considering 200/202 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 347/349 places, 200/202 transitions.
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:28:53] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:28:53] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:53] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 25 ms
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:53] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 22 ms
[2023-03-18 23:28:53] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:53] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 26 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 202/202 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 347 transition count 200
Applied a total of 4 rules in 10 ms. Remains 347 /349 variables (removed 2) and now considering 200/202 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 347/349 places, 200/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 24 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 19 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 349/349 places, 202/202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:54] [INFO ] Input system was already deterministic with 202 transitions.
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:28:54] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:54] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2023-03-18 23:28:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 349 places, 202 transitions and 898 arcs took 2 ms.
Total runtime 19236 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 349 NrTr: 202 NrArc: 898)

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

net check time: 0m 0.000sec

init dd package: 0m 2.713sec


RS generation: 0m 1.166sec


-> reachability set: #nodes 955 (9.6e+02) #states 64,650,180,611,639,699,476,331,863,474,176 (31)



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

checking: AX [EG [[p162<=0 | p165<=0]]]
normalized: ~ [EX [~ [EG [[p162<=0 | p165<=0]]]]]

abstracting: (p165<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (p162<=0)
states: 58,311,927,610,498,552,468,848,347,447,296 (31)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 763461

after gc: idd nodes used:844462, unused:63155538; list nodes free:289730605
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 178860

after gc: idd nodes used:777163, unused:63222837; list nodes free:289987323
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 3524
.-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m40.338sec

checking: EG [[p141<=0 | [p307<=0 | p308<=0]]]
normalized: EG [[p141<=0 | [p307<=0 | p308<=0]]]

abstracting: (p308<=0)
states: 41,515,557,157,474,512,899,017,029,976,064 (31)
abstracting: (p307<=0)
states: 22,817,710,804,108,129,226,940,657,696,768 (31)
abstracting: (p141<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
................................
before gc: list nodes free: 1042643

after gc: idd nodes used:421377, unused:63578623; list nodes free:291689719
..........................
before gc: list nodes free: 5109817

after gc: idd nodes used:1700046, unused:62299954; list nodes free:285876407
....
before gc: list nodes free: 5286938

after gc: idd nodes used:1915606, unused:62084394; list nodes free:284996988
MC time: 3m54.334sec

checking: EF [[AF [[1<=p97 & [1<=p272 & 1<=p273]]] & [1<=p102 & 1<=p105]]]
normalized: E [true U [~ [EG [~ [[1<=p97 & [1<=p272 & 1<=p273]]]]] & [1<=p102 & 1<=p105]]]

abstracting: (1<=p105)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p102)
states: 15,845,632,502,852,867,518,708,790,067,200 (31)
abstracting: (1<=p273)
states: 16,162,545,152,909,924,869,082,965,868,544 (31)
abstracting: (1<=p272)
states: 48,804,548,108,786,831,957,623,073,406,976 (31)
abstracting: (1<=p97)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
...................................................
before gc: list nodes free: 5481323

after gc: idd nodes used:818652, unused:63181348; list nodes free:289920857
...............
before gc: list nodes free: 5245399

after gc: idd nodes used:1497477, unused:62502523; list nodes free:286872811
.MC time: 3m38.094sec

checking: AX [AF [~ [E [[[1<=p197 & [1<=p347 & 1<=p348]] | [1<=p102 & 1<=p105]] U [1<=p3 & [1<=p202 & 1<=p203]]]]]]
normalized: ~ [EX [EG [E [[[1<=p102 & 1<=p105] | [1<=p197 & [1<=p347 & 1<=p348]]] U [1<=p3 & [1<=p202 & 1<=p203]]]]]]

abstracting: (1<=p203)
states: 1,267,650,600,228,229,401,496,703,205,376 (30)
abstracting: (1<=p202)
states: 63,699,442,661,468,527,425,209,336,070,144 (31)
abstracting: (1<=p3)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p348)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p347)
states: 32,958,915,605,933,964,438,914,283,339,776 (31)
abstracting: (1<=p197)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p105)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p102)
states: 15,845,632,502,852,867,518,708,790,067,200 (31)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 5373913

after gc: idd nodes used:734733, unused:63265267; list nodes free:290291512
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 6252619

after gc: idd nodes used:1629918, unused:62370082; list nodes free:286208780
.................MC time: 3m23.001sec

checking: AX [[AF [[[[1<=p6 & 1<=p9] & [1<=p2 & 1<=p5]] | EX [AX [[1<=p120 & 1<=p123]]]]] & [[AG [[p86<=0 | p89<=0]] | p183<=0] | [p335<=0 | p336<=0]]]]
normalized: ~ [EX [~ [[[[p183<=0 | ~ [E [true U ~ [[p86<=0 | p89<=0]]]]] | [p335<=0 | p336<=0]] & ~ [EG [~ [[EX [~ [EX [~ [[1<=p120 & 1<=p123]]]]] | [[1<=p2 & 1<=p5] & [1<=p6 & 1<=p9]]]]]]]]]]

abstracting: (1<=p9)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p6)
states: 31,057,439,705,591,620,336,669,228,531,712 (31)
abstracting: (1<=p5)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p2)
states: 31,691,265,005,705,735,037,417,580,134,400 (31)
abstracting: (1<=p123)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p120)
states: 12,993,418,652,339,351,365,341,207,855,104 (31)
................................
before gc: list nodes free: 3197168

after gc: idd nodes used:457407, unused:63542593; list nodes free:291495053
..........................
before gc: list nodes free: 540236

after gc: idd nodes used:1351404, unused:62648596; list nodes free:289489032
....
before gc: list nodes free: 366338

after gc: idd nodes used:1567662, unused:62432338; list nodes free:288464167
MC time: 3m10.053sec

checking: E [[AX [EG [E [[1<=p33 & [1<=p224 & 1<=p225]] U [1<=p44 & 1<=p47]]]] | [[1<=p106 & 1<=p109] & [1<=p160 & 1<=p163]]] U ~ [EF [AG [[~ [[1<=p75 & [1<=p254 & 1<=p255]]] | AX [[1<=p138 & 1<=p141]]]]]]]
normalized: E [[[[1<=p160 & 1<=p163] & [1<=p106 & 1<=p109]] | ~ [EX [~ [EG [E [[1<=p33 & [1<=p224 & 1<=p225]] U [1<=p44 & 1<=p47]]]]]]] U ~ [E [true U ~ [E [true U ~ [[~ [[1<=p75 & [1<=p254 & 1<=p255]]] | ~ [EX [~ [[1<=p138 & 1<=p141]]]]]]]]]]]

abstracting: (1<=p141)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p138)
states: 10,141,204,801,825,835,211,973,625,643,008 (31)
.abstracting: (1<=p255)
states: 12,676,506,002,282,294,014,967,032,053,760 (31)
abstracting: (1<=p254)
states: 52,290,587,259,414,462,811,739,007,221,760 (31)
abstracting: (1<=p75)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p47)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p44)
states: 25,036,099,354,507,530,679,559,888,306,176 (31)
abstracting: (1<=p225)
states: 6,021,340,351,084,089,657,109,340,225,536 (30)
abstracting: (1<=p224)
states: 58,945,752,910,612,667,169,596,699,049,984 (31)
abstracting: (1<=p33)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
......................................................................
before gc: list nodes free: 1892652

after gc: idd nodes used:1675824, unused:62324176; list nodes free:290021817
......
before gc: list nodes free: 1152951

after gc: idd nodes used:1898817, unused:62101183; list nodes free:288996155
.MC time: 2m57.282sec

checking: EF [[E [EX [[[EG [[1<=p3 & [1<=p202 & 1<=p203]]] & [1<=p167 & 1<=p325]] & [1<=p326 & [1<=p80 & 1<=p83]]]] U ~ [AX [[[1<=p10 & 1<=p13] & [1<=p32 & 1<=p35]]]]] & [1<=p66 & 1<=p69]]]
normalized: E [true U [E [EX [[[1<=p326 & [1<=p80 & 1<=p83]] & [[1<=p167 & 1<=p325] & EG [[1<=p3 & [1<=p202 & 1<=p203]]]]]] U EX [~ [[[1<=p32 & 1<=p35] & [1<=p10 & 1<=p13]]]]] & [1<=p66 & 1<=p69]]]

abstracting: (1<=p69)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p66)
states: 21,550,060,203,879,899,825,443,954,491,392 (31)
abstracting: (1<=p13)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p10)
states: 30,423,614,405,477,505,635,920,876,929,024 (31)
abstracting: (1<=p35)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p32)
states: 26,937,575,254,849,874,781,804,943,114,240 (31)
.abstracting: (1<=p203)
states: 1,267,650,600,228,229,401,496,703,205,376 (30)
abstracting: (1<=p202)
states: 63,699,442,661,468,527,425,209,336,070,144 (31)
abstracting: (1<=p3)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 2534178

after gc: idd nodes used:326815, unused:63673185; list nodes free:296323618
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 4757
abstracting: (1<=p325)
states: 37,712,605,356,789,824,694,526,920,359,936 (31)
abstracting: (1<=p167)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p83)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p80)
states: 19,331,671,653,480,498,372,824,723,881,984 (31)
abstracting: (1<=p326)
states: 27,254,487,904,906,932,132,179,118,915,584 (31)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m23.526sec

checking: EX [[AX [[1<=p87 & [1<=p264 & 1<=p265]]] | AG [[A [EF [[1<=p85 & [1<=p262 & 1<=p263]]] U ~ [[1<=p40 & 1<=p43]]] & [[p65<=0 | [p247<=0 | p248<=0]] & [p139<=0 | [p305<=0 | p306<=0]]]]]]]
normalized: EX [[~ [E [true U ~ [[[[p139<=0 | [p305<=0 | p306<=0]] & [p65<=0 | [p247<=0 | p248<=0]]] & [~ [EG [[1<=p40 & 1<=p43]]] & ~ [E [[1<=p40 & 1<=p43] U [~ [E [true U [1<=p85 & [1<=p262 & 1<=p263]]]] & [1<=p40 & 1<=p43]]]]]]]]] | ~ [EX [~ [[1<=p87 & [1<=p264 & 1<=p265]]]]]]]

abstracting: (1<=p265)
states: 14,577,981,902,624,638,117,212,086,861,824 (31)
abstracting: (1<=p264)
states: 50,389,111,359,072,118,709,493,952,413,696 (31)
abstracting: (1<=p87)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
.abstracting: (1<=p43)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p40)
states: 25,669,924,654,621,645,380,308,239,908,864 (31)
abstracting: (1<=p263)
states: 14,261,069,252,567,580,766,837,911,060,480 (31)
abstracting: (1<=p262)
states: 50,706,024,009,129,176,059,868,128,215,040 (31)
abstracting: (1<=p85)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p43)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p40)
states: 25,669,924,654,621,645,380,308,239,908,864 (31)
abstracting: (1<=p43)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p40)
states: 25,669,924,654,621,645,380,308,239,908,864 (31)
......................................
before gc: list nodes free: 7788255

after gc: idd nodes used:619397, unused:63380603; list nodes free:294941354
...................................
before gc: list nodes free: 1520987

after gc: idd nodes used:1856322, unused:62143678; list nodes free:289204340
.
before gc: list nodes free: 1233992

after gc: idd nodes used:1896734, unused:62103266; list nodes free:289015292
MC time: 2m54.587sec

checking: AF [[EF [[1<=p90 & 1<=p93]] & [EX [[A [[1<=p110 & 1<=p113] U [1<=p42 & 1<=p45]] | [[1<=p18 & 1<=p21] & [1<=p138 & 1<=p141]]]] | [EF [[EG [[1<=p192 & 1<=p195]] | [1<=p84 & 1<=p87]]] | AF [AX [EX [[1<=p73 & [1<=p252 & 1<=p253]]]]]]]]]
normalized: ~ [EG [~ [[[EX [[[~ [EG [~ [[1<=p42 & 1<=p45]]]] & ~ [E [~ [[1<=p42 & 1<=p45]] U [~ [[1<=p42 & 1<=p45]] & ~ [[1<=p110 & 1<=p113]]]]]] | [[1<=p138 & 1<=p141] & [1<=p18 & 1<=p21]]]] | [E [true U [EG [[1<=p192 & 1<=p195]] | [1<=p84 & 1<=p87]]] | ~ [EG [EX [~ [EX [[1<=p73 & [1<=p252 & 1<=p253]]]]]]]]] & E [true U [1<=p90 & 1<=p93]]]]]]

abstracting: (1<=p93)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p90)
states: 17,747,108,403,195,211,620,953,844,875,264 (31)
abstracting: (1<=p253)
states: 12,359,593,352,225,236,664,592,856,252,416 (31)
abstracting: (1<=p252)
states: 52,607,499,909,471,520,162,113,183,023,104 (31)
abstracting: (1<=p73)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
....................................................................
before gc: list nodes free: 8873431

after gc: idd nodes used:1107749, unused:62892251; list nodes free:292812752
MC time: 2m39.010sec

checking: ~ [A [[1<=p23 & [1<=p217 & 1<=p218]] U [[[EF [[1<=p86 & 1<=p89]] | [[1<=p85 & [1<=p262 & 1<=p263]] | [1<=p116 & 1<=p119]]] & ~ [AF [[1<=p127 & [1<=p296 & 1<=p297]]]]] | [EF [[[1<=p5 & 1<=p204] & [1<=p205 & [1<=p32 & 1<=p35]]]] | AX [E [[1<=p43 & [1<=p232 & 1<=p233]] U [1<=p47 & [1<=p235 & 1<=p236]]]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [EX [~ [E [[1<=p43 & [1<=p232 & 1<=p233]] U [1<=p47 & [1<=p235 & 1<=p236]]]]]] | E [true U [[1<=p205 & [1<=p32 & 1<=p35]] & [1<=p5 & 1<=p204]]]] | [EG [~ [[1<=p127 & [1<=p296 & 1<=p297]]]] & [[[1<=p116 & 1<=p119] | [1<=p85 & [1<=p262 & 1<=p263]]] | E [true U [1<=p86 & 1<=p89]]]]]]]] & ~ [E [~ [[[~ [EX [~ [E [[1<=p43 & [1<=p232 & 1<=p233]] U [1<=p47 & [1<=p235 & 1<=p236]]]]]] | E [true U [[1<=p205 & [1<=p32 & 1<=p35]] & [1<=p5 & 1<=p204]]]] | [EG [~ [[1<=p127 & [1<=p296 & 1<=p297]]]] & [[[1<=p116 & 1<=p119] | [1<=p85 & [1<=p262 & 1<=p263]]] | E [true U [1<=p86 & 1<=p89]]]]]] U [~ [[1<=p23 & [1<=p217 & 1<=p218]]] & ~ [[[~ [EX [~ [E [[1<=p43 & [1<=p232 & 1<=p233]] U [1<=p47 & [1<=p235 & 1<=p236]]]]]] | E [true U [[1<=p205 & [1<=p32 & 1<=p35]] & [1<=p5 & 1<=p204]]]] | [EG [~ [[1<=p127 & [1<=p296 & 1<=p297]]]] & [[[1<=p116 & 1<=p119] | [1<=p85 & [1<=p262 & 1<=p263]]] | E [true U [1<=p86 & 1<=p89]]]]]]]]]]]

abstracting: (1<=p89)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p86)
states: 18,380,933,703,309,326,321,702,196,477,952 (31)
abstracting: (1<=p263)
states: 14,261,069,252,567,580,766,837,911,060,480 (31)
abstracting: (1<=p262)
states: 50,706,024,009,129,176,059,868,128,215,040 (31)
abstracting: (1<=p85)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p119)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p116)
states: 13,627,243,952,453,466,066,089,559,457,792 (31)
abstracting: (1<=p297)
states: 20,916,234,903,765,785,124,695,602,888,704 (31)
abstracting: (1<=p296)
states: 44,050,858,357,930,971,702,010,436,386,816 (31)
abstracting: (1<=p127)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
............................................
before gc: list nodes free: 9300563

after gc: idd nodes used:785197, unused:63214803; list nodes free:294265293
...........MC time: 2m27.027sec

checking: EF [[EX [[[1<=p73 & 1<=p252] & [1<=p253 & [1<=p100 & 1<=p103]]]] | [[1<=p91 & [1<=p267 & 1<=p268]] | [EG [[p101<=0 | [p276<=0 | p277<=0]]] & [AF [[p16<=0 | p19<=0]] & [EX [[p47<=0 | [p235<=0 | p236<=0]]] | [[1<=p183 & 1<=p335] & [1<=p336 & ~ [A [[1<=p37 & [1<=p228 & 1<=p229]] U [1<=p38 & 1<=p41]]]]]]]]]]]
normalized: E [true U [[[[[[[1<=p336 & ~ [[~ [EG [~ [[1<=p38 & 1<=p41]]]] & ~ [E [~ [[1<=p38 & 1<=p41]] U [~ [[1<=p37 & [1<=p228 & 1<=p229]]] & ~ [[1<=p38 & 1<=p41]]]]]]]] & [1<=p183 & 1<=p335]] | EX [[p47<=0 | [p235<=0 | p236<=0]]]] & ~ [EG [~ [[p16<=0 | p19<=0]]]]] & EG [[p101<=0 | [p276<=0 | p277<=0]]]] | [1<=p91 & [1<=p267 & 1<=p268]]] | EX [[[1<=p253 & [1<=p100 & 1<=p103]] & [1<=p73 & 1<=p252]]]]]

abstracting: (1<=p252)
states: 52,607,499,909,471,520,162,113,183,023,104 (31)
abstracting: (1<=p73)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p103)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p100)
states: 16,162,545,152,909,924,869,082,965,868,544 (31)
abstracting: (1<=p253)
states: 12,359,593,352,225,236,664,592,856,252,416 (31)
.abstracting: (1<=p268)
states: 15,211,807,202,738,752,817,960,438,464,512 (31)
abstracting: (1<=p267)
states: 49,755,286,058,958,004,008,745,600,811,008 (31)
abstracting: (1<=p91)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p277<=0)
states: 47,853,810,158,615,659,906,500,546,002,944 (31)
abstracting: (p276<=0)
states: 16,479,457,802,966,982,219,457,141,669,888 (31)
abstracting: (p101<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
..................................
before gc: list nodes free: 9234360

after gc: idd nodes used:366189, unused:63633811; list nodes free:296142909
...........................MC time: 2m17.007sec

checking: A [[1<=p2 & [1<=p5 & [[1<=p162 & 1<=p165] | [EF [[AG [[1<=p116 & 1<=p119]] & 1<=p200]] & [EF [[1<=p189 & [1<=p341 & 1<=p342]]] | [[1<=p82 & 1<=p85] & [EX [[1<=p57 & [1<=p241 & 1<=p242]]] & [[1<=p4 & 1<=p7] | [1<=p64 & 1<=p67]]]]]]]]] U AG [A [EF [AG [[1<=p95 & [1<=p270 & 1<=p271]]]] U AX [A [[1<=p10 & 1<=p13] U [1<=p153 & [1<=p315 & 1<=p316]]]]]]]
normalized: [~ [EG [E [true U ~ [[~ [EG [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]]]] & ~ [E [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]] U [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p95 & [1<=p270 & 1<=p271]]]]]]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]]]] & ~ [E [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]] U [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p95 & [1<=p270 & 1<=p271]]]]]]]]]]]]] U [E [true U ~ [[~ [EG [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]]]] & ~ [E [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]] U [EX [~ [[~ [EG [~ [[1<=p153 & [1<=p315 & 1<=p316]]]]] & ~ [E [~ [[1<=p153 & [1<=p315 & 1<=p316]]] U [~ [[1<=p10 & 1<=p13]] & ~ [[1<=p153 & [1<=p315 & 1<=p316]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p95 & [1<=p270 & 1<=p271]]]]]]]]]]]]] & ~ [[1<=p2 & [1<=p5 & [[E [true U [1<=p200 & ~ [E [true U ~ [[1<=p116 & 1<=p119]]]]]] & [[[[[1<=p4 & 1<=p7] | [1<=p64 & 1<=p67]] & EX [[1<=p57 & [1<=p241 & 1<=p242]]]] & [1<=p82 & 1<=p85]] | E [true U [1<=p189 & [1<=p341 & 1<=p342]]]]] | [1<=p162 & 1<=p165]]]]]]]]]

abstracting: (1<=p165)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p162)
states: 6,338,253,001,141,147,007,483,516,026,880 (30)
abstracting: (1<=p342)
states: 30,740,527,055,534,562,986,295,052,730,368 (31)
abstracting: (1<=p341)
states: 34,226,566,206,162,193,840,410,986,545,152 (31)
abstracting: (1<=p189)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p85)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p82)
states: 19,014,759,003,423,441,022,450,548,080,640 (31)
abstracting: (1<=p242)
states: 9,824,292,151,768,777,861,599,449,841,664 (30)
abstracting: (1<=p241)
states: 55,142,801,109,927,978,965,106,589,433,856 (31)
abstracting: (1<=p57)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
.abstracting: (1<=p67)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p64)
states: 21,866,972,853,936,957,175,818,130,292,736 (31)
abstracting: (1<=p7)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p4)
states: 31,374,352,355,648,677,687,043,404,333,056 (31)
abstracting: (1<=p119)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p116)
states: 13,627,243,952,453,466,066,089,559,457,792 (31)
abstracting: (1<=p200)
states: 633,825,300,114,114,700,748,351,602,688 (29)
abstracting: (1<=p5)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p2)
states: 31,691,265,005,705,735,037,417,580,134,400 (31)
abstracting: (1<=p271)
states: 15,845,632,502,852,867,518,708,790,067,200 (31)
abstracting: (1<=p270)
states: 49,121,460,758,843,889,307,997,249,208,320 (31)
abstracting: (1<=p95)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p316)
states: 25,036,099,354,507,530,679,559,888,306,176 (31)
abstracting: (1<=p315)
states: 39,930,993,907,189,226,147,146,150,969,344 (31)
abstracting: (1<=p153)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p13)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p10)
states: 30,423,614,405,477,505,635,920,876,929,024 (31)
abstracting: (1<=p316)
states: 25,036,099,354,507,530,679,559,888,306,176 (31)
abstracting: (1<=p315)
states: 39,930,993,907,189,226,147,146,150,969,344 (31)
abstracting: (1<=p153)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p316)
states: 25,036,099,354,507,530,679,559,888,306,176 (31)
abstracting: (1<=p315)
states: 39,930,993,907,189,226,147,146,150,969,344 (31)
abstracting: (1<=p153)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
....................
before gc: list nodes free: 9311146

after gc: idd nodes used:201500, unused:63798500; list nodes free:296882603
...................................MC time: 2m 7.003sec

checking: AF [[[~ [E [[EF [[1<=p11 & [1<=p208 & 1<=p209]]] | AG [[1<=p163 & [1<=p322 & 1<=p323]]]] U [1<=p103 & [1<=p278 & 1<=p279]]]] & 1<=p99] & [1<=p274 & [1<=p275 & AX [[[[1<=p99 & [1<=p274 & 1<=p275]] | A [[1<=p164 & 1<=p167] U [1<=p77 & [1<=p256 & 1<=p257]]]] & [A [[1<=p138 & 1<=p141] U [1<=p63 & [1<=p245 & 1<=p246]]] & [p86<=0 | p89<=0]]]]]]]]
normalized: ~ [EG [~ [[[1<=p274 & [1<=p275 & ~ [EX [~ [[[[1<=p99 & [1<=p274 & 1<=p275]] | [~ [EG [~ [[1<=p77 & [1<=p256 & 1<=p257]]]]] & ~ [E [~ [[1<=p77 & [1<=p256 & 1<=p257]]] U [~ [[1<=p77 & [1<=p256 & 1<=p257]]] & ~ [[1<=p164 & 1<=p167]]]]]]] & [[p86<=0 | p89<=0] & [~ [EG [~ [[1<=p63 & [1<=p245 & 1<=p246]]]]] & ~ [E [~ [[1<=p63 & [1<=p245 & 1<=p246]]] U [~ [[1<=p138 & 1<=p141]] & ~ [[1<=p63 & [1<=p245 & 1<=p246]]]]]]]]]]]]]] & [1<=p99 & ~ [E [[~ [E [true U ~ [[1<=p163 & [1<=p322 & 1<=p323]]]]] | E [true U [1<=p11 & [1<=p208 & 1<=p209]]]] U [1<=p103 & [1<=p278 & 1<=p279]]]]]]]]]

abstracting: (1<=p279)
states: 17,113,283,103,081,096,920,205,493,272,576 (31)
abstracting: (1<=p278)
states: 47,853,810,158,615,659,906,500,546,002,944 (31)
abstracting: (1<=p103)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p209)
states: 2,535,301,200,456,458,802,993,406,410,752 (30)
abstracting: (1<=p208)
states: 62,431,792,061,240,298,023,712,632,864,768 (31)
abstracting: (1<=p11)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p323)
states: 26,620,662,604,792,817,431,430,767,312,896 (31)
abstracting: (1<=p322)
states: 38,346,430,656,903,939,395,275,271,962,624 (31)
abstracting: (1<=p163)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p99)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p246)
states: 10,775,030,101,939,949,912,721,977,245,696 (31)
abstracting: (1<=p245)
states: 54,192,063,159,756,806,913,984,062,029,824 (31)
abstracting: (1<=p63)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p141)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p138)
states: 10,141,204,801,825,835,211,973,625,643,008 (31)
abstracting: (1<=p246)
states: 10,775,030,101,939,949,912,721,977,245,696 (31)
abstracting: (1<=p245)
states: 54,192,063,159,756,806,913,984,062,029,824 (31)
abstracting: (1<=p63)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p246)
states: 10,775,030,101,939,949,912,721,977,245,696 (31)
abstracting: (1<=p245)
states: 54,192,063,159,756,806,913,984,062,029,824 (31)
abstracting: (1<=p63)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
.....................
before gc: list nodes free: 9125753

after gc: idd nodes used:116131, unused:63883869; list nodes free:297268746
....................................................MC time: 1m58.009sec

checking: EX [EG [[[E [[[[1<=p151 & [1<=p313 & 1<=p314]] | [1<=p44 & 1<=p47]] & [[1<=p121 & [1<=p292 & 1<=p293]] | [1<=p182 & 1<=p185]]] U [~ [[1<=p35 & [1<=p226 & 1<=p227]]] & [1<=p8 & 1<=p11]]] | ~ [A [[1<=p135 & [1<=p302 & 1<=p303]] U [1<=p21 & [1<=p215 & 1<=p216]]]]] | [[1<=p85 & [1<=p262 & 1<=p263]] | [[p0<=0 | p3<=0] & [p107<=0 | [p281<=0 | p282<=0]]]]]]]
normalized: EX [EG [[[[[p107<=0 | [p281<=0 | p282<=0]] & [p0<=0 | p3<=0]] | [1<=p85 & [1<=p262 & 1<=p263]]] | [~ [[~ [EG [~ [[1<=p21 & [1<=p215 & 1<=p216]]]]] & ~ [E [~ [[1<=p21 & [1<=p215 & 1<=p216]]] U [~ [[1<=p135 & [1<=p302 & 1<=p303]]] & ~ [[1<=p21 & [1<=p215 & 1<=p216]]]]]]]] | E [[[[1<=p182 & 1<=p185] | [1<=p121 & [1<=p292 & 1<=p293]]] & [[1<=p44 & 1<=p47] | [1<=p151 & [1<=p313 & 1<=p314]]]] U [[1<=p8 & 1<=p11] & ~ [[1<=p35 & [1<=p226 & 1<=p227]]]]]]]]]

abstracting: (1<=p227)
states: 6,338,253,001,141,147,007,483,516,026,880 (30)
abstracting: (1<=p226)
states: 58,628,840,260,555,609,819,222,523,248,640 (31)
abstracting: (1<=p35)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p11)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p8)
states: 30,740,527,055,534,562,986,295,052,730,368 (31)
abstracting: (1<=p314)
states: 24,719,186,704,450,473,329,185,712,504,832 (31)
abstracting: (1<=p313)
states: 40,247,906,557,246,283,497,520,326,770,688 (31)
abstracting: (1<=p151)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p47)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p44)
states: 25,036,099,354,507,530,679,559,888,306,176 (31)
abstracting: (1<=p293)
states: 19,965,496,953,594,613,073,573,075,484,672 (31)
abstracting: (1<=p292)
states: 45,001,596,308,102,143,753,132,963,790,848 (31)
abstracting: (1<=p121)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p185)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p182)
states: 3,169,126,500,570,573,503,741,758,013,440 (30)
abstracting: (1<=p216)
states: 4,119,864,450,741,745,554,864,285,417,472 (30)
abstracting: (1<=p215)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
abstracting: (1<=p21)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p303)
states: 22,183,885,503,994,014,526,192,306,094,080 (31)
abstracting: (1<=p302)
states: 42,783,207,757,702,742,300,513,733,181,440 (31)
abstracting: (1<=p135)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p216)
states: 4,119,864,450,741,745,554,864,285,417,472 (30)
abstracting: (1<=p215)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
abstracting: (1<=p21)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p216)
states: 4,119,864,450,741,745,554,864,285,417,472 (30)
abstracting: (1<=p215)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
abstracting: (1<=p21)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
...............................................................................
before gc: list nodes free: 9177552

after gc: idd nodes used:97753, unused:63902247; list nodes free:297350195
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 6750428

after gc: idd nodes used:562627, unused:63437373; list nodes free:295264078
MC time: 1m50.041sec

checking: [AX [[[[EG [[p38<=0 | p41<=0]] | [EG [[1<=p75 & [1<=p254 & 1<=p255]]] | EF [[1<=p187 & [1<=p339 & 1<=p340]]]]] & [1<=p172 & 1<=p175]] | EF [~ [E [[1<=p42 & 1<=p45] U [1<=p84 & 1<=p87]]]]]] & [~ [A [A [A [[1<=p173 & [1<=p329 & 1<=p330]] U [1<=p122 & 1<=p125]] U [1<=p134 & 1<=p137]] U E [EX [[1<=p189 & [1<=p341 & 1<=p342]]] U ~ [A [[1<=p72 & 1<=p75] U [1<=p27 & [1<=p220 & 1<=p221]]]]]]] | [EF [[EX [EG [[1<=p185 & [1<=p337 & 1<=p338]]]] & [[[[p75<=0 | [p254<=0 | p255<=0]] & [p194<=0 | p197<=0]] | p88<=0] | [p91<=0 | [p126<=0 | p129<=0]]]]] | AF [[1<=p80 & 1<=p83]]]]]
normalized: [[[~ [EG [~ [[1<=p80 & 1<=p83]]]] | E [true U [EX [EG [[1<=p185 & [1<=p337 & 1<=p338]]]] & [[p91<=0 | [p126<=0 | p129<=0]] | [p88<=0 | [[p75<=0 | [p254<=0 | p255<=0]] & [p194<=0 | p197<=0]]]]]]] | ~ [[~ [EG [~ [E [EX [[1<=p189 & [1<=p341 & 1<=p342]]] U ~ [[~ [EG [~ [[1<=p27 & [1<=p220 & 1<=p221]]]]] & ~ [E [~ [[1<=p27 & [1<=p220 & 1<=p221]]] U [~ [[1<=p72 & 1<=p75]] & ~ [[1<=p27 & [1<=p220 & 1<=p221]]]]]]]]]]]] & ~ [E [~ [E [EX [[1<=p189 & [1<=p341 & 1<=p342]]] U ~ [[~ [EG [~ [[1<=p27 & [1<=p220 & 1<=p221]]]]] & ~ [E [~ [[1<=p27 & [1<=p220 & 1<=p221]]] U [~ [[1<=p72 & 1<=p75]] & ~ [[1<=p27 & [1<=p220 & 1<=p221]]]]]]]]]] U [~ [[~ [EG [~ [[1<=p134 & 1<=p137]]]] & ~ [E [~ [[1<=p134 & 1<=p137]] U [~ [[~ [EG [~ [[1<=p122 & 1<=p125]]]] & ~ [E [~ [[1<=p122 & 1<=p125]] U [~ [[1<=p122 & 1<=p125]] & ~ [[1<=p173 & [1<=p329 & 1<=p330]]]]]]]] & ~ [[1<=p134 & 1<=p137]]]]]]] & ~ [E [EX [[1<=p189 & [1<=p341 & 1<=p342]]] U ~ [[~ [EG [~ [[1<=p27 & [1<=p220 & 1<=p221]]]]] & ~ [E [~ [[1<=p27 & [1<=p220 & 1<=p221]]] U [~ [[1<=p72 & 1<=p75]] & ~ [[1<=p27 & [1<=p220 & 1<=p221]]]]]]]]]]]]]]]] & ~ [EX [~ [[E [true U ~ [E [[1<=p42 & 1<=p45] U [1<=p84 & 1<=p87]]]] | [[1<=p172 & 1<=p175] & [[E [true U [1<=p187 & [1<=p339 & 1<=p340]]] | EG [[1<=p75 & [1<=p254 & 1<=p255]]]] | EG [[p38<=0 | p41<=0]]]]]]]]]

abstracting: (p41<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (p38<=0)
states: 38,663,343,306,960,996,745,649,447,763,968 (31)
..................................................................
before gc: list nodes free: 2664423

after gc: idd nodes used:1679431, unused:62320569; list nodes free:290052616
MC time: 1m42.379sec

checking: [E [[[[[[[[~ [[1<=p109 & [1<=p283 & 1<=p284]]] | [1<=p79 & [1<=p258 & 1<=p259]]] & 1<=p73] & [1<=p252 & 1<=p253]] | [AG [[1<=p19 & [1<=p213 & 1<=p214]]] & ~ [[[1<=p160 & 1<=p163] | 1<=p198]]]] & 1<=p303] & [1<=p135 & 1<=p302]] | [1<=p56 & 1<=p59]] U ~ [E [EX [~ [[1<=p195 & [1<=p345 & 1<=p346]]]] U ~ [EF [[1<=p131 & [1<=p299 & 1<=p300]]]]]]] | [EG [[AF [[1<=p180 & 1<=p183]] & EG [[p111<=0 | [p285<=0 | p286<=0]]]]] | A [AF [[[AF [[1<=p157 & [1<=p318 & 1<=p319]]] & 1<=p79] & [1<=p258 & [1<=p259 & AX [[1<=p115 & [1<=p288 & 1<=p289]]]]]]] U EF [EX [E [[1<=p162 & 1<=p165] U [1<=p140 & 1<=p143]]]]]]]
normalized: [[[~ [EG [~ [E [true U EX [E [[1<=p162 & 1<=p165] U [1<=p140 & 1<=p143]]]]]]] & ~ [E [~ [E [true U EX [E [[1<=p162 & 1<=p165] U [1<=p140 & 1<=p143]]]]] U [EG [~ [[[1<=p258 & [1<=p259 & ~ [EX [~ [[1<=p115 & [1<=p288 & 1<=p289]]]]]]] & [1<=p79 & ~ [EG [~ [[1<=p157 & [1<=p318 & 1<=p319]]]]]]]]] & ~ [E [true U EX [E [[1<=p162 & 1<=p165] U [1<=p140 & 1<=p143]]]]]]]]] | EG [[EG [[p111<=0 | [p285<=0 | p286<=0]]] & ~ [EG [~ [[1<=p180 & 1<=p183]]]]]]] | E [[[1<=p56 & 1<=p59] | [[1<=p135 & 1<=p302] & [1<=p303 & [[~ [[1<=p198 | [1<=p160 & 1<=p163]]] & ~ [E [true U ~ [[1<=p19 & [1<=p213 & 1<=p214]]]]]] | [[1<=p252 & 1<=p253] & [1<=p73 & [[1<=p79 & [1<=p258 & 1<=p259]] | ~ [[1<=p109 & [1<=p283 & 1<=p284]]]]]]]]]] U ~ [E [EX [~ [[1<=p195 & [1<=p345 & 1<=p346]]]] U ~ [E [true U [1<=p131 & [1<=p299 & 1<=p300]]]]]]]]

abstracting: (1<=p300)
states: 21,550,060,203,879,899,825,443,954,491,392 (31)
abstracting: (1<=p299)
states: 43,417,033,057,816,857,001,262,084,784,128 (31)
abstracting: (1<=p131)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p346)
states: 31,691,265,005,705,735,037,417,580,134,400 (31)
abstracting: (1<=p345)
states: 33,275,828,255,991,021,789,288,459,141,120 (31)
abstracting: (1<=p195)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
.abstracting: (1<=p284)
states: 18,064,021,053,252,268,971,328,020,676,608 (31)
abstracting: (1<=p283)
states: 46,903,072,208,444,487,855,378,018,598,912 (31)
abstracting: (1<=p109)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p259)
states: 13,310,331,302,396,408,715,715,383,656,448 (31)
abstracting: (1<=p258)
states: 51,656,761,959,300,348,110,990,655,619,072 (31)
abstracting: (1<=p79)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p73)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p253)
states: 12,359,593,352,225,236,664,592,856,252,416 (31)
abstracting: (1<=p252)
states: 52,607,499,909,471,520,162,113,183,023,104 (31)
abstracting: (1<=p214)
states: 3,802,951,800,684,688,204,490,109,616,128 (30)
abstracting: (1<=p213)
states: 61,164,141,461,012,068,622,215,929,659,392 (31)
abstracting: (1<=p19)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p163)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p160)
states: 6,655,165,651,198,204,357,857,691,828,224 (30)
abstracting: (1<=p198)
states: 633,825,300,114,114,700,748,351,602,688 (29)
abstracting: (1<=p303)
states: 22,183,885,503,994,014,526,192,306,094,080 (31)
abstracting: (1<=p302)
states: 42,783,207,757,702,742,300,513,733,181,440 (31)
abstracting: (1<=p135)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p59)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p56)
states: 23,134,623,454,165,186,577,314,833,498,112 (31)
abstracting: (1<=p183)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p180)
states: 3,486,039,150,627,630,854,115,933,814,784 (30)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 3769473

after gc: idd nodes used:386359, unused:63613641; list nodes free:296030851
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6062712 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098236 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:35553 (176), effective:10100 (50)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 233 sec


net_ddint.h:600: Timeout: after 217 sec


iterations count:503 (2), effective:97 (0)

net_ddint.h:600: Timeout: after 202 sec


net_ddint.h:600: Timeout: after 189 sec


iterations count:8149 (40), effective:2116 (10)

iterations count:9561 (47), effective:3038 (15)

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

net_ddint.h:600: Timeout: after 176 sec


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

iterations count:2516 (12), effective:730 (3)

iterations count:6982 (34), effective:1811 (8)

iterations count:4422 (21), effective:1372 (6)

net_ddint.h:600: Timeout: after 170 sec


iterations count:4056 (20), effective:1228 (6)

net_ddint.h:600: Timeout: after 158 sec


iterations count:3768 (18), effective:1135 (5)

net_ddint.h:600: Timeout: after 146 sec


net_ddint.h:600: Timeout: after 136 sec


iterations count:571 (2), effective:121 (0)

iterations count:3390 (16), effective:862 (4)

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

iterations count:424 (2), effective:71 (0)

net_ddint.h:600: Timeout: after 126 sec


iterations count:17924 (88), effective:4660 (23)

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

iterations count:17923 (88), effective:4660 (23)

iterations count:1894 (9), effective:466 (2)

net_ddint.h:600: Timeout: after 117 sec


iterations count:494 (2), effective:81 (0)

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

net_ddint.h:600: Timeout: after 109 sec


net_ddint.h:600: Timeout: after 101 sec


iterations count:2845 (14), effective:730 (3)

iterations count:14609 (72), effective:4739 (23)

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

iterations count:11469 (56), effective:2966 (14)

net_ddint.h:600: Timeout: after 93 sec

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-R100C002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ResAllocation-PT-R100C002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203700770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;