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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717218886805

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:14:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:14:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:14:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:14:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:14:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 695 ms
[2024-06-01 05:14:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-06-01 05:14:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 05:14:49] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:14:49] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 50, 1] Max Struct:[50, 1, 50, 1, 50, 50, 1, 50, 1]
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 05:14:49] [INFO ] Invariant cache hit.
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 05:14:49] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:14:49] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:14:49] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:14:49] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 05:14:49] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:14:49] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:14:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 05:14:49] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:14:49] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:14:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:14:50] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:14:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:14:50] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 133 ms.
[2024-06-01 05:14:50] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
[2024-06-01 05:14:50] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-06-01 05:14:50] [INFO ] Computed 7 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
RANDOM walk for 10000 steps (23 resets) in 232 ms. (42 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (16 resets) in 60 ms. (327 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 20] Max Struct:[50, 50]
[2024-06-01 05:14:50] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-06-01 05:14:50] [INFO ] Invariant cache hit.
[2024-06-01 05:14:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 05:14:50] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 05:14:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:14:50] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 05:14:50] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:14:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 23 ms returned sat
[2024-06-01 05:14:51] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 155 ms.
[2024-06-01 05:14:51] [INFO ] Added : 21 causal constraints over 5 iterations in 537 ms. Result :sat
Minimization took 338 ms.
[2024-06-01 05:14:52] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 05:14:52] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-01 05:14:52] [INFO ] [Real]Added 42 Read/Feed constraints in 24 ms returned sat
[2024-06-01 05:14:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:14:52] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-06-01 05:14:52] [INFO ] [Nat]Added 42 Read/Feed constraints in 56 ms returned sat
[2024-06-01 05:14:52] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 244 ms.
[2024-06-01 05:14:53] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 35 ms to minimize.
[2024-06-01 05:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2024-06-01 05:14:53] [INFO ] Added : 3 causal constraints over 2 iterations in 904 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 441 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:14:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:14:54] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 05:14:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:15:22] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:15:52] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 4 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 58848ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 58917ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 193 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59596 ms. Remains : 136/138 places, 2298/2348 transitions.
[2024-06-01 05:15:53] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:15:53] [INFO ] Computed 5 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6928 ms. (144 steps per ms)
BEST_FIRST walk for 2000002 steps (1621 resets) in 4936 ms. (405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:16:05] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:05] [INFO ] Invariant cache hit.
[2024-06-01 05:16:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:05] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 05:16:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:16:05] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 05:16:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:16:05] [INFO ] [Nat]Added 41 Read/Feed constraints in 44 ms returned sat
[2024-06-01 05:16:05] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 68 ms.
[2024-06-01 05:16:05] [INFO ] Added : 8 causal constraints over 2 iterations in 196 ms. Result :sat
Minimization took 304 ms.
[2024-06-01 05:16:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:16:06] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 05:16:06] [INFO ] [Real]Added 41 Read/Feed constraints in 23 ms returned sat
[2024-06-01 05:16:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:16:06] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 05:16:06] [INFO ] [Nat]Added 41 Read/Feed constraints in 29 ms returned sat
[2024-06-01 05:16:06] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2024-06-01 05:16:07] [INFO ] Added : 22 causal constraints over 20 iterations in 463 ms. Result :sat
Minimization took 307 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 295 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 136/136 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 181 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-06-01 05:16:08] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:08] [INFO ] Invariant cache hit.
[2024-06-01 05:16:09] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 05:16:09] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:09] [INFO ] Invariant cache hit.
[2024-06-01 05:16:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:16:10] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1512 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 206 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1901 ms. Remains : 134/136 places, 2298/2298 transitions.
[2024-06-01 05:16:10] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-06-01 05:16:10] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 5927 ms. (168 steps per ms)
BEST_FIRST walk for 2000008 steps (1617 resets) in 3987 ms. (501 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:16:20] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:20] [INFO ] Invariant cache hit.
[2024-06-01 05:16:20] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:16:20] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 05:16:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:16:20] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-01 05:16:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:16:20] [INFO ] [Nat]Added 41 Read/Feed constraints in 28 ms returned sat
[2024-06-01 05:16:21] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2024-06-01 05:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-06-01 05:16:21] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 64 ms.
[2024-06-01 05:16:21] [INFO ] Added : 21 causal constraints over 5 iterations in 329 ms. Result :sat
Minimization took 230 ms.
[2024-06-01 05:16:21] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:16:21] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-01 05:16:21] [INFO ] [Real]Added 41 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:16:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:21] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 05:16:21] [INFO ] [Nat]Added 41 Read/Feed constraints in 43 ms returned sat
[2024-06-01 05:16:22] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2024-06-01 05:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-06-01 05:16:22] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 58 ms.
[2024-06-01 05:16:22] [INFO ] Added : 22 causal constraints over 20 iterations in 421 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 168 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 159 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-06-01 05:16:24] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:24] [INFO ] Invariant cache hit.
[2024-06-01 05:16:24] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-01 05:16:24] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:24] [INFO ] Invariant cache hit.
[2024-06-01 05:16:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:16:25] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2024-06-01 05:16:25] [INFO ] Redundant transitions in 144 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:16:25] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:25] [INFO ] Invariant cache hit.
[2024-06-01 05:16:25] [INFO ] State equation strengthened by 41 read => feed constraints.
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-COL-V50P50N20-UpperBounds-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-01
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-02
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-03
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-04
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-05
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-06
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-07
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-08
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-09
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-10
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-11
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-12
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-13
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-14
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-UpperBounds-15

BK_STOP 1717219003395

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-00
ub formula formula --maxsum=/tmp/620/ub_0_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-01
ub formula formula --maxsum=/tmp/620/ub_1_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-02
ub formula formula --maxsum=/tmp/620/ub_2_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-03
ub formula formula --maxsum=/tmp/620/ub_3_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-04
ub formula formula --maxsum=/tmp/620/ub_4_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-05
ub formula formula --maxsum=/tmp/620/ub_5_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-06
ub formula formula --maxsum=/tmp/620/ub_6_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-07
ub formula formula --maxsum=/tmp/620/ub_7_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-08
ub formula formula --maxsum=/tmp/620/ub_8_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-09
ub formula formula --maxsum=/tmp/620/ub_9_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-10
ub formula formula --maxsum=/tmp/620/ub_10_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-11
ub formula formula --maxsum=/tmp/620/ub_11_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-12
ub formula formula --maxsum=/tmp/620/ub_12_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-13
ub formula formula --maxsum=/tmp/620/ub_13_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-14
ub formula formula --maxsum=/tmp/620/ub_14_
ub formula name BridgeAndVehicles-COL-V50P50N20-UpperBounds-15
ub formula formula --maxsum=/tmp/620/ub_15_
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-COL-V50P50N20"
export BK_EXAMINATION="UpperBounds"
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-COL-V50P50N20, examination is UpperBounds"
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-171620398800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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