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.r157-smll-171636264800002.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 EGFr-PT-02010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636264800002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K May 18 16:42 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 EGFr-PT-02010-CTLFireability-2024-00
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-01
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-02
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-03
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-04
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-05
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-06
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-07
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-08
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-09
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-10
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-11
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-12
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-13
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-14
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716378320331

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:45:23] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-22 11:45:23] [INFO ] Transformed 40 places.
[2024-05-22 11:45:23] [INFO ] Transformed 68 transitions.
[2024-05-22 11:45:23] [INFO ] Found NUPN structural information;
[2024-05-22 11:45:23] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 40 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 20 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-22 11:45:24] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2024-05-22 11:45:24] [INFO ] Computed 20 invariants in 9 ms
[2024-05-22 11:45:24] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-22 11:45:24] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-22 11:45:24] [INFO ] Invariant cache hit.
[2024-05-22 11:45:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 11:45:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 11:45:24] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-22 11:45:24] [INFO ] Invariant cache hit.
[2024-05-22 11:45:24] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 27 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 125 constraints, problems are : Problem set: 9 solved, 56 unsolved in 2156 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 6/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 56/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 181 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1252 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 56/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 3504ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 3523ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 53/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4168 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 40 out of 40 places after structural reductions.
[2024-05-22 11:45:28] [INFO ] Flatten gal took : 35 ms
[2024-05-22 11:45:28] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:45:28] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 56 to 54
RANDOM walk for 40000 steps (1786 resets) in 2572 ms. (15 steps per ms) remains 24/54 properties
BEST_FIRST walk for 4003 steps (43 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (44 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (43 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (44 resets) in 119 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (39 resets) in 95 ms. (41 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (40 resets) in 62 ms. (63 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (39 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (44 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (46 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (42 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
[2024-05-22 11:45:29] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 11:45:29] [INFO ] Computed 20 invariants in 2 ms
[2024-05-22 11:45:29] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 11:45:30] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:45:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/48 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 7/40 variables, 7/55 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 7/62 constraints. Problems are: Problem set: 2 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 33/73 variables, 40/102 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 19/121 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/121 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/121 constraints. Problems are: Problem set: 8 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 121 constraints, problems are : Problem set: 8 solved, 16 unsolved in 694 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 9/36 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 2/38 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 9/36 variables, 9/47 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 9/56 constraints. Problems are: Problem set: 8 solved, 16 unsolved
[2024-05-22 11:45:30] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:45:30] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-05-22 11:45:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 3/59 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/59 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 31/67 variables, 36/95 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 14/109 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 8/117 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/117 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/69 variables, 4/121 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/69 variables, 1/122 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/69 variables, 0/122 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/73 variables, 4/126 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 4/130 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 2/132 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 3/135 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/73 variables, 0/135 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/73 variables, 0/135 constraints. Problems are: Problem set: 13 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 135 constraints, problems are : Problem set: 13 solved, 11 unsolved in 716 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 11/24 constraints, Known Traps: 5/5 constraints]
After SMT, in 1443ms problems are : Problem set: 13 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 885 ms.
Support contains 24 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 36 transition count 51
Applied a total of 4 rules in 23 ms. Remains 36 /40 variables (removed 4) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 36/40 places, 51/53 transitions.
RANDOM walk for 40000 steps (2063 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (520 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (528 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (505 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (484 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (477 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (465 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (479 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (473 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (479 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (524 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (506 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
Probably explored full state space saw : 3261 states, properties seen :0
Probabilistic random walk after 18802 steps, saw 3261 distinct states, run finished after 144 ms. (steps per millisecond=130 ) properties seen :0
Explored full state space saw : 3261 states, properties seen :0
Exhaustive walk after 18802 steps, saw 3261 distinct states, run finished after 200 ms. (steps per millisecond=94 ) properties seen :0
Successfully simplified 24 atomic propositions for a total of 16 simplifications.
FORMULA EGFr-PT-02010-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:45:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:45:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 11:45:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EGFr-PT-02010-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 13 ms
FORMULA EGFr-PT-02010-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 32 out of 40 places (down from 34) after GAL structural reductions.
Computed a total of 14 stabilizing places and 7 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 21 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 33/40 places, 48/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 16 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 33/40 places, 48/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 15 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 33/40 places, 48/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 10 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 33/40 places, 48/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Applied a total of 1 rules in 5 ms. Remains 38 /40 variables (removed 2) and now considering 52/53 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 38/40 places, 52/53 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:45:33] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:45:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:45:33] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-22 11:45:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 53 transitions and 278 arcs took 2 ms.
Total runtime 10214 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EGFr-PT-02010

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 588
MODEL NAME: /home/mcc/execution/412/model
40 places, 53 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA EGFr-PT-02010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EGFr-PT-02010-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716378334907

--------------------
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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r157-smll-171636264800002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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