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

About the Execution of LTSMin+red for FireWire-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
503.707 37893.00 63539.00 105.20 FT?TF???TFFF?F?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.r553-tall-171734901100191.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 FireWire-PT-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 86K Jun 2 16:33 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 FireWire-PT-03-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-03-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353654089

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:40:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:40:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:40:55] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:40:55] [INFO ] Transformed 112 places.
[2024-06-02 18:40:55] [INFO ] Transformed 356 transitions.
[2024-06-02 18:40:55] [INFO ] Found NUPN structural information;
[2024-06-02 18:40:55] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-03-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2042 resets) in 2009 ms. (19 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (47 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (51 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (55 resets) in 93 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 188 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (64 resets) in 217 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (116 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 313 ms. (12 steps per ms) remains 12/15 properties
FORMULA FireWire-PT-03-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (10 resets) in 80 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (13 resets) in 65 ms. (60 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (84 resets) in 97 ms. (40 steps per ms) remains 12/12 properties
[2024-06-02 18:40:56] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 18:40:56] [INFO ] Computed 9 invariants in 11 ms
[2024-06-02 18:40:56] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem FireWire-PT-03-ReachabilityFireability-2024-11 is UNSAT
FORMULA FireWire-PT-03-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem FireWire-PT-03-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-03-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-03-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-03-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-03-ReachabilityFireability-2024-10 is UNSAT
FORMULA FireWire-PT-03-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-03-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-03-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 18/112 variables, 7/103 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 18/121 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/121 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/233 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/273 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/273 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/274 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/274 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/274 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 274 constraints, problems are : Problem set: 5 solved, 7 unsolved in 741 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem FireWire-PT-03-ReachabilityFireability-2024-08 is UNSAT
FORMULA FireWire-PT-03-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 38/109 variables, 8/79 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 38/117 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-06-02 18:40:57] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/118 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/118 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3/112 variables, 1/119 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 3/122 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/122 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 270/382 variables, 112/234 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 40/274 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 6/280 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/280 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/383 variables, 1/281 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/281 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/383 variables, 0/281 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 281 constraints, problems are : Problem set: 6 solved, 6 unsolved in 1137 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 2178ms problems are : Problem set: 6 solved, 6 unsolved
Parikh walk visited 0 properties in 1960 ms.
Support contains 55 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 109 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 109 transition count 287
Applied a total of 17 rules in 84 ms. Remains 109 /112 variables (removed 3) and now considering 287/303 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 109/112 places, 287/303 transitions.
RANDOM walk for 40000 steps (2161 resets) in 457 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (532 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (573 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (73 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (950 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 769342 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 6
Probabilistic random walk after 769342 steps, saw 127555 distinct states, run finished after 3027 ms. (steps per millisecond=254 ) properties seen :0
[2024-06-02 18:41:04] [INFO ] Flow matrix only has 264 transitions (discarded 23 similar events)
// Phase 1: matrix 264 rows 109 cols
[2024-06-02 18:41:04] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:41:04] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 264/373 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 156 constraints, problems are : Problem set: 0 solved, 6 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:41:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/109 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 264/373 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 6 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2153 ms.
Support contains 55 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 287/287 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 109/109 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 287/287 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 18:41:07] [INFO ] Flow matrix only has 264 transitions (discarded 23 similar events)
[2024-06-02 18:41:07] [INFO ] Invariant cache hit.
[2024-06-02 18:41:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:41:07] [INFO ] Flow matrix only has 264 transitions (discarded 23 similar events)
[2024-06-02 18:41:07] [INFO ] Invariant cache hit.
[2024-06-02 18:41:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:41:07] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 18:41:07] [INFO ] Redundant transitions in 15 ms returned []
Running 286 sub problems to find dead transitions.
[2024-06-02 18:41:07] [INFO ] Flow matrix only has 264 transitions (discarded 23 similar events)
[2024-06-02 18:41:07] [INFO ] Invariant cache hit.
[2024-06-02 18:41:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:41:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:41:10] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:41:10] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:41:10] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:41:10] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:41:10] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 264/373 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 38/167 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:41:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 168 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10544 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 264/373 variables, 109/130 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 38/168 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 286/454 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 454 constraints, problems are : Problem set: 0 solved, 286 unsolved in 11891 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 12/12 constraints]
After SMT, in 22617ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 22620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22870 ms. Remains : 109/109 places, 287/287 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 15 edges and 109 vertex of which 2 / 109 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 108 transition count 248
Applied a total of 15 rules in 22 ms. Remains 108 /109 variables (removed 1) and now considering 248/287 (removed 39) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 248 rows 108 cols
[2024-06-02 18:41:30] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 18:41:30] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 18:41:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-02 18:41:30] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-02 18:41:31] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-02 18:41:31] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 828 ms.
[2024-06-02 18:41:31] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-06-02 18:41:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 287 transitions and 1046 arcs took 6 ms.
[2024-06-02 18:41:31] [INFO ] Flatten gal took : 52 ms
Total runtime 36427 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 : FireWire-PT-03-ReachabilityFireability-2024-02
Could not compute solution for formula : FireWire-PT-03-ReachabilityFireability-2024-05
Could not compute solution for formula : FireWire-PT-03-ReachabilityFireability-2024-06
Could not compute solution for formula : FireWire-PT-03-ReachabilityFireability-2024-07
Could not compute solution for formula : FireWire-PT-03-ReachabilityFireability-2024-12
Could not compute solution for formula : FireWire-PT-03-ReachabilityFireability-2024-14

BK_STOP 1717353691982

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-03-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/588/inv_0_
rfs formula name FireWire-PT-03-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/588/inv_1_
rfs formula name FireWire-PT-03-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_2_
rfs formula name FireWire-PT-03-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_3_
rfs formula name FireWire-PT-03-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/588/inv_4_
rfs formula name FireWire-PT-03-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_5_
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="FireWire-PT-03"
export BK_EXAMINATION="ReachabilityFireability"
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 FireWire-PT-03, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901100191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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