fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251917900005
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
540.768 11050.00 18368.00 72.50 1 2 1 1 4 2 4 1 5 1 1 4 5 1 5 5 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251917900005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251917900005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 8.7K Apr 29 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 21:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 21:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K May 10 09:33 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-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652537279981

Running Version 202205111006
[2022-05-14 14:08:01] [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]
[2022-05-14 14:08:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:08:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-14 14:08:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:08:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2022-05-14 14:08:01] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-14 14:08:02] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2022-05-14 14:08:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:08:02] [INFO ] Computed 4 place invariants in 6 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:08:02] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-14 14:08:02] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 5 ms.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:08:02] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:08:02] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:08:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:08:02] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 14:08:02] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:08:02] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:08:02] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 4, 4, 1, 4]
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 14:08:02] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 13 ms.
[2022-05-14 14:08:02] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :14
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :4
[2022-05-14 14:08:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2022-05-14 14:08:02] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using 7 positive place invariants in 26 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-14 14:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-14 14:08:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:03] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 3 ms to minimize.
[2022-05-14 14:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-14 14:08:03] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 11 ms.
[2022-05-14 14:08:03] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2022-05-14 14:08:03] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2022-05-14 14:08:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2022-05-14 14:08:03] [INFO ] Added : 16 causal constraints over 5 iterations in 116 ms. Result :sat
Minimization took 36 ms.
[2022-05-14 14:08:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 14:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-14 14:08:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:03] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-14 14:08:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:03] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2022-05-14 14:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-05-14 14:08:03] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-14 14:08:03] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-05-14 14:08:03] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-05-14 14:08:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-05-14 14:08:03] [INFO ] Added : 16 causal constraints over 5 iterations in 108 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 12 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2022-05-14 14:08:03] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/28 places, 51/52 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:03] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25612 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11493 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11480 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 2) seen :4
[2022-05-14 14:08:05] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:08:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-14 14:08:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:05] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:05] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2022-05-14 14:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-14 14:08:05] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:05] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2022-05-14 14:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-14 14:08:05] [INFO ] Added : 14 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 12 ms.
[2022-05-14 14:08:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:05] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:05] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-05-14 14:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-14 14:08:05] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 5 ms.
[2022-05-14 14:08:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2022-05-14 14:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-14 14:08:05] [INFO ] Added : 14 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 51/51 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-14 14:08:05] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-14 14:08:05] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 115 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 23/25 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:05] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25608 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11477 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11485 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 2) seen :4
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 2 ms.
[2022-05-14 14:08:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2022-05-14 14:08:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-14 14:08:07] [INFO ] Added : 17 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 10 ms.
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 2 ms.
[2022-05-14 14:08:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-05-14 14:08:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-14 14:08:07] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:08:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-14 14:08:07] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-01
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 256 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:08:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 2 ms.
[2022-05-14 14:08:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2022-05-14 14:08:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-14 14:08:07] [INFO ] Added : 17 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:07] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25608 resets, run finished after 655 ms. (steps per millisecond=1526 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 11491 resets, run finished after 364 ms. (steps per millisecond=2747 ) properties (out of 1) seen :2
[2022-05-14 14:08:08] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:08] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 6 ms.
[2022-05-14 14:08:08] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2022-05-14 14:08:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-14 14:08:08] [INFO ] Added : 17 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-14 14:08:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-14 14:08:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-14 14:08:09] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-14 14:08:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 in 1460 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-05
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 256 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2022-05-14 14:08:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2022-05-14 14:08:09] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:09] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2022-05-14 14:08:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-14 14:08:09] [INFO ] Added : 17 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-14 14:08:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:09] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 25606 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 11484 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 1) seen :2
[2022-05-14 14:08:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:10] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 2 ms.
[2022-05-14 14:08:10] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2022-05-14 14:08:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-14 14:08:10] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-14 14:08:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-14 14:08:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-14 14:08:10] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-14 14:08:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 in 1448 ms.
[2022-05-14 14:08:10] [INFO ] Flatten gal took : 21 ms
[2022-05-14 14:08:10] [INFO ] Applying decomposition
[2022-05-14 14:08:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6018955527094846814.txt' '-o' '/tmp/graph6018955527094846814.bin' '-w' '/tmp/graph6018955527094846814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6018955527094846814.bin' '-l' '-1' '-v' '-w' '/tmp/graph6018955527094846814.weights' '-q' '0' '-e' '0.001'
[2022-05-14 14:08:10] [INFO ] Decomposing Gal with order
[2022-05-14 14:08:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:08:10] [INFO ] Removed a total of 79 redundant transitions.
[2022-05-14 14:08:10] [INFO ] Flatten gal took : 42 ms
[2022-05-14 14:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2022-05-14 14:08:10] [INFO ] Time to serialize gal into /tmp/UpperBounds1843695697325364695.gal : 4 ms
[2022-05-14 14:08:10] [INFO ] Time to serialize properties into /tmp/UpperBounds16220513340355314956.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1843695697325364695.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16220513340355314956.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds16220513340355314956.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2246,0.033769,4600,140,84,2465,330,105,2339,45,1124,0
Total reachable state count : 2246

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 :0 <= u2.SUR_PONT_A_0 <= 2
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V04P05N02-UpperBounds-01,0,0.03494,4600,1,0,2465,330,144,2339,62,1124,104
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 :0 <= u2.SUR_PONT_A_0 <= 2
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V04P05N02-UpperBounds-05,0,0.035008,4600,1,0,2465,330,144,2339,62,1124,104
Total runtime 9729 ms.

BK_STOP 1652537291031

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-V04P05N02"
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-V04P05N02, 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 r024-tall-165251917900005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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