About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12457.892 | 3600000.00 | 3686005.00 | 1698.30 | 1 80 ? ? 20 80 ? 1 1 1 80 80 ? 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/mcc2021-input.r026-tajo-162038143400115.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143400115
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 45K May 5 16:51 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-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620519559246
Running Version 0
[2021-05-09 00:19:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 00:19:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 00:19:21] [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.
[2021-05-09 00:19:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-09 00:19:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2021-05-09 00:19:22] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-09 00:19:22] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 2 ms.
[2021-05-09 00:19:22] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_14632251325932510631.dot
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
[2021-05-09 00:19:22] [INFO ] Computed 4 place invariants in 15 ms
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-09 00:19:22] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions in 56 ms.
[2021-05-09 00:19:22] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 00:19:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 00:19:22] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 00:19:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 00:19:22] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 00:19:22] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 00:19:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 14 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 00:19:22] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-09 00:19:22] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 2 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 00:19:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 00:19:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 00:19:22] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [1, 80, 20, 20, 80, 20, 20, 80, 1]
[2021-05-09 00:19:22] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions in 33 ms.
[2021-05-09 00:19:22] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2734131498735157958.dot
Incomplete random walk after 10001 steps, including 14 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 9) seen :233
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :254
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-13 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :28
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :30
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :28
[2021-05-09 00:19:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2021-05-09 00:19:23] [INFO ] Computed 7 place invariants in 32 ms
[2021-05-09 00:19:23] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-09 00:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:23] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-09 00:19:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-09 00:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:23] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-09 00:19:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:19:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 168 ms returned sat
[2021-05-09 00:19:24] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 7 ms to minimize.
[2021-05-09 00:19:24] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2021-05-09 00:19:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
[2021-05-09 00:19:24] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 110 ms.
[2021-05-09 00:19:25] [INFO ] Added : 168 causal constraints over 35 iterations in 1018 ms. Result :sat
Minimization took 260 ms.
[2021-05-09 00:19:26] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-09 00:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:26] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-09 00:19:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-09 00:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:26] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-09 00:19:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 135 ms returned sat
[2021-05-09 00:19:27] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 2 ms to minimize.
[2021-05-09 00:19:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2021-05-09 00:19:27] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 342 ms.
[2021-05-09 00:19:28] [INFO ] Added : 168 causal constraints over 34 iterations in 1245 ms. Result :sat
Minimization took 206 ms.
[2021-05-09 00:19:28] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-09 00:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:28] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 00:19:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-09 00:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:28] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-09 00:19:28] [INFO ] [Nat]Added 22 Read/Feed constraints in 158 ms returned sat
[2021-05-09 00:19:29] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 2 ms to minimize.
[2021-05-09 00:19:29] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 2 ms to minimize.
[2021-05-09 00:19:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 639 ms
[2021-05-09 00:19:29] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 67 ms.
[2021-05-09 00:19:30] [INFO ] Added : 168 causal constraints over 35 iterations in 950 ms. Result :sat
Minimization took 441 ms.
[2021-05-09 00:19:31] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2021-05-09 00:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:31] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-09 00:19:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-09 00:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:31] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 00:19:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 205 ms returned sat
[2021-05-09 00:19:31] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2021-05-09 00:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2021-05-09 00:19:32] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 76 ms.
[2021-05-09 00:19:32] [INFO ] Added : 168 causal constraints over 34 iterations in 742 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20] Max seen :[10, 10, 10, 10]
Incomplete Parikh walk after 70700 steps, including 550 resets, run finished after 640 ms. (steps per millisecond=110 ) properties (out of 4) seen :36 could not realise parikh vector
Incomplete Parikh walk after 86000 steps, including 650 resets, run finished after 565 ms. (steps per millisecond=152 ) properties (out of 4) seen :30 could not realise parikh vector
Incomplete Parikh walk after 70700 steps, including 533 resets, run finished after 379 ms. (steps per millisecond=186 ) properties (out of 4) seen :38 could not realise parikh vector
Incomplete Parikh walk after 86000 steps, including 654 resets, run finished after 627 ms. (steps per millisecond=137 ) properties (out of 4) seen :30 could not realise parikh vector
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions, 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.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 485 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2021-05-09 00:19:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2021-05-09 00:19:35] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:19:36] [INFO ] Dead Transitions using invariants and state equation in 680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 186/188 places, 2108/2108 transitions.
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 186 cols
[2021-05-09 00:19:36] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 7014 ms. (steps per millisecond=142 ) properties (out of 4) seen :34
Incomplete Best-First random walk after 1000001 steps, including 551 resets, run finished after 2465 ms. (steps per millisecond=405 ) properties (out of 4) seen :38
Incomplete Best-First random walk after 1000001 steps, including 532 resets, run finished after 2232 ms. (steps per millisecond=448 ) properties (out of 4) seen :38
Incomplete Best-First random walk after 1000001 steps, including 551 resets, run finished after 2324 ms. (steps per millisecond=430 ) properties (out of 4) seen :36
Incomplete Best-First random walk after 1000001 steps, including 532 resets, run finished after 3191 ms. (steps per millisecond=313 ) properties (out of 4) seen :38
[2021-05-09 00:19:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2021-05-09 00:19:53] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:19:53] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-09 00:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:53] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-09 00:19:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:53] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-09 00:19:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:19:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 61 ms returned sat
[2021-05-09 00:19:54] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 80 ms.
[2021-05-09 00:19:55] [INFO ] Added : 168 causal constraints over 35 iterations in 1103 ms. Result :sat
Minimization took 198 ms.
[2021-05-09 00:19:55] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:55] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-09 00:19:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:55] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-09 00:19:55] [INFO ] [Nat]Added 22 Read/Feed constraints in 46 ms returned sat
[2021-05-09 00:19:56] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2021-05-09 00:19:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2021-05-09 00:19:56] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 61 ms.
[2021-05-09 00:19:57] [INFO ] Added : 167 causal constraints over 40 iterations in 1110 ms. Result :sat
Minimization took 390 ms.
[2021-05-09 00:19:57] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-09 00:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:57] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-09 00:19:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:57] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-09 00:19:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 45 ms returned sat
[2021-05-09 00:19:58] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 74 ms.
[2021-05-09 00:19:58] [INFO ] Added : 168 causal constraints over 35 iterations in 981 ms. Result :sat
Minimization took 254 ms.
[2021-05-09 00:19:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 00:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:59] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-09 00:19:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:19:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:19:59] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-09 00:19:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 51 ms returned sat
[2021-05-09 00:19:59] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2021-05-09 00:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2021-05-09 00:20:00] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 65 ms.
[2021-05-09 00:20:01] [INFO ] Added : 167 causal constraints over 40 iterations in 1317 ms. Result :sat
Minimization took 515 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20] Max seen :[10, 10, 10, 10]
Incomplete Parikh walk after 77300 steps, including 607 resets, run finished after 561 ms. (steps per millisecond=137 ) properties (out of 4) seen :28 could not realise parikh vector
Incomplete Parikh walk after 103800 steps, including 798 resets, run finished after 596 ms. (steps per millisecond=174 ) properties (out of 4) seen :38 could not realise parikh vector
Incomplete Parikh walk after 77300 steps, including 607 resets, run finished after 354 ms. (steps per millisecond=218 ) properties (out of 4) seen :28 could not realise parikh vector
Incomplete Parikh walk after 103800 steps, including 794 resets, run finished after 516 ms. (steps per millisecond=201 ) properties (out of 4) seen :40 could not realise parikh vector
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 160 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 211 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2021-05-09 00:20:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2021-05-09 00:20:04] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:20:04] [INFO ] Implicit Places using invariants in 407 ms returned []
[2021-05-09 00:20:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2021-05-09 00:20:04] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:20:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:20:06] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2483 ms to find 2 implicit places.
[2021-05-09 00:20:06] [INFO ] Redundant transitions in 151 ms returned []
[2021-05-09 00:20:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:06] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-09 00:20:07] [INFO ] Dead Transitions using invariants and state equation in 787 ms returned []
Starting structural reductions, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 169 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2021-05-09 00:20:07] [INFO ] Redundant transitions in 33 ms returned []
[2021-05-09 00:20:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:07] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:20:08] [INFO ] Dead Transitions using invariants and state equation in 644 ms returned []
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2108/2108 transitions.
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:08] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 5756 ms. (steps per millisecond=173 ) properties (out of 4) seen :34
Incomplete Best-First random walk after 1000000 steps, including 550 resets, run finished after 2629 ms. (steps per millisecond=380 ) properties (out of 4) seen :36
Incomplete Best-First random walk after 1000001 steps, including 531 resets, run finished after 2129 ms. (steps per millisecond=469 ) properties (out of 4) seen :40
Incomplete Best-First random walk after 1000001 steps, including 551 resets, run finished after 2520 ms. (steps per millisecond=396 ) properties (out of 4) seen :38
Incomplete Best-First random walk after 1000001 steps, including 532 resets, run finished after 2557 ms. (steps per millisecond=391 ) properties (out of 4) seen :34
[2021-05-09 00:20:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:24] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:20:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 00:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:24] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-09 00:20:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:20:24] [INFO ] [Real]Added 22 Read/Feed constraints in 21 ms returned sat
[2021-05-09 00:20:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:20:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 00:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:24] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-09 00:20:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 60 ms returned sat
[2021-05-09 00:20:24] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 0 ms to minimize.
[2021-05-09 00:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2021-05-09 00:20:24] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 59 ms.
[2021-05-09 00:20:27] [INFO ] Added : 168 causal constraints over 35 iterations in 2836 ms. Result :sat
Minimization took 347 ms.
[2021-05-09 00:20:28] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:28] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 00:20:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:20:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 00:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:28] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-09 00:20:28] [INFO ] [Nat]Added 22 Read/Feed constraints in 57 ms returned sat
[2021-05-09 00:20:28] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2021-05-09 00:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2021-05-09 00:20:28] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 51 ms.
[2021-05-09 00:20:29] [INFO ] Added : 168 causal constraints over 36 iterations in 1143 ms. Result :sat
Minimization took 462 ms.
[2021-05-09 00:20:30] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:30] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-09 00:20:30] [INFO ] [Real]Added 22 Read/Feed constraints in 24 ms returned sat
[2021-05-09 00:20:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:20:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:30] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-09 00:20:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 80 ms returned sat
[2021-05-09 00:20:31] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2021-05-09 00:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2021-05-09 00:20:31] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 104 ms.
[2021-05-09 00:20:34] [INFO ] Added : 168 causal constraints over 35 iterations in 3112 ms. Result :sat
Minimization took 431 ms.
[2021-05-09 00:20:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:34] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-09 00:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:20:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:34] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-09 00:20:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 75 ms returned sat
[2021-05-09 00:20:35] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2021-05-09 00:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2021-05-09 00:20:35] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 58 ms.
[2021-05-09 00:20:36] [INFO ] Added : 168 causal constraints over 36 iterations in 973 ms. Result :sat
Minimization took 425 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20] Max seen :[10, 10, 10, 10]
Incomplete Parikh walk after 88900 steps, including 704 resets, run finished after 475 ms. (steps per millisecond=187 ) properties (out of 4) seen :32 could not realise parikh vector
Incomplete Parikh walk after 190800 steps, including 1079 resets, run finished after 1034 ms. (steps per millisecond=184 ) properties (out of 4) seen :36 could not realise parikh vector
Incomplete Parikh walk after 88900 steps, including 689 resets, run finished after 310 ms. (steps per millisecond=286 ) properties (out of 4) seen :28 could not realise parikh vector
Incomplete Parikh walk after 190800 steps, including 1076 resets, run finished after 964 ms. (steps per millisecond=197 ) properties (out of 4) seen :40 could not realise parikh vector
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 137 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 142 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2021-05-09 00:20:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:39] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-09 00:20:40] [INFO ] Implicit Places using invariants in 280 ms returned []
[2021-05-09 00:20:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:40] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-09 00:20:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:20:40] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2021-05-09 00:20:41] [INFO ] Redundant transitions in 65 ms returned []
[2021-05-09 00:20:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:41] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:20:41] [INFO ] Dead Transitions using invariants and state equation in 693 ms returned []
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-02
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:41] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10001 steps, including 14 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :10
[2021-05-09 00:20:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:20:41] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:20:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:41] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-09 00:20:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:20:42] [INFO ] [Real]Added 22 Read/Feed constraints in 19 ms returned sat
[2021-05-09 00:20:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:20:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:42] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-09 00:20:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 62 ms returned sat
[2021-05-09 00:20:42] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 0 ms to minimize.
[2021-05-09 00:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2021-05-09 00:20:42] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 78 ms.
[2021-05-09 00:20:45] [INFO ] Added : 168 causal constraints over 35 iterations in 2717 ms. Result :sat
Minimization took 463 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 190800 steps, including 1077 resets, run finished after 1276 ms. (steps per millisecond=149 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions, 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 5 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 286 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2021-05-09 00:20:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:20:47] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 750 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:20:48] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6418 ms. (steps per millisecond=155 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 2423 ms. (steps per millisecond=412 ) properties (out of 1) seen :10
[2021-05-09 00:20:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:20:57] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:20:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:57] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 00:20:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:20:57] [INFO ] [Real]Added 22 Read/Feed constraints in 25 ms returned sat
[2021-05-09 00:20:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:20:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:20:57] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 00:20:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2021-05-09 00:20:57] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2021-05-09 00:20:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2021-05-09 00:20:57] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 65 ms.
[2021-05-09 00:21:00] [INFO ] Added : 166 causal constraints over 34 iterations in 2976 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 97600 steps, including 876 resets, run finished after 506 ms. (steps per millisecond=192 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 195 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 206 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-09 00:21:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:01] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:02] [INFO ] Implicit Places using invariants in 384 ms returned []
[2021-05-09 00:21:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:02] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:21:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:03] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2021-05-09 00:21:03] [INFO ] Redundant transitions in 43 ms returned []
[2021-05-09 00:21:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:03] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 665 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-02 in 22282 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-03
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:21:04] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :10
[2021-05-09 00:21:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:21:04] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:21:04] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:04] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-09 00:21:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:21:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 00:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:04] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-09 00:21:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 61 ms returned sat
[2021-05-09 00:21:04] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2021-05-09 00:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2021-05-09 00:21:04] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 56 ms.
[2021-05-09 00:21:05] [INFO ] Added : 168 causal constraints over 36 iterations in 1090 ms. Result :sat
Minimization took 358 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 88900 steps, including 692 resets, run finished after 480 ms. (steps per millisecond=185 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions, 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 5 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 223 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2021-05-09 00:21:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:06] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 00:21:07] [INFO ] Dead Transitions using invariants and state equation in 838 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:07] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 7040 ms. (steps per millisecond=142 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000006 steps, including 671 resets, run finished after 2767 ms. (steps per millisecond=361 ) properties (out of 1) seen :10
[2021-05-09 00:21:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:17] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:17] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-09 00:21:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:21:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 00:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:17] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-09 00:21:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 74 ms returned sat
[2021-05-09 00:21:18] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 68 ms.
[2021-05-09 00:21:19] [INFO ] Added : 168 causal constraints over 34 iterations in 1242 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 95300 steps, including 719 resets, run finished after 497 ms. (steps per millisecond=191 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 189 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 173 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-09 00:21:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:20] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:20] [INFO ] Implicit Places using invariants in 320 ms returned []
[2021-05-09 00:21:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:20] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:21:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:24] [INFO ] Implicit Places using invariants and state equation in 3477 ms returned []
Implicit Place search using SMT with State Equation took 3812 ms to find 0 implicit places.
[2021-05-09 00:21:24] [INFO ] Redundant transitions in 98 ms returned []
[2021-05-09 00:21:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:24] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:21:25] [INFO ] Dead Transitions using invariants and state equation in 817 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-03 in 21105 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-06
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:21:25] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :10
[2021-05-09 00:21:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:21:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 00:21:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 00:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:25] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-09 00:21:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:25] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2021-05-09 00:21:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:21:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:25] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-09 00:21:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 82 ms returned sat
[2021-05-09 00:21:25] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2021-05-09 00:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2021-05-09 00:21:26] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 58 ms.
[2021-05-09 00:21:28] [INFO ] Added : 168 causal constraints over 35 iterations in 2757 ms. Result :sat
Minimization took 331 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 190800 steps, including 1077 resets, run finished after 1222 ms. (steps per millisecond=156 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions, 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 3 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 153 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2021-05-09 00:21:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:30] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:31] [INFO ] Dead Transitions using invariants and state equation in 710 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:31] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6951 ms. (steps per millisecond=143 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 3175 ms. (steps per millisecond=314 ) properties (out of 1) seen :10
[2021-05-09 00:21:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:41] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:41] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:41] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-09 00:21:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:41] [INFO ] [Real]Added 22 Read/Feed constraints in 25 ms returned sat
[2021-05-09 00:21:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:21:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:41] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-09 00:21:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 54 ms returned sat
[2021-05-09 00:21:42] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 0 ms to minimize.
[2021-05-09 00:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2021-05-09 00:21:42] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 76 ms.
[2021-05-09 00:21:44] [INFO ] Added : 166 causal constraints over 34 iterations in 2617 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 97600 steps, including 868 resets, run finished after 513 ms. (steps per millisecond=190 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 206 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 193 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-09 00:21:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:45] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:21:46] [INFO ] Implicit Places using invariants in 407 ms returned []
[2021-05-09 00:21:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:21:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:47] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2021-05-09 00:21:47] [INFO ] Redundant transitions in 84 ms returned []
[2021-05-09 00:21:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:47] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:48] [INFO ] Dead Transitions using invariants and state equation in 775 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-06 in 23200 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-12
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:21:48] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :10
[2021-05-09 00:21:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2021-05-09 00:21:48] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:21:48] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:48] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-09 00:21:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:21:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:21:48] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 00:21:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:21:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 58 ms returned sat
[2021-05-09 00:21:49] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2021-05-09 00:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2021-05-09 00:21:49] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 49 ms.
[2021-05-09 00:21:50] [INFO ] Added : 168 causal constraints over 36 iterations in 1135 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 88900 steps, including 715 resets, run finished after 372 ms. (steps per millisecond=238 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions, 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 17 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 204 ms. Remains 183 /184 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2021-05-09 00:21:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:51] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 00:21:52] [INFO ] Dead Transitions using invariants and state equation in 946 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/184 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:21:52] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6357 ms. (steps per millisecond=157 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 672 resets, run finished after 2254 ms. (steps per millisecond=443 ) properties (out of 1) seen :10
[2021-05-09 00:22:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:22:00] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:22:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 00:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:22:00] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-09 00:22:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 00:22:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 00:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 00:22:01] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-09 00:22:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:22:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 61 ms returned sat
[2021-05-09 00:22:01] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 68 ms.
[2021-05-09 00:22:02] [INFO ] Added : 168 causal constraints over 34 iterations in 1035 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 95300 steps, including 724 resets, run finished after 475 ms. (steps per millisecond=200 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 171 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 160 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-09 00:22:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:22:03] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 00:22:03] [INFO ] Implicit Places using invariants in 388 ms returned []
[2021-05-09 00:22:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:22:03] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 00:22:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-09 00:22:07] [INFO ] Implicit Places using invariants and state equation in 3470 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
[2021-05-09 00:22:07] [INFO ] Redundant transitions in 96 ms returned []
[2021-05-09 00:22:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-09 00:22:07] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 00:22:07] [INFO ] Dead Transitions using invariants and state equation in 757 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-12 in 19575 ms.
[2021-05-09 00:22:08] [INFO ] Flatten gal took : 168 ms
[2021-05-09 00:22:08] [INFO ] Applying decomposition
[2021-05-09 00:22:08] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8771406788177000679.txt, -o, /tmp/graph8771406788177000679.bin, -w, /tmp/graph8771406788177000679.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8771406788177000679.bin, -l, -1, -v, -w, /tmp/graph8771406788177000679.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 00:22:08] [INFO ] Decomposing Gal with order
[2021-05-09 00:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 00:22:09] [INFO ] Removed a total of 4249 redundant transitions.
[2021-05-09 00:22:10] [INFO ] Flatten gal took : 1047 ms
[2021-05-09 00:22:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 535 labels/synchronizations in 37 ms.
[2021-05-09 00:22:10] [INFO ] Time to serialize gal into /tmp/UpperBounds9497193040997275593.gal : 4 ms
[2021-05-09 00:22:10] [INFO ] Time to serialize properties into /tmp/UpperBounds17568726068696708972.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9497193040997275593.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17568726068696708972.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9497193040997275593.gal -t CGAL -reachable-file /tmp/UpperBounds17568726068696708972.prop --nowitness
Loading property file /tmp/UpperBounds17568726068696708972.prop.
Detected timeout of ITS tools.
[2021-05-09 00:43:05] [INFO ] Applying decomposition
[2021-05-09 00:43:05] [INFO ] Flatten gal took : 120 ms
[2021-05-09 00:43:05] [INFO ] Decomposing Gal with order
[2021-05-09 00:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 00:43:06] [INFO ] Removed a total of 11232 redundant transitions.
[2021-05-09 00:43:06] [INFO ] Flatten gal took : 351 ms
[2021-05-09 00:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 61 ms.
[2021-05-09 00:43:06] [INFO ] Time to serialize gal into /tmp/UpperBounds5221072175511132517.gal : 31 ms
[2021-05-09 00:43:06] [INFO ] Time to serialize properties into /tmp/UpperBounds1307844078385009217.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5221072175511132517.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1307844078385009217.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5221072175511132517.gal -t CGAL -reachable-file /tmp/UpperBounds1307844078385009217.prop --nowitness
Loading property file /tmp/UpperBounds1307844078385009217.prop.
Detected timeout of ITS tools.
[2021-05-09 01:04:01] [INFO ] Flatten gal took : 65 ms
[2021-05-09 01:04:01] [INFO ] Input system was already deterministic with 2108 transitions.
[2021-05-09 01:04:02] [INFO ] Transformed 184 places.
[2021-05-09 01:04:02] [INFO ] Transformed 2108 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 01:04:02] [INFO ] Time to serialize gal into /tmp/UpperBounds16935469705799079437.gal : 19 ms
[2021-05-09 01:04:02] [INFO ] Time to serialize properties into /tmp/UpperBounds6411371748937303068.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16935469705799079437.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6411371748937303068.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16935469705799079437.gal -t CGAL -reachable-file /tmp/UpperBounds6411371748937303068.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6411371748937303068.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-V80P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V80P20N10, 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 r026-tajo-162038143400115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 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 '
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 ;