Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620398900175.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V10P10N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398900175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 12K Apr 13 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 238K Apr 13 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 97K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 223K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717219608380

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:26:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:26:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:26:50] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-01 05:26:50] [INFO ] Transformed 48 places.
[2024-06-01 05:26:50] [INFO ] Transformed 288 transitions.
[2024-06-01 05:26:50] [INFO ] Parsed PT model containing 48 places and 288 transitions and 2090 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (444 resets) in 2898 ms. (13 steps per ms) remains 10/12 properties
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (203 resets) in 438 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (152 resets) in 4424 ms. (9 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (159 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (149 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (171 resets) in 794 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (167 resets) in 414 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (174 resets) in 271 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (163 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (173 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (160 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
[2024-06-01 05:26:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-06-01 05:26:54] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 05:26:54] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-03 is UNSAT
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/48 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 90/138 variables, 48/55 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/77 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/77 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/77 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 77 constraints, problems are : Problem set: 4 solved, 6 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/48 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 05:26:55] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 9 ms to minimize.
[2024-06-01 05:26:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
Problem BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 05:26:55] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
Problem BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/10 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/84 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/84 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/84 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 84 constraints, problems are : Problem set: 6 solved, 4 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 1832ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 392 ms.
Support contains 22 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 342 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 287
Applied a total of 3 rules in 45 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
Running 284 sub problems to find dead transitions.
[2024-06-01 05:26:56] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-06-01 05:26:56] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:26:56] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 05:26:57] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:26:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
[2024-06-01 05:26:58] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD156 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/8 constraints. Problems are: Problem set: 20 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 264 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/53 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 22/75 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/75 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/75 constraints. Problems are: Problem set: 22 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 75 constraints, problems are : Problem set: 22 solved, 262 unsolved in 4427 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 22 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/8 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/53 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 22/75 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 262/337 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/337 constraints. Problems are: Problem set: 22 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/337 constraints. Problems are: Problem set: 22 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 337 constraints, problems are : Problem set: 22 solved, 262 unsolved in 5906 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 262/284 constraints, Known Traps: 3/3 constraints]
After SMT, in 10782ms problems are : Problem set: 22 solved, 262 unsolved
Search for dead transitions found 22 dead transitions in 10789ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/48 places, 265/288 transitions.
Applied a total of 0 rules in 29 ms. Remains 45 /45 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10881 ms. Remains : 45/48 places, 265/288 transitions.
RANDOM walk for 40000 steps (442 resets) in 298 ms. (133 steps per ms) remains 3/4 properties
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (151 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (165 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (159 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
[2024-06-01 05:27:07] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-01 05:27:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:27:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/125 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/130 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 72 constraints, problems are : Problem set: 0 solved, 3 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/125 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/130 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 75 constraints, problems are : Problem set: 0 solved, 3 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 298 ms.
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 265/265 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 43 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 41 transition count 262
Applied a total of 7 rules in 41 ms. Remains 41 /45 variables (removed 4) and now considering 262/265 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 41/45 places, 262/265 transitions.
RANDOM walk for 40000 steps (618 resets) in 696 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (249 resets) in 415 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (278 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (275 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 112308 steps, run visited all 3 properties in 380 ms. (steps per millisecond=295 )
Probabilistic random walk after 112308 steps, saw 32190 distinct states, run finished after 384 ms. (steps per millisecond=292 ) properties seen :3
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BridgeAndVehicles-PT-V10P10N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 18859 ms.
ITS solved all properties within timeout

BK_STOP 1717219629232

--------------------
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

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="BridgeAndVehicles-PT-V10P10N10"
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 BridgeAndVehicles-PT-V10P10N10, 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 r472-tajo-171620398900175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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