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.r311-tall-171662337500858.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 ResAllocation-PT-R015C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337500858
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 11 23:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 23:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 23:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 ResAllocation-PT-R015C002-CTLFireability-2024-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2024-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2023-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2023-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2023-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716775716197

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R015C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 02:08:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 02:08:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:08:37] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-27 02:08:37] [INFO ] Transformed 60 places.
[2024-05-27 02:08:37] [INFO ] Transformed 32 transitions.
[2024-05-27 02:08:37] [INFO ] Found NUPN structural information;
[2024-05-27 02:08:37] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 60 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2024-05-27 02:08:37] [INFO ] Computed 30 invariants in 5 ms
[2024-05-27 02:08:37] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-27 02:08:37] [INFO ] Invariant cache hit.
[2024-05-27 02:08:37] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-27 02:08:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 9 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:08:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 32/92 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 164 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1052 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 32/92 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 30/194 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 194 constraints, problems are : Problem set: 0 solved, 30 unsolved in 583 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 14/14 constraints]
After SMT, in 1673ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1689ms
Finished structural reductions in LTL mode , in 1 iterations and 1982 ms. Remains : 60/60 places, 32/32 transitions.
Support contains 60 out of 60 places after structural reductions.
[2024-05-27 02:08:39] [INFO ] Flatten gal took : 24 ms
[2024-05-27 02:08:39] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:08:39] [INFO ] Input system was already deterministic with 32 transitions.
Reduction of identical properties reduced properties to check from 67 to 54
RANDOM walk for 40000 steps (581 resets) in 1200 ms. (33 steps per ms) remains 10/54 properties
BEST_FIRST walk for 40004 steps (150 resets) in 254 ms. (156 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (130 resets) in 173 ms. (229 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (130 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 70 ms. (563 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (122 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 86 ms. (459 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (64 resets) in 79 ms. (500 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (100 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
[2024-05-27 02:08:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 2 (OVERLAPS) 17/32 variables, 14/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 17/46 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-27 02:08:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/47 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/36 variables, 4/51 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 4/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 22/58 variables, 36/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/70 variables, 8/99 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 8/107 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 4/111 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 12/82 variables, 8/119 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/82 variables, 8/127 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/82 variables, 4/131 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/82 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/92 variables, 8/139 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/92 variables, 8/147 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/92 variables, 4/151 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/92 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/92 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 151 constraints, problems are : Problem set: 2 solved, 3 unsolved in 164 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 13/21 variables, 9/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 13/30 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/24 variables, 3/33 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/42 variables, 24/60 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 1/61 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/58 variables, 12/73 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/58 variables, 12/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/58 variables, 6/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/58 variables, 2/93 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/58 variables, 1/94 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/58 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/70 variables, 8/102 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/70 variables, 8/110 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/70 variables, 4/114 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/70 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 12/82 variables, 8/122 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/82 variables, 8/130 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/82 variables, 4/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/82 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/92 variables, 8/142 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/92 variables, 8/150 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/92 variables, 4/154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/92 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/92 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 154 constraints, problems are : Problem set: 2 solved, 3 unsolved in 164 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 342ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 41 ms.
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 31
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 30
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 30
Applied a total of 6 rules in 18 ms. Remains 56 /60 variables (removed 4) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 56/60 places, 30/32 transitions.
RANDOM walk for 40000 steps (660 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (168 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Probably explored full state space saw : 131070 states, properties seen :0
Probabilistic random walk after 696309 steps, saw 131070 distinct states, run finished after 826 ms. (steps per millisecond=842 ) properties seen :0
Explored full state space saw : 131072 states, properties seen :0
Exhaustive walk after 696320 steps, saw 131072 distinct states, run finished after 627 ms. (steps per millisecond=1110 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:42] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:08:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:42] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-27 02:08:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 32 transitions and 150 arcs took 3 ms.
Total runtime 5604 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ResAllocation-PT-R015C002

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 590
MODEL NAME: /home/mcc/execution/411/model
60 places, 32 transitions.

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 ResAllocation-PT-R015C002-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716775724995

--------------------
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="ResAllocation-PT-R015C002"
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 ResAllocation-PT-R015C002, 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 r311-tall-171662337500858"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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