Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000618.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 21:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 21:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 21:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 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 CANConstruction-PT-010-CTLFireability-00
FORMULA_NAME CANConstruction-PT-010-CTLFireability-01
FORMULA_NAME CANConstruction-PT-010-CTLFireability-02
FORMULA_NAME CANConstruction-PT-010-CTLFireability-03
FORMULA_NAME CANConstruction-PT-010-CTLFireability-04
FORMULA_NAME CANConstruction-PT-010-CTLFireability-05
FORMULA_NAME CANConstruction-PT-010-CTLFireability-06
FORMULA_NAME CANConstruction-PT-010-CTLFireability-07
FORMULA_NAME CANConstruction-PT-010-CTLFireability-08
FORMULA_NAME CANConstruction-PT-010-CTLFireability-09
FORMULA_NAME CANConstruction-PT-010-CTLFireability-10
FORMULA_NAME CANConstruction-PT-010-CTLFireability-11
FORMULA_NAME CANConstruction-PT-010-CTLFireability-12
FORMULA_NAME CANConstruction-PT-010-CTLFireability-13
FORMULA_NAME CANConstruction-PT-010-CTLFireability-14
FORMULA_NAME CANConstruction-PT-010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678736060268

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:34:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:34:22] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-13 19:34:22] [INFO ] Transformed 322 places.
[2023-03-13 19:34:22] [INFO ] Transformed 480 transitions.
[2023-03-13 19:34:22] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 151 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 292 transition count 420
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 292 transition count 420
Applied a total of 60 rules in 40 ms. Remains 292 /322 variables (removed 30) and now considering 420/480 (removed 60) transitions.
// Phase 1: matrix 420 rows 292 cols
[2023-03-13 19:34:22] [INFO ] Computed 21 place invariants in 18 ms
[2023-03-13 19:34:22] [INFO ] Implicit Places using invariants in 299 ms returned [12, 54, 68, 82, 124]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 328 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 287/322 places, 420/480 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 285 transition count 418
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 285 transition count 418
Applied a total of 4 rules in 21 ms. Remains 285 /287 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 285 cols
[2023-03-13 19:34:22] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-13 19:34:22] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-13 19:34:22] [INFO ] Invariant cache hit.
[2023-03-13 19:34:22] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-13 19:34:23] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 285/322 places, 418/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 740 ms. Remains : 285/322 places, 418/480 transitions.
Support contains 151 out of 285 places after structural reductions.
[2023-03-13 19:34:23] [INFO ] Flatten gal took : 55 ms
[2023-03-13 19:34:23] [INFO ] Flatten gal took : 22 ms
[2023-03-13 19:34:23] [INFO ] Input system was already deterministic with 418 transitions.
Support contains 150 out of 285 places (down from 151) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 114) seen :103
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 19:34:24] [INFO ] Invariant cache hit.
[2023-03-13 19:34:24] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-13 19:34:24] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-13 19:34:24] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:2
[2023-03-13 19:34:24] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-13 19:34:24] [INFO ] After 48ms SMT Verify possible using 190 Read/Feed constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-13 19:34:24] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-13 19:34:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 19:34:24] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-13 19:34:24] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-13 19:34:24] [INFO ] After 85ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-13 19:34:25] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-13 19:34:25] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 37 ms.
Support contains 15 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 418/418 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 285 transition count 363
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 114 place count 230 transition count 359
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 226 transition count 359
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 118 place count 226 transition count 354
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 128 place count 221 transition count 354
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 174 place count 175 transition count 263
Iterating global reduction 3 with 46 rules applied. Total rules applied 220 place count 175 transition count 263
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 225 place count 175 transition count 258
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 230 place count 170 transition count 258
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 244 place count 163 transition count 251
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 264 place count 153 transition count 316
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 267 place count 153 transition count 313
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 270 place count 150 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 150 transition count 313
Applied a total of 271 rules in 185 ms. Remains 150 /285 variables (removed 135) and now considering 313/418 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 150/285 places, 313/418 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 313 rows 150 cols
[2023-03-13 19:34:25] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-13 19:34:25] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 19:34:25] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-13 19:34:25] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 19:34:25] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-13 19:34:25] [INFO ] After 49ms SMT Verify possible using 279 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:34:25] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:34:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 19:34:25] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-13 19:34:25] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:34:25] [INFO ] After 58ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:34:25] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 19:34:25] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 313/313 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 150 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 149 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 149 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 148 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 145 transition count 308
Applied a total of 10 rules in 63 ms. Remains 145 /150 variables (removed 5) and now considering 308/313 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 145/150 places, 308/313 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1253935 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{}
Probabilistic random walk after 1253935 steps, saw 126991 distinct states, run finished after 3002 ms. (steps per millisecond=417 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 308 rows 145 cols
[2023-03-13 19:34:29] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 19:34:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 19:34:29] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-13 19:34:29] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-13 19:34:29] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-13 19:34:29] [INFO ] After 25ms SMT Verify possible using 280 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:34:29] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 19:34:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-13 19:34:29] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:34:29] [INFO ] After 45ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:34:29] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-13 19:34:29] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 308/308 transitions.
Applied a total of 0 rules in 33 ms. Remains 145 /145 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 145/145 places, 308/308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 308/308 transitions.
Applied a total of 0 rules in 25 ms. Remains 145 /145 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2023-03-13 19:34:29] [INFO ] Invariant cache hit.
[2023-03-13 19:34:29] [INFO ] Implicit Places using invariants in 108 ms returned [11, 17, 32, 39, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 111 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 140/145 places, 308/308 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 307
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 132 transition count 300
Applied a total of 16 rules in 62 ms. Remains 132 /140 variables (removed 8) and now considering 300/308 (removed 8) transitions.
// Phase 1: matrix 300 rows 132 cols
[2023-03-13 19:34:29] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-13 19:34:29] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-13 19:34:29] [INFO ] Invariant cache hit.
[2023-03-13 19:34:29] [INFO ] State equation strengthened by 276 read => feed constraints.
[2023-03-13 19:34:30] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 132/145 places, 300/308 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 645 ms. Remains : 132/145 places, 300/308 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1652420 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1652420 steps, saw 164310 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 19:34:33] [INFO ] Invariant cache hit.
[2023-03-13 19:34:33] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-13 19:34:33] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-13 19:34:33] [INFO ] State equation strengthened by 276 read => feed constraints.
[2023-03-13 19:34:33] [INFO ] After 33ms SMT Verify possible using 276 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:34:33] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:34:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-13 19:34:33] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:34:33] [INFO ] After 55ms SMT Verify possible using 276 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:34:33] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 19:34:33] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 1 ms.
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 300/300 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 132 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 125 transition count 293
Applied a total of 14 rules in 85 ms. Remains 125 /132 variables (removed 7) and now considering 293/300 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 125/132 places, 293/300 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2364973 steps, run timeout after 3001 ms. (steps per millisecond=788 ) properties seen :{}
Probabilistic random walk after 2364973 steps, saw 217750 distinct states, run finished after 3003 ms. (steps per millisecond=787 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 125 cols
[2023-03-13 19:34:37] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 19:34:37] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-13 19:34:37] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 19:34:37] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-13 19:34:37] [INFO ] After 33ms SMT Verify possible using 280 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:34:37] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:34:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 19:34:37] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:34:37] [INFO ] After 26ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:34:37] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 19:34:37] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 29 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 125/125 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 31 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-13 19:34:37] [INFO ] Invariant cache hit.
[2023-03-13 19:34:37] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-13 19:34:37] [INFO ] Invariant cache hit.
[2023-03-13 19:34:37] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-13 19:34:37] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-13 19:34:37] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-13 19:34:37] [INFO ] Invariant cache hit.
[2023-03-13 19:34:37] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 125/125 places, 293/293 transitions.
Graph (trivial) has 189 edges and 125 vertex of which 90 / 125 are part of one of the 9 SCC in 3 ms
Free SCC test removed 81 places
Drop transitions removed 162 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 234 transitions.
Graph (complete) has 98 edges and 44 vertex of which 16 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 16 transition count 14
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 49 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 4 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 4 transition count 4
Applied a total of 52 rules in 7 ms. Remains 4 /125 variables (removed 121) and now considering 4/293 (removed 289) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-13 19:34:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 19:34:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 19:34:37] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 19:34:37] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 19:34:37] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA CANConstruction-PT-010-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 21 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 24 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 418 transitions.
Computed a total of 39 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 235 transition count 321
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 235 transition count 321
Applied a total of 100 rules in 9 ms. Remains 235 /285 variables (removed 50) and now considering 321/418 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 235/285 places, 321/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 16 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 241 transition count 333
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 241 transition count 333
Applied a total of 88 rules in 6 ms. Remains 241 /285 variables (removed 44) and now considering 333/418 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 241/285 places, 333/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 333 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 236 transition count 322
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 236 transition count 322
Applied a total of 98 rules in 6 ms. Remains 236 /285 variables (removed 49) and now considering 322/418 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 236/285 places, 322/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 18 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 322 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 236 transition count 323
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 236 transition count 323
Applied a total of 98 rules in 6 ms. Remains 236 /285 variables (removed 49) and now considering 323/418 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 236/285 places, 323/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 240 transition count 331
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 240 transition count 331
Applied a total of 90 rules in 8 ms. Remains 240 /285 variables (removed 45) and now considering 331/418 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 240/285 places, 331/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 235 transition count 321
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 235 transition count 321
Applied a total of 100 rules in 5 ms. Remains 235 /285 variables (removed 50) and now considering 321/418 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 235/285 places, 321/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 285 transition count 353
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 220 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 219 transition count 352
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 132 place count 219 transition count 346
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 144 place count 213 transition count 346
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 193 place count 164 transition count 248
Iterating global reduction 3 with 49 rules applied. Total rules applied 242 place count 164 transition count 248
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 250 place count 164 transition count 240
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 258 place count 156 transition count 240
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 270 place count 150 transition count 234
Applied a total of 270 rules in 28 ms. Remains 150 /285 variables (removed 135) and now considering 234/418 (removed 184) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 150/285 places, 234/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 235 transition count 321
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 235 transition count 321
Applied a total of 100 rules in 4 ms. Remains 235 /285 variables (removed 50) and now considering 321/418 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 235/285 places, 321/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 233 transition count 317
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 233 transition count 317
Applied a total of 104 rules in 5 ms. Remains 233 /285 variables (removed 52) and now considering 317/418 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 233/285 places, 317/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 285 transition count 362
Reduce places removed 56 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 66 rules applied. Total rules applied 122 place count 229 transition count 352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 132 place count 219 transition count 352
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 132 place count 219 transition count 346
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 144 place count 213 transition count 346
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 194 place count 163 transition count 246
Iterating global reduction 3 with 50 rules applied. Total rules applied 244 place count 163 transition count 246
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 252 place count 163 transition count 238
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 260 place count 155 transition count 238
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 272 place count 149 transition count 232
Applied a total of 272 rules in 20 ms. Remains 149 /285 variables (removed 136) and now considering 232/418 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 149/285 places, 232/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 238 transition count 327
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 238 transition count 327
Applied a total of 94 rules in 4 ms. Remains 238 /285 variables (removed 47) and now considering 327/418 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 238/285 places, 327/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 285 transition count 361
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 228 transition count 361
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 114 place count 228 transition count 355
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 222 transition count 355
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 176 place count 172 transition count 258
Iterating global reduction 2 with 50 rules applied. Total rules applied 226 place count 172 transition count 258
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 228 place count 172 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 230 place count 170 transition count 256
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 244 place count 163 transition count 249
Applied a total of 244 rules in 20 ms. Remains 163 /285 variables (removed 122) and now considering 249/418 (removed 169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 163/285 places, 249/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 232 transition count 315
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 232 transition count 315
Applied a total of 106 rules in 8 ms. Remains 232 /285 variables (removed 53) and now considering 315/418 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 232/285 places, 315/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 315 transitions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 418/418 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 247 transition count 343
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 247 transition count 343
Applied a total of 76 rules in 5 ms. Remains 247 /285 variables (removed 38) and now considering 343/418 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 247/285 places, 343/418 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:34:38] [INFO ] Input system was already deterministic with 343 transitions.
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:34:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:34:38] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 19:34:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 285 places, 418 transitions and 1259 arcs took 2 ms.
Total runtime 16846 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 285 NrTr: 418 NrArc: 1259)

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

