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.r394-oct2-167903718000554.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 20:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 20:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 20:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 37K 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 ShieldPPPt-PT-002B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679523407633

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=ShieldPPPt-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:16:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:16:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:16:50] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-22 22:16:50] [INFO ] Transformed 159 places.
[2023-03-22 22:16:50] [INFO ] Transformed 145 transitions.
[2023-03-22 22:16:50] [INFO ] Found NUPN structural information;
[2023-03-22 22:16:50] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 110 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 144
Applied a total of 2 rules in 21 ms. Remains 158 /159 variables (removed 1) and now considering 144/145 (removed 1) transitions.
// Phase 1: matrix 144 rows 158 cols
[2023-03-22 22:16:50] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-22 22:16:51] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-22 22:16:51] [INFO ] Invariant cache hit.
[2023-03-22 22:16:51] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-03-22 22:16:51] [INFO ] Invariant cache hit.
[2023-03-22 22:16:52] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/159 places, 144/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1253 ms. Remains : 158/159 places, 144/145 transitions.
Support contains 110 out of 158 places after structural reductions.
[2023-03-22 22:16:52] [INFO ] Flatten gal took : 43 ms
[2023-03-22 22:16:52] [INFO ] Flatten gal took : 12 ms
[2023-03-22 22:16:52] [INFO ] Input system was already deterministic with 144 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 99) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-22 22:16:53] [INFO ] Invariant cache hit.
[2023-03-22 22:16:53] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-22 22:16:53] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-22 22:16:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-22 22:16:53] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 6 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-22 22:16:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 558 ms
[2023-03-22 22:16:53] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-22 22:16:54] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 144/144 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 158 transition count 106
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 40 rules applied. Total rules applied 78 place count 120 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 119 transition count 104
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 79 place count 119 transition count 96
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 95 place count 111 transition count 96
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 109 place count 97 transition count 82
Iterating global reduction 3 with 14 rules applied. Total rules applied 123 place count 97 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 123 place count 97 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 90 transition count 75
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 197 place count 60 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
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 207 place count 55 transition count 45
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 55 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 54 transition count 44
Applied a total of 214 rules in 40 ms. Remains 54 /158 variables (removed 104) and now considering 44/144 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 54/158 places, 44/144 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1806822 steps, run timeout after 3058 ms. (steps per millisecond=590 ) properties seen :{}
Probabilistic random walk after 1806822 steps, saw 898382 distinct states, run finished after 3060 ms. (steps per millisecond=590 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 54 cols
[2023-03-22 22:16:57] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-22 22:16:57] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2023-03-22 22:16:57] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:16:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-22 22:16:57] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:16:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 22:16:57] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:16:57] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 22:16:57] [INFO ] After 55ms 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 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 54/54 places, 44/44 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-22 22:16:57] [INFO ] Invariant cache hit.
[2023-03-22 22:16:57] [INFO ] Implicit Places using invariants in 152 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 44/44 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 53 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 42
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 51 cols
[2023-03-22 22:16:57] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-22 22:16:57] [INFO ] Implicit Places using invariants in 41 ms returned [34, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/54 places, 42/44 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 40
Applied a total of 4 rules in 3 ms. Remains 47 /49 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 47 cols
[2023-03-22 22:16:57] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-22 22:16:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 22:16:57] [INFO ] Invariant cache hit.
[2023-03-22 22:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 22:16:57] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 47/54 places, 40/44 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 317 ms. Remains : 47/54 places, 40/44 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2173958 steps, run timeout after 3032 ms. (steps per millisecond=717 ) properties seen :{}
Probabilistic random walk after 2173958 steps, saw 861426 distinct states, run finished after 3033 ms. (steps per millisecond=716 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:17:00] [INFO ] Invariant cache hit.
[2023-03-22 22:17:00] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-22 22:17:00] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 22:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 22:17:00] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 22:17:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-22 22:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-22 22:17:00] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:17:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:17:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-22 22:17:00] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:17:00] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:17:00] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-22 22:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 22:17:00] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 22:17:00] [INFO ] After 170ms 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 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 47/47 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-22 22:17:01] [INFO ] Invariant cache hit.
[2023-03-22 22:17:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-22 22:17:01] [INFO ] Invariant cache hit.
[2023-03-22 22:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 22:17:01] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-22 22:17:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 22:17:01] [INFO ] Invariant cache hit.
[2023-03-22 22:17:01] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 47/47 places, 40/40 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 47 transition count 40
Applied a total of 11 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 47 cols
[2023-03-22 22:17:01] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 22:17:01] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-22 22:17:01] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:17:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-22 22:17:01] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:17:01] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 22:17:01] [INFO ] After 6ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:17:01] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-22 22:17:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-22 22:17:01] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 22:17:01] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 11 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 144 transitions.
Support contains 105 out of 158 places (down from 107) after GAL structural reductions.
Computed a total of 39 stabilizing places and 39 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 143 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 142 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 142 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 141 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 141 transition count 127
Applied a total of 34 rules in 17 ms. Remains 141 /158 variables (removed 17) and now considering 127/144 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 141/158 places, 127/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 143 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 143 transition count 129
Applied a total of 30 rules in 5 ms. Remains 143 /158 variables (removed 15) and now considering 129/144 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 143/158 places, 129/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 137 transition count 123
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 135 transition count 121
Applied a total of 46 rules in 8 ms. Remains 135 /158 variables (removed 23) and now considering 121/144 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 135/158 places, 121/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 157 transition count 110
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 35 rules applied. Total rules applied 68 place count 124 transition count 108
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 123 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 122 transition count 107
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 71 place count 122 transition count 97
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 91 place count 112 transition count 97
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 106 place count 97 transition count 82
Iterating global reduction 4 with 15 rules applied. Total rules applied 121 place count 97 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 121 place count 97 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 133 place count 91 transition count 76
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 181 place count 67 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 65 transition count 50
Applied a total of 183 rules in 15 ms. Remains 65 /158 variables (removed 93) and now considering 50/144 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 65/158 places, 50/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Applied a total of 42 rules in 7 ms. Remains 137 /158 variables (removed 21) and now considering 123/144 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 137/158 places, 123/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 107
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 38 rules applied. Total rules applied 74 place count 121 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 120 transition count 105
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 75 place count 120 transition count 96
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 93 place count 111 transition count 96
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 108 place count 96 transition count 81
Iterating global reduction 3 with 15 rules applied. Total rules applied 123 place count 96 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 123 place count 96 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 89 transition count 74
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 191 place count 62 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 60 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 59 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 194 place count 59 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 57 transition count 43
Applied a total of 198 rules in 27 ms. Remains 57 /158 variables (removed 101) and now considering 43/144 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 57/158 places, 43/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 15 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 43 transitions.
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
FORMULA ShieldPPPt-PT-002B-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 140 transition count 126
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 140 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 139 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Applied a total of 40 rules in 6 ms. Remains 138 /158 variables (removed 20) and now considering 124/144 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 138/158 places, 124/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 138 transition count 124
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 136 transition count 122
Applied a total of 44 rules in 7 ms. Remains 136 /158 variables (removed 22) and now considering 122/144 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 136/158 places, 122/144 transitions.
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:01] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:01] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 144 transition count 130
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 144 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 143 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 142 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 142 transition count 128
Applied a total of 32 rules in 5 ms. Remains 142 /158 variables (removed 16) and now considering 128/144 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 142/158 places, 128/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 157 transition count 105
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 40 rules applied. Total rules applied 78 place count 119 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 118 transition count 103
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 79 place count 118 transition count 95
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 95 place count 110 transition count 95
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 109 place count 96 transition count 81
Iterating global reduction 3 with 14 rules applied. Total rules applied 123 place count 96 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 123 place count 96 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 89 transition count 74
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 195 place count 60 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 60 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 58 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 57 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 199 place count 57 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 55 transition count 41
Applied a total of 203 rules in 14 ms. Remains 55 /158 variables (removed 103) and now considering 41/144 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 55/158 places, 41/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Applied a total of 42 rules in 7 ms. Remains 137 /158 variables (removed 21) and now considering 123/144 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 137/158 places, 123/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 141 transition count 127
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 141 transition count 127
Applied a total of 34 rules in 4 ms. Remains 141 /158 variables (removed 17) and now considering 127/144 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 141/158 places, 127/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Applied a total of 42 rules in 21 ms. Remains 137 /158 variables (removed 21) and now considering 123/144 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 137/158 places, 123/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 18 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Applied a total of 40 rules in 4 ms. Remains 138 /158 variables (removed 20) and now considering 124/144 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 138/158 places, 124/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 18 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Applied a total of 38 rules in 3 ms. Remains 139 /158 variables (removed 19) and now considering 125/144 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 139/158 places, 125/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 10 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 138 transition count 124
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 136 transition count 122
Applied a total of 44 rules in 6 ms. Remains 136 /158 variables (removed 22) and now considering 122/144 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 136/158 places, 122/144 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:17:02] [INFO ] Input system was already deterministic with 122 transitions.
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:17:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:17:02] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 22:17:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 144 transitions and 360 arcs took 1 ms.
Total runtime 11701 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: 158 NrTr: 144 NrArc: 360)

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

