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-167889203700769.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700769
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679182105019

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:28:26] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-18 23:28:26] [INFO ] Transformed 400 places.
[2023-03-18 23:28:26] [INFO ] Transformed 202 transitions.
[2023-03-18 23:28:26] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 159 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 269 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:27] [INFO ] Computed 200 place invariants in 9 ms
[2023-03-18 23:28:27] [INFO ] Implicit Places using invariants in 364 ms returned [203, 205, 207, 213, 221, 227, 229, 235, 243, 247, 249, 251, 253, 257, 261, 263, 265, 267, 277, 279, 281, 283, 287, 289, 291, 295, 297, 303, 305, 307, 309, 313, 323, 327, 329, 331, 333, 335, 337, 339, 341, 345, 347, 353, 355, 359, 361, 365, 367, 369, 371, 373, 375, 379, 387, 389, 393]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 407 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 343/400 places, 202/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 690 ms. Remains : 343/400 places, 202/202 transitions.
Support contains 159 out of 343 places after structural reductions.
[2023-03-18 23:28:27] [INFO ] Flatten gal took : 45 ms
[2023-03-18 23:28:27] [INFO ] Flatten gal took : 20 ms
[2023-03-18 23:28:27] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 156 out of 343 places (down from 159) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 103) seen :58
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) seen :0
Running SMT prover for 45 properties.
// Phase 1: matrix 202 rows 343 cols
[2023-03-18 23:28:28] [INFO ] Computed 143 place invariants in 6 ms
[2023-03-18 23:28:29] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:45
[2023-03-18 23:28:29] [INFO ] [Nat]Absence check using 143 positive place invariants in 22 ms returned sat
[2023-03-18 23:28:30] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :17 sat :28
[2023-03-18 23:28:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 5 ms to minimize.
[2023-03-18 23:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 23:28:30] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-18 23:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-18 23:28:30] [INFO ] After 1193ms SMT Verify possible using trap constraints in natural domain returned unsat :17 sat :28
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-18 23:28:31] [INFO ] After 2071ms SMT Verify possible using all constraints in natural domain returned unsat :17 sat :28
Fused 45 Parikh solutions to 26 different solutions.
Parikh walk visited 24 properties in 443 ms.
Support contains 13 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 341 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 341 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 339 transition count 200
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 1 with 2 rules applied. Total rules applied 8 place count 338 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 338 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 336 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 335 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 335 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 333 transition count 196
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 18 place count 332 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 332 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 330 transition count 194
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 4 with 3 rules applied. Total rules applied 24 place count 328 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 328 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 326 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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 30 place count 324 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 324 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 33 place count 322 transition count 190
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 35 place count 321 transition count 189
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 36 place count 321 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 38 place count 319 transition count 188
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 7 with 3 rules applied. Total rules applied 41 place count 317 transition count 187
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 42 place count 317 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 44 place count 315 transition count 186
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 8 with 3 rules applied. Total rules applied 47 place count 313 transition count 185
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 48 place count 313 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 50 place count 311 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 53 place count 309 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 54 place count 309 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 56 place count 307 transition count 182
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 10 with 2 rules applied. Total rules applied 58 place count 306 transition count 181
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 59 place count 306 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 61 place count 304 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 62 place count 304 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 63 place count 303 transition count 179
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 64 place count 303 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 66 place count 301 transition count 178
Applied a total of 66 rules in 240 ms. Remains 301 /343 variables (removed 42) and now considering 178/202 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 301/343 places, 178/202 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 532266 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532266 steps, saw 150134 distinct states, run finished after 3002 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 178 rows 301 cols
[2023-03-18 23:28:35] [INFO ] Computed 125 place invariants in 1 ms
[2023-03-18 23:28:35] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:28:35] [INFO ] [Nat]Absence check using 125 positive place invariants in 14 ms returned sat
[2023-03-18 23:28:35] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:28:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-18 23:28:35] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-18 23:28:35] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 57 ms.
Support contains 13 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 301/301 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-18 23:28:35] [INFO ] Invariant cache hit.
[2023-03-18 23:28:35] [INFO ] Implicit Places using invariants in 164 ms returned [180, 186, 189, 191, 193, 202, 205, 211, 213, 215, 217, 223, 228, 232, 234, 240, 243, 245, 247, 249, 252, 262, 266, 268, 272, 276, 284, 287, 289, 291, 295, 298, 300]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 183 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 268/301 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 195 ms. Remains : 268/301 places, 178/178 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 487624 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487624 steps, saw 138887 distinct states, run finished after 3005 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 178 rows 268 cols
[2023-03-18 23:28:39] [INFO ] Computed 92 place invariants in 6 ms
[2023-03-18 23:28:39] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:28:39] [INFO ] [Nat]Absence check using 92 positive place invariants in 12 ms returned sat
[2023-03-18 23:28:39] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:28:39] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-18 23:28:39] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 41 ms.
Support contains 13 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 268/268 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-18 23:28:39] [INFO ] Invariant cache hit.
[2023-03-18 23:28:39] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-18 23:28:39] [INFO ] Invariant cache hit.
[2023-03-18 23:28:40] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-18 23:28:40] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 23:28:40] [INFO ] Invariant cache hit.
[2023-03-18 23:28:40] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 268/268 places, 178/178 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 267 transition count 178
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 267 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 265 transition count 176
Applied a total of 5 rules in 12 ms. Remains 265 /268 variables (removed 3) and now considering 176/178 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 176 rows 265 cols
[2023-03-18 23:28:40] [INFO ] Computed 91 place invariants in 1 ms
[2023-03-18 23:28:40] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:28:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 10 ms returned sat
[2023-03-18 23:28:40] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:28:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-18 23:28:40] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-18 23:28:40] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R100C002-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:28:40] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:28:40] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:28:40] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 114 out of 343 places (down from 116) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:40] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:28:40] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:28:40] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:40] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 340 transition count 200
Applied a total of 5 rules in 12 ms. Remains 340 /343 variables (removed 3) and now considering 200/202 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 340/343 places, 200/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 343 /343 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 343/343 places, 202/202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:28:41] [INFO ] Input system was already deterministic with 202 transitions.
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:28:41] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:28:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 343 places, 202 transitions and 886 arcs took 2 ms.
Total runtime 15112 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: 343 NrTr: 202 NrArc: 886)

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