net check time: 0m 0.000sec

init dd package: 0m 3.264sec


RS generation: 49m 5.120sec


-> reachability set: #nodes 3749938 (3.7e+06) #states 76,329,077,796 (10)



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

checking: EG [AF [~ [A [1<=p21 U 1<=p230]]]]
normalized: EG [~ [EG [[~ [E [~ [1<=p230] U [~ [1<=p230] & ~ [1<=p21]]]] & ~ [EG [~ [1<=p230]]]]]]]

abstracting: (1<=p230)
states: 986,441,687 (8)
MC time: 0m47.393sec

checking: EX [EX [[EG [p254<=0] & [p154<=0 & EG [[p192<=0 & [p46<=0 | p117<=0]]]]]]]
normalized: EX [EX [[[p154<=0 & EG [[p192<=0 & [p46<=0 | p117<=0]]]] & EG [p254<=0]]]]

abstracting: (p254<=0)
states: 75,321,179,364 (10)
MC time: 0m44.433sec

checking: EG [[p22<=0 | [[1<=p1 & 1<=p108] | [1<=p1 & 1<=p80]]]]
normalized: EG [[p22<=0 | [[1<=p1 & 1<=p80] | [1<=p1 & 1<=p108]]]]

abstracting: (1<=p108)
states: 4,913,470,828 (9)
abstracting: (1<=p1)
states: 1
abstracting: (1<=p80)
states: 4,840,638,434 (9)
abstracting: (1<=p1)
states: 1
abstracting: (p22<=0)
states: 71,381,153,366 (10)
MC time: 0m40.527sec

