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-171679080500540.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-S128P09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080500540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 02:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 12 02:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 02:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 02:39 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 814K 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-S128P09-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717228514209

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:55:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:55:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:55:15] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-06-01 07:55:15] [INFO ] Transformed 242 places.
[2024-06-01 07:55:15] [INFO ] Transformed 946 transitions.
[2024-06-01 07:55:15] [INFO ] Parsed PT model containing 242 places and 946 transitions and 6609 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 64 places in 4 ms
Reduce places removed 64 places and 534 transitions.
Ensure Unique test removed 212 transitions
Reduce redundant transitions removed 212 transitions.
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 200/200 transitions.
Ensure Unique test removed 19 places
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 55 transition count 74
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 259 place count 45 transition count 61
Iterating global reduction 1 with 10 rules applied. Total rules applied 269 place count 45 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 272 place count 45 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 278 place count 39 transition count 52
Iterating global reduction 2 with 6 rules applied. Total rules applied 284 place count 39 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 288 place count 35 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 292 place count 35 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 296 place count 35 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 298 place count 35 transition count 42
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 306 place count 31 transition count 38
Applied a total of 306 rules in 32 ms. Remains 31 /178 variables (removed 147) and now considering 38/200 (removed 162) transitions.
[2024-06-01 07:55:15] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 31 cols
[2024-06-01 07:55:15] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 07:55:16] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 07:55:16] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
[2024-06-01 07:55:16] [INFO ] Invariant cache hit.
[2024-06-01 07:55:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 07:55:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 07:55:16] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
[2024-06-01 07:55:16] [INFO ] Invariant cache hit.
[2024-06-01 07:55:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 32/63 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 55 constraints, problems are : Problem set: 0 solved, 32 unsolved in 678 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 32/63 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 87 constraints, problems are : Problem set: 0 solved, 32 unsolved in 364 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1093ms
Starting structural reductions in LTL mode, iteration 1 : 31/178 places, 38/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1473 ms. Remains : 31/178 places, 38/200 transitions.
Support contains 6 out of 31 places after structural reductions.
[2024-06-01 07:55:17] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:55:17] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:55:17] [INFO ] Input system was already deterministic with 38 transitions.
RANDOM walk for 30067 steps (6 resets) in 529 ms. (56 steps per ms) remains 0/4 properties
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 38/38 transitions.
Graph (complete) has 69 edges and 31 vertex of which 25 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 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 21 transition count 32
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 21 transition count 32
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 18 transition count 29
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 18 transition count 29
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 14 transition count 25
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 14 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 23 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 27 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 12 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 10 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 10 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 10 transition count 15
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 33 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 9 transition count 14
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 35 place count 9 transition count 13
Applied a total of 35 rules in 14 ms. Remains 9 /31 variables (removed 22) and now considering 13/38 (removed 25) transitions.
// Phase 1: matrix 13 rows 9 cols
[2024-06-01 07:55:18] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 07:55:18] [INFO ] Redundant transitions in 15 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/19 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/31 places, 13/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 9/31 places, 13/38 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLFireability-10 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 38/38 transitions.
Graph (complete) has 69 edges and 31 vertex of which 25 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 1 places
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 21 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 21 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 8 place count 21 transition count 31
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 18 transition count 28
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 18 transition count 28
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 14 transition count 24
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 14 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 14 transition count 20
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 28 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 13 vertex of which 12 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 30 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 10 transition count 15
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 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 5 with 1 rules applied. Total rules applied 36 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 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 6 with 1 rules applied. Total rules applied 38 place count 9 transition count 12
Applied a total of 38 rules in 11 ms. Remains 9 /31 variables (removed 22) and now considering 12/38 (removed 26) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-06-01 07:55:18] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 07:55:18] [INFO ] Redundant transitions in 14 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/20 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 72 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/20 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/31 places, 12/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 9/31 places, 12/38 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLFireability-15 finished in 290 ms.
All properties solved by simple procedures.
Total runtime 3480 ms.
ITS solved all properties within timeout

BK_STOP 1717228518922

--------------------
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 LTLFireability -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-S128P09"
export BK_EXAMINATION="LTLFireability"
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-S128P09, examination is LTLFireability"
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-171679080500540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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