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-171620399000198.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-V20P10N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399000198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 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 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 1.8M 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-V20P10N50-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717219911425

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:31:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:31:53] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-06-01 05:31:53] [INFO ] Transformed 108 places.
[2024-06-01 05:31:53] [INFO ] Transformed 2228 transitions.
[2024-06-01 05:31:53] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (228 resets) in 2791 ms. (14 steps per ms) remains 14/15 properties
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (100 resets) in 555 ms. (71 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (68 resets) in 504 ms. (79 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (75 resets) in 325 ms. (122 steps per ms) remains 13/14 properties
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (88 resets) in 461 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (80 resets) in 280 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (96 resets) in 946 ms. (42 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (75 resets) in 594 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (70 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 312 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (74 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (68 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 265 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (84 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
[2024-06-01 05:31:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:31:56] [INFO ] Computed 7 invariants in 14 ms
[2024-06-01 05:31:56] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 20/108 variables, 3/7 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 12 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/108 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/218 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/218 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/218 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 218 constraints, problems are : Problem set: 12 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1536ms problems are : Problem set: 12 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 41 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 350 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 05:31:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-06-01 05:31:58] [INFO ] Computed 6 invariants in 22 ms
[2024-06-01 05:31:58] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:32:23] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:32:51] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58362ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 58406ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 262 ms. Remains 107 /107 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59059 ms. Remains : 107/108 places, 2208/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326959 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326959 steps, saw 84321 distinct states, run finished after 3005 ms. (steps per millisecond=108 ) properties seen :0
[2024-06-01 05:33:00] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 107 cols
[2024-06-01 05:33:00] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:33:00] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/396 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 101/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 101/101 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:33:00] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2024-06-01 05:33:01] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 289/396 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 101/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 41 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2208/2208 transitions.
Applied a total of 0 rules in 240 ms. Remains 107 /107 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 107/107 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2208/2208 transitions.
Applied a total of 0 rules in 317 ms. Remains 107 /107 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 05:33:02] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:02] [INFO ] Invariant cache hit.
[2024-06-01 05:33:02] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 05:33:02] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:02] [INFO ] Invariant cache hit.
[2024-06-01 05:33:02] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:33:03] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2024-06-01 05:33:03] [INFO ] Redundant transitions in 134 ms returned []
Running 2205 sub problems to find dead transitions.
[2024-06-01 05:33:03] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:03] [INFO ] Invariant cache hit.
[2024-06-01 05:33:03] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 05:34:19] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 107/396 variables, and 8 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 2/2 constraints]
After SMT, in 75978ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 76014ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77636 ms. Remains : 107/107 places, 2208/2208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1919 transitions
Reduce isomorphic transitions removed 1919 transitions.
Iterating post reduction 0 with 1919 rules applied. Total rules applied 1919 place count 107 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1921 place count 106 transition count 288
Applied a total of 1921 rules in 22 ms. Remains 106 /107 variables (removed 1) and now considering 288/2208 (removed 1920) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 288 rows 106 cols
[2024-06-01 05:34:19] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:34:19] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:34:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:34:19] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:34:20] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:34:20] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 474 ms.
[2024-06-01 05:34:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 05:34:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 2208 transitions and 17029 arcs took 27 ms.
[2024-06-01 05:34:20] [INFO ] Flatten gal took : 200 ms
Total runtime 147540 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 : BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-15

BK_STOP 1717220060980

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/597/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="BridgeAndVehicles-PT-V20P10N50"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399000198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;