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-171624187900523.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-d1m08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K 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.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 432K 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-d1m08-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716292636125

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-d1m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 11:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:57:17] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-21 11:57:17] [INFO ] Transformed 1440 places.
[2024-05-21 11:57:17] [INFO ] Transformed 672 transitions.
[2024-05-21 11:57:17] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 196 place count 231 transition count 332
Iterating global reduction 1 with 95 rules applied. Total rules applied 291 place count 231 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 295 place count 231 transition count 328
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 365 place count 161 transition count 258
Iterating global reduction 2 with 70 rules applied. Total rules applied 435 place count 161 transition count 258
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 441 place count 161 transition count 252
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 481 place count 121 transition count 189
Iterating global reduction 3 with 40 rules applied. Total rules applied 521 place count 121 transition count 189
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 543 place count 121 transition count 167
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 552 place count 112 transition count 150
Iterating global reduction 4 with 9 rules applied. Total rules applied 561 place count 112 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 563 place count 112 transition count 148
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 569 place count 106 transition count 142
Iterating global reduction 5 with 6 rules applied. Total rules applied 575 place count 106 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 577 place count 106 transition count 140
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 582 place count 101 transition count 135
Iterating global reduction 6 with 5 rules applied. Total rules applied 587 place count 101 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 588 place count 101 transition count 134
Applied a total of 588 rules in 82 ms. Remains 101 /347 variables (removed 246) and now considering 134/672 (removed 538) transitions.
// Phase 1: matrix 134 rows 101 cols
[2024-05-21 11:57:17] [INFO ] Computed 2 invariants in 14 ms
[2024-05-21 11:57:18] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 11:57:18] [INFO ] Invariant cache hit.
[2024-05-21 11:57:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 11:57:18] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-21 11:57:18] [INFO ] Invariant cache hit.
[2024-05-21 11:57:18] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/235 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 45/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 148 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/235 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 45/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 133/281 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 281 constraints, problems are : Problem set: 0 solved, 133 unsolved in 7573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 10897ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 10915ms
Starting structural reductions in LTL mode, iteration 1 : 101/347 places, 134/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11449 ms. Remains : 101/347 places, 134/672 transitions.
Support contains 5 out of 101 places after structural reductions.
[2024-05-21 11:57:29] [INFO ] Flatten gal took : 35 ms
[2024-05-21 11:57:29] [INFO ] Flatten gal took : 14 ms
[2024-05-21 11:57:29] [INFO ] Input system was already deterministic with 134 transitions.
RANDOM walk for 40000 steps (9108 resets) in 1754 ms. (22 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (3965 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3909 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
[2024-05-21 11:57:30] [INFO ] Invariant cache hit.
[2024-05-21 11:57:30] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 99/168 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 63/231 variables, 30/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 33/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/235 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/235 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 45/45 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 11:57:30] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 8 ms to minimize.
[2024-05-21 11:57:30] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:57:30] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 99/168 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 63/231 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 33/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/235 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/235 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 102 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 134/134 transitions.
Graph (complete) has 317 edges and 101 vertex of which 100 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 132
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 97 transition count 128
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 94 transition count 125
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 94 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 94 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 92 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 91 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 91 transition count 118
Applied a total of 24 rules in 27 ms. Remains 91 /101 variables (removed 10) and now considering 118/134 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 91/101 places, 118/134 transitions.
RANDOM walk for 40000 steps (9202 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3949 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15320 steps, run visited all 1 properties in 58 ms. (steps per millisecond=264 )
Probabilistic random walk after 15320 steps, saw 7237 distinct states, run finished after 61 ms. (steps per millisecond=251 ) properties seen :1
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 344 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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(p0)&&X((p1||G(p0)))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 134/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 98 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 98 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 97 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 97 transition count 129
Applied a total of 8 rules in 9 ms. Remains 97 /101 variables (removed 4) and now considering 129/134 (removed 5) transitions.
// Phase 1: matrix 129 rows 97 cols
[2024-05-21 11:57:30] [INFO ] Computed 2 invariants in 7 ms
[2024-05-21 11:57:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 11:57:31] [INFO ] Invariant cache hit.
[2024-05-21 11:57:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:57:31] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 11:57:31] [INFO ] Invariant cache hit.
[2024-05-21 11:57:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 42/141 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 141 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 42/141 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 128/269 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 269 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 10126ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10128ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 129/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10386 ms. Remains : 97/101 places, 129/134 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLCardinality-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLCardinality-06 finished in 10766 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 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 134/134 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 129
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 13 place count 92 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 18 place count 92 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 92 transition count 122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 89 transition count 111
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 89 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 89 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 88 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 88 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 87 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 87 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 87 transition count 106
Applied a total of 33 rules in 21 ms. Remains 87 /101 variables (removed 14) and now considering 106/134 (removed 28) transitions.
// Phase 1: matrix 106 rows 87 cols
[2024-05-21 11:57:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:57:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:57:41] [INFO ] Invariant cache hit.
[2024-05-21 11:57:41] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:57:41] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-21 11:57:41] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-21 11:57:41] [INFO ] Invariant cache hit.
[2024-05-21 11:57:41] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/193 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 34/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 123 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/193 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 34/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 105/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 228 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 7048ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7050ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/101 places, 106/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7271 ms. Remains : 87/101 places, 106/134 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLCardinality-09
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLCardinality-09 finished in 7330 ms.
All properties solved by simple procedures.
Total runtime 31702 ms.
ITS solved all properties within timeout

BK_STOP 1716292669070

--------------------
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 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-d1m08"
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-d1m08, 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-171624187900523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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