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.r267-smll-171654405600066.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 Parking-PT-208, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-CTLFireability-2024-00
FORMULA_NAME Parking-PT-208-CTLFireability-2024-01
FORMULA_NAME Parking-PT-208-CTLFireability-2024-02
FORMULA_NAME Parking-PT-208-CTLFireability-2024-03
FORMULA_NAME Parking-PT-208-CTLFireability-2024-04
FORMULA_NAME Parking-PT-208-CTLFireability-2024-05
FORMULA_NAME Parking-PT-208-CTLFireability-2024-06
FORMULA_NAME Parking-PT-208-CTLFireability-2024-07
FORMULA_NAME Parking-PT-208-CTLFireability-2024-08
FORMULA_NAME Parking-PT-208-CTLFireability-2024-09
FORMULA_NAME Parking-PT-208-CTLFireability-2024-10
FORMULA_NAME Parking-PT-208-CTLFireability-2024-11
FORMULA_NAME Parking-PT-208-CTLFireability-2023-12
FORMULA_NAME Parking-PT-208-CTLFireability-2023-13
FORMULA_NAME Parking-PT-208-CTLFireability-2023-14
FORMULA_NAME Parking-PT-208-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716652636901

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:57:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:57:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:57:19] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-25 15:57:19] [INFO ] Transformed 137 places.
[2024-05-25 15:57:19] [INFO ] Transformed 201 transitions.
[2024-05-25 15:57:19] [INFO ] Found NUPN structural information;
[2024-05-25 15:57:19] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Support contains 70 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Applied a total of 0 rules in 22 ms. Remains 137 /137 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 137 cols
[2024-05-25 15:57:20] [INFO ] Computed 34 invariants in 13 ms
[2024-05-25 15:57:20] [INFO ] Implicit Places using invariants in 508 ms returned [28, 44, 64, 94, 102, 110, 118, 130, 132]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 584 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 113
Applied a total of 8 rules in 42 ms. Remains 124 /128 variables (removed 4) and now considering 113/117 (removed 4) transitions.
// Phase 1: matrix 113 rows 124 cols
[2024-05-25 15:57:20] [INFO ] Computed 25 invariants in 5 ms
[2024-05-25 15:57:20] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-25 15:57:20] [INFO ] Invariant cache hit.
[2024-05-25 15:57:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 15:57:21] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 113/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1182 ms. Remains : 124/137 places, 113/117 transitions.
Support contains 70 out of 124 places after structural reductions.
[2024-05-25 15:57:21] [INFO ] Flatten gal took : 71 ms
[2024-05-25 15:57:21] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:57:21] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 40000 steps (1161 resets) in 3110 ms. (12 steps per ms) remains 14/67 properties
BEST_FIRST walk for 40004 steps (98 resets) in 396 ms. (100 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (98 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (103 resets) in 121 ms. (327 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (86 resets) in 99 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (101 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (106 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 510 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 122 ms. (325 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (104 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (100 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (103 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
[2024-05-25 15:57:23] [INFO ] Invariant cache hit.
[2024-05-25 15:57:23] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 92/124 variables, 25/25 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/175 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/175 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 175 constraints, problems are : Problem set: 5 solved, 5 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/124 variables, 25/25 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 4/179 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/179 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-25 15:57:24] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 18 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/237 variables, 1/180 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/180 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/180 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 180 constraints, problems are : Problem set: 6 solved, 4 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 1279ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 1 properties in 964 ms.
Support contains 13 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 108 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 107 transition count 116
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 49 place count 107 transition count 101
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 64 place count 92 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 92 transition count 101
Applied a total of 65 rules in 88 ms. Remains 92 /124 variables (removed 32) and now considering 101/113 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 92/124 places, 101/113 transitions.
RANDOM walk for 40000 steps (1243 resets) in 569 ms. (70 steps per ms) remains 2/3 properties
BEST_FIRST walk for 32904 steps (183 resets) in 145 ms. (225 steps per ms) remains 0/2 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA Parking-PT-208-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:57:26] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Parking-PT-208-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 20 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 113 transitions.
Support contains 56 out of 124 places (down from 62) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 20 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 5 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 121/124 places, 110/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 4 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/124 places, 110/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 5 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 120 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 120 transition count 106
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 117 transition count 106
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 113 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 113 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 110 transition count 99
Applied a total of 26 rules in 21 ms. Remains 110 /124 variables (removed 14) and now considering 99/113 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 110/124 places, 99/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 114 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 114 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 112 transition count 101
Applied a total of 24 rules in 19 ms. Remains 112 /124 variables (removed 12) and now considering 101/113 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 112/124 places, 101/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 121 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 120 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 117 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 113 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 110 transition count 99
Applied a total of 28 rules in 20 ms. Remains 110 /124 variables (removed 14) and now considering 99/113 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 110/124 places, 99/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 111
Applied a total of 4 rules in 3 ms. Remains 122 /124 variables (removed 2) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 122/124 places, 111/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 3 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/124 places, 109/113 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:57:26] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:57:26] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-25 15:57:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 113 transitions and 375 arcs took 3 ms.
Total runtime 7578 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Parking-PT-208

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 549
MODEL NAME: /home/mcc/execution/413/model
124 places, 113 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 Parking-PT-208-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716652655540

--------------------
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="Parking-PT-208"
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 Parking-PT-208, 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 r267-smll-171654405600066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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