net check time: 0m 0.000sec

init dd package: 0m 2.734sec


RS generation: 0m 1.192sec


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



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

checking: AG [EX [[AX [~ [p208<=p272]] | [1<=p302 | EG [~ [p120<=0]]]]]]
normalized: ~ [E [true U ~ [EX [[[1<=p302 | EG [~ [p120<=0]]] | ~ [EX [p208<=p272]]]]]]]

abstracting: (p208<=p272)
states: 49,596,829,733,929,475,333,558,512,910,336 (31)
.abstracting: (p120<=0)
states: 51,656,761,959,300,348,110,990,655,619,072 (31)
.............................................................................................................................................................................................................................................................................................
before gc: list nodes free: 579361

after gc: idd nodes used:2962576, unused:61037424; list nodes free:283989265
............................
before gc: list nodes free: 2082920

after gc: idd nodes used:3099459, unused:60900541; list nodes free:285506170
...
before gc: list nodes free: 2030160

after gc: idd nodes used:3114157, unused:60885843; list nodes free:285434718
.
before gc: list nodes free: 1972556

after gc: idd nodes used:3119395, unused:60880605; list nodes free:285413806
MC time: 4m17.283sec

checking: AF [AX [AX [A [[p85<=1 & p235<=p47] U [1<=p140 & 1<=p104]]]]]
normalized: ~ [EG [EX [EX [~ [[~ [EG [~ [[1<=p140 & 1<=p104]]]] & ~ [E [~ [[1<=p140 & 1<=p104]] U [~ [[p85<=1 & p235<=p47]] & ~ [[1<=p140 & 1<=p104]]]]]]]]]]]

abstracting: (1<=p104)
states: 15,528,719,852,795,810,168,334,614,265,856 (31)
abstracting: (1<=p140)
states: 9,824,292,151,768,777,861,599,449,841,664 (30)
abstracting: (p235<=p47)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
abstracting: (p85<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=p104)
states: 15,528,719,852,795,810,168,334,614,265,856 (31)
abstracting: (1<=p140)
states: 9,824,292,151,768,777,861,599,449,841,664 (30)
abstracting: (1<=p104)
states: 15,528,719,852,795,810,168,334,614,265,856 (31)
abstracting: (1<=p140)
states: 9,824,292,151,768,777,861,599,449,841,664 (30)
.......................................................................................................................................................................................................................................................................
before gc: list nodes free: 4585522

