fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1162.575 3600000.00 14072482.00 198.40 1 ? 1 80 1 80 1 1 50 ? 80 1 80 80 ? 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694300141.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-V80P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694300141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 12:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:44 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 45K 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-V80P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678610011455

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-V80P50N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 08:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:33:33] [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 08:33:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 08:33:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2023-03-12 08:33:34] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-12 08:33:34] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 08:33:34] [INFO ] Skeletonized 16 HLPN properties in 1 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 08:33:34] [INFO ] Computed 4 place invariants in 3 ms
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-12 08:33:34] [INFO ] Invariant cache hit.
[2023-03-12 08:33:34] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-12 08:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 08:33:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 08:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:34] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-12 08:33:34] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 08:33:34] [INFO ] Added : 2 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 30 ms.
[2023-03-12 08:33:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 08:33:35] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:35] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-12 08:33:35] [INFO ] Added : 2 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 08:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 08:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 08:33:36] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 08:33:36] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [50, 80, 80, 1, 1, 50, 80, 80, 80, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] 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 08:33:36] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 193 ms.
[2023-03-12 08:33:36] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 11) seen :402
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-13 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :184
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :87
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :26
[2023-03-12 08:33:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-12 08:33:36] [INFO ] Computed 7 place invariants in 32 ms
[2023-03-12 08:33:36] [INFO ] [Real]Absence check using 7 positive place invariants in 54 ms returned sat
[2023-03-12 08:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:38] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2023-03-12 08:33:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-12 08:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:38] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-12 08:33:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:33:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 95 ms returned sat
[2023-03-12 08:33:39] [INFO ] Deduced a trap composed of 5 places in 488 ms of which 35 ms to minimize.
[2023-03-12 08:33:39] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 1 ms to minimize.
[2023-03-12 08:33:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1080 ms
[2023-03-12 08:33:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 124 ms.
[2023-03-12 08:33:42] [INFO ] Deduced a trap composed of 15 places in 1767 ms of which 2 ms to minimize.
[2023-03-12 08:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1805 ms
[2023-03-12 08:33:42] [INFO ] Added : 11 causal constraints over 3 iterations in 2156 ms. Result :sat
Minimization took 164 ms.
[2023-03-12 08:33:42] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-12 08:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:42] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-12 08:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 08:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:42] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-12 08:33:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 334 ms returned sat
[2023-03-12 08:33:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 238 ms.
[2023-03-12 08:33:43] [INFO ] Added : 1 causal constraints over 1 iterations in 351 ms. Result :sat
Minimization took 476 ms.
[2023-03-12 08:33:43] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 08:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:44] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-12 08:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:33:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 08:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:33:44] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-12 08:33:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 61 ms returned sat
[2023-03-12 08:33:46] [INFO ] Deduced a trap composed of 5 places in 1973 ms of which 0 ms to minimize.
[2023-03-12 08:33:46] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 2 ms to minimize.
[2023-03-12 08:33:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2529 ms
[2023-03-12 08:33:46] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 94 ms.
[2023-03-12 08:33:48] [INFO ] Deduced a trap composed of 15 places in 1553 ms of which 0 ms to minimize.
[2023-03-12 08:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1589 ms
[2023-03-12 08:33:48] [INFO ] Added : 11 causal constraints over 3 iterations in 1848 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[10, 7, 10]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 463 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 08:33:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 08:33:50] [INFO ] Computed 5 place invariants in 30 ms
[2023-03-12 08:33:51] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1540 ms. Remains : 186/188 places, 2108/2108 transitions.
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 08:33:51] [INFO ] Computed 5 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 1424 resets, run finished after 6797 ms. (steps per millisecond=147 ) properties (out of 3) seen :25
Incomplete Best-First random walk after 1000000 steps, including 550 resets, run finished after 2575 ms. (steps per millisecond=388 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 531 resets, run finished after 2409 ms. (steps per millisecond=415 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 1000001 steps, including 551 resets, run finished after 2473 ms. (steps per millisecond=404 ) properties (out of 3) seen :28
[2023-03-12 08:34:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 08:34:06] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 08:34:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 08:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:06] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-12 08:34:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:06] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-12 08:34:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 132 ms returned sat
[2023-03-12 08:34:06] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 77 ms.
[2023-03-12 08:34:07] [INFO ] Added : 10 causal constraints over 2 iterations in 448 ms. Result :sat
Minimization took 430 ms.
[2023-03-12 08:34:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 08:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:07] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-12 08:34:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:07] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-12 08:34:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2023-03-12 08:34:08] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-12 08:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2023-03-12 08:34:08] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 59 ms.
[2023-03-12 08:34:08] [INFO ] Added : 5 causal constraints over 5 iterations in 324 ms. Result :sat
Minimization took 429 ms.
[2023-03-12 08:34:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 08:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:09] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-12 08:34:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 08:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:09] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-12 08:34:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 94 ms returned sat
[2023-03-12 08:34:09] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 93 ms.
[2023-03-12 08:34:10] [INFO ] Added : 10 causal constraints over 2 iterations in 446 ms. Result :sat
Minimization took 429 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[10, 10, 10]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 275 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 400 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 08:34:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 08:34:11] [INFO ] Invariant cache hit.
[2023-03-12 08:34:12] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-12 08:34:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 08:34:12] [INFO ] Invariant cache hit.
[2023-03-12 08:34:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:15] [INFO ] Implicit Places using invariants and state equation in 3615 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4077 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 331 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4812 ms. Remains : 184/186 places, 2108/2108 transitions.
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:34:16] [INFO ] Computed 5 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 6431 ms. (steps per millisecond=155 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 1000001 steps, including 552 resets, run finished after 2409 ms. (steps per millisecond=415 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000000 steps, including 531 resets, run finished after 2346 ms. (steps per millisecond=426 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 1000000 steps, including 551 resets, run finished after 2486 ms. (steps per millisecond=402 ) properties (out of 3) seen :27
[2023-03-12 08:34:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:34:30] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 08:34:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:30] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 08:34:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:30] [INFO ] [Real]Added 22 Read/Feed constraints in 38 ms returned sat
[2023-03-12 08:34:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 08:34:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:30] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-12 08:34:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2023-03-12 08:34:30] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 56 ms.
[2023-03-12 08:34:30] [INFO ] Added : 10 causal constraints over 2 iterations in 290 ms. Result :sat
Minimization took 77 ms.
[2023-03-12 08:34:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 08:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:31] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-12 08:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:31] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-12 08:34:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2023-03-12 08:34:31] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 63 ms.
[2023-03-12 08:34:31] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-12 08:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-12 08:34:31] [INFO ] Added : 12 causal constraints over 7 iterations in 663 ms. Result :sat
Minimization took 457 ms.
[2023-03-12 08:34:32] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 08:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:32] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-12 08:34:32] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2023-03-12 08:34:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:32] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-12 08:34:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2023-03-12 08:34:32] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 76 ms.
[2023-03-12 08:34:33] [INFO ] Added : 10 causal constraints over 2 iterations in 386 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[10, 10, 10]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 146 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 180 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 08:34:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 08:34:34] [INFO ] Invariant cache hit.
[2023-03-12 08:34:35] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 08:34:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 08:34:35] [INFO ] Invariant cache hit.
[2023-03-12 08:34:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:36] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
[2023-03-12 08:34:36] [INFO ] Redundant transitions in 157 ms returned []
[2023-03-12 08:34:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 08:34:36] [INFO ] Invariant cache hit.
[2023-03-12 08:34:37] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2897 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-01
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:34:37] [INFO ] Computed 5 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :10
[2023-03-12 08:34:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:34:37] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 08:34:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:37] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-12 08:34:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:38] [INFO ] [Real]Added 22 Read/Feed constraints in 36 ms returned sat
[2023-03-12 08:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:38] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-12 08:34:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2023-03-12 08:34:38] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 72 ms.
[2023-03-12 08:34:38] [INFO ] Added : 10 causal constraints over 2 iterations in 338 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 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 183 transition count 2107
Applied a total of 2 rules in 243 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 08:34:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:34:39] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:34:40] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1102 ms. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:34:40] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6640 ms. (steps per millisecond=150 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 3040 ms. (steps per millisecond=328 ) properties (out of 1) seen :10
[2023-03-12 08:34:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:34:50] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 08:34:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 08:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:50] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-12 08:34:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:50] [INFO ] [Real]Added 22 Read/Feed constraints in 88 ms returned sat
[2023-03-12 08:34:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:50] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-12 08:34:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 125 ms returned sat
[2023-03-12 08:34:50] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 71 ms.
[2023-03-12 08:34:51] [INFO ] Added : 11 causal constraints over 3 iterations in 427 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 205 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 175 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 08:34:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:34:52] [INFO ] Invariant cache hit.
[2023-03-12 08:34:52] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-12 08:34:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:34:52] [INFO ] Invariant cache hit.
[2023-03-12 08:34:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:53] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2023-03-12 08:34:53] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-12 08:34:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:34:53] [INFO ] Invariant cache hit.
[2023-03-12 08:34:54] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2254 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-01 in 16474 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-09
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:34:54] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :10
[2023-03-12 08:34:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:34:54] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 08:34:54] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 08:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:54] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-12 08:34:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:34:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:34:54] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-12 08:34:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:34:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 62 ms returned sat
[2023-03-12 08:34:54] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 72 ms.
[2023-03-12 08:34:55] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2023-03-12 08:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-12 08:34:55] [INFO ] Added : 12 causal constraints over 7 iterations in 718 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 2107
Applied a total of 2 rules in 194 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 08:34:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:34:56] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 08:34:57] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1264 ms. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:34:57] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6766 ms. (steps per millisecond=147 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 671 resets, run finished after 2613 ms. (steps per millisecond=382 ) properties (out of 1) seen :10
[2023-03-12 08:35:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:35:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:35:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 08:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:35:07] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-12 08:35:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:35:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:35:07] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-12 08:35:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:35:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2023-03-12 08:35:07] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 51 ms.
[2023-03-12 08:35:07] [INFO ] Added : 12 causal constraints over 10 iterations in 488 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 199 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 170 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 08:35:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:35:08] [INFO ] Invariant cache hit.
[2023-03-12 08:35:09] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-12 08:35:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:35:09] [INFO ] Invariant cache hit.
[2023-03-12 08:35:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:35:10] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2023-03-12 08:35:10] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-12 08:35:10] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:35:10] [INFO ] Invariant cache hit.
[2023-03-12 08:35:11] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2511 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-09 in 17027 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-14
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:35:11] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :10
[2023-03-12 08:35:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 08:35:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:35:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 08:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:35:11] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-12 08:35:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:35:11] [INFO ] [Real]Added 22 Read/Feed constraints in 15 ms returned sat
[2023-03-12 08:35:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:35:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:35:11] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-12 08:35:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2023-03-12 08:35:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 58 ms.
[2023-03-12 08:35:11] [INFO ] Added : 10 causal constraints over 2 iterations in 352 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 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 183 transition count 2107
Applied a total of 2 rules in 199 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 08:35:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:35:12] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:35:13] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1009 ms. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:35:13] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6658 ms. (steps per millisecond=150 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 2796 ms. (steps per millisecond=357 ) properties (out of 1) seen :10
[2023-03-12 08:35:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 08:35:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:35:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 08:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:35:23] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-12 08:35:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:35:23] [INFO ] [Real]Added 22 Read/Feed constraints in 60 ms returned sat
[2023-03-12 08:35:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:35:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 08:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:35:23] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-12 08:35:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 70 ms returned sat
[2023-03-12 08:35:23] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 85 ms.
[2023-03-12 08:35:23] [INFO ] Added : 11 causal constraints over 3 iterations in 448 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 166 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 165 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 08:35:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:35:24] [INFO ] Invariant cache hit.
[2023-03-12 08:35:25] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-12 08:35:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:35:25] [INFO ] Invariant cache hit.
[2023-03-12 08:35:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 08:35:25] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2023-03-12 08:35:26] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-12 08:35:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 08:35:26] [INFO ] Invariant cache hit.
[2023-03-12 08:35:26] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2103 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-14 in 15626 ms.
[2023-03-12 08:35:27] [INFO ] Flatten gal took : 260 ms
[2023-03-12 08:35:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-12 08:35:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 2108 transitions and 15626 arcs took 22 ms.
Total runtime 113444 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/752/ub_0_ --maxsum=/tmp/752/ub_1_ --maxsum=/tmp/752/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 15219436 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16091268 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-V80P50N10"
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-V80P50N10, 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-167813694300141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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