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.r028-tall-165251935900001.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 gold2021
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 r028-tall-165251935900001
=====================================================================

--------------------
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 1652537293817

Running Version 0
[2022-05-14 14:08:15] [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:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:08:15] [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.
[2022-05-14 14:08:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:08:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 650 ms
[2022-05-14 14:08:16] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-14 14:08:16] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 3 ms.
[2022-05-14 14:08:16] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_10512286927644209173.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
[2022-05-14 14:08:16] [INFO ] Computed 4 place invariants in 9 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
[2022-05-14 14:08:16] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 5 ms.
[2022-05-14 14:08:16] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:08:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-14 14:08:16] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:08:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:08:16] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-14 14:08:16] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:08:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:08:16] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:08:16] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:08:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-14 14:08:16] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 4, 4, 1, 4]
[2022-05-14 14:08:16] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 2 ms.
[2022-05-14 14:08:16] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_15528602513354917449.dot
Incomplete random walk after 10000 steps, including 229 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :4
[2022-05-14 14:08:16] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2022-05-14 14:08:16] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-14 14:08:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-14 14:08:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:17] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:17] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 3 ms to minimize.
[2022-05-14 14:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-05-14 14:08:17] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:17] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2022-05-14 14:08:17] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2022-05-14 14:08:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 39 ms
[2022-05-14 14:08:17] [INFO ] Added : 21 causal constraints over 6 iterations in 81 ms. Result :sat
Minimization took 22 ms.
[2022-05-14 14:08:17] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:17] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:17] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 2 ms to minimize.
[2022-05-14 14:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-14 14:08:17] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-14 14:08:17] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2022-05-14 14:08:17] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2022-05-14 14:08:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2022-05-14 14:08:17] [INFO ] Added : 21 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Incomplete Parikh walk after 7100 steps, including 931 resets, run finished after 15 ms. (steps per millisecond=473 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7100 steps, including 927 resets, run finished after 11 ms. (steps per millisecond=645 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, 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 1 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 14 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2022-05-14 14:08:17] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:17] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
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:17] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25606 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11493 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11487 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 2) seen :4
[2022-05-14 14:08:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:19] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-14 14:08:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-14 14:08:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:19] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:19] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 12 ms.
[2022-05-14 14:08:19] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2022-05-14 14:08:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-14 14:08:19] [INFO ] Added : 22 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 18 ms.
[2022-05-14 14:08:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-14 14:08:19] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:19] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-14 14:08:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2022-05-14 14:08:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-14 14:08:19] [INFO ] Added : 22 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Incomplete Parikh walk after 1400 steps, including 171 resets, run finished after 5 ms. (steps per millisecond=280 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 170 resets, run finished after 5 ms. (steps per millisecond=280 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 7 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, 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.
[2022-05-14 14:08:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-14 14:08:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:19] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
[2022-05-14 14:08:19] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-14 14:08:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 23/25 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:19] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-14 14:08:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:19] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-14 14:08:19] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
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:19] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25609 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11497 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 11489 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 2) seen :4
[2022-05-14 14:08:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:08:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:08:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-14 14:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-14 14:08:21] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:21] [INFO ] Added : 19 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2022-05-14 14:08:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:21] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] Deduced a trap composed of 5 places in 8 ms of which 0 ms to minimize.
[2022-05-14 14:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2022-05-14 14:08:21] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 2 ms.
[2022-05-14 14:08:21] [INFO ] Added : 19 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Incomplete Parikh walk after 1600 steps, including 178 resets, run finished after 5 ms. (steps per millisecond=320 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 1600 steps, including 182 resets, run finished after 5 ms. (steps per millisecond=320 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, 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, 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:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-14 14:08:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-14 14:08:21] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-14 14:08:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
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:21] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 255 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2022-05-14 14:08:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 0 ms returned sat
[2022-05-14 14:08:21] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2022-05-14 14:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2022-05-14 14:08:21] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:21] [INFO ] Added : 19 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 1600 steps, including 178 resets, run finished after 5 ms. (steps per millisecond=320 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 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.
[2022-05-14 14:08:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
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:21] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 25605 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11488 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :2
[2022-05-14 14:08:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2022-05-14 14:08:22] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 2 ms to minimize.
[2022-05-14 14:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-14 14:08:22] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-14 14:08:22] [INFO ] Added : 19 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 1600 steps, including 178 resets, run finished after 6 ms. (steps per millisecond=266 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, 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.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions, 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:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-14 14:08:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-14 14:08:22] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-14 14:08:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 in 1379 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:22] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 255 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2022-05-14 14:08:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:08:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:22] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-14 14:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-14 14:08:22] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-14 14:08:22] [INFO ] Added : 19 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 1600 steps, including 180 resets, run finished after 5 ms. (steps per millisecond=320 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, 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:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:22] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:08:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
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:22] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 25608 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11493 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 1) seen :2
[2022-05-14 14:08:23] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-14 14:08:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:23] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-14 14:08:23] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2022-05-14 14:08:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-14 14:08:23] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:23] [INFO ] Added : 19 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Incomplete Parikh walk after 1600 steps, including 181 resets, run finished after 6 ms. (steps per millisecond=266 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, 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, 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:23] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-14 14:08:23] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-14 14:08:24] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-14 14:08:24] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2022-05-14 14:08:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:24] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 in 1400 ms.
[2022-05-14 14:08:24] [INFO ] Flatten gal took : 25 ms
[2022-05-14 14:08:24] [INFO ] Applying decomposition
[2022-05-14 14:08:24] [INFO ] Flatten gal took : 7 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/graph9379550282237964575.txt, -o, /tmp/graph9379550282237964575.bin, -w, /tmp/graph9379550282237964575.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/graph9379550282237964575.bin, -l, -1, -v, -w, /tmp/graph9379550282237964575.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 14:08:24] [INFO ] Decomposing Gal with order
[2022-05-14 14:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:08:24] [INFO ] Removed a total of 79 redundant transitions.
[2022-05-14 14:08:24] [INFO ] Flatten gal took : 22 ms
[2022-05-14 14:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2022-05-14 14:08:24] [INFO ] Time to serialize gal into /tmp/UpperBounds9675118423015700476.gal : 2 ms
[2022-05-14 14:08:24] [INFO ] Time to serialize properties into /tmp/UpperBounds8720350032193550046.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/UpperBounds9675118423015700476.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8720350032193550046.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/UpperBounds9675118423015700476.gal -t CGAL -reachable-file /tmp/UpperBounds8720350032193550046.prop --nowitness
Loading property file /tmp/UpperBounds8720350032193550046.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.03788,4928,140,84,2558,335,105,2544,45,1152,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.039161,4928,1,0,2558,335,144,2544,62,1152,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.039299,4928,1,0,2558,335,144,2544,62,1152,104

BK_STOP 1652537305385

--------------------
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-V04P05N02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
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 r028-tall-165251935900001"
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 ;