after gc: idd nodes used:1536986, unused:62463014; list nodes free:292823373
................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 6726291

after gc: idd nodes used:1943427, unused:62056573; list nodes free:290977661
..................................................................................................................................
before gc: list nodes free: 6025872

after gc: idd nodes used:1019119, unused:62980881; list nodes free:295228948
..............................................................
before gc: list nodes free: 6886421

after gc: idd nodes used:2285919, unused:61714081; list nodes free:289231969
.MC time: 3m59.215sec

checking: AG [[p278<=0 & [AX [p150<=p43] | [1<=p179 & 1<=p221]]]]
normalized: ~ [E [true U ~ [[p278<=0 & [[1<=p179 & 1<=p221] | ~ [EX [~ [p150<=p43]]]]]]]]

abstracting: (p150<=p43)
states: 60,530,316,160,897,953,921,467,578,056,704 (31)
.abstracting: (1<=p221)
states: 4,753,689,750,855,860,255,612,637,020,160 (30)
abstracting: (1<=p179)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p278<=0)
states: 46,903,072,208,444,487,855,378,018,598,912 (31)
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.128sec

checking: AG [E [p188<=p189 U EX [~ [[AX [p337<=p173] & EX [1<=p312]]]]]]
normalized: ~ [E [true U ~ [E [p188<=p189 U EX [~ [[EX [1<=p312] & ~ [EX [~ [p337<=p173]]]]]]]]]]

abstracting: (p337<=p173)
states: 48,804,548,108,786,831,957,623,073,406,976 (31)
.abstracting: (1<=p312)
states: 39,297,168,607,075,111,446,397,799,366,656 (31)
..abstracting: (p188<=p189)
states: 62,431,792,061,240,298,023,712,632,864,768 (31)
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.172sec

checking: [AG [[AX [~ [1<=p30]] & [p106<=p339 & p82<=1]]] & A [p27<=p298 U AG [AF [1<=p283]]]]
normalized: [[~ [EG [E [true U EG [~ [1<=p283]]]]] & ~ [E [E [true U EG [~ [1<=p283]]] U [~ [p27<=p298] & E [true U EG [~ [1<=p283]]]]]]] & ~ [E [true U ~ [[[p106<=p339 & p82<=1] & ~ [EX [1<=p30]]]]]]]

abstracting: (1<=p30)
states: 27,254,487,904,906,932,132,179,118,915,584 (31)
.abstracting: (p82<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p106<=p339)
states: 56,727,364,360,213,265,716,977,468,440,576 (31)
abstracting: (1<=p283)
states: 45,952,334,258,273,315,804,255,491,194,880 (31)
..........................
before gc: list nodes free: 7203713

after gc: idd nodes used:217291, unused:63782709; list nodes free:298914717
...................................
before gc: list nodes free: 11813672

after gc: idd nodes used:1481330, unused:62518670; list nodes free:293217722
.....
before gc: list nodes free: 11808541

after gc: idd nodes used:1734534, unused:62265466; list nodes free:292105200
MC time: 4m18.369sec

checking: EG [[~ [E [EF [1<=p268] U AF [p236<=0]]] | [EX [[1<=p29 & p233<=1]] | AG [[~ [p251<=p287] | AF [p94<=0]]]]]]
normalized: EG [[~ [E [E [true U 1<=p268] U ~ [EG [~ [p236<=0]]]]] | [EX [[1<=p29 & p233<=1]] | ~ [E [true U ~ [[~ [EG [~ [p94<=0]]] | ~ [p251<=p287]]]]]]]]

abstracting: (p251<=p287)
states: 51,022,936,659,186,233,410,242,304,016,384 (31)
abstracting: (p94<=0)
states: 47,536,897,508,558,602,556,126,370,201,600 (31)
.........................................................................................................................
before gc: list nodes free: 5260170

after gc: idd nodes used:2042000, unused:61958000; list nodes free:290430751
.......................
before gc: list nodes free: 2442363

after gc: idd nodes used:2569373, unused:61430627; list nodes free:288004481
.
before gc: list nodes free: 2515468

after gc: idd nodes used:2594585, unused:61405415; list nodes free:287887218
MC time: 3m57.281sec

