Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809500002.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d0m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809500002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 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 SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716876381045

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:06:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:06:24] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-28 06:06:24] [INFO ] Transformed 262 places.
[2024-05-28 06:06:24] [INFO ] Transformed 73 transitions.
[2024-05-28 06:06:24] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Support contains 56 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 36 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-05-28 06:06:24] [INFO ] Computed 5 invariants in 27 ms
[2024-05-28 06:06:24] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-28 06:06:24] [INFO ] Invariant cache hit.
[2024-05-28 06:06:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:06:25] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-28 06:06:25] [INFO ] Invariant cache hit.
[2024-05-28 06:06:25] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 20 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 3 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 3 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 3 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 3 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 73/143 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 06:06:31] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:06:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/143 variables, 2/118 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 118 constraints, problems are : Problem set: 3 solved, 69 unsolved in 7852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 2/69 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 6/16 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 73/142 variables, 69/85 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 31/116 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 17/133 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 69 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 14 (OVERLAPS) 1/143 variables, 1/134 constraints. Problems are: Problem set: 8 solved, 64 unsolved
Problem TDEAD67 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 52/186 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 1/187 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/187 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 18 (OVERLAPS) 0/143 variables, 0/187 constraints. Problems are: Problem set: 9 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 187 constraints, problems are : Problem set: 9 solved, 63 unsolved in 5640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 69/72 constraints, Known Traps: 12/12 constraints]
After SMT, in 13798ms problems are : Problem set: 9 solved, 63 unsolved
Search for dead transitions found 9 dead transitions in 13841ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 64/73 transitions.
Reduce places removed 0 places and 9 transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 1 places and 6 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 69 transition count 49
Deduced a syphon composed of 15 places in 1 ms
Applied a total of 1 rules in 4 ms. Remains 69 /70 variables (removed 1) and now considering 49/64 (removed 15) transitions.
// Phase 1: matrix 49 rows 69 cols
[2024-05-28 06:06:38] [INFO ] Computed 21 invariants in 3 ms
[2024-05-28 06:06:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 06:06:39] [INFO ] Invariant cache hit.
[2024-05-28 06:06:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 06:06:39] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 69/72 places, 49/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14862 ms. Remains : 69/72 places, 49/73 transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Support contains 35 out of 54 places after structural reductions.
[2024-05-28 06:06:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 06:06:39] [INFO ] Flatten gal took : 35 ms
[2024-05-28 06:06:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:06:39] [INFO ] Flatten gal took : 15 ms
[2024-05-28 06:06:39] [INFO ] Input system was already deterministic with 49 transitions.
Support contains 31 out of 54 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (8973 resets) in 2614 ms. (15 steps per ms) remains 13/26 properties
BEST_FIRST walk for 40002 steps (2340 resets) in 770 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2030 resets) in 153 ms. (259 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4183 resets) in 197 ms. (202 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (1918 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1624 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (4084 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (4132 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1945 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
// Phase 1: matrix 49 rows 54 cols
[2024-05-28 06:06:41] [INFO ] Computed 6 invariants in 3 ms
[2024-05-28 06:06:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 32/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 2 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 49/103 variables, 54/63 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 20/83 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 83 constraints, problems are : Problem set: 3 solved, 8 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 37/49 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/54 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 49/103 variables, 54/63 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 20/83 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 8/91 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 91 constraints, problems are : Problem set: 3 solved, 8 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 790ms problems are : Problem set: 3 solved, 8 unsolved
Parikh walk visited 2 properties in 744 ms.
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 131 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 45 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 45 transition count 45
Applied a total of 8 rules in 34 ms. Remains 45 /54 variables (removed 9) and now considering 45/49 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 45/54 places, 45/49 transitions.
RANDOM walk for 40000 steps (8898 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1883 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4147 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 1016 steps, run visited all 6 properties in 20 ms. (steps per millisecond=50 )
Probabilistic random walk after 1016 steps, saw 443 distinct states, run finished after 26 ms. (steps per millisecond=39 ) properties seen :6
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 11 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 49 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 40 transition count 39
Applied a total of 19 rules in 24 ms. Remains 40 /54 variables (removed 14) and now considering 39/49 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 40/54 places, 39/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 40
Applied a total of 17 rules in 16 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 41/54 places, 40/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 40
Applied a total of 17 rules in 15 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 41/54 places, 40/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 44 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 43 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 42 transition count 41
Applied a total of 15 rules in 14 ms. Remains 42 /54 variables (removed 12) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 42/54 places, 41/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 40 transition count 39
Applied a total of 24 rules in 8 ms. Remains 40 /54 variables (removed 14) and now considering 39/49 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 40/54 places, 39/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 41 transition count 40
Applied a total of 22 rules in 9 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 41/54 places, 40/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Applied a total of 21 rules in 7 ms. Remains 41 /54 variables (removed 13) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 41/54 places, 41/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 44 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 44 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 43 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 43 transition count 42
Applied a total of 18 rules in 4 ms. Remains 43 /54 variables (removed 11) and now considering 42/49 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 43/54 places, 42/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 40
Applied a total of 17 rules in 10 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 41/54 places, 40/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 40 transition count 39
Applied a total of 24 rules in 5 ms. Remains 40 /54 variables (removed 14) and now considering 39/49 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 40/54 places, 39/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Graph (complete) has 150 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 40
Applied a total of 17 rules in 9 ms. Remains 41 /54 variables (removed 13) and now considering 40/49 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 41/54 places, 40/49 transitions.
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 43 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 43 transition count 43
Applied a total of 17 rules in 1 ms. Remains 43 /54 variables (removed 11) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/54 places, 43/49 transitions.
[2024-05-28 06:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:44] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 42 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 40 transition count 39
Applied a total of 24 rules in 3 ms. Remains 40 /54 variables (removed 14) and now considering 39/49 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/54 places, 39/49 transitions.
[2024-05-28 06:06:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:44] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-28 06:06:44] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:44] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:44] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-28 06:06:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 49 transitions and 196 arcs took 2 ms.
Total runtime 20446 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d0m04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 54
TRANSITIONS: 49
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 614
MODEL NAME: /home/mcc/execution/415/model
54 places, 49 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716876405014

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="SieveSingleMsgMbox-PT-d0m04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d0m04, 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 r377-smll-171683809500002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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