checking: AG [[p273<=0 | [AX [[1<=p18 & 1<=p37]] & [A [EF [[1<=p1 & 1<=p2]] U p195<=0] & [AF [1<=p146] | 1<=p230]]]]]
normalized: ~ [E [true U ~ [[p273<=0 | [[[1<=p230 | ~ [EG [~ [1<=p146]]]] & [~ [EG [~ [p195<=0]]] & ~ [E [~ [p195<=0] U [~ [E [true U [1<=p1 & 1<=p2]]] & ~ [p195<=0]]]]]] & ~ [EX [~ [[1<=p18 & 1<=p37]]]]]]]]]

abstracting: (1<=p37)
states: 4,946,407,842 (9)
abstracting: (1<=p18)
states: 14,925,012,012 (10)
MC time: 0m37.700sec

checking: EX [AX [[~ [E [~ [[1<=p11 & 1<=p125]] U E [[1<=p90 & 1<=p91] U [1<=p59 & 1<=p261]]]] & [p112<=0 | p284<=0]]]]
normalized: EX [~ [EX [~ [[[p112<=0 | p284<=0] & ~ [E [~ [[1<=p11 & 1<=p125]] U E [[1<=p90 & 1<=p91] U [1<=p59 & 1<=p261]]]]]]]]]

