Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348700441.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 HirschbergSinclair-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 173K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678786782781

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:39:45] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-14 09:39:45] [INFO ] Transformed 330 places.
[2023-03-14 09:39:45] [INFO ] Transformed 296 transitions.
[2023-03-14 09:39:45] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 110 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 320 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 314 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 314 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 309 transition count 285
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 309 transition count 285
Applied a total of 32 rules in 101 ms. Remains 309 /330 variables (removed 21) and now considering 285/296 (removed 11) transitions.
// Phase 1: matrix 285 rows 309 cols
[2023-03-14 09:39:45] [INFO ] Computed 24 place invariants in 27 ms
[2023-03-14 09:39:46] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-14 09:39:46] [INFO ] Invariant cache hit.
[2023-03-14 09:39:47] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2023-03-14 09:39:47] [INFO ] Invariant cache hit.
[2023-03-14 09:39:47] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/330 places, 285/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1885 ms. Remains : 309/330 places, 285/296 transitions.
Support contains 110 out of 309 places after structural reductions.
[2023-03-14 09:39:47] [INFO ] Flatten gal took : 83 ms
[2023-03-14 09:39:47] [INFO ] Flatten gal took : 33 ms
[2023-03-14 09:39:47] [INFO ] Input system was already deterministic with 285 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 920 ms. (steps per millisecond=10 ) properties (out of 91) seen :72
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-14 09:39:49] [INFO ] Invariant cache hit.
[2023-03-14 09:39:49] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-14 09:39:49] [INFO ] [Real]Absence check using 20 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 09:39:49] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:14
[2023-03-14 09:39:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-14 09:39:49] [INFO ] [Nat]Absence check using 20 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 09:39:50] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :4
[2023-03-14 09:39:50] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 9 ms to minimize.
[2023-03-14 09:39:50] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2023-03-14 09:39:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2023-03-14 09:39:50] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2023-03-14 09:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-14 09:39:50] [INFO ] After 1154ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :4
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-14 09:39:51] [INFO ] After 1604ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :4
Fused 19 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 61 ms.
Support contains 14 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 285/285 transitions.
Graph (complete) has 600 edges and 309 vertex of which 293 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 293 transition count 170
Reduce places removed 103 places and 0 transitions.
Graph (complete) has 322 edges and 190 vertex of which 166 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 106 rules applied. Total rules applied 222 place count 166 transition count 168
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 248 place count 164 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 162 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 162 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 254 place count 160 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 160 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 258 place count 159 transition count 139
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 159 transition count 134
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 268 place count 154 transition count 134
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 280 place count 142 transition count 122
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 9 rules applied. Total rules applied 289 place count 137 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 293 place count 133 transition count 118
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 293 place count 133 transition count 94
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 341 place count 109 transition count 94
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 6 with 4 rules applied. Total rules applied 345 place count 107 transition count 92
Applied a total of 345 rules in 68 ms. Remains 107 /309 variables (removed 202) and now considering 92/285 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 107/309 places, 92/285 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Finished Best-First random walk after 297 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=297 )
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 24 ms
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 26 ms
[2023-03-14 09:39:51] [INFO ] Input system was already deterministic with 285 transitions.
Computed a total of 309 stabilizing places and 285 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 309 transition count 285
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 285 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 285 transition count 266
Applied a total of 43 rules in 28 ms. Remains 285 /309 variables (removed 24) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 285/309 places, 266/285 transitions.
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 19 ms
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 21 ms
[2023-03-14 09:39:51] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 297 transition count 278
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 297 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 291 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 291 transition count 272
Applied a total of 31 rules in 27 ms. Remains 291 /309 variables (removed 18) and now considering 272/285 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 291/309 places, 272/285 transitions.
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 17 ms
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 19 ms
[2023-03-14 09:39:51] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 306 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 297 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 297 transition count 276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 289 transition count 268
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 289 transition count 268
Applied a total of 37 rules in 26 ms. Remains 289 /309 variables (removed 20) and now considering 268/285 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 289/309 places, 268/285 transitions.
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 17 ms
[2023-03-14 09:39:51] [INFO ] Flatten gal took : 19 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 14 place count 295 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 295 transition count 276
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 286 transition count 267
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 286 transition count 267
Applied a total of 41 rules in 27 ms. Remains 286 /309 variables (removed 23) and now considering 267/285 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 286/309 places, 267/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 16 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 17 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 285 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 285 transition count 266
Applied a total of 43 rules in 28 ms. Remains 285 /309 variables (removed 24) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 285/309 places, 266/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 285 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 285 transition count 266
Applied a total of 43 rules in 30 ms. Remains 285 /309 variables (removed 24) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 285/309 places, 266/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 16 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 306 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 297 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 297 transition count 276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 289 transition count 268
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 289 transition count 268
Applied a total of 37 rules in 26 ms. Remains 289 /309 variables (removed 20) and now considering 268/285 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 289/309 places, 268/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 285 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 285 transition count 266
Applied a total of 43 rules in 23 ms. Remains 285 /309 variables (removed 24) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 285/309 places, 266/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 14 place count 295 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 295 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 288 transition count 269
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 288 transition count 269
Applied a total of 37 rules in 20 ms. Remains 288 /309 variables (removed 21) and now considering 269/285 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 288/309 places, 269/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 14 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 297 transition count 278
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 297 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 292 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 292 transition count 273
Applied a total of 29 rules in 22 ms. Remains 292 /309 variables (removed 17) and now considering 273/285 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 292/309 places, 273/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 14 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 306 transition count 285
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 299 transition count 278
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 299 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 293 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 293 transition count 272
Applied a total of 29 rules in 20 ms. Remains 293 /309 variables (removed 16) and now considering 272/285 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 293/309 places, 272/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 19 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 286 transition count 267
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 286 transition count 267
Applied a total of 41 rules in 19 ms. Remains 286 /309 variables (removed 23) and now considering 267/285 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 286/309 places, 267/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 14 place count 295 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 295 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 288 transition count 269
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 288 transition count 269
Applied a total of 37 rules in 18 ms. Remains 288 /309 variables (removed 21) and now considering 269/285 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 288/309 places, 269/285 transitions.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 16 ms
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:52] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 285 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 285 transition count 266
Applied a total of 43 rules in 25 ms. Remains 285 /309 variables (removed 24) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 285/309 places, 266/285 transitions.
[2023-03-14 09:39:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 14 ms
FORMULA HirschbergSinclair-PT-15-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 09:39:52] [INFO ] Flatten gal took : 14 ms
[2023-03-14 09:39:53] [INFO ] Input system was already deterministic with 266 transitions.
Support contains 0 out of 285 places (down from 1) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 14 place count 295 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 295 transition count 276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 287 transition count 268
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 287 transition count 268
Applied a total of 39 rules in 18 ms. Remains 287 /309 variables (removed 22) and now considering 268/285 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 287/309 places, 268/285 transitions.
[2023-03-14 09:39:53] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:39:53] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:53] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 285/285 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 294 transition count 275
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 285 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 285 transition count 266
Applied a total of 43 rules in 18 ms. Remains 285 /309 variables (removed 24) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 285/309 places, 266/285 transitions.
[2023-03-14 09:39:53] [INFO ] Flatten gal took : 17 ms
[2023-03-14 09:39:53] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:53] [INFO ] Input system was already deterministic with 266 transitions.
[2023-03-14 09:39:53] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:53] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:39:53] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-14 09:39:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 285 transitions and 868 arcs took 3 ms.
Total runtime 7922 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 309 NrTr: 285 NrArc: 868)

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

