fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654405500018
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ParamProductionCell-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
394.623 26211.00 65422.00 265.40 FTTFFTFTTTFFFTTF 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.r267-smll-171654405500018.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 ParamProductionCell-PT-1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405500018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.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 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K 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 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-CTLFireability-2024-00
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-01
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-02
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-03
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-04
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-05
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-06
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-07
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-08
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-09
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-10
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-11
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-12
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-13
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-14
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716648900314

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:55:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:55:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:55:03] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-25 14:55:03] [INFO ] Transformed 231 places.
[2024-05-25 14:55:03] [INFO ] Transformed 202 transitions.
[2024-05-25 14:55:03] [INFO ] Found NUPN structural information;
[2024-05-25 14:55:03] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 115 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 200
Applied a total of 4 rules in 75 ms. Remains 229 /231 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 229 cols
[2024-05-25 14:55:03] [INFO ] Computed 59 invariants in 27 ms
[2024-05-25 14:55:04] [INFO ] Implicit Places using invariants in 713 ms returned [1, 15, 16, 18, 19, 36, 42, 46, 59, 64, 73, 115, 120, 167, 194, 195]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 904 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 213/231 places, 200/202 transitions.
Applied a total of 0 rules in 17 ms. Remains 213 /213 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1034 ms. Remains : 213/231 places, 200/202 transitions.
Support contains 115 out of 213 places after structural reductions.
[2024-05-25 14:55:04] [INFO ] Flatten gal took : 101 ms
[2024-05-25 14:55:05] [INFO ] Flatten gal took : 46 ms
[2024-05-25 14:55:05] [INFO ] Input system was already deterministic with 200 transitions.
Reduction of identical properties reduced properties to check from 75 to 74
RANDOM walk for 40000 steps (8 resets) in 2832 ms. (14 steps per ms) remains 23/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 137 ms. (29 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 277 ms. (14 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 213 ms. (18 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 109 ms. (36 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
// Phase 1: matrix 200 rows 213 cols
[2024-05-25 14:55:07] [INFO ] Computed 43 invariants in 12 ms
[2024-05-25 14:55:07] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/168 variables, 16/16 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 6/22 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 14:55:07] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 36 ms to minimize.
[2024-05-25 14:55:07] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 4 ms to minimize.
[2024-05-25 14:55:07] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-25 14:55:07] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 14:55:08] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-25 14:55:08] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 6/28 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 14:55:08] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/29 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 14:55:08] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/30 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/30 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 3/171 variables, 3/33 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 14:55:08] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-25 14:55:09] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 2/35 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 10 (OVERLAPS) 28/199 variables, 12/47 constraints. Problems are: Problem set: 6 solved, 17 unsolved
[2024-05-25 14:55:09] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-05-25 14:55:09] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 4 ms to minimize.
[2024-05-25 14:55:09] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 4 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-25 14:55:09] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
[2024-05-25 14:55:10] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp55 is UNSAT
[2024-05-25 14:55:10] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 6/53 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 185/384 variables, 199/252 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 45/297 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/297 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 15/399 variables, 23/320 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/399 variables, 0/320 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 14/413 variables, 14/334 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/413 variables, 6/340 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/413 variables, 0/340 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/413 variables, 0/340 constraints. Problems are: Problem set: 18 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 340 constraints, problems are : Problem set: 18 solved, 5 unsolved in 4183 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 213/213 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 18 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/154 variables, 11/11 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 2/13 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/15 constraints. Problems are: Problem set: 18 solved, 5 unsolved
[2024-05-25 14:55:11] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-25 14:55:11] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-25 14:55:11] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-25 14:55:11] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/19 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 5/159 variables, 5/24 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 5 unsolved
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 8 (OVERLAPS) 32/191 variables, 16/40 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/41 constraints. Problems are: Problem set: 21 solved, 2 unsolved
[2024-05-25 14:55:11] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-25 14:55:12] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-25 14:55:12] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Int declared 191/413 variables, and 44 constraints, problems are : Problem set: 23 solved, 0 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 16/25 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/213 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 10/23 constraints]
After SMT, in 5183ms problems are : Problem set: 23 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:55:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 19 ms
[2024-05-25 14:55:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 59 out of 213 places (down from 78) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 27 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 14 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 211 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 211 transition count 198
Applied a total of 4 rules in 9 ms. Remains 211 /213 variables (removed 2) and now considering 198/200 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 211/213 places, 198/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 14 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 213 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 201 transition count 188
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 24 place count 201 transition count 173
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 54 place count 186 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 182 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 182 transition count 169
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 106 place count 160 transition count 147
Applied a total of 106 rules in 47 ms. Remains 160 /213 variables (removed 53) and now considering 147/200 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 160/213 places, 147/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 11 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 11 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 9 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 9 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 8 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 9 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 14 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 9 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 8 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 7 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 209/213 places, 196/200 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:55:12] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-25 14:55:12] [INFO ] Flatten gal took : 11 ms
[2024-05-25 14:55:13] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:55:13] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-25 14:55:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 213 places, 200 transitions and 780 arcs took 3 ms.
Total runtime 10264 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-1

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 606
MODEL NAME: /home/mcc/execution/412/model
213 places, 200 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 ParamProductionCell-PT-1-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716648926525

--------------------
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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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-171654405500018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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