fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r065-tajo-171620414500161
Last Updated
July 7, 2024

About the Execution of 2023-gold for BridgeAndVehicles-PT-V50P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4246.764 904321.00 945047.00 298.00 50 1 20 1 50 20 1 50 50 20 1 50 1 1 50 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716634092887

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 10:48:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 10:48:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 10:48:15] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-25 10:48:15] [INFO ] Transformed 138 places.
[2024-05-25 10:48:15] [INFO ] Transformed 2348 transitions.
[2024-05-25 10:48:15] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 138 cols
[2024-05-25 10:48:15] [INFO ] Computed 7 invariants in 53 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 10) seen :126
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :49
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :31
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :46
[2024-05-25 10:48:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-25 10:48:15] [INFO ] Computed 7 invariants in 9 ms
[2024-05-25 10:48:15] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-05-25 10:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:16] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-25 10:48:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-25 10:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:16] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-25 10:48:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:48:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 101 ms returned sat
[2024-05-25 10:48:16] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 172 ms.
[2024-05-25 10:48:16] [INFO ] Added : 20 causal constraints over 4 iterations in 364 ms. Result :sat
Minimization took 183 ms.
[2024-05-25 10:48:17] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-25 10:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:17] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-25 10:48:17] [INFO ] [Real]Added 42 Read/Feed constraints in 147 ms returned sat
[2024-05-25 10:48:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 10:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:17] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-25 10:48:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 38 ms returned sat
[2024-05-25 10:48:18] [INFO ] Deduced a trap composed of 6 places in 476 ms of which 12 ms to minimize.
[2024-05-25 10:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2024-05-25 10:48:18] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 144 ms.
[2024-05-25 10:48:18] [INFO ] Added : 22 causal constraints over 20 iterations in 482 ms. Result :sat
Minimization took 197 ms.
[2024-05-25 10:48:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2024-05-25 10:48:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-25 10:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:18] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-25 10:48:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 10:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:19] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-25 10:48:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 93 ms returned sat
[2024-05-25 10:48:19] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 90 ms.
[2024-05-25 10:48:19] [INFO ] Added : 20 causal constraints over 4 iterations in 198 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 1, 50] Max seen :[20, 20, 1, 20]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 507 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:48:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 10:48:21] [INFO ] Computed 5 invariants in 10 ms
[2024-05-25 10:48:22] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1431 ms. Remains : 136/138 places, 2348/2348 transitions.
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 10:48:22] [INFO ] Computed 5 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2315 resets, run finished after 7221 ms. (steps per millisecond=138 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 1000001 steps, including 842 resets, run finished after 2497 ms. (steps per millisecond=400 ) properties (out of 3) seen :52
Incomplete Best-First random walk after 1000001 steps, including 776 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties (out of 3) seen :42
Incomplete Best-First random walk after 1000001 steps, including 842 resets, run finished after 2278 ms. (steps per millisecond=438 ) properties (out of 3) seen :49
[2024-05-25 10:48:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 10:48:36] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:48:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:37] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-25 10:48:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:48:37] [INFO ] [Real]Added 42 Read/Feed constraints in 52 ms returned sat
[2024-05-25 10:48:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:37] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-25 10:48:37] [INFO ] [Nat]Added 42 Read/Feed constraints in 64 ms returned sat
[2024-05-25 10:48:37] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 103 ms.
[2024-05-25 10:48:37] [INFO ] Added : 21 causal constraints over 5 iterations in 353 ms. Result :sat
Minimization took 265 ms.
[2024-05-25 10:48:38] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:38] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-25 10:48:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:38] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-25 10:48:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 123 ms returned sat
[2024-05-25 10:48:38] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 118 ms.
[2024-05-25 10:48:39] [INFO ] Added : 22 causal constraints over 11 iterations in 338 ms. Result :sat
Minimization took 213 ms.
[2024-05-25 10:48:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:39] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-25 10:48:39] [INFO ] [Real]Added 42 Read/Feed constraints in 53 ms returned sat
[2024-05-25 10:48:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:39] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-25 10:48:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 46 ms returned sat
[2024-05-25 10:48:39] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 81 ms.
[2024-05-25 10:48:39] [INFO ] Added : 21 causal constraints over 5 iterations in 234 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[20, 20, 20]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 297 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 396 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:48:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:48:42] [INFO ] Invariant cache hit.
[2024-05-25 10:48:42] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-25 10:48:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:48:42] [INFO ] Invariant cache hit.
[2024-05-25 10:48:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:48:43] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1585 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 224 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2209 ms. Remains : 134/136 places, 2348/2348 transitions.
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:48:44] [INFO ] Computed 5 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2315 resets, run finished after 6727 ms. (steps per millisecond=148 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000000 steps, including 842 resets, run finished after 2583 ms. (steps per millisecond=387 ) properties (out of 3) seen :48
Incomplete Best-First random walk after 1000001 steps, including 778 resets, run finished after 2276 ms. (steps per millisecond=439 ) properties (out of 3) seen :36
Incomplete Best-First random walk after 1000000 steps, including 842 resets, run finished after 2345 ms. (steps per millisecond=426 ) properties (out of 3) seen :49
[2024-05-25 10:48:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:48:58] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:48:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:58] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-25 10:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:58] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-25 10:48:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:48:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 196 ms returned sat
[2024-05-25 10:48:58] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 68 ms.
[2024-05-25 10:48:58] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2024-05-25 10:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-25 10:48:59] [INFO ] Added : 20 causal constraints over 4 iterations in 472 ms. Result :sat
Minimization took 186 ms.
[2024-05-25 10:48:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:59] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-25 10:48:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:48:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:48:59] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-25 10:48:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 148 ms returned sat
[2024-05-25 10:48:59] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 87 ms.
[2024-05-25 10:48:59] [INFO ] Added : 4 causal constraints over 2 iterations in 197 ms. Result :sat
Minimization took 176 ms.
[2024-05-25 10:49:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:00] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-25 10:49:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:49:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:00] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-25 10:49:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 133 ms returned sat
[2024-05-25 10:49:00] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 55 ms.
[2024-05-25 10:49:00] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2024-05-25 10:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2024-05-25 10:49:00] [INFO ] Added : 20 causal constraints over 4 iterations in 462 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[20, 20, 20]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 179 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 181 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:49:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:49:02] [INFO ] Invariant cache hit.
[2024-05-25 10:49:02] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-25 10:49:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:49:02] [INFO ] Invariant cache hit.
[2024-05-25 10:49:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:03] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2024-05-25 10:49:03] [INFO ] Redundant transitions in 196 ms returned []
[2024-05-25 10:49:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:49:03] [INFO ] Invariant cache hit.
[2024-05-25 10:49:04] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2356 ms. Remains : 134/134 places, 2348/2348 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:49:04] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :20
[2024-05-25 10:49:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:49:04] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:49:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:05] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-25 10:49:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:05] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-25 10:49:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 195 ms returned sat
[2024-05-25 10:49:05] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 68 ms.
[2024-05-25 10:49:05] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 2 ms to minimize.
[2024-05-25 10:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-25 10:49:05] [INFO ] Added : 20 causal constraints over 4 iterations in 438 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 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 133 transition count 2347
Applied a total of 2 rules in 236 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:49:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:07] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:49:07] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 133/134 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:07] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 6324 ms. (steps per millisecond=158 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 1061 resets, run finished after 2586 ms. (steps per millisecond=386 ) properties (out of 1) seen :20
[2024-05-25 10:49:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:16] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:49:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:17] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-25 10:49:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:17] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-25 10:49:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 22 ms returned sat
[2024-05-25 10:49:17] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 84 ms.
[2024-05-25 10:49:17] [INFO ] Added : 20 causal constraints over 4 iterations in 220 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 177 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 201 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:49:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:18] [INFO ] Invariant cache hit.
[2024-05-25 10:49:18] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-25 10:49:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:18] [INFO ] Invariant cache hit.
[2024-05-25 10:49:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:19] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2024-05-25 10:49:19] [INFO ] Redundant transitions in 159 ms returned []
[2024-05-25 10:49:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:19] [INFO ] Invariant cache hit.
[2024-05-25 10:49:20] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2384 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 in 15822 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:49:20] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :20
[2024-05-25 10:49:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:49:20] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:49:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:20] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-25 10:49:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:20] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-25 10:49:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 265 ms returned sat
[2024-05-25 10:49:21] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 76 ms.
[2024-05-25 10:49:21] [INFO ] Added : 4 causal constraints over 2 iterations in 186 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 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 133 transition count 2347
Applied a total of 2 rules in 230 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:49:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:22] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:49:22] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1039 ms. Remains : 133/134 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:22] [INFO ] Computed 5 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2681 resets, run finished after 6307 ms. (steps per millisecond=158 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 994 resets, run finished after 2618 ms. (steps per millisecond=381 ) properties (out of 1) seen :20
[2024-05-25 10:49:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:49:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:31] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-25 10:49:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:32] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-25 10:49:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:32] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2024-05-25 10:49:32] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 61 ms.
[2024-05-25 10:49:32] [INFO ] Added : 21 causal constraints over 20 iterations in 398 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 195 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 233 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:49:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:33] [INFO ] Invariant cache hit.
[2024-05-25 10:49:33] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-25 10:49:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:33] [INFO ] Invariant cache hit.
[2024-05-25 10:49:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:34] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2024-05-25 10:49:34] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-25 10:49:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:34] [INFO ] Invariant cache hit.
[2024-05-25 10:49:35] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2699 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 in 15321 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:49:35] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) 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 :20
[2024-05-25 10:49:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-25 10:49:36] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:49:36] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:36] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-25 10:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-25 10:49:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 194 ms returned sat
[2024-05-25 10:49:36] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 79 ms.
[2024-05-25 10:49:36] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 2 ms to minimize.
[2024-05-25 10:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-25 10:49:37] [INFO ] Added : 20 causal constraints over 4 iterations in 466 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 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 133 transition count 2347
Applied a total of 2 rules in 207 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:49:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:38] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:49:39] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1023 ms. Remains : 133/134 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:39] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2681 resets, run finished after 6014 ms. (steps per millisecond=166 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1068 resets, run finished after 2388 ms. (steps per millisecond=418 ) properties (out of 1) seen :20
[2024-05-25 10:49:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:49:47] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:49:47] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:47] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-25 10:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:49:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:49:47] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-25 10:49:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 46 ms returned sat
[2024-05-25 10:49:48] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 75 ms.
[2024-05-25 10:49:48] [INFO ] Added : 20 causal constraints over 4 iterations in 225 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 209 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 201 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:49:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:49] [INFO ] Invariant cache hit.
[2024-05-25 10:49:49] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-25 10:49:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:49] [INFO ] Invariant cache hit.
[2024-05-25 10:49:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:49:50] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2024-05-25 10:49:50] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-25 10:49:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:49:50] [INFO ] Invariant cache hit.
[2024-05-25 10:49:51] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2071 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 in 15335 ms.
[2024-05-25 10:49:51] [INFO ] Flatten gal took : 237 ms
[2024-05-25 10:49:51] [INFO ] Applying decomposition
[2024-05-25 10:49:52] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11199773582175466195.txt' '-o' '/tmp/graph11199773582175466195.bin' '-w' '/tmp/graph11199773582175466195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11199773582175466195.bin' '-l' '-1' '-v' '-w' '/tmp/graph11199773582175466195.weights' '-q' '0' '-e' '0.001'
[2024-05-25 10:49:52] [INFO ] Decomposing Gal with order
[2024-05-25 10:49:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 10:49:53] [INFO ] Removed a total of 4373 redundant transitions.
[2024-05-25 10:49:53] [INFO ] Flatten gal took : 791 ms
[2024-05-25 10:49:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 34 ms.
[2024-05-25 10:49:53] [INFO ] Time to serialize gal into /tmp/UpperBounds5839929171442683306.gal : 11 ms
[2024-05-25 10:49:53] [INFO ] Time to serialize properties into /tmp/UpperBounds11715477772311013757.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5839929171442683306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11715477772311013757.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11715477772311013757.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.9629e+08,799.755,3605888,2088,33868,333956,4.47743e+06,107,6.25044e+06,472,5.12398e+07,0
Total reachable state count : 896290210

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 :0 <= u0.SUR_PONT_A <= 20
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 20 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N20-UpperBounds-02,0,802.405,3605888,1,0,333956,4.47743e+06,134,6.25044e+06,554,5.12398e+07,403
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 :0 <= u0.SUR_PONT_B <= 20
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 20 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N20-UpperBounds-05,0,802.413,3605888,1,0,333956,4.47743e+06,139,6.25044e+06,578,5.12398e+07,409
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 :0 <= u0.SUR_PONT_A <= 20
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 20 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N20-UpperBounds-09,0,802.413,3605888,1,0,333956,4.47743e+06,139,6.25044e+06,578,5.12398e+07,409
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 902112 ms.

BK_STOP 1716634997208

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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