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

About the Execution of LTSMin+red for CANInsertWithFailure-PT-090

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10354.220 629382.00 739264.00 1207.80 F??TT??T????F??? 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.r476-tall-171620505300166.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 CANInsertWithFailure-PT-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49M 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 CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-08
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717197858381

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:24:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:24:20] [INFO ] Load time of PNML (sax parser for PT used): 1170 ms
[2024-05-31 23:24:20] [INFO ] Transformed 17284 places.
[2024-05-31 23:24:21] [INFO ] Transformed 49140 transitions.
[2024-05-31 23:24:21] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1429 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 119 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (16 resets) in 4119 ms. (9 steps per ms) remains 13/16 properties
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 770 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 740 ms. (53 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
// Phase 1: matrix 49140 rows 17284 cols
[2024-05-31 23:24:40] [INFO ] Computed 93 invariants in 16563 ms
[2024-05-31 23:24:40] [INFO ] State equation strengthened by 16110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16803/17139 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17139/66424 variables, and 20 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 20/91 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/17284 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16803/17139 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 23:24:50] [INFO ] Deduced a trap composed of 5 places in 854 ms of which 42 ms to minimize.
[2024-05-31 23:24:51] [INFO ] Deduced a trap composed of 5 places in 809 ms of which 6 ms to minimize.
SMT process timed out in 27448ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 336 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.65 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 581 transitions
Trivial Post-agglo rules discarded 581 transitions
Performed 581 trivial Post agglomeration. Transition count delta: 581
Iterating post reduction 0 with 581 rules applied. Total rules applied 582 place count 17283 transition count 48559
Reduce places removed 581 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 596 rules applied. Total rules applied 1178 place count 16702 transition count 48544
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1193 place count 16687 transition count 48544
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1193 place count 16687 transition count 48533
Deduced a syphon composed of 11 places in 19 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1215 place count 16676 transition count 48533
Performed 7492 Post agglomeration using F-continuation condition.Transition count delta: 7492
Deduced a syphon composed of 7492 places in 53 ms
Reduce places removed 7492 places and 0 transitions.
Iterating global reduction 3 with 14984 rules applied. Total rules applied 16199 place count 9184 transition count 41041
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 16210 place count 9184 transition count 41030
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 16221 place count 9173 transition count 41030
Partial Free-agglomeration rule applied 8648 times.
Drop transitions (Partial Free agglomeration) removed 8648 transitions
Iterating global reduction 4 with 8648 rules applied. Total rules applied 24869 place count 9173 transition count 41030
Partial Free-agglomeration rule applied 740 times.
Drop transitions (Partial Free agglomeration) removed 740 transitions
Iterating global reduction 4 with 740 rules applied. Total rules applied 25609 place count 9173 transition count 41030
Applied a total of 25609 rules in 27499 ms. Remains 9173 /17284 variables (removed 8111) and now considering 41030/49140 (removed 8110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27522 ms. Remains : 9173/17284 places, 41030/49140 transitions.
RANDOM walk for 40000 steps (65 resets) in 3311 ms. (12 steps per ms) remains 11/13 properties
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
[2024-05-31 23:25:20] [INFO ] Flow matrix only has 40888 transitions (discarded 142 similar events)
// Phase 1: matrix 40888 rows 9173 cols
[2024-05-31 23:25:24] [INFO ] Computed 92 invariants in 4367 ms
[2024-05-31 23:25:25] [INFO ] State equation strengthened by 38334 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8719/9027 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9027 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 142/9169 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9169 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/9171 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9171 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 40888/50059 variables, 9171/9263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 50059/50061 variables, and 47597 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45070 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9171/9173 constraints, ReadFeed: 38334/38334 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8719/9027 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:26:12] [INFO ] Deduced a trap composed of 2 places in 537 ms of which 4 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 2 places in 478 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9027 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9027 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 142/9169 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9169 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/9171 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:26:51] [INFO ] Deduced a trap composed of 113 places in 25921 ms of which 58 ms to minimize.
[2024-05-31 23:27:16] [INFO ] Deduced a trap composed of 112 places in 24951 ms of which 58 ms to minimize.
SMT process timed out in 116219ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 308 out of 9173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9173/9173 places, 41030/41030 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 9162 transition count 41019
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 9162 transition count 41018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 9161 transition count 41018
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 1 with 101 rules applied. Total rules applied 125 place count 9161 transition count 41018
Applied a total of 125 rules in 11683 ms. Remains 9161 /9173 variables (removed 12) and now considering 41018/41030 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11683 ms. Remains : 9161/9173 places, 41018/41030 transitions.
RANDOM walk for 40000 steps (65 resets) in 3059 ms. (13 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 115700 steps, run timeout after 3002 ms. (steps per millisecond=38 ) properties seen :0 out of 11
Probabilistic random walk after 115700 steps, saw 112002 distinct states, run finished after 3006 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-31 23:27:32] [INFO ] Flow matrix only has 40891 transitions (discarded 127 similar events)
// Phase 1: matrix 40891 rows 9161 cols
[2024-05-31 23:27:37] [INFO ] Computed 92 invariants in 4287 ms
[2024-05-31 23:27:37] [INFO ] State equation strengthened by 38474 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8707/9015 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9015 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 142/9157 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9157 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/9159 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 40891/50050 variables, 9159/9251 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 50050/50052 variables, and 47725 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75132 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9159/9161 constraints, ReadFeed: 38474/38474 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8707/9015 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:28:54] [INFO ] Deduced a trap composed of 2 places in 436 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9015 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9015 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 142/9157 variables, 71/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9157 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/9159 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 23:29:28] [INFO ] Deduced a trap composed of 103 places in 21812 ms of which 53 ms to minimize.
[2024-05-31 23:29:51] [INFO ] Deduced a trap composed of 99 places in 23232 ms of which 60 ms to minimize.
[2024-05-31 23:30:14] [INFO ] Deduced a trap composed of 130 places in 23011 ms of which 56 ms to minimize.
SMT process timed out in 162154ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 308 out of 9161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9161/9161 places, 41018/41018 transitions.
Applied a total of 0 rules in 3172 ms. Remains 9161 /9161 variables (removed 0) and now considering 41018/41018 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3172 ms. Remains : 9161/9161 places, 41018/41018 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9161/9161 places, 41018/41018 transitions.
Applied a total of 0 rules in 3186 ms. Remains 9161 /9161 variables (removed 0) and now considering 41018/41018 (removed 0) transitions.
[2024-05-31 23:30:21] [INFO ] Flow matrix only has 40891 transitions (discarded 127 similar events)
[2024-05-31 23:30:21] [INFO ] Invariant cache hit.
[2024-05-31 23:30:48] [INFO ] Implicit Places using invariants in 27062 ms returned []
Implicit Place search using SMT only with invariants took 27072 ms to find 0 implicit places.
Running 40928 sub problems to find dead transitions.
[2024-05-31 23:30:48] [INFO ] Flow matrix only has 40891 transitions (discarded 127 similar events)
[2024-05-31 23:30:48] [INFO ] Invariant cache hit.
[2024-05-31 23:30:49] [INFO ] State equation strengthened by 38474 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9160 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 40928 unsolved
SMT process timed out in 236930ms, After SMT, problems are : Problem set: 0 solved, 40928 unsolved
Search for dead transitions found 0 dead transitions in 237245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267611 ms. Remains : 9161/9161 places, 41018/41018 transitions.
[2024-05-31 23:34:45] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-31 23:34:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9161 places, 41018 transitions and 161494 arcs took 124 ms.
[2024-05-31 23:34:47] [INFO ] Flatten gal took : 1072 ms
Total runtime 627711 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 : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-08
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-11
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-15

BK_STOP 1717198487763

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/582/inv_0_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/582/inv_1_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/582/inv_2_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/582/inv_3_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-08
rfs formula type EF
rfs formula formula --invariant=/tmp/582/inv_4_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/582/inv_5_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/582/inv_6_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/582/inv_7_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-13
rfs formula type AG
rfs formula formula --invariant=/tmp/582/inv_8_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2023-14
rfs formula type AG
rfs formula formula --invariant=/tmp/582/inv_9_
rfs formula name CANInsertWithFailure-PT-090-ReachabilityCardinality-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/582/inv_10_
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="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANInsertWithFailure-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505300166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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