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

About the Execution of GreatSPN+red for NoC3x3-PT-4A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13795.768 3600000.00 14124491.00 324.50 FT???????T?????? 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.r245-tall-171654350300602.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 NoC3x3-PT-4A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 144K 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 NoC3x3-PT-4A-CTLFireability-2024-00
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-01
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-02
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-03
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-04
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-05
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-06
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-07
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-08
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-09
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-10
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-11
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-12
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-13
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-14
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716686969149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 01:29:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 01:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:29:30] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-26 01:29:30] [INFO ] Transformed 293 places.
[2024-05-26 01:29:30] [INFO ] Transformed 608 transitions.
[2024-05-26 01:29:30] [INFO ] Found NUPN structural information;
[2024-05-26 01:29:30] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
Support contains 112 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 255 transition count 396
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 255 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 129 place count 255 transition count 343
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 133 place count 251 transition count 343
Applied a total of 133 rules in 47 ms. Remains 251 /293 variables (removed 42) and now considering 343/453 (removed 110) transitions.
// Phase 1: matrix 343 rows 251 cols
[2024-05-26 01:29:30] [INFO ] Computed 62 invariants in 26 ms
[2024-05-26 01:29:30] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-26 01:29:31] [INFO ] Invariant cache hit.
[2024-05-26 01:29:31] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-05-26 01:29:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 5/251 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 343/594 variables, 251/313 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 0/594 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 313 constraints, problems are : Problem set: 0 solved, 342 unsolved in 15018 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 5/251 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 343/594 variables, 251/313 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 342/655 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (OVERLAPS) 0/594 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 655 constraints, problems are : Problem set: 0 solved, 342 unsolved in 16108 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 0/0 constraints]
After SMT, in 31267ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 31291ms
Starting structural reductions in LTL mode, iteration 1 : 251/293 places, 343/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31939 ms. Remains : 251/293 places, 343/453 transitions.
Support contains 112 out of 251 places after structural reductions.
[2024-05-26 01:30:02] [INFO ] Flatten gal took : 54 ms
[2024-05-26 01:30:02] [INFO ] Flatten gal took : 25 ms
[2024-05-26 01:30:02] [INFO ] Input system was already deterministic with 343 transitions.
RANDOM walk for 40000 steps (8 resets) in 2090 ms. (19 steps per ms) remains 2/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
[2024-05-26 01:30:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 216/251 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 343/594 variables, 251/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/594 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 216/251 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 343/594 variables, 251/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/594 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 7054 steps, including 42 resets, run visited all 2 properties in 39 ms. (steps per millisecond=180 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 46 ms.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 21 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 22 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 343 transitions.
Computed a total of 6 stabilizing places and 1 stable transitions
Graph (complete) has 814 edges and 251 vertex of which 246 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 247 transition count 343
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 22 place count 229 transition count 325
Iterating global reduction 1 with 18 rules applied. Total rules applied 40 place count 229 transition count 325
Applied a total of 40 rules in 17 ms. Remains 229 /251 variables (removed 22) and now considering 325/343 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 229/251 places, 325/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 17 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 17 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 325 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 229 transition count 326
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 229 transition count 326
Applied a total of 39 rules in 8 ms. Remains 229 /251 variables (removed 22) and now considering 326/343 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 229/251 places, 326/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 16 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 17 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 247 transition count 343
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 22 place count 229 transition count 325
Iterating global reduction 1 with 18 rules applied. Total rules applied 40 place count 229 transition count 325
Applied a total of 40 rules in 7 ms. Remains 229 /251 variables (removed 22) and now considering 325/343 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 229/251 places, 325/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 15 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 15 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 325 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 228 transition count 325
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 228 transition count 325
Applied a total of 41 rules in 7 ms. Remains 228 /251 variables (removed 23) and now considering 325/343 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 228/251 places, 325/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 13 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 14 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 325 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 247 transition count 343
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 231 transition count 327
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 231 transition count 327
Applied a total of 36 rules in 7 ms. Remains 231 /251 variables (removed 20) and now considering 327/343 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 231/251 places, 327/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 13 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 343
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 232 transition count 327
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 232 transition count 327
Applied a total of 35 rules in 7 ms. Remains 232 /251 variables (removed 19) and now considering 327/343 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 232/251 places, 327/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Graph (trivial) has 127 edges and 251 vertex of which 67 / 251 are part of one of the 29 SCC in 3 ms
Free SCC test removed 38 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Graph (complete) has 739 edges and 213 vertex of which 208 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 18 place count 192 transition count 252
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 192 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 37 place count 192 transition count 249
Applied a total of 37 rules in 37 ms. Remains 192 /251 variables (removed 59) and now considering 249/343 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 192/251 places, 249/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 8 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 9 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 247 transition count 343
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 232 transition count 328
Iterating global reduction 1 with 15 rules applied. Total rules applied 34 place count 232 transition count 328
Applied a total of 34 rules in 7 ms. Remains 232 /251 variables (removed 19) and now considering 328/343 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 232/251 places, 328/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 343
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 231 transition count 326
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 231 transition count 326
Applied a total of 37 rules in 6 ms. Remains 231 /251 variables (removed 20) and now considering 326/343 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 231/251 places, 326/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 21 place count 230 transition count 327
Iterating global reduction 1 with 16 rules applied. Total rules applied 37 place count 230 transition count 327
Applied a total of 37 rules in 7 ms. Remains 230 /251 variables (removed 21) and now considering 327/343 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 230/251 places, 327/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Graph (trivial) has 124 edges and 251 vertex of which 64 / 251 are part of one of the 28 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Graph (complete) has 743 edges and 215 vertex of which 211 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 19 place count 194 transition count 255
Iterating global reduction 0 with 17 rules applied. Total rules applied 36 place count 194 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 194 transition count 249
Applied a total of 42 rules in 22 ms. Remains 194 /251 variables (removed 57) and now considering 249/343 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 194/251 places, 249/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 8 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 8 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 229 transition count 326
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 229 transition count 326
Applied a total of 39 rules in 7 ms. Remains 229 /251 variables (removed 22) and now considering 326/343 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 229/251 places, 326/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 10 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:30:04] [INFO ] Input system was already deterministic with 326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 228 transition count 325
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 228 transition count 325
Applied a total of 41 rules in 7 ms. Remains 228 /251 variables (removed 23) and now considering 325/343 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 228/251 places, 325/343 transitions.
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 10 ms
[2024-05-26 01:30:04] [INFO ] Flatten gal took : 10 ms
[2024-05-26 01:30:05] [INFO ] Input system was already deterministic with 325 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Graph (trivial) has 91 edges and 251 vertex of which 45 / 251 are part of one of the 20 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 765 edges and 226 vertex of which 221 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 17 place count 206 transition count 279
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 206 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 45 place count 206 transition count 266
Applied a total of 45 rules in 23 ms. Remains 206 /251 variables (removed 45) and now considering 266/343 (removed 77) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 206/251 places, 266/343 transitions.
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 9 ms
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 9 ms
[2024-05-26 01:30:05] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 20 place count 231 transition count 328
Iterating global reduction 1 with 15 rules applied. Total rules applied 35 place count 231 transition count 328
Applied a total of 35 rules in 6 ms. Remains 231 /251 variables (removed 20) and now considering 328/343 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 231/251 places, 328/343 transitions.
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 10 ms
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:30:05] [INFO ] Input system was already deterministic with 328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 343/343 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 246 transition count 343
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 228 transition count 325
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 228 transition count 325
Applied a total of 41 rules in 6 ms. Remains 228 /251 variables (removed 23) and now considering 325/343 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 228/251 places, 325/343 transitions.
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 9 ms
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 10 ms
[2024-05-26 01:30:05] [INFO ] Input system was already deterministic with 325 transitions.
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:30:05] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:30:05] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-26 01:30:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 343 transitions and 1151 arcs took 5 ms.
Total runtime 34947 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-4A

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/423/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: 570
MODEL NAME: /home/mcc/execution/423/model
251 places, 343 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 NoC3x3-PT-4A-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NoC3x3-PT-4A-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NoC3x3-PT-4A-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="NoC3x3-PT-4A"
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 NoC3x3-PT-4A, 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 r245-tall-171654350300602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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