About the Execution of GreatSPN+red for ResAllocation-PT-R015C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
266.752 | 5299.00 | 14275.00 | 47.60 | FTTTTFFFTFFTTFTT | normal |
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-171662337500857.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337500857
=====================================================================
--------------------
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-CTLCardinality-2024-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2024-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2023-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2023-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2023-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716775707094
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
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:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 02:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:08:28] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-27 02:08:28] [INFO ] Transformed 60 places.
[2024-05-27 02:08:28] [INFO ] Transformed 32 transitions.
[2024-05-27 02:08:28] [INFO ] Found NUPN structural information;
[2024-05-27 02:08:28] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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:28] [INFO ] Computed 30 invariants in 8 ms
[2024-05-27 02:08:28] [INFO ] Implicit Places using invariants in 199 ms returned [39, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 230 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 58/60 places, 32/32 transitions.
Support contains 50 out of 58 places after structural reductions.
[2024-05-27 02:08:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 02:08:28] [INFO ] Flatten gal took : 25 ms
[2024-05-27 02:08:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:08:28] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:08:28] [INFO ] Input system was already deterministic with 32 transitions.
Reduction of identical properties reduced properties to check from 52 to 49
RANDOM walk for 40000 steps (581 resets) in 2270 ms. (17 steps per ms) remains 5/49 properties
BEST_FIRST walk for 40002 steps (129 resets) in 160 ms. (248 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (131 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (130 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (99 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
// Phase 1: matrix 32 rows 58 cols
[2024-05-27 02:08:29] [INFO ] Computed 28 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 02:08:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 11 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/16 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/30 variables, 16/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 24/54 variables, 16/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/54 variables, 16/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/54 variables, 8/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/54 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 23/77 variables, 15/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/77 variables, 15/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/77 variables, 7/118 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/77 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/90 variables, 11/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/90 variables, 11/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/90 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/90 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/90 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 145 constraints, problems are : Problem set: 1 solved, 2 unsolved in 212 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/12 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/24 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/48 variables, 16/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 16/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 8/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/48 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/48 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 23/71 variables, 15/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/71 variables, 15/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/71 variables, 7/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/71 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 19/90 variables, 15/125 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/90 variables, 15/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/90 variables, 7/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/90 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/90 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 147 constraints, problems are : Problem set: 1 solved, 2 unsolved in 139 ms.
Refiners :[Domain max(s): 58/58 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 382ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 9 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 56 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 56 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 54 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 52 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 52 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 50 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 48 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 48 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 46 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 44 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 44 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 42 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 41 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 41 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 29 place count 39 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 32 place count 37 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 37 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 35 place count 35 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 38 place count 33 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 39 place count 33 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 41 place count 31 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 42 place count 31 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 43 place count 30 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 44 place count 30 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 46 place count 28 transition count 16
Applied a total of 46 rules in 35 ms. Remains 28 /58 variables (removed 30) and now considering 16/32 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 28/58 places, 16/32 transitions.
RANDOM walk for 40000 steps (2737 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (90 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Probably explored full state space saw : 384 states, properties seen :0
Probabilistic random walk after 1344 steps, saw 384 distinct states, run finished after 21 ms. (steps per millisecond=64 ) properties seen :0
Explored full state space saw : 384 states, properties seen :0
Exhaustive walk after 1344 steps, saw 384 distinct states, run finished after 3 ms. (steps per millisecond=448 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:08:30] [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 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 55 transition count 30
Applied a total of 5 rules in 4 ms. Remains 55 /58 variables (removed 3) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 55/58 places, 30/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 55 transition count 30
Applied a total of 5 rules in 4 ms. Remains 55 /58 variables (removed 3) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 55/58 places, 30/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 56 transition count 31
Applied a total of 3 rules in 4 ms. Remains 56 /58 variables (removed 2) and now considering 31/32 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 56/58 places, 31/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 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 : 58/58 places, 32/32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:08:30] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:08:30] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 02:08:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 32 transitions and 146 arcs took 3 ms.
Total runtime 2571 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/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 58
TRANSITIONS: 32
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]
SAVING FILE /home/mcc/execution/407/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: 525
MODEL NAME: /home/mcc/execution/407/model
58 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-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716775712393
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-171662337500857"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;