net check time: 0m 0.000sec

init dd package: 0m 3.113sec


RS generation: 0m 4.290sec


-> reachability set: #nodes 107016 (1.1e+05) #states 100,165,007,865,845 (14)



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

checking: EF [AG [[p53<=0 & 0<=p53]]]
normalized: E [true U ~ [E [true U ~ [[p53<=0 & 0<=p53]]]]]

abstracting: (0<=p53)
states: 100,165,007,865,845 (14)
abstracting: (p53<=0)
states: 86,534,487,643,759 (13)
-> the formula is TRUE

FORMULA ShieldPPPt-PT-002B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.255sec

checking: AX [E [[p58<=1 & 1<=p58] U EF [[p61<=1 & 1<=p61]]]]
normalized: ~ [EX [~ [E [[p58<=1 & 1<=p58] U E [true U [p61<=1 & 1<=p61]]]]]]

abstracting: (1<=p61)
states: 11,233,295,283,562 (13)
abstracting: (p61<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p58)
states: 1,443,694,114,702 (12)
abstracting: (p58<=1)
states: 100,165,007,865,845 (14)
.-> the formula is TRUE

FORMULA ShieldPPPt-PT-002B-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.678sec

checking: AG [[[p39<=0 & 0<=p39] & EF [~ [A [[p8<=1 & 1<=p8] U AX [[p47<=1 & 1<=p47]]]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [[~ [EG [EX [~ [[p47<=1 & 1<=p47]]]]] & ~ [E [EX [~ [[p47<=1 & 1<=p47]]] U [~ [[p8<=1 & 1<=p8]] & EX [~ [[p47<=1 & 1<=p47]]]]]]]]] & [p39<=0 & 0<=p39]]]]]

abstracting: (0<=p39)
states: 100,165,007,865,845 (14)
abstracting: (p39<=0)
states: 89,045,528,202,625 (13)
abstracting: (1<=p47)
states: 342,840,593,238 (11)
abstracting: (p47<=1)
states: 100,165,007,865,845 (14)
.abstracting: (1<=p8)
states: 7,778,196 (6)
abstracting: (p8<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p47)
states: 342,840,593,238 (11)
abstracting: (p47<=1)
states: 100,165,007,865,845 (14)
.abstracting: (1<=p47)
states: 342,840,593,238 (11)
abstracting: (p47<=1)
states: 100,165,007,865,845 (14)
.......................................................................
before gc: list nodes free: 1089577

after gc: idd nodes used:1037222, unused:62962778; list nodes free:286725006
......................................................................................................................
EG iterations: 188
-> the formula is FALSE

FORMULA ShieldPPPt-PT-002B-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m40.771sec

