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-171690533400887.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-b08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400887
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 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 3.7M 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-b08-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2023-02
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2023-03
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-05
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2023-08
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-09
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-13
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2023-14
FORMULA_NAME Szymanski-PT-b08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717284465105

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-b08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:27:46] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2024-06-01 23:27:46] [INFO ] Transformed 568 places.
[2024-06-01 23:27:46] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:27:46] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40009 steps (12 resets) in 1888 ms. (21 steps per ms) remains 14/15 properties
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 333 ms. (119 steps per ms) remains 13/14 properties
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 121 ms. (327 steps per ms) remains 12/13 properties
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 95 ms. (416 steps per ms) remains 11/12 properties
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 1255 ms. (31 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
[2024-06-01 23:27:48] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:27:48] [INFO ] Computed 3 invariants in 49 ms
[2024-06-01 23:27:48] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem Szymanski-PT-b08-ReachabilityFireability-2023-02 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2023-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b08-ReachabilityFireability-2024-05 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b08-ReachabilityFireability-2023-08 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b08-ReachabilityFireability-2024-10 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b08-ReachabilityFireability-2024-11 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b08-ReachabilityFireability-2024-12 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b08-ReachabilityFireability-2023-14 is UNSAT
FORMULA Szymanski-PT-b08-ReachabilityFireability-2023-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 191/307 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 7 solved, 4 unsolved in 4157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 11/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 299/307 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 23:27:53] [INFO ] Deduced a trap composed of 139 places in 618 ms of which 50 ms to minimize.
[2024-06-01 23:27:54] [INFO ] Deduced a trap composed of 58 places in 607 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 2/4 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/5 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2733/3041 variables, 308/313 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 147/460 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3041 variables, 4/464 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 23:27:57] [INFO ] Deduced a trap composed of 154 places in 424 ms of which 3 ms to minimize.
[2024-06-01 23:27:57] [INFO ] Deduced a trap composed of 75 places in 314 ms of which 2 ms to minimize.
[2024-06-01 23:27:58] [INFO ] Deduced a trap composed of 104 places in 312 ms of which 2 ms to minimize.
SMT process timed out in 9751ms, After SMT, problems are : Problem set: 7 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 306 transition count 7941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 305 transition count 7813
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 305 transition count 7813
Applied a total of 126 rules in 473 ms. Remains 305 /308 variables (removed 3) and now considering 7813/8064 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 305/308 places, 7813/8064 transitions.
RANDOM walk for 40007 steps (8 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 129955 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 129955 steps, saw 84626 distinct states, run finished after 3005 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 23:28:01] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2024-06-01 23:28:01] [INFO ] Computed 1 invariants in 22 ms
[2024-06-01 23:28:01] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 297/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:28:02] [INFO ] Deduced a trap composed of 44 places in 382 ms of which 2 ms to minimize.
[2024-06-01 23:28:02] [INFO ] Deduced a trap composed of 74 places in 377 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2609/2914 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2914 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2914 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2914 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2914/2914 variables, and 455 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6596 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 297/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2609/2914 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2914 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2914 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:28:36] [INFO ] Deduced a trap composed of 103 places in 212 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2914 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2914 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2914 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2914/2914 variables, and 460 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43074 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 49745ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA Szymanski-PT-b08-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2127 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7812
Applied a total of 1 rules in 287 ms. Remains 305 /305 variables (removed 0) and now considering 7812/7813 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 305/305 places, 7812/7813 transitions.
RANDOM walk for 40014 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 122406 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 122406 steps, saw 78992 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 23:28:57] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
// Phase 1: matrix 2608 rows 305 cols
[2024-06-01 23:28:57] [INFO ] Computed 1 invariants in 24 ms
[2024-06-01 23:28:57] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 299/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:28:57] [INFO ] Deduced a trap composed of 37 places in 514 ms of which 2 ms to minimize.
[2024-06-01 23:28:58] [INFO ] Deduced a trap composed of 93 places in 428 ms of which 2 ms to minimize.
[2024-06-01 23:28:58] [INFO ] Deduced a trap composed of 37 places in 345 ms of which 2 ms to minimize.
[2024-06-01 23:28:58] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2608/2913 variables, 305/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2913 variables, 147/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2913 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2913 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2913/2913 variables, and 457 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4353 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 299/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:29:02] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 2 ms to minimize.
[2024-06-01 23:29:02] [INFO ] Deduced a trap composed of 47 places in 311 ms of which 2 ms to minimize.
[2024-06-01 23:29:02] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2608/2913 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2913 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2913 variables, 3/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:29:09] [INFO ] Deduced a trap composed of 72 places in 290 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2913 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2913 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2913 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2913/2913 variables, and 464 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10986 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 15410ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1402 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7812/7812 transitions.
Applied a total of 0 rules in 305 ms. Remains 305 /305 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 305/305 places, 7812/7812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7812/7812 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
[2024-06-01 23:29:14] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
[2024-06-01 23:29:14] [INFO ] Invariant cache hit.
[2024-06-01 23:29:14] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-01 23:29:14] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
[2024-06-01 23:29:14] [INFO ] Invariant cache hit.
[2024-06-01 23:29:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:29:46] [INFO ] Performed 287/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:29:50] [INFO ] Implicit Places using invariants and state equation in 35692 ms returned []
Implicit Place search using SMT with State Equation took 36141 ms to find 0 implicit places.
[2024-06-01 23:29:51] [INFO ] Redundant transitions in 944 ms returned []
Running 7810 sub problems to find dead transitions.
[2024-06-01 23:29:51] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
[2024-06-01 23:29:51] [INFO ] Invariant cache hit.
[2024-06-01 23:29:51] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2913 variables, and 1 constraints, problems are : Problem set: 0 solved, 7810 unsolved in 30135 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7810/7810 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2913 variables, and 1 constraints, problems are : Problem set: 0 solved, 7810 unsolved in 30107 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7810 constraints, Known Traps: 0/0 constraints]
After SMT, in 88071ms problems are : Problem set: 0 solved, 7810 unsolved
Search for dead transitions found 0 dead transitions in 88159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125473 ms. Remains : 305/305 places, 7812/7812 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 4680 edges and 305 vertex of which 15 / 305 are part of one of the 7 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 1600 transitions
Ensure Unique test removed 3620 transitions
Reduce isomorphic transitions removed 5220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 297 transition count 2590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 295 transition count 2590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 5 place count 295 transition count 2585
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 290 transition count 2585
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 287 transition count 2582
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 287 transition count 2579
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 287 transition count 2576
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 284 transition count 2576
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 284 transition count 2575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 283 transition count 2575
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 283 transition count 2575
Applied a total of 33 rules in 317 ms. Remains 283 /305 variables (removed 22) and now considering 2575/7812 (removed 5237) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2575 rows 283 cols
[2024-06-01 23:31:20] [INFO ] Computed 1 invariants in 22 ms
[2024-06-01 23:31:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 23:31:21] [INFO ] After 775ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
TRAPS : Iteration 0
[2024-06-01 23:31:21] [INFO ] After 1169ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 23:31:21] [INFO ] After 1249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 23:31:21] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 23:31:22] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 23:31:22] [INFO ] After 1233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 23:31:23] [INFO ] After 1697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 3309 ms.
[2024-06-01 23:31:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 75 ms.
[2024-06-01 23:31:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7812 transitions and 31368 arcs took 32 ms.
[2024-06-01 23:31:23] [INFO ] Flatten gal took : 455 ms
Total runtime 217681 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-b08-ReachabilityFireability-2024-01
Could not compute solution for formula : Szymanski-PT-b08-ReachabilityFireability-2023-03
Could not compute solution for formula : Szymanski-PT-b08-ReachabilityFireability-2024-07

BK_STOP 1717284684205

--------------------
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 Szymanski-PT-b08-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/614/inv_0_
rfs formula name Szymanski-PT-b08-ReachabilityFireability-2023-03
rfs formula type EF
rfs formula formula --invariant=/tmp/614/inv_1_
rfs formula name Szymanski-PT-b08-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/614/inv_2_
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-b08"
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-b08, 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-171690533400887"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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