abstracting: (1<=p261)
states: 1,010,298,062 (9)
abstracting: (1<=p59)
states: 15,696,798,815 (10)
abstracting: (1<=p91)
states: 4,840,638,406 (9)
abstracting: (1<=p90)
states: 32,151,724,810 (10)
MC time: 0m34.093sec

checking: E [~ [AF [[[1<=p200 & 1<=p32] | AX [1<=p257]]]] U ~ [EF [[[[[[1<=p112 & 1<=p11] | 1<=p127] | ~ [[1<=p37 & 1<=p125]]] & p230<=0] & 1<=p246]]]]
normalized: E [EG [~ [[~ [EX [~ [1<=p257]]] | [1<=p200 & 1<=p32]]]] U ~ [E [true U [1<=p246 & [p230<=0 & [~ [[1<=p37 & 1<=p125]] | [1<=p127 | [1<=p112 & 1<=p11]]]]]]]]

abstracting: (1<=p11)
states: 4,898,748,566 (9)
abstracting: (1<=p112)
states: 16,040,642,586 (10)
abstracting: (1<=p127)
states: 4,860,313,062 (9)
abstracting: (1<=p125)
states: 15,622,694,547 (10)
abstracting: (1<=p37)
states: 4,946,407,842 (9)
abstracting: (p230<=0)
states: 75,342,636,109 (10)
abstracting: (1<=p246)
states: 1,015,811,123 (9)
MC time: 0m32.151sec

checking: [EG [[[EX [EX [1<=p67]] | [EX [1<=p58] & 1<=p58]] | [p104<=0 | p105<=0]]] & [AF [[p112<=0 | p179<=0]] | EX [[EF [[p6<=0 | p169<=0]] & [[1<=p244 | 1<=p281] & 1<=p251]]]]]
normalized: [[EX [[[1<=p251 & [1<=p244 | 1<=p281]] & E [true U [p6<=0 | p169<=0]]]] | ~ [EG [~ [[p112<=0 | p179<=0]]]]] & EG [[[p104<=0 | p105<=0] | [[1<=p58 & EX [1<=p58]] | EX [EX [1<=p67]]]]]]