checking: AG [[[p89<=0 & 0<=p89] | [AX [EX [[p1<=0 & 0<=p1]]] & AF [[[p73<=1 & 1<=p73] & [p44<=1 & 1<=p44]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[[p44<=1 & 1<=p44] & [p73<=1 & 1<=p73]]]]] & ~ [EX [~ [EX [[p1<=0 & 0<=p1]]]]]] | [p89<=0 & 0<=p89]]]]]

abstracting: (0<=p89)
states: 100,165,007,865,845 (14)
abstracting: (p89<=0)
states: 98,189,157,619,093 (13)
abstracting: (0<=p1)
states: 100,165,007,865,845 (14)
abstracting: (p1<=0)
states: 100,165,007,217,662 (14)
..abstracting: (1<=p73)
states: 11,205,890,444,060 (13)
abstracting: (p73<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p44)
states: 11,119,479,663,220 (13)
abstracting: (p44<=1)
states: 100,165,007,865,845 (14)

before gc: list nodes free: 1240792

after gc: idd nodes used:427872, unused:63572128; list nodes free:289558053
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldPPPt-PT-002B-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.621sec

checking: EX [EF [[[[p13<=1 & 1<=p13] & [p75<=1 & 1<=p75]] | [AX [[[p137<=1 & 1<=p137] & [p14<=1 & 1<=p14]]] & [p73<=1 & 1<=p73]]]]]
normalized: EX [E [true U [[[p73<=1 & 1<=p73] & ~ [EX [~ [[[p14<=1 & 1<=p14] & [p137<=1 & 1<=p137]]]]]] | [[p75<=1 & 1<=p75] & [p13<=1 & 1<=p13]]]]]

abstracting: (1<=p13)
states: 33,192,356,790,443 (13)
abstracting: (p13<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p75)
states: 11,205,890,444,060 (13)
abstracting: (p75<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p137)
states: 9,927,684,500,192 (12)
abstracting: (p137<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p14)
states: 31,808,212,271,411 (13)
abstracting: (p14<=1)
states: 100,165,007,865,845 (14)
.abstracting: (1<=p73)
states: 11,205,890,444,060 (13)
abstracting: (p73<=1)
states: 100,165,007,865,845 (14)
.-> the formula is TRUE

FORMULA ShieldPPPt-PT-002B-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.323sec

checking: AF [[AX [[[p119<=0 & 0<=p119] & [[p143<=1 & 1<=p143] & [[p157<=0 & 0<=p157] | [p137<=0 & 0<=p137]]]]] & AG [[p88<=0 & 0<=p88]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[p88<=0 & 0<=p88]]]] & ~ [EX [~ [[[[[p137<=0 & 0<=p137] | [p157<=0 & 0<=p157]] & [p143<=1 & 1<=p143]] & [p119<=0 & 0<=p119]]]]]]]]]

abstracting: (0<=p119)
states: 100,165,007,865,845 (14)
abstracting: (p119<=0)
states: 89,909,398,698,501 (13)
abstracting: (1<=p143)
states: 11,280,864,109,248 (13)
abstracting: (p143<=1)
states: 100,165,007,865,845 (14)
abstracting: (0<=p157)
states: 100,165,007,865,845 (14)
abstracting: (p157<=0)
states: 100,164,639,496,683 (14)
abstracting: (0<=p137)
states: 100,165,007,865,845 (14)
abstracting: (p137<=0)
states: 90,237,323,365,653 (13)
.abstracting: (0<=p88)
states: 100,165,007,865,845 (14)
abstracting: (p88<=0)
states: 100,064,223,152,853 (14)
.......................................................................................................
before gc: list nodes free: 1072719

after gc: idd nodes used:1240460, unused:62759540; list nodes free:285797627
.....................................................................................
EG iterations: 188
-> the formula is FALSE

FORMULA ShieldPPPt-PT-002B-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m26.685sec

checking: EG [AX [[EG [[p126<=0 & 0<=p126]] & [EX [[[p13<=0 & 0<=p13] | [p75<=0 & 0<=p75]]] & [EF [[p53<=1 & 1<=p53]] | AX [[[p19<=0 & 0<=p19] | [p46<=0 & 0<=p46]]]]]]]]
normalized: EG [~ [EX [~ [[[[~ [EX [~ [[[p46<=0 & 0<=p46] | [p19<=0 & 0<=p19]]]]] | E [true U [p53<=1 & 1<=p53]]] & EX [[[p75<=0 & 0<=p75] | [p13<=0 & 0<=p13]]]] & EG [[p126<=0 & 0<=p126]]]]]]]

abstracting: (0<=p126)
states: 100,165,007,865,845 (14)
abstracting: (p126<=0)
states: 98,595,231,187,189 (13)
...............................
EG iterations: 31
abstracting: (0<=p13)
states: 100,165,007,865,845 (14)
abstracting: (p13<=0)
states: 66,972,651,075,402 (13)
abstracting: (0<=p75)
states: 100,165,007,865,845 (14)
abstracting: (p75<=0)
states: 88,959,117,421,785 (13)
.abstracting: (1<=p53)
states: 13,630,520,222,086 (13)
abstracting: (p53<=1)
states: 100,165,007,865,845 (14)
abstracting: (0<=p19)
states: 100,165,007,865,845 (14)
abstracting: (p19<=0)
states: 72,732,292,102,207 (13)
abstracting: (0<=p46)
states: 100,165,007,865,845 (14)
abstracting: (p46<=0)
states: 89,041,971,526,379 (13)
...................................
before gc: list nodes free: 159941

after gc: idd nodes used:1121482, unused:62878518; list nodes free:286378978
...........................................................................................
before gc: list nodes free: 849516

after gc: idd nodes used:815379, unused:63184621; list nodes free:287816883
.................................
EG iterations: 157
-> the formula is FALSE

FORMULA ShieldPPPt-PT-002B-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m59.836sec

checking: AF [EX [[AX [[E [[[p41<=1 & 1<=p41] & [p100<=1 & 1<=p100]] U [p139<=1 & 1<=p139]] & [[p13<=1 & 1<=p13] & [p75<=1 & 1<=p75]]]] & [p150<=1 & 1<=p150]]]]
normalized: ~ [EG [~ [EX [[[p150<=1 & 1<=p150] & ~ [EX [~ [[[[p75<=1 & 1<=p75] & [p13<=1 & 1<=p13]] & E [[[p100<=1 & 1<=p100] & [p41<=1 & 1<=p41]] U [p139<=1 & 1<=p139]]]]]]]]]]]