checking: EG [[~ [A [[AG [1<=p99] | p66<=p218] U p220<=p128]] | p147<=p182]]
normalized: EG [[p147<=p182 | ~ [[~ [EG [~ [p220<=p128]]] & ~ [E [~ [p220<=p128] U [~ [[p66<=p218 | ~ [E [true U ~ [1<=p99]]]]] & ~ [p220<=p128]]]]]]]]

abstracting: (p220<=p128)
states: 16,162,545,152,909,924,869,082,965,868,544 (31)
abstracting: (1<=p99)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p66<=p218)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p220<=p128)
states: 16,162,545,152,909,924,869,082,965,868,544 (31)
abstracting: (p220<=p128)
states: 16,162,545,152,909,924,869,082,965,868,544 (31)
..................................................................................................................
before gc: list nodes free: 4467756

after gc: idd nodes used:959796, unused:63040204; list nodes free:295451123
..................................................................................................................................................................................
before gc: list nodes free: 5433326

after gc: idd nodes used:2141940, unused:61858060; list nodes free:289962176
......................................................................................................................
before gc: list nodes free: 5201990

after gc: idd nodes used:2360373, unused:61639627; list nodes free:288958803
.MC time: 3m37.577sec

checking: EF [[EG [~ [p48<=p153]] | [p150<=0 & [A [AG [p139<=0] U ~ [AX [1<=p74]]] & [EG [AG [~ [p272<=p125]]] | ~ [1<=p91]]]]]]
normalized: E [true U [[p150<=0 & [[~ [1<=p91] | EG [~ [E [true U p272<=p125]]]] & [~ [EG [~ [EX [~ [1<=p74]]]]] & ~ [E [~ [EX [~ [1<=p74]]] U [E [true U ~ [p139<=0]] & ~ [EX [~ [1<=p74]]]]]]]]] | EG [~ [p48<=p153]]]]

abstracting: (p48<=p153)
states: 52,290,587,259,414,462,811,739,007,221,760 (31)
.............................
before gc: list nodes free: 5288462

after gc: idd nodes used:1241027, unused:62758973; list nodes free:294208241
........
before gc: list nodes free: 6605335

after gc: idd nodes used:2165057, unused:61834943; list nodes free:289981462
.MC time: 3m19.235sec

checking: AX [E [EX [[1<=p96 | [[1<=p110 & p236<=p94] | [~ [p115<=0] & [p146<=p188 | 1<=p213]]]]] U A [[1<=p152 & AX [1<=p77]] U [~ [EX [0<=0]] & p107<=p81]]]]
normalized: ~ [EX [~ [E [EX [[1<=p96 | [[[p146<=p188 | 1<=p213] & ~ [p115<=0]] | [1<=p110 & p236<=p94]]]] U [~ [EG [~ [[p107<=p81 & ~ [EX [0<=0]]]]]] & ~ [E [~ [[p107<=p81 & ~ [EX [0<=0]]]] U [~ [[1<=p152 & ~ [EX [~ [1<=p77]]]]] & ~ [[p107<=p81 & ~ [EX [0<=0]]]]]]]]]]]]

abstracting: (0<=0)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
.abstracting: (p107<=p81)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (1<=p77)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
.abstracting: (1<=p152)
states: 7,922,816,251,426,433,759,354,395,033,600 (30)
abstracting: (0<=0)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
.abstracting: (p107<=p81)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (0<=0)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
.abstracting: (p107<=p81)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
..................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 4772956

after gc: idd nodes used:613637, unused:63386363; list nodes free:297079282
....................................................................................................................................................................................
before gc: list nodes free: 3056547

after gc: idd nodes used:1024422, unused:62975578; list nodes free:295188106
MC time: 3m 2.246sec

checking: [AX [[AG [~ [p263<=p231]] & ~ [p295<=0]]] | [AG [AX [~ [E [p342<=p170 U 1<=p25]]]] | EF [[A [1<=p18 U p309<=p31] & [p86<=1 & p280<=p168]]]]]
normalized: [[E [true U [[~ [E [~ [p309<=p31] U [~ [1<=p18] & ~ [p309<=p31]]]] & ~ [EG [~ [p309<=p31]]]] & [p86<=1 & p280<=p168]]] | ~ [E [true U EX [E [p342<=p170 U 1<=p25]]]]] | ~ [EX [~ [[~ [p295<=0] & ~ [E [true U p263<=p231]]]]]]]

