fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694400229
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1032.699 3600000.00 14225148.00 124.90 1 1 ? ? 1 ? 1 20 50 50 50 1 50 50 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 20K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 455K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 12:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Feb 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 856K Feb 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:22 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-PT-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678615576947

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:06:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 10:06:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:06:19] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-12 10:06:19] [INFO ] Transformed 128 places.
[2023-03-12 10:06:19] [INFO ] Transformed 1328 transitions.
[2023-03-12 10:06:19] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 10:06:19] [INFO ] Computed 7 place invariants in 56 ms
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :163
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :56
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :30
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :29
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :25
[2023-03-12 10:06:19] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 10:06:19] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-12 10:06:19] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2023-03-12 10:06:19] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2023-03-12 10:06:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:20] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 10:06:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:20] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-12 10:06:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:20] [INFO ] [Nat]Added 22 Read/Feed constraints in 135 ms returned sat
[2023-03-12 10:06:20] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 126 ms.
[2023-03-12 10:06:20] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
[2023-03-12 10:06:21] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2023-03-12 10:06:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2023-03-12 10:06:21] [INFO ] Added : 3 causal constraints over 2 iterations in 658 ms. Result :sat
Minimization took 74 ms.
[2023-03-12 10:06:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:21] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-12 10:06:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:21] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-12 10:06:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 199 ms returned sat
[2023-03-12 10:06:21] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 87 ms.
[2023-03-12 10:06:22] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2023-03-12 10:06:22] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 2 ms to minimize.
[2023-03-12 10:06:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-03-12 10:06:22] [INFO ] Added : 3 causal constraints over 2 iterations in 570 ms. Result :sat
Minimization took 126 ms.
[2023-03-12 10:06:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2023-03-12 10:06:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:22] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-12 10:06:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:22] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-12 10:06:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 25 ms returned sat
[2023-03-12 10:06:22] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 2 ms to minimize.
[2023-03-12 10:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-12 10:06:23] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 47 ms.
[2023-03-12 10:06:23] [INFO ] Added : 10 causal constraints over 2 iterations in 183 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 20, 20, 1, 20] Max seen :[1, 1, 10, 10, 1, 10]
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 169 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:06:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:06:23] [INFO ] Computed 5 place invariants in 23 ms
[2023-03-12 10:06:24] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 126/128 places, 1328/1328 transitions.
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:06:24] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4921 ms. (steps per millisecond=203 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 1000001 steps, including 816 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 1000001 steps, including 817 resets, run finished after 1842 ms. (steps per millisecond=542 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000000 steps, including 865 resets, run finished after 1865 ms. (steps per millisecond=536 ) properties (out of 3) seen :26
[2023-03-12 10:06:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:06:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:06:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 10:06:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:34] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-12 10:06:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2023-03-12 10:06:35] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 36 ms.
[2023-03-12 10:06:35] [INFO ] Added : 5 causal constraints over 4 iterations in 130 ms. Result :sat
Minimization took 65 ms.
[2023-03-12 10:06:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:35] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-12 10:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:35] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-12 10:06:35] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 31 ms.
[2023-03-12 10:06:35] [INFO ] Added : 5 causal constraints over 4 iterations in 121 ms. Result :sat
Minimization took 63 ms.
[2023-03-12 10:06:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:35] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Real]Added 22 Read/Feed constraints in 60 ms returned sat
[2023-03-12 10:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:35] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-12 10:06:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-12 10:06:35] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 41 ms.
[2023-03-12 10:06:36] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 0 ms to minimize.
[2023-03-12 10:06:36] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2023-03-12 10:06:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-12 10:06:36] [INFO ] Added : 10 causal constraints over 2 iterations in 627 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20] Max seen :[10, 10, 10]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 181 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 126/126 places, 1328/1328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 172 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:06:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:06:37] [INFO ] Invariant cache hit.
[2023-03-12 10:06:37] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-12 10:06:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:06:37] [INFO ] Invariant cache hit.
[2023-03-12 10:06:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:38] [INFO ] Implicit Places using invariants and state equation in 598 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 945 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 80 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1200 ms. Remains : 124/126 places, 1328/1328 transitions.
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:06:38] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4469 ms. (steps per millisecond=223 ) properties (out of 3) seen :25
Incomplete Best-First random walk after 1000001 steps, including 816 resets, run finished after 1785 ms. (steps per millisecond=560 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000000 steps, including 815 resets, run finished after 1652 ms. (steps per millisecond=605 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 864 resets, run finished after 1705 ms. (steps per millisecond=586 ) properties (out of 3) seen :26
[2023-03-12 10:06:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:06:47] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:06:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:48] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-12 10:06:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-12 10:06:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2023-03-12 10:06:48] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 39 ms.
[2023-03-12 10:06:48] [INFO ] Added : 12 causal constraints over 10 iterations in 155 ms. Result :sat
Minimization took 25 ms.
[2023-03-12 10:06:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:48] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-12 10:06:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2023-03-12 10:06:48] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 39 ms.
[2023-03-12 10:06:48] [INFO ] Added : 12 causal constraints over 10 iterations in 164 ms. Result :sat
Minimization took 24 ms.
[2023-03-12 10:06:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:48] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-12 10:06:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:48] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-12 10:06:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2023-03-12 10:06:49] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 39 ms.
[2023-03-12 10:06:49] [INFO ] Added : 10 causal constraints over 2 iterations in 115 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20] Max seen :[10, 10, 10]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 89 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 124/124 places, 1328/1328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 77 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:06:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:06:49] [INFO ] Invariant cache hit.
[2023-03-12 10:06:49] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-12 10:06:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:06:49] [INFO ] Invariant cache hit.
[2023-03-12 10:06:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:50] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-03-12 10:06:50] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-12 10:06:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:06:50] [INFO ] Invariant cache hit.
[2023-03-12 10:06:50] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1219 ms. Remains : 124/124 places, 1328/1328 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-02
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:06:50] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :10
[2023-03-12 10:06:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:06:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:06:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:51] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-12 10:06:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:51] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-12 10:06:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2023-03-12 10:06:51] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 38 ms.
[2023-03-12 10:06:51] [INFO ] Added : 12 causal constraints over 10 iterations in 146 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 85 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:06:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:06:51] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:06:51] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 123/124 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:06:51] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4632 ms. (steps per millisecond=215 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1029 resets, run finished after 1813 ms. (steps per millisecond=551 ) properties (out of 1) seen :10
[2023-03-12 10:06:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:06:58] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:06:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:58] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-12 10:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:06:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:06:58] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-12 10:06:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-12 10:06:58] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 31 ms.
[2023-03-12 10:06:58] [INFO ] Added : 13 causal constraints over 10 iterations in 155 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:06:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:59] [INFO ] Invariant cache hit.
[2023-03-12 10:06:59] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-12 10:06:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:06:59] [INFO ] Invariant cache hit.
[2023-03-12 10:06:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:06:59] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-12 10:06:59] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-12 10:06:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:00] [INFO ] Invariant cache hit.
[2023-03-12 10:07:00] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1394 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-02 in 9642 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-03
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:07:00] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :10
[2023-03-12 10:07:00] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:07:00] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:07:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:00] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-12 10:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:07:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:00] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-12 10:07:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2023-03-12 10:07:00] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 32 ms.
[2023-03-12 10:07:01] [INFO ] Added : 12 causal constraints over 10 iterations in 186 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 82 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:07:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:07:01] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 123/124 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:01] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4554 ms. (steps per millisecond=219 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1029 resets, run finished after 2052 ms. (steps per millisecond=487 ) properties (out of 1) seen :10
[2023-03-12 10:07:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:07:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-12 10:07:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:07:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:08] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-12 10:07:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2023-03-12 10:07:08] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 38 ms.
[2023-03-12 10:07:08] [INFO ] Added : 13 causal constraints over 10 iterations in 165 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 104 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 71 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:07:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:09] [INFO ] Invariant cache hit.
[2023-03-12 10:07:09] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 10:07:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:09] [INFO ] Invariant cache hit.
[2023-03-12 10:07:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:10] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-12 10:07:10] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-12 10:07:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:10] [INFO ] Invariant cache hit.
[2023-03-12 10:07:10] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1588 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-03 in 10297 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-05
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:07:10] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :10
[2023-03-12 10:07:10] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:07:10] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:07:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:10] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-12 10:07:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:07:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:11] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-12 10:07:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-12 10:07:11] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 32 ms.
[2023-03-12 10:07:11] [INFO ] Added : 10 causal constraints over 2 iterations in 118 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 1327
Applied a total of 2 rules in 85 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:07:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:11] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:07:11] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 123/124 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:11] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4316 ms. (steps per millisecond=231 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1086 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 1) seen :10
[2023-03-12 10:07:18] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:07:18] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:07:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:18] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-03-12 10:07:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:07:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:07:18] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-12 10:07:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:07:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 43 ms returned sat
[2023-03-12 10:07:18] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 48 ms.
[2023-03-12 10:07:18] [INFO ] Added : 12 causal constraints over 3 iterations in 155 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 74 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 70 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:07:19] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:19] [INFO ] Invariant cache hit.
[2023-03-12 10:07:19] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-12 10:07:19] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:19] [INFO ] Invariant cache hit.
[2023-03-12 10:07:19] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-12 10:07:19] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 10:07:19] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:07:19] [INFO ] Invariant cache hit.
[2023-03-12 10:07:20] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1189 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P20N10-UpperBounds-05 in 9373 ms.
[2023-03-12 10:07:20] [INFO ] Flatten gal took : 123 ms
[2023-03-12 10:07:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 10:07:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 1328 transitions and 9806 arcs took 9 ms.
Total runtime 61508 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/687/ub_0_ --maxsum=/tmp/687/ub_1_ --maxsum=/tmp/687/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 15110880 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16096692 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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-V50P20N10"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P20N10, 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 r041-tajo-167813694400229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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