abstracting: (1<=p139)
states: 11,280,182,444,934 (13)
abstracting: (p139<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p41)
states: 11,119,479,663,220 (13)
abstracting: (p41<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p100)
states: 15,822,015,156,072 (13)
abstracting: (p100<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p13)
states: 33,192,356,790,443 (13)
abstracting: (p13<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p75)
states: 11,205,890,444,060 (13)
abstracting: (p75<=1)
states: 100,165,007,865,845 (14)
.abstracting: (1<=p150)
states: 10,813,696,431,690 (13)
abstracting: (p150<=1)
states: 100,165,007,865,845 (14)
.
EG iterations: 0
-> the formula is FALSE

FORMULA ShieldPPPt-PT-002B-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.788sec

checking: AX [EX [AF [[E [[p51<=1 & 1<=p51] U [p3<=1 & 1<=p3]] | [E [[p84<=1 & 1<=p84] U [p69<=1 & 1<=p69]] | [[p125<=1 & 1<=p125] & [p54<=1 & 1<=p54]]]]]]]
normalized: ~ [EX [~ [EX [~ [EG [~ [[[[[p54<=1 & 1<=p54] & [p125<=1 & 1<=p125]] | E [[p84<=1 & 1<=p84] U [p69<=1 & 1<=p69]]] | E [[p51<=1 & 1<=p51] U [p3<=1 & 1<=p3]]]]]]]]]]

abstracting: (1<=p3)
states: 33,334,680,031,349 (13)
abstracting: (p3<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p51)
states: 13,571,357,609,313 (13)
abstracting: (p51<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p69)
states: 845,380,489 (8)
abstracting: (p69<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p84)
states: 2,502 (3)
abstracting: (p84<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p125)
states: 2,833,597,356,284 (12)
abstracting: (p125<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p54)
states: 13,630,520,222,086 (13)
abstracting: (p54<=1)
states: 100,165,007,865,845 (14)
.................................................
before gc: list nodes free: 1241993

after gc: idd nodes used:2207934, unused:61792066; list nodes free:285603425
......................
before gc: list nodes free: 870563

after gc: idd nodes used:2942580, unused:61057420; list nodes free:284353851
..............
before gc: list nodes free: 289114

after gc: idd nodes used:4640918, unused:59359082; list nodes free:276169613
............
before gc: list nodes free: 1744979

after gc: idd nodes used:4426050, unused:59573950; list nodes free:279317246
.MC time: 7m39.575sec

checking: AG [[[AG [[p91<=0 & 0<=p91]] | AF [[[p28<=0 & 0<=p28] | [p80<=0 & 0<=p80]]]] | [[p18<=1 & 1<=p18] | [[p105<=1 & 1<=p105] & [[p156<=1 & 1<=p156] & [p125<=1 & 1<=p125]]]]]]
normalized: ~ [E [true U ~ [[[[[[p125<=1 & 1<=p125] & [p156<=1 & 1<=p156]] & [p105<=1 & 1<=p105]] | [p18<=1 & 1<=p18]] | [~ [EG [~ [[[p80<=0 & 0<=p80] | [p28<=0 & 0<=p28]]]]] | ~ [E [true U ~ [[p91<=0 & 0<=p91]]]]]]]]]

abstracting: (0<=p91)
states: 100,165,007,865,845 (14)
abstracting: (p91<=0)
states: 68,511,197,697,481 (13)
abstracting: (0<=p28)
states: 100,165,007,865,845 (14)
abstracting: (p28<=0)
states: 71,580,077,780,256 (13)
abstracting: (0<=p80)
states: 100,165,007,865,845 (14)
abstracting: (p80<=0)
states: 88,955,562,686,988 (13)
.......................................................................................
before gc: list nodes free: 7255564

after gc: idd nodes used:1724467, unused:62275533; list nodes free:292086330
................................................................................
before gc: list nodes free: 8350293

after gc: idd nodes used:1057776, unused:62942224; list nodes free:295142061
...........................................................................................................................
EG iterations: 290
abstracting: (1<=p18)
states: 13,727,342,404,321 (13)
abstracting: (p18<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p105)
states: 27,985,945,481,340 (13)
abstracting: (p105<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p156)
states: 11,284,683,066,324 (13)
abstracting: (p156<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p125)
states: 2,833,597,356,284 (12)
abstracting: (p125<=1)
states: 100,165,007,865,845 (14)
-> the formula is FALSE

FORMULA ShieldPPPt-PT-002B-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m35.321sec

checking: [E [~ [[E [[p40<=1 & 1<=p40] U [p118<=1 & 1<=p118]] & ~ [EF [[p25<=1 & 1<=p25]]]]] U E [[[AF [[p1<=1 & 1<=p1]] | [~ [EX [[p143<=1 & 1<=p143]]] | ~ [[p62<=1 & 1<=p62]]]] | [[p130<=1 & 1<=p130] | [[p51<=1 & 1<=p51] | ~ [[p131<=1 & 1<=p131]]]]] U [[p118<=1 & 1<=p118] & [p79<=1 & 1<=p79]]]] | AG [[p154<=0 & 0<=p154]]]
normalized: [~ [E [true U ~ [[p154<=0 & 0<=p154]]]] | E [~ [[~ [E [true U [p25<=1 & 1<=p25]]] & E [[p40<=1 & 1<=p40] U [p118<=1 & 1<=p118]]]] U E [[[[~ [[p131<=1 & 1<=p131]] | [p51<=1 & 1<=p51]] | [p130<=1 & 1<=p130]] | [[~ [[p62<=1 & 1<=p62]] | ~ [EX [[p143<=1 & 1<=p143]]]] | ~ [EG [~ [[p1<=1 & 1<=p1]]]]]] U [[p79<=1 & 1<=p79] & [p118<=1 & 1<=p118]]]]]

