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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
709.283 3600000.00 14160534.00 103.60 1 1 ? ? 1 ? 1 20 50 ? 1 20 1 1 50 50 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-167813694200069.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-COL-V50P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.9K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 12:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678603628118

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-COL-V50P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 06:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:47:10] [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.
[2023-03-12 06:47:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 06:47:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2023-03-12 06:47:10] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-12 06:47:10] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2023-03-12 06:47:10] [INFO ] Skeletonized 16 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
[2023-03-12 06:47:10] [INFO ] Computed 4 place invariants in 4 ms
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-12 06:47:10] [INFO ] Invariant cache hit.
[2023-03-12 06:47:10] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-12 06:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 06:47:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 06:47:10] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 06:47:10] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 06:47:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 06:47:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 06:47:10] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:47:10] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 06:47:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 06:47:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 06:47:11] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 06:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 06:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 06:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 06:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 06:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 06:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:47:11] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1, 20, 20, 1, 20, 20, 1, 1, 50]
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) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 06:47:11] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 112 ms.
[2023-03-12 06:47:11] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 9) seen :76
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :30
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :30
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :30
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :30
[2023-03-12 06:47:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 06:47:12] [INFO ] Computed 7 place invariants in 30 ms
[2023-03-12 06:47:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:12] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-12 06:47:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:12] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-12 06:47:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:47:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 29 ms returned sat
[2023-03-12 06:47:12] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 98 ms.
[2023-03-12 06:47:13] [INFO ] Added : 11 causal constraints over 10 iterations in 260 ms. Result :sat
Minimization took 176 ms.
[2023-03-12 06:47:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:13] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-12 06:47:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:13] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-12 06:47:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2023-03-12 06:47:13] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 56 ms.
[2023-03-12 06:47:13] [INFO ] Added : 11 causal constraints over 10 iterations in 226 ms. Result :sat
Minimization took 177 ms.
[2023-03-12 06:47:14] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:14] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-12 06:47:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:14] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 06:47:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 35 ms returned sat
[2023-03-12 06:47:14] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 68 ms.
[2023-03-12 06:47:14] [INFO ] Added : 10 causal constraints over 2 iterations in 135 ms. Result :sat
Minimization took 126 ms.
[2023-03-12 06:47:14] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-12 06:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:14] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-12 06:47:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:14] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 06:47:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2023-03-12 06:47:14] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 49 ms.
[2023-03-12 06:47:15] [INFO ] Added : 10 causal constraints over 2 iterations in 107 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20] Max seen :[10, 10, 10, 10]
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.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 212 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 06:47:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 06:47:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:47:16] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 709 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 06:47:16] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 5144 ms. (steps per millisecond=194 ) properties (out of 4) seen :38
Incomplete Best-First random walk after 1000001 steps, including 815 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 4) seen :38
Incomplete Best-First random walk after 1000000 steps, including 815 resets, run finished after 1884 ms. (steps per millisecond=530 ) properties (out of 4) seen :36
Incomplete Best-First random walk after 1000001 steps, including 862 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 4) seen :38
Incomplete Best-First random walk after 1000001 steps, including 866 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 4) seen :36
[2023-03-12 06:47:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 06:47:29] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 06:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:29] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-12 06:47:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:47:29] [INFO ] [Real]Added 22 Read/Feed constraints in 15 ms returned sat
[2023-03-12 06:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:29] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-12 06:47:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2023-03-12 06:47:30] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 6 ms to minimize.
[2023-03-12 06:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-12 06:47:30] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 39 ms.
[2023-03-12 06:47:30] [INFO ] Added : 10 causal constraints over 10 iterations in 173 ms. Result :sat
Minimization took 216 ms.
[2023-03-12 06:47:30] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:30] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-12 06:47:30] [INFO ] [Real]Added 22 Read/Feed constraints in 16 ms returned sat
[2023-03-12 06:47:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:30] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-12 06:47:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2023-03-12 06:47:30] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 2 ms to minimize.
[2023-03-12 06:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-12 06:47:31] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 53 ms.
[2023-03-12 06:47:31] [INFO ] Added : 10 causal constraints over 10 iterations in 239 ms. Result :sat
Minimization took 218 ms.
[2023-03-12 06:47:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:31] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-12 06:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 06:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:31] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 06:47:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 66 ms returned sat
[2023-03-12 06:47:31] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 57 ms.
[2023-03-12 06:47:31] [INFO ] Added : 10 causal constraints over 2 iterations in 148 ms. Result :sat
Minimization took 76 ms.
[2023-03-12 06:47:32] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:32] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-12 06:47:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-12 06:47:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 65 ms returned sat
[2023-03-12 06:47:32] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 46 ms.
[2023-03-12 06:47:32] [INFO ] Added : 10 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20] Max seen :[10, 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 90 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 90 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 135 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 06:47:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 06:47:33] [INFO ] Invariant cache hit.
[2023-03-12 06:47:33] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 06:47:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 06:47:33] [INFO ] Invariant cache hit.
[2023-03-12 06:47:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:47:34] [INFO ] Implicit Places using invariants and state equation in 846 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1141 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 91 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 1367 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 06:47:34] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4583 ms. (steps per millisecond=218 ) properties (out of 4) seen :32
Incomplete Best-First random walk after 1000001 steps, including 818 resets, run finished after 1626 ms. (steps per millisecond=615 ) properties (out of 4) seen :40
Incomplete Best-First random walk after 1000000 steps, including 816 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties (out of 4) seen :36
Incomplete Best-First random walk after 1000000 steps, including 864 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties (out of 4) seen :36
Incomplete Best-First random walk after 1000000 steps, including 865 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 4) seen :36
[2023-03-12 06:47:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:47:46] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 06:47:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:46] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-12 06:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:46] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-12 06:47:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:47:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 146 ms returned sat
[2023-03-12 06:47:46] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 2 ms to minimize.
[2023-03-12 06:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-12 06:47:46] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 35 ms.
[2023-03-12 06:47:46] [INFO ] Added : 13 causal constraints over 9 iterations in 168 ms. Result :sat
Minimization took 58 ms.
[2023-03-12 06:47:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:47] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-12 06:47:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:47] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 06:47:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 146 ms returned sat
[2023-03-12 06:47:47] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 2 ms to minimize.
[2023-03-12 06:47:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-12 06:47:47] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 35 ms.
[2023-03-12 06:47:47] [INFO ] Added : 13 causal constraints over 9 iterations in 170 ms. Result :sat
Minimization took 58 ms.
[2023-03-12 06:47:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:47] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-12 06:47:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:47] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 06:47:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 18 ms returned sat
[2023-03-12 06:47:48] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 2 ms to minimize.
[2023-03-12 06:47:48] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-12 06:47:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2023-03-12 06:47:48] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 102 ms.
[2023-03-12 06:47:48] [INFO ] Added : 11 causal constraints over 3 iterations in 218 ms. Result :sat
Minimization took 65 ms.
[2023-03-12 06:47:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:48] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-12 06:47:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 06:47:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 18 ms returned sat
[2023-03-12 06:47:49] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-12 06:47:49] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2023-03-12 06:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2023-03-12 06:47:49] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 49 ms.
[2023-03-12 06:47:49] [INFO ] Added : 11 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20] Max seen :[10, 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 79 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 79 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 76 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 06:47:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 06:47:50] [INFO ] Invariant cache hit.
[2023-03-12 06:47:50] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-12 06:47:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 06:47:50] [INFO ] Invariant cache hit.
[2023-03-12 06:47:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:47:51] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2023-03-12 06:47:51] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-12 06:47:51] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 06:47:51] [INFO ] Invariant cache hit.
[2023-03-12 06:47:52] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1771 ms. Remains : 124/124 places, 1328/1328 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-02
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:47:52] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :10
[2023-03-12 06:47:52] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:47:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:47:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:52] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-12 06:47:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:47:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:47:52] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 06:47:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:47:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 150 ms returned sat
[2023-03-12 06:47:52] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-12 06:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-12 06:47:52] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 40 ms.
[2023-03-12 06:47:52] [INFO ] Added : 13 causal constraints over 9 iterations in 163 ms. Result :sat
Minimization took 59 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 89 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 06:47:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:47:53] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:47:53] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 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 06:47:53] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4701 ms. (steps per millisecond=212 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 1030 resets, run finished after 1864 ms. (steps per millisecond=536 ) properties (out of 1) seen :10
[2023-03-12 06:48:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:00] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-12 06:48:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:00] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 06:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:00] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-12 06:48:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2023-03-12 06:48:00] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-12 06:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-12 06:48:00] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 40 ms.
[2023-03-12 06:48:00] [INFO ] Added : 12 causal constraints over 10 iterations in 217 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 73 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 72 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 06:48:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:01] [INFO ] Invariant cache hit.
[2023-03-12 06:48:01] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-12 06:48:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:01] [INFO ] Invariant cache hit.
[2023-03-12 06:48:01] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-12 06:48:01] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 06:48:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:01] [INFO ] Invariant cache hit.
[2023-03-12 06:48:02] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1195 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-02 in 10209 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:48:02] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10002 steps, including 22 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :10
[2023-03-12 06:48:02] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:48:02] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:48:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:02] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-12 06:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:02] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-12 06:48:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 110 ms returned sat
[2023-03-12 06:48:02] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-12 06:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-12 06:48:02] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 58 ms.
[2023-03-12 06:48:03] [INFO ] Added : 13 causal constraints over 9 iterations in 220 ms. Result :sat
Minimization took 58 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 4 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 113 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 06:48:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:48:03] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 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 06:48:03] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4482 ms. (steps per millisecond=223 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000000 steps, including 1029 resets, run finished after 1742 ms. (steps per millisecond=574 ) properties (out of 1) seen :10
[2023-03-12 06:48:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:10] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:48:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-12 06:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:10] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 06:48:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2023-03-12 06:48:10] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-12 06:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-12 06:48:10] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 37 ms.
[2023-03-12 06:48:10] [INFO ] Added : 12 causal constraints over 10 iterations in 212 ms. Result :sat
Minimization took 37 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 99 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 99 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 79 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 06:48:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:11] [INFO ] Invariant cache hit.
[2023-03-12 06:48:11] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 06:48:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:11] [INFO ] Invariant cache hit.
[2023-03-12 06:48:11] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-12 06:48:12] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-12 06:48:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:12] [INFO ] Invariant cache hit.
[2023-03-12 06:48:12] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1584 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 in 10530 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-05
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:48:12] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :5
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 06:48:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:48:12] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:48:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:12] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-12 06:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:13] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-12 06:48:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2023-03-12 06:48:13] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-12 06:48:13] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-12 06:48:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2023-03-12 06:48:13] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 44 ms.
[2023-03-12 06:48:13] [INFO ] Added : 11 causal constraints over 3 iterations in 139 ms. Result :sat
Minimization took 56 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 8 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 131 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 06:48:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:48:14] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 636 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 06:48:14] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2623 resets, run finished after 4722 ms. (steps per millisecond=211 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1086 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties (out of 1) seen :10
[2023-03-12 06:48:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:48:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:21] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-12 06:48:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:21] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-12 06:48:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2023-03-12 06:48:21] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 57 ms.
[2023-03-12 06:48:21] [INFO ] Added : 10 causal constraints over 2 iterations in 214 ms. Result :sat
Minimization took 78 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 87 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 88 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 78 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 06:48:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:22] [INFO ] Invariant cache hit.
[2023-03-12 06:48:22] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 06:48:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:22] [INFO ] Invariant cache hit.
[2023-03-12 06:48:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:23] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-12 06:48:23] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 06:48:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:23] [INFO ] Invariant cache hit.
[2023-03-12 06:48:23] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1755 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-05 in 11085 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-09
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:48:23] [INFO ] Computed 5 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :10
[2023-03-12 06:48:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 06:48:24] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:48:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:24] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-12 06:48:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:24] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 06:48:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2023-03-12 06:48:24] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 1 ms to minimize.
[2023-03-12 06:48:25] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2023-03-12 06:48:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 702 ms
[2023-03-12 06:48:25] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 56 ms.
[2023-03-12 06:48:25] [INFO ] Added : 11 causal constraints over 3 iterations in 129 ms. Result :sat
Minimization took 52 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 88 ms. Remains 123 /124 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 06:48:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:48:26] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 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 06:48:26] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4417 ms. (steps per millisecond=226 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 1088 resets, run finished after 1881 ms. (steps per millisecond=531 ) properties (out of 1) seen :10
[2023-03-12 06:48:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 06:48:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:48:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:32] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 06:48:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:48:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:48:32] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 06:48:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2023-03-12 06:48:32] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 46 ms.
[2023-03-12 06:48:32] [INFO ] Added : 10 causal constraints over 2 iterations in 176 ms. Result :sat
Minimization took 44 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 109 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 110 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 78 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 06:48:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:33] [INFO ] Invariant cache hit.
[2023-03-12 06:48:33] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 06:48:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:33] [INFO ] Invariant cache hit.
[2023-03-12 06:48:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:48:34] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
[2023-03-12 06:48:34] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 06:48:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 06:48:34] [INFO ] Invariant cache hit.
[2023-03-12 06:48:35] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2191 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-09 in 11575 ms.
[2023-03-12 06:48:35] [INFO ] Flatten gal took : 198 ms
[2023-03-12 06:48:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 06:48:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 1328 transitions and 9806 arcs took 10 ms.
Total runtime 85870 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/810/ub_0_ --maxsum=/tmp/810/ub_1_ --maxsum=/tmp/810/ub_2_ --maxsum=/tmp/810/ub_3_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15577576 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16091876 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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.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-COL-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-COL-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-167813694200069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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