abstracting: (p263<=p231)
states: 61,322,597,786,040,597,297,403,017,560,064 (31)
abstracting: (p295<=0)
states: 43,417,033,057,816,857,001,262,084,784,128 (31)
.abstracting: (1<=p25)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p342<=p170)
states: 34,701,935,181,247,779,865,972,250,247,168 (31)
.abstracting: (p280<=p168)
states: 23,451,536,104,222,243,927,689,009,299,456 (31)
abstracting: (p86<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p309<=p31)
states: 52,132,130,934,385,934,136,551,919,321,088 (31)
.......................
before gc: list nodes free: 5079826

after gc: idd nodes used:836927, unused:63163073; list nodes free:296068309
...........MC time: 2m47.090sec

checking: EF [[~ [E [[p130<=0 & A [p147<=p22 U p109<=p159]] U AF [p304<=p6]]] & EX [[[p226<=p324 | 1<=p94] & [p242<=p71 & p69<=p320]]]]]
normalized: E [true U [EX [[[p242<=p71 & p69<=p320] & [p226<=p324 | 1<=p94]]] & ~ [E [[p130<=0 & [~ [EG [~ [p109<=p159]]] & ~ [E [~ [p109<=p159] U [~ [p147<=p22] & ~ [p109<=p159]]]]]] U ~ [EG [~ [p304<=p6]]]]]]]

abstracting: (p304<=p6)
states: 52,132,130,934,385,934,136,551,919,321,088 (31)
....
before gc: list nodes free: 7050957

after gc: idd nodes used:38986, unused:63961014; list nodes free:299712565
..........................
before gc: list nodes free: 6981556

after gc: idd nodes used:1693101, unused:62306899; list nodes free:292186668
MC time: 2m33.134sec

checking: [[EG [AF [~ [1<=p211]]] & EX [[AF [~ [p292<=p287]] & ~ [A [p224<=p131 U p65<=0]]]]] & [EF [[~ [p250<=p304] | [1<=p211 & p170<=0]]] & AF [[AG [p274<=p315] | [~ [1<=p245] | EG [1<=p253]]]]]]
normalized: [[E [true U [[1<=p211 & p170<=0] | ~ [p250<=p304]]] & ~ [EG [~ [[[~ [1<=p245] | EG [1<=p253]] | ~ [E [true U ~ [p274<=p315]]]]]]]] & [EG [~ [EG [1<=p211]]] & EX [[~ [[~ [EG [~ [p65<=0]]] & ~ [E [~ [p65<=0] U [~ [p224<=p131] & ~ [p65<=0]]]]]] & ~ [EG [p292<=p287]]]]]]

abstracting: (p292<=p287)
states: 54,984,344,784,899,450,289,919,501,533,184 (31)
...................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 5002146

after gc: idd nodes used:882197, unused:63117803; list nodes free:295846449
........................................................MC time: 2m21.000sec

checking: A [[~ [E [~ [[~ [1<=p247] & [1<=p316 & 1<=p51]]] U EX [A [1<=p175 U p331<=p119]]]] & 1<=p152] U A [E [[p51<=0 | [AX [1<=p335] & [1<=p255 | 1<=p49]]] U ~ [EG [1<=p57]]] U AG [~ [p339<=p198]]]]
normalized: [~ [EG [~ [[~ [EG [E [true U p339<=p198]]] & ~ [E [E [true U p339<=p198] U [~ [E [[p51<=0 | [[1<=p255 | 1<=p49] & ~ [EX [~ [1<=p335]]]]] U ~ [EG [1<=p57]]]] & E [true U p339<=p198]]]]]]]] & ~ [E [~ [[~ [EG [E [true U p339<=p198]]] & ~ [E [E [true U p339<=p198] U [~ [E [[p51<=0 | [[1<=p255 | 1<=p49] & ~ [EX [~ [1<=p335]]]]] U ~ [EG [1<=p57]]]] & E [true U p339<=p198]]]]]] U [~ [[~ [EG [E [true U p339<=p198]]] & ~ [E [E [true U p339<=p198] U [~ [E [[p51<=0 | [[1<=p255 | 1<=p49] & ~ [EX [~ [1<=p335]]]]] U ~ [EG [1<=p57]]]] & E [true U p339<=p198]]]]]] & ~ [[1<=p152 & ~ [E [~ [[[1<=p316 & 1<=p51] & ~ [1<=p247]]] U EX [[~ [EG [~ [p331<=p119]]] & ~ [E [~ [p331<=p119] U [~ [p331<=p119] & ~ [1<=p175]]]]]]]]]]]]]]

