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.r480-tall-171624189500545.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 DBSingleClientW-PT-d2m04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 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 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-d2m04-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717190173732

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:16:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:16:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:16:15] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-31 21:16:15] [INFO ] Transformed 4763 places.
[2024-05-31 21:16:15] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:16:15] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 384 places :
Symmetric choice reduction at 1 with 384 rule applications. Total rules 629 place count 753 transition count 1233
Iterating global reduction 1 with 384 rules applied. Total rules applied 1013 place count 753 transition count 1233
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1031 place count 753 transition count 1215
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 1336 place count 448 transition count 910
Iterating global reduction 2 with 305 rules applied. Total rules applied 1641 place count 448 transition count 910
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1651 place count 448 transition count 900
Discarding 225 places :
Symmetric choice reduction at 3 with 225 rule applications. Total rules 1876 place count 223 transition count 584
Iterating global reduction 3 with 225 rules applied. Total rules applied 2101 place count 223 transition count 584
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 2299 place count 223 transition count 386
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2318 place count 204 transition count 350
Iterating global reduction 4 with 19 rules applied. Total rules applied 2337 place count 204 transition count 350
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2345 place count 204 transition count 342
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2359 place count 190 transition count 328
Iterating global reduction 5 with 14 rules applied. Total rules applied 2373 place count 190 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2376 place count 190 transition count 325
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2388 place count 178 transition count 313
Iterating global reduction 6 with 12 rules applied. Total rules applied 2400 place count 178 transition count 313
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2412 place count 178 transition count 301
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2414 place count 176 transition count 294
Iterating global reduction 7 with 2 rules applied. Total rules applied 2416 place count 176 transition count 294
Applied a total of 2416 rules in 208 ms. Remains 176 /1183 variables (removed 1007) and now considering 294/2478 (removed 2184) transitions.
// Phase 1: matrix 294 rows 176 cols
[2024-05-31 21:16:15] [INFO ] Computed 2 invariants in 22 ms
[2024-05-31 21:16:16] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-31 21:16:16] [INFO ] Invariant cache hit.
[2024-05-31 21:16:16] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-31 21:16:16] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 21:16:16] [INFO ] Invariant cache hit.
[2024-05-31 21:16:16] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/470 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 303 constraints, problems are : Problem set: 0 solved, 293 unsolved in 12483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/470 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 293/596 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 596 constraints, problems are : Problem set: 0 solved, 293 unsolved in 28190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints]
After SMT, in 41472ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41494ms
Starting structural reductions in LTL mode, iteration 1 : 176/1183 places, 294/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42790 ms. Remains : 176/1183 places, 294/2478 transitions.
Support contains 17 out of 176 places after structural reductions.
[2024-05-31 21:16:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-31 21:16:58] [INFO ] Flatten gal took : 74 ms
[2024-05-31 21:16:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:16:58] [INFO ] Flatten gal took : 36 ms
[2024-05-31 21:16:58] [INFO ] Input system was already deterministic with 294 transitions.
Support contains 11 out of 176 places (down from 17) after GAL structural reductions.
RANDOM walk for 40000 steps (9186 resets) in 2260 ms. (17 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (3861 resets) in 279 ms. (142 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (3821 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (3788 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3910 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (3756 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3783 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3838 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
[2024-05-31 21:17:00] [INFO ] Invariant cache hit.
[2024-05-31 21:17:00] [INFO ] State equation strengthened by 125 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 66/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 38/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 194/307 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 25/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 8 (OVERLAPS) 163/470 variables, 63/203 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 100/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 303 constraints, problems are : Problem set: 2 solved, 5 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/73 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/111 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-31 21:17:00] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 25 ms to minimize.
[2024-05-31 21:17:00] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2024-05-31 21:17:00] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 190/301 variables, 111/116 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 21/137 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 3/140 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 169/470 variables, 65/205 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 104/309 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 2/311 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/470 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/470 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 311 constraints, problems are : Problem set: 2 solved, 5 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1198ms problems are : Problem set: 2 solved, 5 unsolved
Parikh walk visited 1 properties in 1116 ms.
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 294/294 transitions.
Graph (complete) has 612 edges and 176 vertex of which 175 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 175 transition count 289
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 17 place count 164 transition count 278
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 164 transition count 278
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 33 place count 164 transition count 273
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 154 transition count 254
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 154 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 154 transition count 248
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 148 transition count 231
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 148 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 148 transition count 229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 146 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 146 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 146 transition count 226
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 145 transition count 225
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 145 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 81 place count 144 transition count 224
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 144 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 83 place count 143 transition count 222
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 143 transition count 222
Applied a total of 84 rules in 60 ms. Remains 143 /176 variables (removed 33) and now considering 222/294 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 143/176 places, 222/294 transitions.
RANDOM walk for 40000 steps (9253 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3822 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3944 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3813 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3840 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 40502 steps, run visited all 4 properties in 318 ms. (steps per millisecond=127 )
Probabilistic random walk after 40502 steps, saw 17271 distinct states, run finished after 322 ms. (steps per millisecond=125 ) properties seen :4
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:17:03] [INFO ] Input system was already deterministic with 294 transitions.
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 658 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 294/294 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 39 place count 160 transition count 267
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 146 transition count 246
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 146 transition count 246
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 146 transition count 239
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 136 transition count 208
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 136 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 136 transition count 203
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 132 transition count 186
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 132 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 130 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 130 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 129 transition count 182
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 128 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 128 transition count 180
Applied a total of 116 rules in 12 ms. Remains 128 /176 variables (removed 48) and now considering 180/294 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 128/176 places, 180/294 transitions.
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:17:03] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 294/294 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 39 place count 160 transition count 267
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 146 transition count 243
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 146 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 73 place count 146 transition count 237
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 136 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 136 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 136 transition count 208
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 103 place count 131 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 108 place count 131 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 131 transition count 189
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 129 transition count 187
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 129 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 115 place count 128 transition count 185
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 128 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 127 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 127 transition count 183
Applied a total of 118 rules in 12 ms. Remains 127 /176 variables (removed 49) and now considering 183/294 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 127/176 places, 183/294 transitions.
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:17:03] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 294/294 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 162 transition count 276
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 162 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 162 transition count 271
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 149 transition count 248
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 149 transition count 248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 149 transition count 241
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 141 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 141 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 141 transition count 217
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 137 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 137 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 137 transition count 206
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 135 transition count 204
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 135 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 135 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 100 place count 134 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 101 place count 134 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 133 transition count 200
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 133 transition count 200
Applied a total of 103 rules in 12 ms. Remains 133 /176 variables (removed 43) and now considering 200/294 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 133/176 places, 200/294 transitions.
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:17:03] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 294/294 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 162 transition count 280
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 162 transition count 280
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 162 transition count 273
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 150 transition count 250
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 150 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 150 transition count 244
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 142 transition count 217
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 142 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 142 transition count 212
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 139 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 139 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 139 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 138 transition count 200
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 138 transition count 200
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 137 transition count 199
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 137 transition count 199
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 136 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 136 transition count 197
Applied a total of 99 rules in 11 ms. Remains 136 /176 variables (removed 40) and now considering 197/294 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 136/176 places, 197/294 transitions.
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:17:03] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 13 ms
[2024-05-31 21:17:03] [INFO ] Flatten gal took : 13 ms
[2024-05-31 21:17:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 21:17:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 294 transitions and 1156 arcs took 4 ms.
Total runtime 48289 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d2m04-CTLCardinality-2024-01
Could not compute solution for formula : DBSingleClientW-PT-d2m04-CTLCardinality-2024-09
Could not compute solution for formula : DBSingleClientW-PT-d2m04-CTLCardinality-2024-10
Could not compute solution for formula : DBSingleClientW-PT-d2m04-CTLCardinality-2023-13

BK_STOP 1717190223671

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DBSingleClientW-PT-d2m04-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/540/ctl_0_
ctl formula name DBSingleClientW-PT-d2m04-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/540/ctl_1_
ctl formula name DBSingleClientW-PT-d2m04-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/540/ctl_2_
ctl formula name DBSingleClientW-PT-d2m04-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/540/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m04.tgz
mv DBSingleClientW-PT-d2m04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;