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.r091-tall-171624188000595.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d2m10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188000595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.0K 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 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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 DBSingleClientW-PT-d2m10-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716307575177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:06:16] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 16:06:16] [INFO ] Transformed 4763 places.
[2024-05-21 16:06:16] [INFO ] Transformed 2478 transitions.
[2024-05-21 16:06:16] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 634 place count 748 transition count 1211
Iterating global reduction 1 with 389 rules applied. Total rules applied 1023 place count 748 transition count 1211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1032 place count 748 transition count 1202
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1347 place count 433 transition count 887
Iterating global reduction 2 with 315 rules applied. Total rules applied 1662 place count 433 transition count 887
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1674 place count 433 transition count 875
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1914 place count 193 transition count 535
Iterating global reduction 3 with 240 rules applied. Total rules applied 2154 place count 193 transition count 535
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2365 place count 193 transition count 324
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2389 place count 169 transition count 279
Iterating global reduction 4 with 24 rules applied. Total rules applied 2413 place count 169 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2419 place count 169 transition count 273
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2435 place count 153 transition count 257
Iterating global reduction 5 with 16 rules applied. Total rules applied 2451 place count 153 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2454 place count 153 transition count 254
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2468 place count 139 transition count 240
Iterating global reduction 6 with 14 rules applied. Total rules applied 2482 place count 139 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2495 place count 139 transition count 227
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2501 place count 133 transition count 198
Iterating global reduction 7 with 6 rules applied. Total rules applied 2507 place count 133 transition count 198
Applied a total of 2507 rules in 194 ms. Remains 133 /1183 variables (removed 1050) and now considering 198/2478 (removed 2280) transitions.
// Phase 1: matrix 198 rows 133 cols
[2024-05-21 16:06:17] [INFO ] Computed 2 invariants in 15 ms
[2024-05-21 16:06:17] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 16:06:17] [INFO ] Invariant cache hit.
[2024-05-21 16:06:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 16:06:17] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-21 16:06:17] [INFO ] Invariant cache hit.
[2024-05-21 16:06:17] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/331 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6632 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/331 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 197/403 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 403 constraints, problems are : Problem set: 0 solved, 197 unsolved in 11688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints]
After SMT, in 18806ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 18825ms
Starting structural reductions in LTL mode, iteration 1 : 133/1183 places, 198/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19641 ms. Remains : 133/1183 places, 198/2478 transitions.
Support contains 3 out of 133 places after structural reductions.
[2024-05-21 16:06:36] [INFO ] Flatten gal took : 38 ms
[2024-05-21 16:06:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:06:36] [INFO ] Input system was already deterministic with 198 transitions.
RANDOM walk for 40000 steps (9170 resets) in 914 ms. (43 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (3877 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3772 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
[2024-05-21 16:06:37] [INFO ] Invariant cache hit.
[2024-05-21 16:06:37] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/225 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 100/325 variables, 42/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 58/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/331 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:06:37] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 137/225 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 100/325 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 58/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/331 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/331 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/331 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 198/198 transitions.
Graph (complete) has 456 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 132 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 131 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 131 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 130 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 130 transition count 193
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 130 transition count 192
Applied a total of 9 rules in 25 ms. Remains 130 /133 variables (removed 3) and now considering 192/198 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 130/133 places, 192/198 transitions.
RANDOM walk for 40000 steps (9162 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3901 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3857 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18147 steps, run visited all 2 properties in 128 ms. (steps per millisecond=141 )
Probabilistic random walk after 18147 steps, saw 8947 distinct states, run finished after 132 ms. (steps per millisecond=137 ) properties seen :2
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 487 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 129 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 128 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 128 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 128 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 127 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 127 transition count 183
Applied a total of 14 rules in 29 ms. Remains 127 /133 variables (removed 6) and now considering 183/198 (removed 15) transitions.
// Phase 1: matrix 183 rows 127 cols
[2024-05-21 16:06:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 16:06:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 16:06:38] [INFO ] Invariant cache hit.
[2024-05-21 16:06:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 16:06:38] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 16:06:38] [INFO ] Redundant transitions in 7 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 16:06:38] [INFO ] Invariant cache hit.
[2024-05-21 16:06:38] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 16:06:41] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 191 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6877 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/310 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 373 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 1/1 constraints]
After SMT, in 19400ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 19403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/133 places, 183/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19774 ms. Remains : 127/133 places, 183/198 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLCardinality-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLCardinality-11 finished in 19990 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' '!(G(F(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 129 transition count 191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 128 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 128 transition count 183
Applied a total of 12 rules in 22 ms. Remains 128 /133 variables (removed 5) and now considering 183/198 (removed 15) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 16:06:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 16:06:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 16:06:58] [INFO ] Invariant cache hit.
[2024-05-21 16:06:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 16:06:58] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-21 16:06:58] [INFO ] Redundant transitions in 11 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 16:06:58] [INFO ] Invariant cache hit.
[2024-05-21 16:06:58] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 191 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 373 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 19523ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 19525ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/133 places, 183/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20017 ms. Remains : 128/133 places, 183/198 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLCardinality-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLCardinality-15 finished in 20111 ms.
All properties solved by simple procedures.
Total runtime 61926 ms.
ITS solved all properties within timeout

BK_STOP 1716307638280

--------------------
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 LTLCardinality -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="DBSingleClientW-PT-d2m10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d2m10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188000595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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