abstracting: (1<=p67)
states: 4,831,385,564 (9)
MC time: 0m30.309sec

checking: AG [[[AG [AF [[p89<=0 | p112<=0]]] | AG [EF [[p18<=0 | p77<=0]]]] | [[AX [[[1<=p275 & 1<=p0] & [1<=p94 & p124<=0]]] & [1<=p89 & 1<=p125]] | [AX [[1<=p46 & 1<=p259]] & AG [[1<=p77 & 1<=p84]]]]]]
normalized: ~ [E [true U ~ [[[[~ [E [true U ~ [[1<=p77 & 1<=p84]]]] & ~ [EX [~ [[1<=p46 & 1<=p259]]]]] | [[1<=p89 & 1<=p125] & ~ [EX [~ [[[1<=p94 & p124<=0] & [1<=p275 & 1<=p0]]]]]]] | [~ [E [true U ~ [E [true U [p18<=0 | p77<=0]]]]] | ~ [E [true U EG [~ [[p89<=0 | p112<=0]]]]]]]]]]

abstracting: (p112<=0)
states: 60,288,435,210 (10)
abstracting: (p89<=0)
states: 71,488,439,390 (10)
MC time: 0m27.211sec

checking: EG [AF [[AF [[EF [1<=p227] & [[1<=p46 & 1<=p217] | 1<=p208]]] & [[EG [[[1<=p0 & 1<=p80] | 1<=p82]] | EF [[1<=p125 & 1<=p151]]] | [[1<=p6 & 1<=p226] | [1<=p219 & [1<=p23 & 1<=p112]]]]]]]
normalized: EG [~ [EG [~ [[[[[1<=p219 & [1<=p23 & 1<=p112]] | [1<=p6 & 1<=p226]] | [E [true U [1<=p125 & 1<=p151]] | EG [[1<=p82 | [1<=p0 & 1<=p80]]]]] & ~ [EG [~ [[[1<=p208 | [1<=p46 & 1<=p217]] & E [true U 1<=p227]]]]]]]]]]

abstracting: (1<=p227)
states: 976,931,863 (8)
MC time: 0m25.115sec

checking: EF [[~ [E [[E [[1<=p32 & 1<=p229] U [1<=p32 & 1<=p77]] & [1<=p32 & 1<=p89]] U E [EX [[1<=p84 & 1<=p130]] U EF [1<=p241]]]] | [~ [A [~ [[1<=p46 & 1<=p103]] U AF [1<=p212]]] & [~ [A [A [[1<=p59 & 1<=p130] U [1<=p72 & 1<=p143]] U E [[1<=p72 & 1<=p263] U 1<=p48]]] & p277<=0]]]]
normalized: E [true U [[[p277<=0 & ~ [[~ [EG [~ [E [[1<=p72 & 1<=p263] U 1<=p48]]]] & ~ [E [~ [E [[1<=p72 & 1<=p263] U 1<=p48]] U [~ [[~ [EG [~ [[1<=p72 & 1<=p143]]]] & ~ [E [~ [[1<=p72 & 1<=p143]] U [~ [[1<=p59 & 1<=p130]] & ~ [[1<=p72 & 1<=p143]]]]]]] & ~ [E [[1<=p72 & 1<=p263] U 1<=p48]]]]]]]] & ~ [[~ [EG [EG [~ [1<=p212]]]] & ~ [E [EG [~ [1<=p212]] U [[1<=p46 & 1<=p103] & EG [~ [1<=p212]]]]]]]] | ~ [E [[[1<=p32 & 1<=p89] & E [[1<=p32 & 1<=p229] U [1<=p32 & 1<=p77]]] U E [EX [[1<=p84 & 1<=p130]] U E [true U 1<=p241]]]]]]

abstracting: (1<=p241)
states: 1,013,944,431 (9)
MC time: 0m24.125sec

