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

About the Execution of LTSMin+red for SemanticWebServices-PT-S128P06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
279.027 9144.00 21025.00 64.30 T?T?T??F?F?????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.r524-tall-171679080500529.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 ltsminxred
Input is SemanticWebServices-PT-S128P06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080500529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 17K Apr 12 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 12 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 02:47 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 1.2M 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-S128P06-CTLCardinality-2024-00
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-01
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-02
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-03
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-04
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-05
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-06
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-07
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-08
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-09
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-10
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2024-11
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2023-12
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2023-13
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2023-14
FORMULA_NAME SemanticWebServices-PT-S128P06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717228476117

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:54:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:54:37] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-06-01 07:54:37] [INFO ] Transformed 262 places.
[2024-06-01 07:54:37] [INFO ] Transformed 1328 transitions.
[2024-06-01 07:54:37] [INFO ] Parsed PT model containing 262 places and 1328 transitions and 9727 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 82 places in 4 ms
Reduce places removed 82 places and 792 transitions.
Ensure Unique test removed 195 transitions
Reduce redundant transitions removed 195 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 341/341 transitions.
Ensure Unique test removed 10 places
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 100 transition count 229
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 199 place count 93 transition count 201
Iterating global reduction 1 with 7 rules applied. Total rules applied 206 place count 93 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 211 place count 93 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 2 with 33 rules applied. Total rules applied 244 place count 93 transition count 163
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 254 place count 89 transition count 157
Applied a total of 254 rules in 32 ms. Remains 89 /180 variables (removed 91) and now considering 157/341 (removed 184) transitions.
[2024-06-01 07:54:37] [INFO ] Flow matrix only has 119 transitions (discarded 38 similar events)
Normalized transition count is 118 out of 119 initially.
// Phase 1: matrix 118 rows 89 cols
[2024-06-01 07:54:37] [INFO ] Computed 4 invariants in 7 ms
[2024-06-01 07:54:37] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 07:54:37] [INFO ] Flow matrix only has 119 transitions (discarded 38 similar events)
[2024-06-01 07:54:37] [INFO ] Invariant cache hit.
[2024-06-01 07:54:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 07:54:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-01 07:54:38] [INFO ] Flow matrix only has 119 transitions (discarded 38 similar events)
[2024-06-01 07:54:38] [INFO ] Invariant cache hit.
[2024-06-01 07:54:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 78/132 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 14/146 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 5/151 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 2/153 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 2/155 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 16 (OVERLAPS) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/208 variables, and 110 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2447 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 65/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 78/132 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 14/146 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 46/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 5/151 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 2/153 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/153 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 16 (OVERLAPS) 2/155 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 18 (OVERLAPS) 0/155 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/208 variables, and 194 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2781 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 65/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 5287ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 5305ms
Starting structural reductions in LTL mode, iteration 1 : 89/180 places, 157/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5679 ms. Remains : 89/180 places, 157/341 transitions.
Support contains 61 out of 89 places after structural reductions.
[2024-06-01 07:54:43] [INFO ] Flatten gal took : 41 ms
[2024-06-01 07:54:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SemanticWebServices-PT-S128P06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:54:43] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:54:43] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 49 out of 89 places (down from 61) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2113 ms. (18 steps per ms) remains 2/38 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
[2024-06-01 07:54:44] [INFO ] Flow matrix only has 119 transitions (discarded 38 similar events)
[2024-06-01 07:54:44] [INFO ] Invariant cache hit.
[2024-06-01 07:54:44] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/64 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 25/89 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/101 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/107 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/107 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/115 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/115 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/115 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/131 variables, 35/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/131 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/131 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 17/148 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/148 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/148 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/208 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/89 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/64 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 25/89 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/101 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/101 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/107 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/107 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/115 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/115 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 16/131 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/131 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/131 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 17/148 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/148 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/148 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/208 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/89 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 14 ms.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 53 transition count 104
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 98 place count 44 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 107 place count 44 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 44 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 41 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 41 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 41 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 140 place count 41 transition count 58
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 159 place count 32 transition count 48
Applied a total of 159 rules in 3 ms. Remains 32 /89 variables (removed 57) and now considering 48/157 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 32/89 places, 48/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Graph (complete) has 216 edges and 89 vertex of which 56 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 52 transition count 106
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 43 transition count 94
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 43 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 43 transition count 85
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 39 transition count 81
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 39 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 92 place count 39 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 111 place count 39 transition count 54
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 57 edges and 30 vertex of which 29 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 3 with 20 rules applied. Total rules applied 131 place count 29 transition count 43
Applied a total of 131 rules in 19 ms. Remains 29 /89 variables (removed 60) and now considering 43/157 (removed 114) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 29/89 places, 43/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Graph (complete) has 216 edges and 89 vertex of which 48 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 44 transition count 98
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 33 transition count 80
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 33 transition count 80
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 33 transition count 70
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 28 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 28 transition count 65
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 28 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 124 place count 28 transition count 39
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 43 edges and 19 vertex of which 18 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 3 with 18 rules applied. Total rules applied 142 place count 18 transition count 30
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 17 transition count 29
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 17 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 17 transition count 28
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 146 place count 17 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 16 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 16 transition count 26
Applied a total of 148 rules in 9 ms. Remains 16 /89 variables (removed 73) and now considering 26/157 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 16/89 places, 26/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 55 transition count 105
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 45 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 45 transition count 88
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 116 place count 45 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 40 transition count 73
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 40 transition count 73
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 135 place count 40 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 148 place count 40 transition count 51
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 162 place count 33 transition count 44
Applied a total of 162 rules in 3 ms. Remains 33 /89 variables (removed 56) and now considering 44/157 (removed 113) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 33/89 places, 44/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 56 transition count 109
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 92 place count 45 transition count 91
Iterating global reduction 1 with 11 rules applied. Total rules applied 103 place count 45 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 113 place count 45 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 40 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 40 transition count 76
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 40 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 146 place count 40 transition count 53
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 164 place count 32 transition count 43
Applied a total of 164 rules in 3 ms. Remains 32 /89 variables (removed 57) and now considering 43/157 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 32/89 places, 43/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 52 transition count 103
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 101 place count 42 transition count 86
Iterating global reduction 1 with 10 rules applied. Total rules applied 111 place count 42 transition count 86
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 121 place count 42 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 38 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 38 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 137 place count 38 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 151 place count 38 transition count 50
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 168 place count 30 transition count 41
Applied a total of 168 rules in 3 ms. Remains 30 /89 variables (removed 59) and now considering 41/157 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 30/89 places, 41/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Graph (complete) has 216 edges and 89 vertex of which 50 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 46 transition count 100
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 35 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 35 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 85 place count 35 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 29 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 29 transition count 70
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 107 place count 29 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 127 place count 29 transition count 40
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 40 edges and 19 vertex of which 18 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 3 with 21 rules applied. Total rules applied 148 place count 18 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 17 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 17 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 17 transition count 27
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 152 place count 17 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 153 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 154 place count 16 transition count 25
Applied a total of 154 rules in 8 ms. Remains 16 /89 variables (removed 73) and now considering 25/157 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 16/89 places, 25/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 56 transition count 114
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 49 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 49 transition count 100
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 49 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 45 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 45 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 45 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 130 place count 45 transition count 64
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 150 place count 37 transition count 52
Applied a total of 150 rules in 3 ms. Remains 37 /89 variables (removed 52) and now considering 52/157 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 37/89 places, 52/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 52 transition count 103
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 102 place count 41 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 113 place count 41 transition count 85
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 123 place count 41 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 36 transition count 70
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 36 transition count 70
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 36 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 156 place count 36 transition count 47
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 172 place count 28 transition count 39
Applied a total of 172 rules in 3 ms. Remains 28 /89 variables (removed 61) and now considering 39/157 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 28/89 places, 39/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 157/157 transitions.
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 55 transition count 107
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 45 transition count 90
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 45 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 113 place count 45 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 40 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 40 transition count 76
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 40 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 145 place count 40 transition count 54
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 162 place count 32 transition count 45
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 163 place count 32 transition count 44
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 165 place count 31 transition count 43
Applied a total of 165 rules in 4 ms. Remains 31 /89 variables (removed 58) and now considering 43/157 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 31/89 places, 43/157 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:54:44] [INFO ] Input system was already deterministic with 43 transitions.
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:54:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:54:44] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:54:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 157 transitions and 554 arcs took 2 ms.
Total runtime 7638 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-01
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-03
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-05
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-06
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-08
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-10
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2024-11
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2023-12
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2023-13
Could not compute solution for formula : SemanticWebServices-PT-S128P06-CTLCardinality-2023-14

BK_STOP 1717228485261

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/510/ctl_0_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/510/ctl_1_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/510/ctl_2_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/510/ctl_3_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/510/ctl_4_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/510/ctl_5_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/510/ctl_6_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/510/ctl_7_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/510/ctl_8_
ctl formula name SemanticWebServices-PT-S128P06-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/510/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S128P06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SemanticWebServices-PT-S128P06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080500529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P06.tgz
mv SemanticWebServices-PT-S128P06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;