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.r333-tall-171679078600490.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 SemanticWebServices-PT-S064P06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078600490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 02:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 96K 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 SemanticWebServices-PT-S064P06-CTLFireability-2024-00
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-01
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-02
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-03
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-04
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-05
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-06
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-07
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-08
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-09
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-10
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2024-11
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2023-12
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2023-13
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2023-14
FORMULA_NAME SemanticWebServices-PT-S064P06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716872535065

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:02:16] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-28 05:02:16] [INFO ] Transformed 97 places.
[2024-05-28 05:02:16] [INFO ] Transformed 164 transitions.
[2024-05-28 05:02:16] [INFO ] Parsed PT model containing 97 places and 164 transitions and 661 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 82/82 transitions.
Ensure Unique test removed 4 places
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 44 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 41 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 41 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 40 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 40 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 40 transition count 42
Applied a total of 95 rules in 21 ms. Remains 40 /95 variables (removed 55) and now considering 42/82 (removed 40) transitions.
[2024-05-28 05:02:16] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
// Phase 1: matrix 34 rows 40 cols
[2024-05-28 05:02:16] [INFO ] Computed 10 invariants in 5 ms
[2024-05-28 05:02:16] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 05:02:16] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
[2024-05-28 05:02:16] [INFO ] Invariant cache hit.
[2024-05-28 05:02:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 05:02:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-28 05:02:16] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
[2024-05-28 05:02:16] [INFO ] Invariant cache hit.
[2024-05-28 05:02:16] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/40 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/73 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/74 variables, and 73 constraints, problems are : Problem set: 0 solved, 36 unsolved in 497 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/40 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 33/73 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/74 variables, and 109 constraints, problems are : Problem set: 0 solved, 36 unsolved in 502 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1073ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1083ms
Starting structural reductions in LTL mode, iteration 1 : 40/95 places, 42/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 40/95 places, 42/82 transitions.
Support contains 32 out of 40 places after structural reductions.
[2024-05-28 05:02:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 22 ms
[2024-05-28 05:02:18] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 7 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 23 out of 40 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1382 ms. (28 steps per ms) remains 0/14 properties
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 5 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 10 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 42
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 25 transition count 35
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 25 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 22 transition count 30
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 22 transition count 30
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 22 transition count 27
Applied a total of 33 rules in 3 ms. Remains 22 /40 variables (removed 18) and now considering 27/42 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 22/40 places, 27/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Graph (complete) has 121 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 17 transition count 31
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 17 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 17 transition count 30
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 11 transition count 24
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 11 transition count 24
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 34 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 19 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 9 transition count 15
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 8 transition count 14
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 8 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 7 transition count 10
Applied a total of 45 rules in 14 ms. Remains 7 /40 variables (removed 33) and now considering 10/42 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 7/40 places, 10/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 0 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 0 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 42
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 24 transition count 35
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 24 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 24 transition count 33
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 20 transition count 29
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 20 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 20 transition count 25
Applied a total of 37 rules in 2 ms. Remains 20 /40 variables (removed 20) and now considering 25/42 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 20/40 places, 25/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 42
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 26 transition count 36
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 26 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 26 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 23 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 23 transition count 32
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 23 transition count 29
Applied a total of 30 rules in 1 ms. Remains 23 /40 variables (removed 17) and now considering 29/42 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/40 places, 29/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Graph (complete) has 121 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 8 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 19 transition count 32
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 19 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 19 transition count 31
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 13 transition count 25
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 13 transition count 25
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 34 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 10 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 9 transition count 12
Applied a total of 44 rules in 6 ms. Remains 9 /40 variables (removed 31) and now considering 12/42 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 9/40 places, 12/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 35 transition count 42
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 31 transition count 38
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 31 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 31 transition count 37
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 29 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 29 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 29 transition count 33
Applied a total of 20 rules in 1 ms. Remains 29 /40 variables (removed 11) and now considering 33/42 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 29/40 places, 33/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Graph (complete) has 121 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 17 transition count 31
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 17 transition count 29
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 12 transition count 24
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 12 transition count 24
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 12 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 20 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 10 transition count 15
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 9 transition count 14
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 9 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 42 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 43 place count 8 transition count 11
Applied a total of 43 rules in 4 ms. Remains 8 /40 variables (removed 32) and now considering 11/42 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 8/40 places, 11/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 0 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 0 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Graph (complete) has 121 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 9 places
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 17 transition count 31
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 17 transition count 29
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 11 transition count 23
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 11 transition count 23
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 18 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 8 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 8 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 7 transition count 10
Applied a total of 47 rules in 4 ms. Remains 7 /40 variables (removed 33) and now considering 10/42 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 7/40 places, 10/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 1 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 42/42 transitions.
Graph (complete) has 121 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 8 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 19 transition count 32
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 19 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 19 transition count 31
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 13 transition count 25
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 13 transition count 25
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 34 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 10 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 9 transition count 12
Applied a total of 44 rules in 5 ms. Remains 9 /40 variables (removed 31) and now considering 12/42 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 9/40 places, 12/42 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 0 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 0 ms
[2024-05-28 05:02:18] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 05:02:18] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-28 05:02:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 42 transitions and 156 arcs took 1 ms.
Total runtime 2546 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S064P06

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 530
MODEL NAME: /home/mcc/execution/411/model
40 places, 42 transitions.
Enabling coverability test.

CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716872539373

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="SemanticWebServices-PT-S064P06"
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 SemanticWebServices-PT-S064P06, 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 r333-tall-171679078600490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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