abstracting: (1<=p118)
states: 10,255,609,167,344 (13)
abstracting: (p118<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p79)
states: 11,123,660,035,789 (13)
abstracting: (p79<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p1)
states: 648,183 (5)
abstracting: (p1<=1)
states: 100,165,007,865,845 (14)
..
EG iterations: 2
abstracting: (1<=p143)
states: 11,280,864,109,248 (13)
abstracting: (p143<=1)
states: 100,165,007,865,845 (14)
.abstracting: (1<=p62)
states: 11,071,600,675,948 (13)
abstracting: (p62<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p130)
states: 13,601,800,505,810 (13)
abstracting: (p130<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p51)
states: 13,571,357,609,313 (13)
abstracting: (p51<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p131)
states: 13,601,800,505,810 (13)
abstracting: (p131<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p118)
states: 10,255,609,167,344 (13)
abstracting: (p118<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p40)
states: 10,877,492,333,824 (13)
abstracting: (p40<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p25)
states: 14,440,609,666,399 (13)
abstracting: (p25<=1)
states: 100,165,007,865,845 (14)

before gc: list nodes free: 9757199

after gc: idd nodes used:938568, unused:63061432; list nodes free:295679811
abstracting: (0<=p154)
states: 100,165,007,865,845 (14)
abstracting: (p154<=0)
states: 88,880,704,952,305 (13)
-> the formula is TRUE

FORMULA ShieldPPPt-PT-002B-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m58.889sec

checking: [AF [[[[EX [AX [[0<=p121 & p121<=0]]] | EX [[p122<=0 & 0<=p122]]] & AX [[p65<=0 & 0<=p65]]] & [EX [[p155<=0 & 0<=p155]] & [[p39<=0 & 0<=p39] & [p59<=0 & 0<=p59]]]]] & EG [[EX [[[p54<=0 & 0<=p54] | [[p91<=0 & 0<=p91] | [[p72<=0 & 0<=p72] & [[p116<=1 & 1<=p116] | [p108<=1 & 1<=p108]]]]]] & [AF [[[p88<=0 & 0<=p88] & [[p4<=0 & 0<=p4] | [p23<=0 & 0<=p23]]]] & [p127<=0 & 0<=p127]]]]]
normalized: [~ [EG [~ [[[~ [EX [~ [[p65<=0 & 0<=p65]]]] & [EX [[p122<=0 & 0<=p122]] | EX [~ [EX [~ [[0<=p121 & p121<=0]]]]]]] & [[[p59<=0 & 0<=p59] & [p39<=0 & 0<=p39]] & EX [[p155<=0 & 0<=p155]]]]]]] & EG [[[[p127<=0 & 0<=p127] & ~ [EG [~ [[[[p23<=0 & 0<=p23] | [p4<=0 & 0<=p4]] & [p88<=0 & 0<=p88]]]]]] & EX [[[[[[p108<=1 & 1<=p108] | [p116<=1 & 1<=p116]] & [p72<=0 & 0<=p72]] | [p91<=0 & 0<=p91]] | [p54<=0 & 0<=p54]]]]]]

abstracting: (0<=p54)
states: 100,165,007,865,845 (14)
abstracting: (p54<=0)
states: 86,534,487,643,759 (13)
abstracting: (0<=p91)
states: 100,165,007,865,845 (14)
abstracting: (p91<=0)
states: 68,511,197,697,481 (13)
abstracting: (0<=p72)
states: 100,165,007,865,845 (14)
abstracting: (p72<=0)
states: 89,126,415,580,354 (13)
abstracting: (1<=p116)
states: 10,255,609,167,344 (13)
abstracting: (p116<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p108)
states: 14,313,208,046,998 (13)
abstracting: (p108<=1)
states: 100,165,007,865,845 (14)
.abstracting: (0<=p88)
states: 100,165,007,865,845 (14)
abstracting: (p88<=0)
states: 100,064,223,152,853 (14)
abstracting: (0<=p4)
states: 100,165,007,865,845 (14)
abstracting: (p4<=0)
states: 66,756,228,525,539 (13)
abstracting: (0<=p23)
states: 100,165,007,865,845 (14)
abstracting: (p23<=0)
states: 85,829,087,132,938 (13)
.........................................................
before gc: list nodes free: 6208545

after gc: idd nodes used:2070018, unused:61929982; list nodes free:290559847
.................................................
before gc: list nodes free: 5631969

after gc: idd nodes used:2110302, unused:61889698; list nodes free:290384299
.....................................................................
before gc: list nodes free: 6271891

after gc: idd nodes used:1827027, unused:62172973; list nodes free:291592029
..............................................
EG iterations: 221
abstracting: (0<=p127)
states: 100,165,007,865,845 (14)
abstracting: (p127<=0)
states: 86,563,207,360,035 (13)
......................................................
before gc: list nodes free: 6473481

after gc: idd nodes used:2468100, unused:61531900; list nodes free:288580617
.MC time: 8m 3.126sec