net check time: 0m 0.000sec

init dd package: 0m 3.516sec


RS generation: 0m12.256sec


-> reachability set: #nodes 151256 (1.5e+05) #states 673,523,600,846,189,097 (17)



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

checking: AG [AX [EX [0<=0]]]
normalized: ~ [E [true U EX [~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 673,523,600,846,189,097 (17)
..-> the formula is FALSE

FORMULA HirschbergSinclair-PT-15-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.493sec

checking: AF [[EX [AF [1<=p138]] & p232<=0]]
normalized: ~ [EG [~ [[EX [~ [EG [~ [1<=p138]]]] & p232<=0]]]]

abstracting: (p232<=0)
states: 662,497,532,097,705,281 (17)
abstracting: (1<=p138)
states: 2,974,081,949,719,968 (15)
..............................................
before gc: list nodes free: 831273

after gc: idd nodes used:1778443, unused:62221557; list nodes free:275494009
...........
before gc: list nodes free: 4597330

after gc: idd nodes used:2772829, unused:61227171; list nodes free:271140208
.MC time: 4m15.195sec

checking: [EX [EG [EF [1<=p203]]] | [AG [EF [EX [~ [p188<=p112]]]] | AX [~ [p248<=0]]]]
normalized: [[~ [EX [p248<=0]] | ~ [E [true U ~ [E [true U EX [~ [p188<=p112]]]]]]] | EX [EG [E [true U 1<=p203]]]]

abstracting: (1<=p203)
states: 8,826,274,091,104,382 (15)
...........................................
before gc: list nodes free: 5173953

after gc: idd nodes used:1126317, unused:62873683; list nodes free:278349197
........................MC time: 3m57.004sec

checking: E [EX [EX [A [EG [p187<=0] U [1<=p43 | 1<=p123]]]] U AX [EX [AF [[1<=p293 | 1<=p299]]]]]
normalized: E [EX [EX [[~ [EG [~ [[1<=p43 | 1<=p123]]]] & ~ [E [~ [[1<=p43 | 1<=p123]] U [~ [EG [p187<=0]] & ~ [[1<=p43 | 1<=p123]]]]]]]] U ~ [EX [~ [EX [~ [EG [~ [[1<=p293 | 1<=p299]]]]]]]]]

abstracting: (1<=p299)
states: 588,289,749,498,000 (14)
abstracting: (1<=p293)
states: 10,931,650,714,121,626 (16)

before gc: list nodes free: 7824959

after gc: idd nodes used:354589, unused:63645411; list nodes free:281624660
..............................
before gc: list nodes free: 3611696

after gc: idd nodes used:2607784, unused:61392216; list nodes free:271679942
.MC time: 3m40.271sec

checking: EG [AF [[EX [AX [1<=p192]] | [p199<=p31 | E [EG [1<=p43] U EX [1<=p85]]]]]]
normalized: EG [~ [EG [~ [[[p199<=p31 | E [EG [1<=p43] U EX [1<=p85]]] | EX [~ [EX [~ [1<=p192]]]]]]]]]

abstracting: (1<=p192)
states: 6,020,447,240,762,600 (15)
..abstracting: (1<=p85)
states: 165,276,592,066,521,872 (17)
.abstracting: (1<=p43)
states: 89,877,395,587,608,871 (16)
..............
before gc: list nodes free: 6078460

after gc: idd nodes used:1048251, unused:62951749; list nodes free:278648245
..........MC time: 3m24.059sec

checking: [AF [[[~ [E [1<=p183 U p215<=0]] | 1<=p42] & AF [EX [0<=0]]]] & [AG [~ [1<=p176]] | EX [AG [EF [~ [p243<=p11]]]]]]
normalized: [[EX [~ [E [true U ~ [E [true U ~ [p243<=p11]]]]]] | ~ [E [true U 1<=p176]]] & ~ [EG [~ [[~ [EG [~ [EX [0<=0]]]] & [1<=p42 | ~ [E [1<=p183 U p215<=0]]]]]]]]

abstracting: (p215<=0)
states: 668,250,251,473,056,897 (17)
abstracting: (1<=p183)
states: 11,246,578,827,292,436 (16)
abstracting: (1<=p42)
states: 166,259,829,019,605,997 (17)
abstracting: (0<=0)
states: 673,523,600,846,189,097 (17)
..
EG iterations: 1

before gc: list nodes free: 5424393

after gc: idd nodes used:516187, unused:63483813; list nodes free:280958012
........................................
before gc: list nodes free: 1478012

after gc: idd nodes used:2054421, unused:61945579; list nodes free:276493325
MC time: 3m 9.166sec

checking: AX [AG [~ [A [AF [p69<=p243] U [E [p308<=p39 U 1<=p254] & AF [1<=p73]]]]]]
normalized: ~ [EX [E [true U [~ [EG [~ [[~ [EG [~ [1<=p73]]] & E [p308<=p39 U 1<=p254]]]]] & ~ [E [~ [[~ [EG [~ [1<=p73]]] & E [p308<=p39 U 1<=p254]]] U [EG [~ [p69<=p243]] & ~ [[~ [EG [~ [1<=p73]]] & E [p308<=p39 U 1<=p254]]]]]]]]]]

abstracting: (1<=p254)
states: 4,976,798,474,002,276 (15)
abstracting: (p308<=p39)
states: 673,522,605,673,709,097 (17)
abstracting: (1<=p73)
states: 258,430,103,360,003,263 (17)
.......................................................
before gc: list nodes free: 6064463

after gc: idd nodes used:2296786, unused:61703214; list nodes free:275192783
.MC time: 2m56.212sec

checking: E [~ [[EG [AX [[1<=p199 & p217<=0]]] & [AF [1<=p275] | EX [EG [p155<=0]]]]] U EG [E [~ [EF [p247<=p284]] U ~ [1<=p278]]]]
normalized: E [~ [[[EX [EG [p155<=0]] | ~ [EG [~ [1<=p275]]]] & EG [~ [EX [~ [[1<=p199 & p217<=0]]]]]]] U EG [E [~ [E [true U p247<=p284]] U ~ [1<=p278]]]]

abstracting: (1<=p278)
states: 5,206,425,665,890,420 (15)
abstracting: (p247<=p284)
states: 662,793,582,605,149,271 (17)
.
EG iterations: 1
abstracting: (p217<=0)
states: 668,385,342,945,250,281 (17)
abstracting: (1<=p199)
states: 11,213,024,074,715,576 (16)
................................................................................................
EG iterations: 95
abstracting: (1<=p275)
states: 10,931,650,714,121,626 (16)
..........
before gc: list nodes free: 9975329

after gc: idd nodes used:1126052, unused:62873948; list nodes free:280340807
.......MC time: 2m43.008sec

checking: [AF [[EX [EF [~ [p66<=p67]]] | ~ [p68<=p251]]] & EF [[EF [[p64<=0 & p45<=1]] & [1<=p92 & p305<=1]]]]
normalized: [E [true U [[1<=p92 & p305<=1] & E [true U [p64<=0 & p45<=1]]]] & ~ [EG [~ [[~ [p68<=p251] | EX [E [true U ~ [p66<=p67]]]]]]]]

abstracting: (p66<=p67)
states: 620,456,030,063,849,909 (17)
.abstracting: (p68<=p251)
states: 520,028,893,166,501,715 (17)
.
EG iterations: 1
abstracting: (p45<=1)
states: 673,523,600,846,189,097 (17)
abstracting: (p64<=0)
states: 575,321,197,889,049,496 (17)
abstracting: (p305<=1)
states: 673,523,600,846,189,097 (17)
abstracting: (1<=p92)
states: 163,511,296,456,073,802 (17)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-15-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.789sec

checking: [E [1<=p107 U EF [EG [[EX [1<=p31] & [p17<=0 & 1<=p138]]]]] | ~ [E [~ [EG [~ [p15<=0]]] U [AX [~ [p216<=p251]] | AG [A [p102<=0 U 1<=p132]]]]]]
normalized: [~ [E [~ [EG [~ [p15<=0]]] U [~ [E [true U ~ [[~ [EG [~ [1<=p132]]] & ~ [E [~ [1<=p132] U [~ [p102<=0] & ~ [1<=p132]]]]]]]] | ~ [EX [p216<=p251]]]]] | E [1<=p107 U E [true U EG [[[p17<=0 & 1<=p138] & EX [1<=p31]]]]]]

abstracting: (1<=p31)
states: 22,916,620,907,280,346 (16)
.abstracting: (1<=p138)
states: 2,974,081,949,719,968 (15)
abstracting: (p17<=0)
states: 358,640,903,528,895,566 (17)
.
EG iterations: 1
abstracting: (1<=p107)
states: 2,281,561,754,639,491 (15)
abstracting: (p216<=p251)
states: 662,463,984,057,678,661 (17)
.abstracting: (1<=p132)
states: 3,492,295,476,755,156 (15)
abstracting: (p102<=0)
states: 506,510,783,565,388,549 (17)
abstracting: (1<=p132)
states: 3,492,295,476,755,156 (15)
abstracting: (1<=p132)
states: 3,492,295,476,755,156 (15)
......................
before gc: list nodes free: 4311326

after gc: idd nodes used:1545544, unused:62454456; list nodes free:278660141
.............MC time: 2m37.004sec

checking: A [[p83<=0 | A [EX [~ [p28<=0]] U p209<=0]] U AX [A [E [EG [1<=p166] U [1<=p256 | 1<=p15]] U [p70<=p181 & EG [1<=p119]]]]]
normalized: [~ [EG [EX [~ [[~ [EG [~ [[p70<=p181 & EG [1<=p119]]]]] & ~ [E [~ [[p70<=p181 & EG [1<=p119]]] U [~ [E [EG [1<=p166] U [1<=p256 | 1<=p15]]] & ~ [[p70<=p181 & EG [1<=p119]]]]]]]]]]] & ~ [E [EX [~ [[~ [EG [~ [[p70<=p181 & EG [1<=p119]]]]] & ~ [E [~ [[p70<=p181 & EG [1<=p119]]] U [~ [E [EG [1<=p166] U [1<=p256 | 1<=p15]]] & ~ [[p70<=p181 & EG [1<=p119]]]]]]]]] U [~ [[p83<=0 | [~ [EG [~ [p209<=0]]] & ~ [E [~ [p209<=0] U [~ [EX [~ [p28<=0]]] & ~ [p209<=0]]]]]]] & EX [~ [[~ [EG [~ [[p70<=p181 & EG [1<=p119]]]]] & ~ [E [~ [[p70<=p181 & EG [1<=p119]]] U [~ [E [EG [1<=p166] U [1<=p256 | 1<=p15]]] & ~ [[p70<=p181 & EG [1<=p119]]]]]]]]]]]]]

abstracting: (1<=p119)
states: 3,675,345,388,813,382 (15)
........................................
before gc: list nodes free: 6070834

after gc: idd nodes used:1751215, unused:62248785; list nodes free:277790387
...........................MC time: 2m25.008sec

checking: A [EX [A [1<=p95 U [AF [p256<=p99] | [p227<=p209 | [p127<=p50 & p78<=p66]]]]] U 1<=p265]
normalized: [~ [EG [~ [1<=p265]]] & ~ [E [~ [1<=p265] U [~ [EX [[~ [EG [~ [[[p227<=p209 | [p127<=p50 & p78<=p66]] | ~ [EG [~ [p256<=p99]]]]]]] & ~ [E [~ [[[p227<=p209 | [p127<=p50 & p78<=p66]] | ~ [EG [~ [p256<=p99]]]]] U [~ [1<=p95] & ~ [[[p227<=p209 | [p127<=p50 & p78<=p66]] | ~ [EG [~ [p256<=p99]]]]]]]]]]] & ~ [1<=p265]]]]]

abstracting: (1<=p265)
states: 10,931,650,714,121,626 (16)
abstracting: (p256<=p99)
states: 668,557,909,506,713,907 (17)
...........................................................................
before gc: list nodes free: 16773862

after gc: idd nodes used:1442672, unused:62557328; list nodes free:279095277
MC time: 2m14.011sec

checking: E [AX [AF [p83<=0]] U [~ [AG [AF [1<=p274]]] | ~ [[[1<=p139 & EF [1<=p196]] | E [p39<=0 U [EF [p142<=p176] & E [p127<=0 U p21<=p209]]]]]]]
normalized: E [~ [EX [EG [~ [p83<=0]]]] U [~ [[E [p39<=0 U [E [p127<=0 U p21<=p209] & E [true U p142<=p176]]] | [1<=p139 & E [true U 1<=p196]]]] | E [true U EG [~ [1<=p274]]]]]

abstracting: (1<=p274)
states: 4,976,798,474,002,276 (15)
.
EG iterations: 1
abstracting: (1<=p196)
states: 5,201,714,126,510,144 (15)
abstracting: (1<=p139)
states: 6,382,726,974,653,724 (15)
abstracting: (p142<=p176)
states: 670,140,037,753,693,059 (17)
abstracting: (p21<=p209)
states: 331,278,442,285,875,862 (17)
abstracting: (p127<=0)
states: 670,772,432,718,808,241 (17)
abstracting: (p39<=0)
states: 592,667,933,267,319,727 (17)
abstracting: (p83<=0)
states: 508,247,008,779,667,225 (17)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA HirschbergSinclair-PT-15-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m35.323sec

checking: EF [[~ [p308<=0] | [AX [AG [[1<=p22 & p254<=1]]] & [A [E [1<=p116 U 1<=p156] U ~ [[1<=p214 | p80<=p225]]] | [AX [p186<=p137] | E [p19<=0 U p210<=0]]]]]]
normalized: E [true U [[[[E [p19<=0 U p210<=0] | ~ [EX [~ [p186<=p137]]]] | [~ [EG [[1<=p214 | p80<=p225]]] & ~ [E [[1<=p214 | p80<=p225] U [~ [E [1<=p116 U 1<=p156]] & [1<=p214 | p80<=p225]]]]]] & ~ [EX [E [true U ~ [[1<=p22 & p254<=1]]]]]] | ~ [p308<=0]]]

abstracting: (p308<=0)
states: 673,522,605,673,709,097 (17)
abstracting: (p254<=1)
states: 673,523,600,846,189,097 (17)
abstracting: (1<=p22)
states: 502,964,759,165,722 (14)
.abstracting: (p80<=p225)
states: 524,833,842,886,884,591 (17)
abstracting: (1<=p214)
states: 11,097,484,406,583,556 (16)
abstracting: (1<=p156)
states: 6,250,050,443,817,372 (15)
abstracting: (1<=p116)
states: 2,074,481,248,220,808 (15)
abstracting: (p80<=p225)
states: 524,833,842,886,884,591 (17)
abstracting: (1<=p214)
states: 11,097,484,406,583,556 (16)
abstracting: (p80<=p225)
states: 524,833,842,886,884,591 (17)
abstracting: (1<=p214)
states: 11,097,484,406,583,556 (16)
.
EG iterations: 1
abstracting: (p186<=p137)
states: 668,191,747,286,715,201 (17)
.abstracting: (p210<=0)
states: 662,218,607,171,370,613 (17)
abstracting: (p19<=0)
states: 372,387,962,881,389,598 (17)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-15-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.635sec

checking: ~ [E [AF [[[AX [p38<=p43] | EF [p195<=p24]] & ~ [[[1<=p187 | p153<=p59] & ~ [1<=p98]]]]] U [AF [[p79<=0 | [1<=p288 | ~ [[p186<=p23 & 1<=p252]]]]] & AG [[~ [p168<=p248] & [EF [p85<=p216] | [p185<=p56 | 1<=p263]]]]]]]
normalized: ~ [E [~ [EG [~ [[~ [[~ [1<=p98] & [1<=p187 | p153<=p59]]] & [E [true U p195<=p24] | ~ [EX [~ [p38<=p43]]]]]]]] U [~ [E [true U ~ [[[[p185<=p56 | 1<=p263] | E [true U p85<=p216]] & ~ [p168<=p248]]]]] & ~ [EG [~ [[p79<=0 | [1<=p288 | ~ [[p186<=p23 & 1<=p252]]]]]]]]]]

abstracting: (1<=p252)
states: 5,739,017,486,980,714 (15)
abstracting: (p186<=p23)
states: 670,782,124,683,052,113 (17)
abstracting: (1<=p288)
states: 5,143,560,437,923,076 (15)
abstracting: (p79<=0)
states: 411,733,039,099,862,350 (17)
..........................................................................................
EG iterations: 90
abstracting: (p168<=p248)
states: 667,393,534,005,073,777 (17)
abstracting: (p85<=p216)
states: 510,964,941,863,356,927 (17)
abstracting: (1<=p263)
states: 10,931,650,714,121,626 (16)
abstracting: (p185<=p56)
states: 665,030,409,998,105,649 (17)
abstracting: (p38<=p43)
states: 544,881,663,958,619,366 (17)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6219772 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098916 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec


iterations count:14804 (51), effective:543 (1)

initing FirstDep: 0m 0.000sec


iterations count:9211 (32), effective:444 (1)

net_ddint.h:600: Timeout: after 254 sec


iterations count:2596 (9), effective:121 (0)

net_ddint.h:600: Timeout: after 236 sec


net_ddint.h:600: Timeout: after 219 sec


net_ddint.h:600: Timeout: after 203 sec


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

net_ddint.h:600: Timeout: after 188 sec


iterations count:5483 (19), effective:318 (1)

net_ddint.h:600: Timeout: after 175 sec


iterations count:345 (1), effective:5 (0)

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

net_ddint.h:600: Timeout: after 162 sec


iterations count:587 (2), effective:26 (0)

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

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

iterations count:590 (2), effective:23 (0)

net_ddint.h:600: Timeout: after 156 sec


net_ddint.h:600: Timeout: after 144 sec


net_ddint.h:600: Timeout: after 133 sec


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

iterations count:3597 (12), effective:184 (0)

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

iterations count:6328 (22), effective:379 (1)

iterations count:997 (3), effective:20 (0)

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

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

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

iterations count:398 (1), effective:5 (0)

iterations count:333 (1), effective:5 (0)

iterations count:9184 (32), effective:442 (1)

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

iterations count:790 (2), effective:36 (0)

net_ddint.h:600: Timeout: after 134 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="HirschbergSinclair-PT-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is HirschbergSinclair-PT-15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348700441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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