abstracting: (1<=p175)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p331<=p119)
states: 47,061,528,533,473,016,530,565,106,499,584 (31)
abstracting: (p331<=p119)
states: 47,061,528,533,473,016,530,565,106,499,584 (31)
abstracting: (p331<=p119)
states: 47,061,528,533,473,016,530,565,106,499,584 (31)
...........................
before gc: list nodes free: 5516519

after gc: idd nodes used:737474, unused:63262526; list nodes free:296530721
...................MC time: 2m 9.005sec

checking: EG [A [~ [A [[EG [1<=p285] | AF [1<=p306]] U AX [p18<=p189]]] U [[A [p144<=p308 U p87<=p111] | [p338<=p305 | p20<=0]] & [AF [1<=p327] | [A [1<=p212 U p66<=0] & [p79<=p323 & p26<=0]]]]]]
normalized: EG [[~ [EG [~ [[[[[p79<=p323 & p26<=0] & [~ [EG [~ [p66<=0]]] & ~ [E [~ [p66<=0] U [~ [1<=p212] & ~ [p66<=0]]]]]] | ~ [EG [~ [1<=p327]]]] & [[p338<=p305 | p20<=0] | [~ [EG [~ [p87<=p111]]] & ~ [E [~ [p87<=p111] U [~ [p144<=p308] & ~ [p87<=p111]]]]]]]]]] & ~ [E [~ [[[[[p79<=p323 & p26<=0] & [~ [EG [~ [p66<=0]]] & ~ [E [~ [p66<=0] U [~ [1<=p212] & ~ [p66<=0]]]]]] | ~ [EG [~ [1<=p327]]]] & [[p338<=p305 | p20<=0] | [~ [EG [~ [p87<=p111]]] & ~ [E [~ [p87<=p111] U [~ [p144<=p308] & ~ [p87<=p111]]]]]]]] U [[~ [EG [EX [~ [p18<=p189]]]] & ~ [E [EX [~ [p18<=p189]] U [~ [[~ [EG [~ [1<=p306]]] | EG [1<=p285]]] & EX [~ [p18<=p189]]]]]] & ~ [[[[[p79<=p323 & p26<=0] & [~ [EG [~ [p66<=0]]] & ~ [E [~ [p66<=0] U [~ [1<=p212] & ~ [p66<=0]]]]]] | ~ [EG [~ [1<=p327]]]] & [[p338<=p305 | p20<=0] | [~ [EG [~ [p87<=p111]]] & ~ [E [~ [p87<=p111] U [~ [p144<=p308] & ~ [p87<=p111]]]]]]]]]]]]]

abstracting: (p87<=p111)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (p144<=p308)
states: 64,016,355,311,525,584,775,583,511,871,488 (31)
abstracting: (p87<=p111)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (p87<=p111)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
..........................
before gc: list nodes free: 9289451

after gc: idd nodes used:368810, unused:63631190; list nodes free:298210808
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6028192 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095636 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:35621 (176), effective:10100 (50)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 256 sec


iterations count:7000 (34), effective:1810 (8)

net_ddint.h:600: Timeout: after 238 sec


iterations count:4794 (23), effective:1224 (6)

iterations count:660 (3), effective:130 (0)

iterations count:33261 (164), effective:9548 (47)

iterations count:955 (4), effective:233 (1)

net_ddint.h:600: Timeout: after 257 sec


net_ddint.h:600: Timeout: after 236 sec


iterations count:5375 (26), effective:1376 (6)

net_ddint.h:600: Timeout: after 216 sec


net_ddint.h:600: Timeout: after 198 sec


iterations count:445 (2), effective:63 (0)

net_ddint.h:600: Timeout: after 181 sec


iterations count:382 (1), effective:58 (0)

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

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

net_ddint.h:600: Timeout: after 166 sec


net_ddint.h:600: Timeout: after 152 sec


net_ddint.h:600: Timeout: after 140 sec


iterations count:320 (1), effective:31 (0)

net_ddint.h:600: Timeout: after 128 sec


iterations count:1525 (7), effective:366 (1)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ResAllocation-PT-R100C002, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203700769"
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 [ "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 ;