checking: E [[EG [AF [~ [[[p59<=1 & 1<=p59] | [p155<=1 & 1<=p155]]]]] & AG [EF [[p139<=1 & 1<=p139]]]] U [[EF [[~ [[p17<=1 & 1<=p17]] & ~ [AF [[[p104<=1 & 1<=p104] & [p106<=1 & 1<=p106]]]]]] & ~ [EX [EX [[p85<=1 & 1<=p85]]]]] & [[p77<=1 & 1<=p77] & [E [~ [[p137<=1 & 1<=p137]] U [~ [[[[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]] | [p120<=1 & 1<=p120]]] & [A [[p87<=1 & 1<=p87] U [p79<=1 & 1<=p79]] | ~ [[p117<=1 & 1<=p117]]]]] & ~ [[~ [AG [[[p145<=1 & 1<=p145] & [p112<=1 & 1<=p112]]]] & EF [[[p79<=1 & 1<=p79] | [p57<=1 & 1<=p57]]]]]]]]]
normalized: E [[~ [E [true U ~ [E [true U [p139<=1 & 1<=p139]]]]] & EG [~ [EG [[[p155<=1 & 1<=p155] | [p59<=1 & 1<=p59]]]]]] U [[[~ [[E [true U [[p57<=1 & 1<=p57] | [p79<=1 & 1<=p79]]] & E [true U ~ [[[p112<=1 & 1<=p112] & [p145<=1 & 1<=p145]]]]]] & E [~ [[p137<=1 & 1<=p137]] U [[~ [[p117<=1 & 1<=p117]] | [~ [EG [~ [[p79<=1 & 1<=p79]]]] & ~ [E [~ [[p79<=1 & 1<=p79]] U [~ [[p87<=1 & 1<=p87]] & ~ [[p79<=1 & 1<=p79]]]]]]] & ~ [[[p120<=1 & 1<=p120] | [[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]]]]]] & [p77<=1 & 1<=p77]] & [~ [EX [EX [[p85<=1 & 1<=p85]]]] & E [true U [EG [~ [[[p106<=1 & 1<=p106] & [p104<=1 & 1<=p104]]]] & ~ [[p17<=1 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 13,511,910,561,457 (13)
abstracting: (p17<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p104)
states: 25,931,546,191,840 (13)
abstracting: (p104<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p106)
states: 28,253,615,055,050 (13)
abstracting: (p106<=1)
states: 100,165,007,865,845 (14)
..........................................................................................
before gc: list nodes free: 9622245

after gc: idd nodes used:1612798, unused:62387202; list nodes free:292583001
............................................
EG iterations: 134
abstracting: (1<=p85)
states: 10,008 (4)
abstracting: (p85<=1)
states: 100,165,007,865,845 (14)
..abstracting: (1<=p77)
states: 11,205,890,444,060 (13)
abstracting: (p77<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p4)
states: 33,408,779,340,306 (13)
abstracting: (p4<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p23)
states: 14,335,920,732,907 (13)
abstracting: (p23<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p120)
states: 10,255,609,167,344 (13)
abstracting: (p120<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p79)
states: 11,123,660,035,789 (13)
abstracting: (p79<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p87)
states: 160,128 (5)
abstracting: (p87<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p79)
states: 11,123,660,035,789 (13)
abstracting: (p79<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p79)
states: 11,123,660,035,789 (13)
abstracting: (p79<=1)
states: 100,165,007,865,845 (14)
..........................................................................
before gc: list nodes free: 10117730

after gc: idd nodes used:1926881, unused:62073119; list nodes free:291106486
......................................................................................................................
EG iterations: 192
abstracting: (1<=p117)
states: 10,255,609,167,344 (13)
abstracting: (p117<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p137)
states: 9,927,684,500,192 (12)
abstracting: (p137<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p145)
states: 11,281,307,874,412 (13)
abstracting: (p145<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p112)
states: 28,616,608,140,150 (13)
abstracting: (p112<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p79)
states: 11,123,660,035,789 (13)
abstracting: (p79<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p57)
states: 1,443,694,114,702 (12)
abstracting: (p57<=1)
states: 100,165,007,865,845 (14)

before gc: list nodes free: 9945463

after gc: idd nodes used:1212750, unused:62787250; list nodes free:294446989
abstracting: (1<=p59)
states: 845,380,489 (8)
abstracting: (p59<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p155)
states: 11,268,203,562,710 (13)
abstracting: (p155<=1)
states: 100,165,007,865,845 (14)
............................................MC time: 6m27.008sec

checking: [E [EF [[EF [[p144<=1 & 1<=p144]] | [[EX [[p107<=1 & 1<=p107]] | [[p41<=1 & 1<=p41] & [[p100<=1 & 1<=p100] & [p55<=1 & 1<=p55]]]] & ~ [AX [[p132<=1 & 1<=p132]]]]]] U [~ [[[~ [E [[p102<=1 & 1<=p102] U [p122<=1 & 1<=p122]]] | ~ [[[p28<=1 & 1<=p28] & [p80<=1 & 1<=p80]]]] | [[p6<=1 & 1<=p6] | [p153<=1 & 1<=p153]]]] & [~ [[p86<=1 & 1<=p86]] & ~ [[AG [[p144<=1 & 1<=p144]] & [EG [[p76<=1 & 1<=p76]] | AG [[p45<=1 & 1<=p45]]]]]]]] | EG [AG [AF [[[[p115<=1 & 1<=p115] & [p97<=1 & 1<=p97]] & [[p99<=1 & 1<=p99] & [[p136<=1 & 1<=p136] | [p12<=1 & 1<=p12]]]]]]]]
normalized: [EG [~ [E [true U EG [~ [[[[[p12<=1 & 1<=p12] | [p136<=1 & 1<=p136]] & [p99<=1 & 1<=p99]] & [[p97<=1 & 1<=p97] & [p115<=1 & 1<=p115]]]]]]]] | E [E [true U [[EX [~ [[p132<=1 & 1<=p132]]] & [[[[p55<=1 & 1<=p55] & [p100<=1 & 1<=p100]] & [p41<=1 & 1<=p41]] | EX [[p107<=1 & 1<=p107]]]] | E [true U [p144<=1 & 1<=p144]]]] U [[~ [[[~ [E [true U ~ [[p45<=1 & 1<=p45]]]] | EG [[p76<=1 & 1<=p76]]] & ~ [E [true U ~ [[p144<=1 & 1<=p144]]]]]] & ~ [[p86<=1 & 1<=p86]]] & ~ [[[[p153<=1 & 1<=p153] | [p6<=1 & 1<=p6]] | [~ [[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]]] | ~ [E [[p102<=1 & 1<=p102] U [p122<=1 & 1<=p122]]]]]]]]]

abstracting: (1<=p122)
states: 10,141,615,162,580 (13)
abstracting: (p122<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p102)
states: 15,028,523,267,776 (13)
abstracting: (p102<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p28)
states: 28,584,930,085,589 (13)
abstracting: (p28<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p80)
states: 11,209,445,178,857 (13)
abstracting: (p80<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p6)
states: 648,183 (5)
abstracting: (p6<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p153)
states: 11,284,302,913,540 (13)
abstracting: (p153<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p86)
states: 40,032 (4)
abstracting: (p86<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p144)
states: 11,271,510,396,718 (13)
abstracting: (p144<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p76)
states: 11,205,890,444,060 (13)
abstracting: (p76<=1)
states: 100,165,007,865,845 (14)
..................................
before gc: list nodes free: 6038401

after gc: idd nodes used:1735351, unused:62264649; list nodes free:292079499
......................................................................
before gc: list nodes free: 8602363

after gc: idd nodes used:2350751, unused:61649249; list nodes free:289239798
................................................................
before gc: list nodes free: 8098700

after gc: idd nodes used:2249542, unused:61750458; list nodes free:289739039
.......MC time: 5m 9.004sec

checking: A [[EF [[[[AG [[p74<=1 & 1<=p74]] | ~ [[p60<=1 & 1<=p60]]] & A [[p89<=1 & 1<=p89] U [p108<=1 & 1<=p108]]] & [[p4<=1 & 1<=p4] & [[p23<=1 & 1<=p23] & ~ [[p64<=1 & 1<=p64]]]]]] & AG [~ [[EG [[p83<=1 & 1<=p83]] | [AF [[p144<=1 & 1<=p144]] | A [[p101<=1 & 1<=p101] U [p71<=1 & 1<=p71]]]]]]] U [[EG [[p91<=1 & 1<=p91]] | A [A [[[p110<=1 & 1<=p110] & [[p156<=1 & 1<=p156] & [p134<=1 & 1<=p134]]] U [[p146<=1 & 1<=p146] | [[p28<=1 & 1<=p28] & [p80<=1 & 1<=p80]]]] U ~ [[p7<=1 & 1<=p7]]]] & [~ [E [EF [[[p33<=1 & 1<=p33] & [p80<=1 & 1<=p80]]] U AX [[p94<=1 & 1<=p94]]]] | [[[AG [[p55<=1 & 1<=p55]] & EG [[p115<=1 & 1<=p115]]] & [~ [[[p2<=1 & 1<=p2] & [p63<=1 & 1<=p63]]] & [AX [[p128<=1 & 1<=p128]] & [EF [[p1<=1 & 1<=p1]] | [[p27<=1 & 1<=p27] & [[p29<=1 & 1<=p29] & [p134<=1 & 1<=p134]]]]]]] | [[AX [[p0<=1 & 1<=p0]] & [p139<=1 & 1<=p139]] & [[p34<=1 & 1<=p34] & [p36<=1 & 1<=p36]]]]]]]
normalized: [~ [EG [~ [[[[[[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]] & [[p139<=1 & 1<=p139] & ~ [EX [~ [[p0<=1 & 1<=p0]]]]]] | [[[[[[[p134<=1 & 1<=p134] & [p29<=1 & 1<=p29]] & [p27<=1 & 1<=p27]] | E [true U [p1<=1 & 1<=p1]]] & ~ [EX [~ [[p128<=1 & 1<=p128]]]]] & ~ [[[p63<=1 & 1<=p63] & [p2<=1 & 1<=p2]]]] & [EG [[p115<=1 & 1<=p115]] & ~ [E [true U ~ [[p55<=1 & 1<=p55]]]]]]] | ~ [E [E [true U [[p80<=1 & 1<=p80] & [p33<=1 & 1<=p33]]] U ~ [EX [~ [[p94<=1 & 1<=p94]]]]]]] & [[~ [EG [[p7<=1 & 1<=p7]]] & ~ [E [[p7<=1 & 1<=p7] U [~ [[~ [EG [~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]]]] & ~ [E [~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]] U [~ [[[[p134<=1 & 1<=p134] & [p156<=1 & 1<=p156]] & [p110<=1 & 1<=p110]]] & ~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]]]]]]] & [p7<=1 & 1<=p7]]]]] | EG [[p91<=1 & 1<=p91]]]]]]] & ~ [E [~ [[[[[[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]] & [[p139<=1 & 1<=p139] & ~ [EX [~ [[p0<=1 & 1<=p0]]]]]] | [[[[[[[p134<=1 & 1<=p134] & [p29<=1 & 1<=p29]] & [p27<=1 & 1<=p27]] | E [true U [p1<=1 & 1<=p1]]] & ~ [EX [~ [[p128<=1 & 1<=p128]]]]] & ~ [[[p63<=1 & 1<=p63] & [p2<=1 & 1<=p2]]]] & [EG [[p115<=1 & 1<=p115]] & ~ [E [true U ~ [[p55<=1 & 1<=p55]]]]]]] | ~ [E [E [true U [[p80<=1 & 1<=p80] & [p33<=1 & 1<=p33]]] U ~ [EX [~ [[p94<=1 & 1<=p94]]]]]]] & [[~ [EG [[p7<=1 & 1<=p7]]] & ~ [E [[p7<=1 & 1<=p7] U [~ [[~ [EG [~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]]]] & ~ [E [~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]] U [~ [[[[p134<=1 & 1<=p134] & [p156<=1 & 1<=p156]] & [p110<=1 & 1<=p110]]] & ~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]]]]]]] & [p7<=1 & 1<=p7]]]]] | EG [[p91<=1 & 1<=p91]]]]] U [~ [[E [true U [[[~ [[p64<=1 & 1<=p64]] & [p23<=1 & 1<=p23]] & [p4<=1 & 1<=p4]] & [[~ [EG [~ [[p108<=1 & 1<=p108]]]] & ~ [E [~ [[p108<=1 & 1<=p108]] U [~ [[p89<=1 & 1<=p89]] & ~ [[p108<=1 & 1<=p108]]]]]] & [~ [[p60<=1 & 1<=p60]] | ~ [E [true U ~ [[p74<=1 & 1<=p74]]]]]]]] & ~ [E [true U [[[~ [EG [~ [[p71<=1 & 1<=p71]]]] & ~ [E [~ [[p71<=1 & 1<=p71]] U [~ [[p101<=1 & 1<=p101]] & ~ [[p71<=1 & 1<=p71]]]]]] | ~ [EG [~ [[p144<=1 & 1<=p144]]]]] | EG [[p83<=1 & 1<=p83]]]]]]] & ~ [[[[[[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]] & [[p139<=1 & 1<=p139] & ~ [EX [~ [[p0<=1 & 1<=p0]]]]]] | [[[[[[[p134<=1 & 1<=p134] & [p29<=1 & 1<=p29]] & [p27<=1 & 1<=p27]] | E [true U [p1<=1 & 1<=p1]]] & ~ [EX [~ [[p128<=1 & 1<=p128]]]]] & ~ [[[p63<=1 & 1<=p63] & [p2<=1 & 1<=p2]]]] & [EG [[p115<=1 & 1<=p115]] & ~ [E [true U ~ [[p55<=1 & 1<=p55]]]]]]] | ~ [E [E [true U [[p80<=1 & 1<=p80] & [p33<=1 & 1<=p33]]] U ~ [EX [~ [[p94<=1 & 1<=p94]]]]]]] & [[~ [EG [[p7<=1 & 1<=p7]]] & ~ [E [[p7<=1 & 1<=p7] U [~ [[~ [EG [~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]]]] & ~ [E [~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]] U [~ [[[[p134<=1 & 1<=p134] & [p156<=1 & 1<=p156]] & [p110<=1 & 1<=p110]]] & ~ [[[[p80<=1 & 1<=p80] & [p28<=1 & 1<=p28]] | [p146<=1 & 1<=p146]]]]]]]] & [p7<=1 & 1<=p7]]]]] | EG [[p91<=1 & 1<=p91]]]]]]]]]

