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

About the Execution of LTSMin+red for Szymanski-PT-a04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
948.867 17364.00 30694.00 75.80 FTTTTFFF?FTTTFFF 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.r536-tall-171690533200823.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 Szymanski-PT-a04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533200823
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 11 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 11 15:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-05
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-09
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-13
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-a04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717280783126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:26:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 22:26:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:26:24] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 22:26:24] [INFO ] Transformed 61 places.
[2024-06-01 22:26:24] [INFO ] Transformed 224 transitions.
[2024-06-01 22:26:24] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40002 steps (67 resets) in 1138 ms. (35 steps per ms) remains 13/15 properties
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (33 resets) in 306 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 475 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1021 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (37 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (12 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (30 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (63 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
[2024-06-01 22:26:26] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-06-01 22:26:26] [INFO ] Computed 3 invariants in 11 ms
[2024-06-01 22:26:26] [INFO ] State equation strengthened by 9 read => feed constraints.
Problem Szymanski-PT-a04-ReachabilityFireability-2024-03 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem Szymanski-PT-a04-ReachabilityFireability-2024-01 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-02 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-05 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-07 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-09 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-10 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-13 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-a04-ReachabilityFireability-2024-15 is UNSAT
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3/48 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/128 variables, 49/52 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 61 constraints, problems are : Problem set: 9 solved, 4 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/48 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-06-01 22:26:26] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/53 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 9/62 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 4/66 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 66 constraints, problems are : Problem set: 9 solved, 4 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 858ms problems are : Problem set: 9 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 37 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 47 transition count 200
Applied a total of 17 rules in 54 ms. Remains 47 /49 variables (removed 2) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 47/49 places, 200/216 transitions.
RANDOM walk for 40005 steps (54 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (21 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (33 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2268590 steps, run timeout after 3001 ms. (steps per millisecond=755 ) properties seen :3 out of 4
Probabilistic random walk after 2268590 steps, saw 1200625 distinct states, run finished after 3005 ms. (steps per millisecond=754 ) properties seen :3
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Szymanski-PT-a04-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 22:26:30] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 47 cols
[2024-06-01 22:26:30] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 22:26:30] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 200/200 transitions.
Applied a total of 0 rules in 13 ms. Remains 47 /47 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 47/47 places, 200/200 transitions.
RANDOM walk for 40002 steps (51 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2325594 steps, run timeout after 3001 ms. (steps per millisecond=774 ) properties seen :0 out of 1
Probabilistic random walk after 2325594 steps, saw 1233206 distinct states, run finished after 3001 ms. (steps per millisecond=774 ) properties seen :0
[2024-06-01 22:26:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-06-01 22:26:33] [INFO ] Invariant cache hit.
[2024-06-01 22:26:33] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 47 /47 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 47/47 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 22:26:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-06-01 22:26:33] [INFO ] Invariant cache hit.
[2024-06-01 22:26:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 22:26:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-06-01 22:26:33] [INFO ] Invariant cache hit.
[2024-06-01 22:26:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 22:26:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-01 22:26:33] [INFO ] Redundant transitions in 9 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 22:26:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-06-01 22:26:33] [INFO ] Invariant cache hit.
[2024-06-01 22:26:33] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 57 constraints, problems are : Problem set: 0 solved, 198 unsolved in 2393 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 75/122 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 198/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 255 constraints, problems are : Problem set: 0 solved, 198 unsolved in 3402 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 5872ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 5876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6032 ms. Remains : 47/47 places, 200/200 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 47 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 46 transition count 74
Applied a total of 127 rules in 12 ms. Remains 46 /47 variables (removed 1) and now considering 74/200 (removed 126) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 46 cols
[2024-06-01 22:26:39] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 22:26:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:26:39] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:26:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:26:40] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:26:40] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:26:40] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
[2024-06-01 22:26:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 22:26:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 200 transitions and 796 arcs took 4 ms.
[2024-06-01 22:26:40] [INFO ] Flatten gal took : 38 ms
Total runtime 16042 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 : Szymanski-PT-a04-ReachabilityFireability-2024-08

BK_STOP 1717280800490

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name Szymanski-PT-a04-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/549/inv_0_
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="Szymanski-PT-a04"
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 Szymanski-PT-a04, 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 r536-tall-171690533200823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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