fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r179-tall-171640601600482
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for GPUForwardProgress-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
237.792 5641.00 11842.00 40.20 FTTTFTTTFFFTTTTT 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.r179-tall-171640601600482.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 GPUForwardProgress-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601600482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 22:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 22:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K 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 GPUForwardProgress-PT-08a-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716474482135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 14:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:28:03] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-05-23 14:28:03] [INFO ] Transformed 40 places.
[2024-05-23 14:28:03] [INFO ] Transformed 49 transitions.
[2024-05-23 14:28:03] [INFO ] Found NUPN structural information;
[2024-05-23 14:28:03] [INFO ] Parsed PT model containing 40 places and 49 transitions and 181 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 9 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2024-05-23 14:28:03] [INFO ] Computed 10 invariants in 7 ms
[2024-05-23 14:28:03] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 14:28:03] [INFO ] Invariant cache hit.
[2024-05-23 14:28:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 14:28:03] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-05-23 14:28:03] [INFO ] Invariant cache hit.
[2024-05-23 14:28:03] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 941 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/79 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 137 constraints, problems are : Problem set: 0 solved, 38 unsolved in 919 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1915ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1929ms
Finished structural reductions in LTL mode , in 1 iterations and 2210 ms. Remains : 40/40 places, 39/39 transitions.
Support contains 38 out of 40 places after structural reductions.
[2024-05-23 14:28:05] [INFO ] Flatten gal took : 19 ms
[2024-05-23 14:28:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 14:28:05] [INFO ] Input system was already deterministic with 39 transitions.
Reduction of identical properties reduced properties to check from 52 to 46
RANDOM walk for 40000 steps (306 resets) in 874 ms. (45 steps per ms) remains 3/46 properties
BEST_FIRST walk for 40003 steps (93 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
[2024-05-23 14:28:06] [INFO ] Invariant cache hit.
[2024-05-23 14:28:06] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 31/39 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 78/79 variables, and 90 constraints, problems are : Problem set: 3 solved, 0 unsolved in 55 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 11 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 6 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 6 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 0 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 5 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 30 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 23 transition count 31
Applied a total of 15 rules in 13 ms. Remains 23 /40 variables (removed 17) and now considering 31/39 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 23/40 places, 31/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 30 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 23 transition count 31
Applied a total of 15 rules in 3 ms. Remains 23 /40 variables (removed 17) and now considering 31/39 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 23/40 places, 31/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 31 transitions.
RANDOM walk for 270 steps (3 resets) in 6 ms. (38 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/40 places, 39/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 30 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 25 transition count 33
Applied a total of 11 rules in 3 ms. Remains 25 /40 variables (removed 15) and now considering 33/39 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 25/40 places, 33/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 30 transition count 31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 23 transition count 31
Applied a total of 15 rules in 2 ms. Remains 23 /40 variables (removed 17) and now considering 31/39 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 23/40 places, 31/39 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 1 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-23 14:28:06] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 14:28:06] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-23 14:28:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 39 transitions and 161 arcs took 3 ms.
Total runtime 3493 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running GPUForwardProgress-PT-08a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/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: 532
MODEL NAME: /home/mcc/execution/408/model
40 places, 39 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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716474487776

--------------------
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="GPUForwardProgress-PT-08a"
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 GPUForwardProgress-PT-08a, 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 r179-tall-171640601600482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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