abstracting: (1<=p91)
states: 31,653,810,168,364 (13)
abstracting: (p91<=1)
states: 100,165,007,865,845 (14)
............................................................................
before gc: list nodes free: 7390424

after gc: idd nodes used:1985854, unused:62014146; list nodes free:290950053
.....................................................................................................................................................................................................
EG iterations: 273
abstracting: (1<=p7)
states: 1,944,549 (6)
abstracting: (p7<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p146)
states: 903,222 (5)
abstracting: (p146<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p28)
states: 28,584,930,085,589 (13)
abstracting: (p28<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p80)
states: 11,209,445,178,857 (13)
abstracting: (p80<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p110)
states: 28,608,774,970,042 (13)
abstracting: (p110<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p156)
states: 11,284,683,066,324 (13)
abstracting: (p156<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p134)
states: 1,569,776,678,656 (12)
abstracting: (p134<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p146)
states: 903,222 (5)
abstracting: (p146<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p28)
states: 28,584,930,085,589 (13)
abstracting: (p28<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p80)
states: 11,209,445,178,857 (13)
abstracting: (p80<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p146)
states: 903,222 (5)
abstracting: (p146<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p28)
states: 28,584,930,085,589 (13)
abstracting: (p28<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p80)
states: 11,209,445,178,857 (13)
abstracting: (p80<=1)
states: 100,165,007,865,845 (14)
...............................
before gc: list nodes free: 8313197