checking: A [[[~ [[[EX [[1<=p1 & 1<=p42]] | EX [1<=p10]] | [1<=p86 | [~ [[1<=p72 & 1<=p234]] | [1<=p8 & [1<=p131 & 1<=p132]]]]]] & 1<=p32] & [1<=p103 & 1<=p73]] U A [[EG [[EX [~ [[p72<=0 | p175<=0]]] | p197<=0]] | [EF [p203<=0] & [EX [[1<=p1 & 1<=p121]] | [1<=p199 | 1<=p214]]]] U [EX [[AG [1<=p9] | [1<=p161 | [1<=p98 & 1<=p235]]]] & AF [1<=p177]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]] U [~ [[[[[1<=p199 | 1<=p214] | EX [[1<=p1 & 1<=p121]]] & E [true U p203<=0]] | EG [[p197<=0 | EX [~ [[p72<=0 | p175<=0]]]]]]] & ~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]] U [~ [[[[[1<=p199 | 1<=p214] | EX [[1<=p1 & 1<=p121]]] & E [true U p203<=0]] | EG [[p197<=0 | EX [~ [[p72<=0 | p175<=0]]]]]]] & ~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]]]]]]] U [~ [[[1<=p103 & 1<=p73] & [1<=p32 & ~ [[[1<=p86 | [[1<=p8 & [1<=p131 & 1<=p132]] | ~ [[1<=p72 & 1<=p234]]]] | [EX [1<=p10] | EX [[1<=p1 & 1<=p42]]]]]]]] & ~ [[~ [EG [~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]] U [~ [[[[[1<=p199 | 1<=p214] | EX [[1<=p1 & 1<=p121]]] & E [true U p203<=0]] | EG [[p197<=0 | EX [~ [[p72<=0 | p175<=0]]]]]]] & ~ [[~ [EG [~ [1<=p177]]] & EX [[[1<=p161 | [1<=p98 & 1<=p235]] | ~ [E [true U ~ [1<=p9]]]]]]]]]]]]]]]]

abstracting: (1<=p9)
states: 4,898,748,566 (9)
MC time: 0m22.550sec

checking: [A [[EF [EX [EG [1<=p159]]] | A [E [[1<=p38 & [1<=p39 & 1<=p150]] U [1<=p32 & 1<=p155]] U A [[1<=p32 & [1<=p137 & 1<=p126]] U [[1<=p89 & 1<=p112] & [1<=p72 & 1<=p130]]]]] U [[EG [[AG [[1<=p32 & 1<=p130]] | [1<=p77 & [1<=p125 & 1<=p27]]]] & 1<=p11] & [1<=p32 & [1<=p264 & [1<=p148 | [[1<=p18 & 1<=p242] & [1<=p163 & p257<=0]]]]]]] & EG [[AG [EX [p279<=0]] | [1<=p22 | 1<=p266]]]]
normalized: [EG [[[1<=p22 | 1<=p266] | ~ [E [true U ~ [EX [p279<=0]]]]]] & [~ [EG [~ [[[1<=p32 & [1<=p264 & [1<=p148 | [[1<=p163 & p257<=0] & [1<=p18 & 1<=p242]]]]] & [1<=p11 & EG [[[1<=p77 & [1<=p125 & 1<=p27]] | ~ [E [true U ~ [[1<=p32 & 1<=p130]]]]]]]]]]] & ~ [E [~ [[[1<=p32 & [1<=p264 & [1<=p148 | [[1<=p163 & p257<=0] & [1<=p18 & 1<=p242]]]]] & [1<=p11 & EG [[[1<=p77 & [1<=p125 & 1<=p27]] | ~ [E [true U ~ [[1<=p32 & 1<=p130]]]]]]]]] U [~ [[[~ [EG [~ [[~ [EG [~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]]]] & ~ [E [~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]] U [~ [[1<=p32 & [1<=p137 & 1<=p126]]] & ~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]]]] & ~ [E [~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]] U [~ [[1<=p32 & [1<=p137 & 1<=p126]]] & ~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]]]]]]] U [~ [E [[1<=p38 & [1<=p39 & 1<=p150]] U [1<=p32 & 1<=p155]]] & ~ [[~ [EG [~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]]]] & ~ [E [~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]] U [~ [[1<=p32 & [1<=p137 & 1<=p126]]] & ~ [[[1<=p72 & 1<=p130] & [1<=p89 & 1<=p112]]]]]]]]]]]] | E [true U EX [EG [1<=p159]]]]] & ~ [[[1<=p32 & [1<=p264 & [1<=p148 | [[1<=p163 & p257<=0] & [1<=p18 & 1<=p242]]]]] & [1<=p11 & EG [[[1<=p77 & [1<=p125 & 1<=p27]] | ~ [E [true U ~ [[1<=p32 & 1<=p130]]]]]]]]]]]]]]

