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-171620505300158.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-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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.1K 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 39M 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-080-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-04
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717196435323

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-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:00:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:00:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:00:37] [INFO ] Load time of PNML (sax parser for PT used): 962 ms
[2024-05-31 23:00:37] [INFO ] Transformed 13764 places.
[2024-05-31 23:00:37] [INFO ] Transformed 38880 transitions.
[2024-05-31 23:00:37] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (19 resets) in 3924 ms. (10 steps per ms) remains 12/16 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
// Phase 1: matrix 38880 rows 13764 cols
[2024-05-31 23:00:49] [INFO ] Computed 83 invariants in 9430 ms
[2024-05-31 23:00:49] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13389/13635 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13635 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 124/13759 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 12 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 13759/52644 variables, and 80 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 80/81 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13764 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13389/13635 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 23:00:57] [INFO ] Deduced a trap composed of 5 places in 862 ms of which 49 ms to minimize.
[2024-05-31 23:00:58] [INFO ] Deduced a trap composed of 5 places in 718 ms of which 6 ms to minimize.
[2024-05-31 23:00:59] [INFO ] Deduced a trap composed of 5 places in 711 ms of which 7 ms to minimize.
[2024-05-31 23:01:00] [INFO ] Deduced a trap composed of 5 places in 899 ms of which 6 ms to minimize.
SMT process timed out in 20808ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 246 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.85 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 521 transitions
Trivial Post-agglo rules discarded 521 transitions
Performed 521 trivial Post agglomeration. Transition count delta: 521
Iterating post reduction 0 with 521 rules applied. Total rules applied 522 place count 13763 transition count 38359
Reduce places removed 521 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 533 rules applied. Total rules applied 1055 place count 13242 transition count 38347
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1067 place count 13230 transition count 38347
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1067 place count 13230 transition count 38342
Deduced a syphon composed of 5 places in 33 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1077 place count 13225 transition count 38342
Performed 6107 Post agglomeration using F-continuation condition.Transition count delta: 6107
Deduced a syphon composed of 6107 places in 49 ms
Reduce places removed 6107 places and 0 transitions.
Iterating global reduction 3 with 12214 rules applied. Total rules applied 13291 place count 7118 transition count 32235
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 13299 place count 7118 transition count 32227
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 13307 place count 7110 transition count 32227
Partial Free-agglomeration rule applied 6623 times.
Drop transitions (Partial Free agglomeration) removed 6623 transitions
Iterating global reduction 4 with 6623 rules applied. Total rules applied 19930 place count 7110 transition count 32227
Partial Free-agglomeration rule applied 481 times.
Drop transitions (Partial Free agglomeration) removed 481 transitions
Iterating global reduction 4 with 481 rules applied. Total rules applied 20411 place count 7110 transition count 32227
Applied a total of 20411 rules in 17103 ms. Remains 7110 /13764 variables (removed 6654) and now considering 32227/38880 (removed 6653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17119 ms. Remains : 7110/13764 places, 32227/38880 transitions.
RANDOM walk for 40000 steps (74 resets) in 2419 ms. (16 steps per ms) remains 9/12 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
[2024-05-31 23:01:19] [INFO ] Flow matrix only has 32138 transitions (discarded 89 similar events)
// Phase 1: matrix 32138 rows 7110 cols
[2024-05-31 23:01:21] [INFO ] Computed 82 invariants in 2352 ms
[2024-05-31 23:01:21] [INFO ] State equation strengthened by 30678 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6797/6974 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6974 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 132/7106 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7106 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/7108 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 32138/39246 variables, 7108/7190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39246 variables, 30678/37868 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39246 variables, 0/37868 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 47869ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 177 out of 7110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7110/7110 places, 32227/32227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7110 transition count 32226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7109 transition count 32226
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 25 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 80 place count 7070 transition count 32187
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 107 place count 7070 transition count 32187
Applied a total of 107 rules in 5819 ms. Remains 7070 /7110 variables (removed 40) and now considering 32187/32227 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5821 ms. Remains : 7070/7110 places, 32187/32227 transitions.
RANDOM walk for 40000 steps (79 resets) in 2467 ms. (16 steps per ms) remains 7/9 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
[2024-05-31 23:02:13] [INFO ] Flow matrix only has 32125 transitions (discarded 62 similar events)
// Phase 1: matrix 32125 rows 7070 cols
[2024-05-31 23:02:16] [INFO ] Computed 82 invariants in 2582 ms
[2024-05-31 23:02:16] [INFO ] State equation strengthened by 31037 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6778/6932 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6932 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 134/7066 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7066 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/7068 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7068 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 32125/39193 variables, 7068/7150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39193 variables, 31037/38187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39193 variables, 0/38187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/39195 variables, 2/38189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39195 variables, 0/38189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/39195 variables, 0/38189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39195/39195 variables, and 38189 constraints, problems are : Problem set: 0 solved, 7 unsolved in 69117 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7070/7070 constraints, ReadFeed: 31037/31037 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6778/6932 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:03:27] [INFO ] Deduced a trap composed of 2 places in 295 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6932 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6932 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 134/7066 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7066 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/7068 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:03:46] [INFO ] Deduced a trap composed of 89 places in 14456 ms of which 51 ms to minimize.
[2024-05-31 23:04:02] [INFO ] Deduced a trap composed of 85 places in 15415 ms of which 45 ms to minimize.
[2024-05-31 23:04:17] [INFO ] Deduced a trap composed of 104 places in 14644 ms of which 44 ms to minimize.
[2024-05-31 23:04:32] [INFO ] Deduced a trap composed of 116 places in 14940 ms of which 45 ms to minimize.
[2024-05-31 23:04:47] [INFO ] Deduced a trap composed of 117 places in 15101 ms of which 39 ms to minimize.
SMT process timed out in 153400ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 154 out of 7070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7070/7070 places, 32187/32187 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 7059 transition count 32176
Partial Free-agglomeration rule applied 94 times.
Drop transitions (Partial Free agglomeration) removed 94 transitions
Iterating global reduction 0 with 94 rules applied. Total rules applied 116 place count 7059 transition count 32176
Applied a total of 116 rules in 5426 ms. Remains 7059 /7070 variables (removed 11) and now considering 32176/32187 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5426 ms. Remains : 7059/7070 places, 32176/32187 transitions.
RANDOM walk for 40000 steps (78 resets) in 1636 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 73975 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :0 out of 7
Probabilistic random walk after 73975 steps, saw 70606 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-31 23:04:56] [INFO ] Flow matrix only has 32126 transitions (discarded 50 similar events)
// Phase 1: matrix 32126 rows 7059 cols
[2024-05-31 23:04:58] [INFO ] Computed 82 invariants in 2004 ms
[2024-05-31 23:04:58] [INFO ] State equation strengthened by 31163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6767/6921 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6921 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 134/7055 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7055 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/7057 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7057 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 32126/39183 variables, 7057/7139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39183 variables, 31163/38302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39183 variables, 0/38302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/39185 variables, 2/38304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39185 variables, 0/38304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/39185 variables, 0/38304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39185/39185 variables, and 38304 constraints, problems are : Problem set: 0 solved, 7 unsolved in 65038 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7059/7059 constraints, ReadFeed: 31163/31163 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6767/6921 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 2 places in 286 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6921 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6921 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 134/7055 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7055 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/7057 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:06:24] [INFO ] Deduced a trap composed of 88 places in 14520 ms of which 45 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/7057 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7057 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 32126/39183 variables, 7057/7141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39183 variables, 31163/38304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 39183/39185 variables, and 38311 constraints, problems are : Problem set: 0 solved, 7 unsolved in 90209 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7057/7059 constraints, ReadFeed: 31163/31163 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 157656ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 154 out of 7059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7059/7059 places, 32176/32176 transitions.
Applied a total of 0 rules in 1868 ms. Remains 7059 /7059 variables (removed 0) and now considering 32176/32176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1870 ms. Remains : 7059/7059 places, 32176/32176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7059/7059 places, 32176/32176 transitions.
Applied a total of 0 rules in 1912 ms. Remains 7059 /7059 variables (removed 0) and now considering 32176/32176 (removed 0) transitions.
[2024-05-31 23:07:37] [INFO ] Flow matrix only has 32126 transitions (discarded 50 similar events)
[2024-05-31 23:07:37] [INFO ] Invariant cache hit.
[2024-05-31 23:07:55] [INFO ] Implicit Places using invariants in 17618 ms returned []
Implicit Place search using SMT only with invariants took 17633 ms to find 0 implicit places.
Running 32096 sub problems to find dead transitions.
[2024-05-31 23:07:56] [INFO ] Flow matrix only has 32126 transitions (discarded 50 similar events)
[2024-05-31 23:07:56] [INFO ] Invariant cache hit.
[2024-05-31 23:07:56] [INFO ] State equation strengthened by 31163 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/7058 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 32096 unsolved
SMT process timed out in 157834ms, After SMT, problems are : Problem set: 0 solved, 32096 unsolved
Search for dead transitions found 0 dead transitions in 158157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177816 ms. Remains : 7059/7059 places, 32176/32176 transitions.
[2024-05-31 23:10:33] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 23:10:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7059 places, 32176 transitions and 127823 arcs took 106 ms.
[2024-05-31 23:10:35] [INFO ] Flatten gal took : 984 ms
Total runtime 598887 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-080-ReachabilityCardinality-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-04
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-14

BK_STOP 1717197035727

--------------------
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-080-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_0_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_1_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-04
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_2_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_3_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_4_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_5_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-14
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_6_
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-080"
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-080, 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-171620505300158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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