About the Execution of GreatSPN+red for Szymanski-PT-a08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15585.611 | 1869383.00 | 6959314.00 | 982.50 | ??F?????T??FT?F? | 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.r399-tall-171690531200834.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 Szymanski-PT-a08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531200834
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 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 101K 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 Szymanski-PT-a08-CTLFireability-2024-00
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-01
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-02
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-03
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-04
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-05
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-06
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-07
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-08
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-09
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-10
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2024-11
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2023-12
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2023-13
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2023-14
FORMULA_NAME Szymanski-PT-a08-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717092804077
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 18:13:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 18:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:13:25] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-30 18:13:25] [INFO ] Transformed 61 places.
[2024-05-30 18:13:25] [INFO ] Transformed 224 transitions.
[2024-05-30 18:13:25] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
Support contains 36 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 46 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 212
Applied a total of 4 rules in 22 ms. Remains 46 /49 variables (removed 3) and now considering 212/216 (removed 4) transitions.
[2024-05-30 18:13:25] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 46 cols
[2024-05-30 18:13:25] [INFO ] Computed 1 invariants in 10 ms
[2024-05-30 18:13:25] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-30 18:13:25] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2024-05-30 18:13:25] [INFO ] Invariant cache hit.
[2024-05-30 18:13:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 18:13:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-30 18:13:25] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2024-05-30 18:13:25] [INFO ] Invariant cache hit.
[2024-05-30 18:13:25] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 78/124 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 0/124 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 56 constraints, problems are : Problem set: 0 solved, 210 unsolved in 2559 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 78/124 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 210/266 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 266 constraints, problems are : Problem set: 0 solved, 210 unsolved in 3189 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
After SMT, in 5882ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 5899ms
Starting structural reductions in LTL mode, iteration 1 : 46/49 places, 212/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6230 ms. Remains : 46/49 places, 212/216 transitions.
Support contains 36 out of 46 places after structural reductions.
[2024-05-30 18:13:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 18:13:31] [INFO ] Flatten gal took : 41 ms
[2024-05-30 18:13:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a08-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a08-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:13:31] [INFO ] Flatten gal took : 16 ms
[2024-05-30 18:13:31] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 33 out of 46 places (down from 36) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 47 to 45
RANDOM walk for 40008 steps (47 resets) in 1353 ms. (29 steps per ms) remains 15/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
[2024-05-30 18:13:32] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2024-05-30 18:13:32] [INFO ] Invariant cache hit.
[2024-05-30 18:13:32] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 24/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 3 (OVERLAPS) 78/124 variables, 46/47 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 9/56 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/56 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/56 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 56 constraints, problems are : Problem set: 5 solved, 8 unsolved in 214 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 34/46 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 78/124 variables, 46/47 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 9/56 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 8/64 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/64 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/64 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 64 constraints, problems are : Problem set: 5 solved, 8 unsolved in 190 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 5 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 12 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 212/212 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 42 transition count 195
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 42 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 42 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 40 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 40 transition count 171
Applied a total of 29 rules in 29 ms. Remains 40 /46 variables (removed 6) and now considering 171/212 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 40/46 places, 171/212 transitions.
RANDOM walk for 40020 steps (15 resets) in 163 ms. (244 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
[2024-05-30 18:13:33] [INFO ] Flow matrix only has 67 transitions (discarded 104 similar events)
// Phase 1: matrix 67 rows 40 cols
[2024-05-30 18:13:33] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 18:13:33] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 67/107 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 50 constraints, problems are : Problem set: 0 solved, 6 unsolved in 123 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 67/107 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 56 constraints, problems are : Problem set: 0 solved, 6 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 12493 steps, including 618 resets, run visited all 6 properties in 68 ms. (steps per millisecond=183 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 74 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a08-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 11 ms
[2024-05-30 18:13:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a08-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 12 ms
[2024-05-30 18:13:33] [INFO ] Input system was already deterministic with 212 transitions.
Computed a total of 8 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/46 places, 196/212 transitions.
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:13:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 42 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 40 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 40 transition count 176
Applied a total of 24 rules in 21 ms. Remains 40 /46 variables (removed 6) and now considering 176/212 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 40/46 places, 176/212 transitions.
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:13:33] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 204
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 204/212 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 44/46 places, 204/212 transitions.
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:13:33] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/46 places, 196/212 transitions.
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 15 ms
[2024-05-30 18:13:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 204
Applied a total of 4 rules in 2 ms. Remains 44 /46 variables (removed 2) and now considering 204/212 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/46 places, 204/212 transitions.
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:13:33] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:13:33] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 42 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 40 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 40 transition count 176
Applied a total of 24 rules in 13 ms. Remains 40 /46 variables (removed 6) and now considering 176/212 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 40/46 places, 176/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/46 places, 196/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/46 places, 196/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 40 transition count 172
Applied a total of 28 rules in 13 ms. Remains 40 /46 variables (removed 6) and now considering 172/212 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 40/46 places, 172/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/46 places, 196/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/46 places, 196/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 200
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 200/212 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/46 places, 200/212 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:13:34] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-30 18:13:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 212 transitions and 844 arcs took 3 ms.
Total runtime 9067 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Szymanski-PT-a08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 46
TRANSITIONS: 212
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/405/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: 545
MODEL NAME: /home/mcc/execution/405/model
46 places, 212 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 Szymanski-PT-a08-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a08-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA Szymanski-PT-a08-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717094673460
--------------------
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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="Szymanski-PT-a08"
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 Szymanski-PT-a08, 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 r399-tall-171690531200834"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a08.tgz
mv Szymanski-PT-a08 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 '
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 ;