fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r510-tall-171654365200397
Last Updated
July 7, 2024

About the Execution of LTSMin+red for NoC3x3-PT-6A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1485.195 106022.00 180676.00 474.30 T normal

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.r510-tall-171654365200397.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 NoC3x3-PT-6A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r510-tall-171654365200397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 7.2K 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 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 297K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717232261685

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-6A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:57:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 08:57:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:57:43] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-06-01 08:57:43] [INFO ] Transformed 512 places.
[2024-06-01 08:57:43] [INFO ] Transformed 1117 transitions.
[2024-06-01 08:57:43] [INFO ] Found NUPN structural information;
[2024-06-01 08:57:43] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 317 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 509 transition count 1142
Applied a total of 6 rules in 140 ms. Remains 509 /512 variables (removed 3) and now considering 1142/1117 (removed -25) transitions.
[2024-06-01 08:57:43] [INFO ] Flow matrix only has 1100 transitions (discarded 42 similar events)
// Phase 1: matrix 1100 rows 509 cols
[2024-06-01 08:57:43] [INFO ] Computed 66 invariants in 43 ms
[2024-06-01 08:57:45] [INFO ] Implicit Places using invariants in 1148 ms returned [13, 52, 106, 150, 223, 330, 389, 433, 491]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1236 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 500/512 places, 1142/1117 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 476 transition count 1118
Applied a total of 48 rules in 35 ms. Remains 476 /500 variables (removed 24) and now considering 1118/1142 (removed 24) transitions.
[2024-06-01 08:57:45] [INFO ] Flow matrix only has 1076 transitions (discarded 42 similar events)
// Phase 1: matrix 1076 rows 476 cols
[2024-06-01 08:57:45] [INFO ] Computed 57 invariants in 10 ms
[2024-06-01 08:57:45] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-01 08:57:45] [INFO ] Flow matrix only has 1076 transitions (discarded 42 similar events)
[2024-06-01 08:57:45] [INFO ] Invariant cache hit.
[2024-06-01 08:57:45] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-01 08:57:46] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 476/512 places, 1118/1117 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2869 ms. Remains : 476/512 places, 1118/1117 transitions.
Discarding 366 transitions out of 1118. Remains 752
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (114 resets) in 3298 ms. (12 steps per ms) remains 8/751 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 108 ms. (367 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
[2024-06-01 08:57:47] [INFO ] Flow matrix only has 1076 transitions (discarded 42 similar events)
[2024-06-01 08:57:47] [INFO ] Invariant cache hit.
[2024-06-01 08:57:47] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 55/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 413/476 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 413/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1552 variables, 476/1009 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1552 variables, 97/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1552 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1552 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1552/1552 variables, and 1106 constraints, problems are : Problem set: 0 solved, 5 unsolved in 913 ms.
Refiners :[Domain max(s): 476/476 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 55/63 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 413/476 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 413/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:57:49] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 24 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1076/1552 variables, 476/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1552 variables, 97/1107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1552 variables, 5/1112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1552 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1552 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1552/1552 variables, and 1112 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1423 ms.
Refiners :[Domain max(s): 476/476 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 2377ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 707 ms.
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1118/1118 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 397 transition count 802
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 397 transition count 802
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 183 place count 397 transition count 777
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 208 place count 372 transition count 777
Applied a total of 208 rules in 98 ms. Remains 372 /476 variables (removed 104) and now considering 777/1118 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 372/476 places, 777/1118 transitions.
RANDOM walk for 4000000 steps (13 resets) in 15502 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (9 resets) in 6658 ms. (600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 5948 ms. (672 steps per ms) remains 1/2 properties
[2024-06-01 08:57:58] [INFO ] Flow matrix only has 773 transitions (discarded 4 similar events)
// Phase 1: matrix 773 rows 372 cols
[2024-06-01 08:57:58] [INFO ] Computed 57 invariants in 3 ms
[2024-06-01 08:57:58] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/372 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 773/1145 variables, 372/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1145 variables, 43/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1145 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 372/372 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/372 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 773/1145 variables, 372/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1145 variables, 43/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1145 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1145/1145 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 372/372 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 777/777 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 371 transition count 772
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 371 transition count 772
Applied a total of 2 rules in 31 ms. Remains 371 /372 variables (removed 1) and now considering 772/777 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 371/372 places, 772/777 transitions.
RANDOM walk for 4000000 steps (10 resets) in 15161 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5968 ms. (670 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2593596 steps, run timeout after 15001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 2593596 steps, saw 1185141 distinct states, run finished after 15005 ms. (steps per millisecond=172 ) properties seen :0
[2024-06-01 08:58:20] [INFO ] Flow matrix only has 769 transitions (discarded 3 similar events)
// Phase 1: matrix 769 rows 371 cols
[2024-06-01 08:58:20] [INFO ] Computed 57 invariants in 11 ms
[2024-06-01 08:58:20] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 355/371 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 769/1140 variables, 371/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1140 variables, 42/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1140 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1140 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1140/1140 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 371/371 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 355/371 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:58:20] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:58:21] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 769/1140 variables, 371/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1140 variables, 42/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1140 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1140 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1140 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 371/371 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 772/772 transitions.
Applied a total of 0 rules in 22 ms. Remains 371 /371 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 371/371 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 772/772 transitions.
Applied a total of 0 rules in 18 ms. Remains 371 /371 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2024-06-01 08:58:21] [INFO ] Flow matrix only has 769 transitions (discarded 3 similar events)
[2024-06-01 08:58:21] [INFO ] Invariant cache hit.
[2024-06-01 08:58:21] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-01 08:58:21] [INFO ] Flow matrix only has 769 transitions (discarded 3 similar events)
[2024-06-01 08:58:21] [INFO ] Invariant cache hit.
[2024-06-01 08:58:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 08:58:22] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2024-06-01 08:58:22] [INFO ] Redundant transitions in 36 ms returned []
Running 764 sub problems to find dead transitions.
[2024-06-01 08:58:22] [INFO ] Flow matrix only has 769 transitions (discarded 3 similar events)
[2024-06-01 08:58:22] [INFO ] Invariant cache hit.
[2024-06-01 08:58:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (OVERLAPS) 769/1140 variables, 371/428 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 42/470 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1140/1140 variables, and 470 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 371/371 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (OVERLAPS) 769/1140 variables, 371/428 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 42/470 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1140 variables, 764/1234 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 1234 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 371/371 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 764 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61560 ms. Remains : 371/371 places, 772/772 transitions.
RANDOM walk for 333902 steps (13 resets) in 3285 ms. (101 steps per ms) remains 0/2 properties
RANDOM walk for 3001291 steps (8 resets) in 10493 ms. (286 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 752 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 104422 ms.
ITS solved all properties within timeout

BK_STOP 1717232367707

--------------------
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 QuasiLiveness -timeout 180 -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="NoC3x3-PT-6A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 NoC3x3-PT-6A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r510-tall-171654365200397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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