abstracting: (1<=p130)
states: 4,860,313,062 (9)
abstracting: (1<=p32)
states: 14,073,496,750 (10)
MC time: 0m22.230sec

checking: [EF [[A [~ [E [1<=p45 U 1<=p190]] U [[1<=p47 & 1<=p283] | [1<=p57 & [1<=p46 & 1<=p274]]]] & [[p0<=0 | p2<=0] & [E [AG [1<=p236] U [[1<=p98 & [1<=p222 & 1<=p269]] | [1<=p210 & 1<=p260]]] | [[AF [[1<=p111 | 1<=p246]] & [p262<=0 | [p37<=0 | p84<=0]]] & [p214<=0 & p224<=0]]]]]] | [AX [EG [p20<=0]] & [AF [~ [A [A [1<=p99 U [1<=p84 & 1<=p145]] U [1<=p249 | [1<=p32 & 1<=p272]]]]] | [~ [E [[EF [[1<=p6 & 1<=p270]] | [1<=p33 | 1<=p129]] U ~ [[1<=p1 & 1<=p108]]]] & ~ [A [A [[1<=p24 & 1<=p26] U 1<=p257] U [AF [1<=p95] & [1<=p221 | 1<=p34]]]]]]]]
normalized: [[[[~ [[~ [EG [~ [[[1<=p221 | 1<=p34] & ~ [EG [~ [1<=p95]]]]]]] & ~ [E [~ [[[1<=p221 | 1<=p34] & ~ [EG [~ [1<=p95]]]]] U [~ [[~ [EG [~ [1<=p257]]] & ~ [E [~ [1<=p257] U [~ [[1<=p24 & 1<=p26]] & ~ [1<=p257]]]]]] & ~ [[[1<=p221 | 1<=p34] & ~ [EG [~ [1<=p95]]]]]]]]]] & ~ [E [[[1<=p33 | 1<=p129] | E [true U [1<=p6 & 1<=p270]]] U ~ [[1<=p1 & 1<=p108]]]]] | ~ [EG [[~ [EG [~ [[1<=p249 | [1<=p32 & 1<=p272]]]]] & ~ [E [~ [[1<=p249 | [1<=p32 & 1<=p272]]] U [~ [[~ [EG [~ [[1<=p84 & 1<=p145]]]] & ~ [E [~ [[1<=p84 & 1<=p145]] U [~ [1<=p99] & ~ [[1<=p84 & 1<=p145]]]]]]] & ~ [[1<=p249 | [1<=p32 & 1<=p272]]]]]]]]]] & ~ [EX [~ [EG [p20<=0]]]]] | E [true U [[[[[p214<=0 & p224<=0] & [[p262<=0 | [p37<=0 | p84<=0]] & ~ [EG [~ [[1<=p111 | 1<=p246]]]]]] | E [~ [E [true U ~ [1<=p236]]] U [[1<=p210 & 1<=p260] | [1<=p98 & [1<=p222 & 1<=p269]]]]] & [p0<=0 | p2<=0]] & [~ [EG [~ [[[1<=p57 & [1<=p46 & 1<=p274]] | [1<=p47 & 1<=p283]]]]] & ~ [E [~ [[[1<=p57 & [1<=p46 & 1<=p274]] | [1<=p47 & 1<=p283]]] U [E [1<=p45 U 1<=p190] & ~ [[[1<=p57 & [1<=p46 & 1<=p274]] | [1<=p47 & 1<=p283]]]]]]]]]]

abstracting: (1<=p283)
states: 999,904,241 (8)
abstracting: (1<=p47)
states: 4,915,443,577 (9)
abstracting: (1<=p274)
states: 1,018,236,905 (9)
abstracting: (1<=p46)
states: 15,953,113,753 (10)
abstracting: (1<=p57)
states: 1
abstracting: (1<=p190)
states: 1,004,706,486 (9)
abstracting: (1<=p45)
states: 1
MC time: 0m19.045sec