after gc: idd nodes used:2220261, unused:61779739; list nodes free:289900801
.......MC time: 4m 7.012sec

checking: AX [EX [AF [[E [[p51<=1 & 1<=p51] U [p3<=1 & 1<=p3]] | [E [[p84<=1 & 1<=p84] U [p69<=1 & 1<=p69]] | [[p125<=1 & 1<=p125] & [p54<=1 & 1<=p54]]]]]]]
normalized: ~ [EX [~ [EX [~ [EG [~ [[[[[p54<=1 & 1<=p54] & [p125<=1 & 1<=p125]] | E [[p84<=1 & 1<=p84] U [p69<=1 & 1<=p69]]] | E [[p51<=1 & 1<=p51] U [p3<=1 & 1<=p3]]]]]]]]]]

abstracting: (1<=p3)
states: 33,334,680,031,349 (13)
abstracting: (p3<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p51)
states: 13,571,357,609,313 (13)
abstracting: (p51<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p69)
states: 845,380,489 (8)
abstracting: (p69<=1)
states: 100,165,007,865,845 (14)
abstracting: (1<=p84)
states: 2,502 (3)
abstracting: (p84<=1)
states: 100,165,007,865,845 (14)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5991888 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098672 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec


iterations count:33556 (233), effective:5538 (38)

initing FirstDep: 0m 0.000sec


iterations count:3048 (21), effective:307 (2)

iterations count:12083 (83), effective:1629 (11)

iterations count:3114 (21), effective:301 (2)

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

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

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

iterations count:7918 (54), effective:963 (6)

iterations count:258 (1), effective:9 (0)

iterations count:3076 (21), effective:297 (2)

iterations count:252 (1), effective:7 (0)

iterations count:3048 (21), effective:307 (2)

iterations count:1477 (10), effective:152 (1)

iterations count:2134 (14), effective:203 (1)

iterations count:179 (1), effective:6 (0)

net_ddint.h:600: Timeout: after 458 sec


iterations count:4704 (32), effective:530 (3)

iterations count:4025 (27), effective:448 (3)

iterations count:5447 (37), effective:605 (4)

iterations count:2328 (16), effective:274 (1)

iterations count:3351 (23), effective:335 (2)

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

iterations count:4652 (32), effective:521 (3)

net_ddint.h:600: Timeout: after 482 sec


iterations count:1322 (9), effective:101 (0)

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

iterations count:1819 (12), effective:199 (1)

iterations count:158 (1), effective:2 (0)

iterations count:2655 (18), effective:275 (1)

net_ddint.h:600: Timeout: after 386 sec


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

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

net_ddint.h:600: Timeout: after 308 sec


iterations count:1183 (8), effective:131 (0)

net_ddint.h:600: Timeout: after 246 sec


iterations count:2134 (14), effective:203 (1)

iterations count:179 (1), effective:6 (0)

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="ShieldPPPt-PT-002B"
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 ShieldPPPt-PT-002B, 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 r394-oct2-167903718000554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B 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 ;