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

--------------------
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-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717228487106

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-S128P06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:54:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:54:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:54:48] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-06-01 07:54:48] [INFO ] Transformed 262 places.
[2024-06-01 07:54:48] [INFO ] Transformed 1328 transitions.
[2024-06-01 07:54:48] [INFO ] Parsed PT model containing 262 places and 1328 transitions and 9727 arcs in 282 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 3 formulas.
Deduced a syphon composed of 82 places in 5 ms
Reduce places removed 82 places and 792 transitions.
Ensure Unique test removed 195 transitions
Reduce redundant transitions removed 195 transitions.
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 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 13 places
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 0 with 318 rules applied. Total rules applied 318 place count 65 transition count 138
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 332 place count 51 transition count 112
Iterating global reduction 1 with 14 rules applied. Total rules applied 346 place count 51 transition count 112
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 356 place count 51 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 364 place count 43 transition count 94
Iterating global reduction 2 with 8 rules applied. Total rules applied 372 place count 43 transition count 94
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 384 place count 43 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 412 place count 43 transition count 54
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 435 place count 32 transition count 42
Applied a total of 435 rules in 49 ms. Remains 32 /180 variables (removed 148) and now considering 42/341 (removed 299) transitions.
[2024-06-01 07:54:49] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 32 cols
[2024-06-01 07:54:49] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 07:54:49] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 07:54:49] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2024-06-01 07:54:49] [INFO ] Invariant cache hit.
[2024-06-01 07:54:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 07:54:49] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-06-01 07:54:49] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2024-06-01 07:54:49] [INFO ] Invariant cache hit.
[2024-06-01 07:54:49] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 31/57 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/59 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/70 variables, and 43 constraints, problems are : Problem set: 0 solved, 24 unsolved in 355 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/32 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 31/57 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2/59 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/70 variables, and 67 constraints, problems are : Problem set: 0 solved, 24 unsolved in 271 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/32 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 664ms
Starting structural reductions in LTL mode, iteration 1 : 32/180 places, 42/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1000 ms. Remains : 32/180 places, 42/341 transitions.
Support contains 8 out of 32 places after structural reductions.
[2024-06-01 07:54:50] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:54:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:54:50] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 176 steps (0 resets) in 20 ms. (8 steps per ms) remains 0/3 properties
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' '!(X((p0||X(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 40
Applied a total of 4 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 40/42 (removed 2) transitions.
[2024-06-01 07:54:50] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 30 cols
[2024-06-01 07:54:50] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:54:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:54:50] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:54:50] [INFO ] Invariant cache hit.
[2024-06-01 07:54:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 07:54:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-06-01 07:54:50] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2024-06-01 07:54:50] [INFO ] Invariant cache hit.
[2024-06-01 07:54:50] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 31/57 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/59 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/66 variables, and 43 constraints, problems are : Problem set: 0 solved, 24 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/30 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 31/57 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2/59 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/66 variables, and 67 constraints, problems are : Problem set: 0 solved, 24 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/30 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 40/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 30/32 places, 40/42 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P06-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P06-LTLFireability-10 finished in 983 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 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 42/42 transitions.
Graph (complete) has 64 edges and 32 vertex of which 23 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 22 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 21 transition count 34
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 21 transition count 34
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 20 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 20 transition count 32
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 11 place count 20 transition count 30
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 13 place count 18 transition count 29
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 17 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 17 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 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 4 with 1 rules applied. Total rules applied 17 place count 17 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 18 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 5 with 1 rules applied. Total rules applied 19 place count 16 transition count 25
Applied a total of 19 rules in 16 ms. Remains 16 /32 variables (removed 16) and now considering 25/42 (removed 17) transitions.
[2024-06-01 07:54:51] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 16 cols
[2024-06-01 07:54:51] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:54:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:54:51] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2024-06-01 07:54:51] [INFO ] Invariant cache hit.
[2024-06-01 07:54:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:54:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 07:54:51] [INFO ] Redundant transitions in 21 ms returned [21, 23]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 7 sub problems to find dead transitions.
[2024-06-01 07:54:51] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 16 cols
[2024-06-01 07:54:51] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:54:51] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/29 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/38 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 58 ms.
Refiners :[State Equation: 12/16 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/29 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/31 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 7 unsolved in 91 ms.
Refiners :[State Equation: 13/16 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 23/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 248 ms. Remains : 16/32 places, 23/42 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P06-LTLFireability-11
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P06-LTLFireability-11 finished in 289 ms.
All properties solved by simple procedures.
Total runtime 3421 ms.
ITS solved all properties within timeout

BK_STOP 1717228491691

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S128P06"
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-S128P06, 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-171679080500532"
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 [ "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 ;