checking: E [[AX [AG [AF [1<=p183]]] & [EF [EX [[1<=p131 & 1<=p133]]] | [AX [EG [[1<=p1 & 1<=p94]]] & [1<=p63 & [AG [1<=p230] | [A [[1<=p0 & 1<=p108] U 1<=p216] & [1<=p192 | 1<=p159]]]]]]] U [[[E [A [1<=p74 U 1<=p185] U E [1<=p230 U [1<=p112 & 1<=p149]]] & EX [AF [[1<=p18 & 1<=p171]]]] & [1<=p99 & 1<=p15]] | [[[AF [EG [[1<=p125 & 1<=p151]]] & 1<=p18] & [1<=p89 & [A [1<=p275 U [1<=p32 & 1<=p243]] | E [[1<=p32 & 1<=p200] U 1<=p74]]]] | [EF [[A [[1<=p37 & 1<=p125] U 1<=p174] | [[1<=p89 & 1<=p125] & [1<=p24 & 1<=p26]]]] & A [AF [1<=p260] U [[1<=p62 & 1<=p69] | [[1<=p24 & 1<=p25] & [1<=p6 & 1<=p37]]]]]]]]
normalized: E [[~ [EX [E [true U EG [~ [1<=p183]]]]] & [[[1<=p63 & [[[1<=p192 | 1<=p159] & [~ [EG [~ [1<=p216]]] & ~ [E [~ [1<=p216] U [~ [[1<=p0 & 1<=p108]] & ~ [1<=p216]]]]]] | ~ [E [true U ~ [1<=p230]]]]] & ~ [EX [~ [EG [[1<=p1 & 1<=p94]]]]]] | E [true U EX [[1<=p131 & 1<=p133]]]]] U [[[[~ [EG [~ [[[[1<=p6 & 1<=p37] & [1<=p24 & 1<=p25]] | [1<=p62 & 1<=p69]]]]] & ~ [E [~ [[[[1<=p6 & 1<=p37] & [1<=p24 & 1<=p25]] | [1<=p62 & 1<=p69]]] U [EG [~ [1<=p260]] & ~ [[[[1<=p6 & 1<=p37] & [1<=p24 & 1<=p25]] | [1<=p62 & 1<=p69]]]]]]] & E [true U [[[1<=p24 & 1<=p26] & [1<=p89 & 1<=p125]] | [~ [EG [~ [1<=p174]]] & ~ [E [~ [1<=p174] U [~ [[1<=p37 & 1<=p125]] & ~ [1<=p174]]]]]]]] | [[1<=p89 & [E [[1<=p32 & 1<=p200] U 1<=p74] | [~ [EG [~ [[1<=p32 & 1<=p243]]]] & ~ [E [~ [[1<=p32 & 1<=p243]] U [~ [1<=p275] & ~ [[1<=p32 & 1<=p243]]]]]]]] & [1<=p18 & ~ [EG [~ [EG [[1<=p125 & 1<=p151]]]]]]]] | [[1<=p99 & 1<=p15] & [EX [~ [EG [~ [[1<=p18 & 1<=p171]]]]] & E [[~ [EG [~ [1<=p185]]] & ~ [E [~ [1<=p185] U [~ [1<=p74] & ~ [1<=p185]]]]] U E [1<=p230 U [1<=p112 & 1<=p149]]]]]]]

abstracting: (1<=p149)
states: 1,039,726,322 (9)
abstracting: (1<=p112)
states: 16,040,642,586 (10)
abstracting: (1<=p230)
states: 986,441,687 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6108168 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101628 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

3779309
iterations count:102789 (245), effective:1374 (3)

initing FirstDep: 0m 0.001sec


net_ddint.h:600: Timeout: after 45 sec


net_ddint.h:600: Timeout: after 42 sec


net_ddint.h:600: Timeout: after 39 sec


net_ddint.h:600: Timeout: after 36 sec


sat_reach.icc:155: Timeout: after 33 sec


sat_reach.icc:155: Timeout: after 31 sec


net_ddint.h:600: Timeout: after 29 sec


net_ddint.h:600: Timeout: after 26 sec


sat_reach.icc:155: Timeout: after 24 sec


sat_reach.icc:155: Timeout: after 23 sec


sat_reach.icc:155: Timeout: after 21 sec


sat_reach.icc:155: Timeout: after 19 sec


sat_reach.icc:155: Timeout: after 18 sec


sat_reach.icc:155: Timeout: after 16 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="CANConstruction-PT-010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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