Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r191-tall-167838876300102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is GPPP-PT-C0001N0000100000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876300102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678575290778

Running Version 202205111006
[2023-03-11 22:54:51] [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]
[2023-03-11 22:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 22:54:52] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-11 22:54:52] [INFO ] Transformed 33 places.
[2023-03-11 22:54:52] [INFO ] Transformed 22 transitions.
[2023-03-11 22:54:52] [INFO ] Parsed PT model containing 33 places and 22 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:54:52] [INFO ] Computed 13 place invariants in 9 ms
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-09 100000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-01 200000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :400063
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :400043
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :400036
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :400052
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :400019
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :400020
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :400049
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :400054
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :400026
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :400043
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :400016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :400052
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :400051
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :400046
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:54:52] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-11 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 22:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:52] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2023-03-11 22:54:53] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-11 22:54:53] [INFO ] Added : 21 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 24 ms.
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-11 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 400007, 7, 4, 1, -1, 7, 7, 7, 4, 1, 7, 7] Max seen :[3, 400007, 7, 4, 1, 1, 7, 7, 7, 4, 1, 7, 7]
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-02 400007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
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 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 17 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 22:54:53] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 22:54:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/33 places, 14/22 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 22:54:53] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :1
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 22:54:54] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 22:54:54] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:54] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 22:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 22:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:54] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:54] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-11 22:54:54] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 22:54:54] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 22:54:54] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 22:54:54] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 2, 3, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 19/24 places, 14/14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 16 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 14 transition count 9
Applied a total of 10 rules in 8 ms. Remains 14 /19 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:54] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 22:54:54] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:54] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 22:54:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:54:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 14/24 places, 9/14 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/24 places, 9/14 transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:54] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=3355 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4166 ) properties (out of 1) seen :1
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 22:54:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 22:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-11 22:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:54:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 22:54:55] [INFO ] Added : 8 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 22:54:55] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 22:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:54:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 22:54:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 22:54:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Starting property specific reduction for GPPP-PT-C0001N0000100000-UpperBounds-06
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :1
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 22:54:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 22:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-11 22:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:54:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 22:54:55] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 22:54:55] [INFO ] Added : 8 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 22:54:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:55] [INFO ] Computed 6 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=3154 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 1) seen :1
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:56] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-11 22:54:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 22:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-11 22:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 22:54:56] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 22:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-11 22:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 22:54:56] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 22:54:56] [INFO ] Added : 8 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:56] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 22:54:56] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 22:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:54:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 22:54:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 14 cols
[2023-03-11 22:54:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 22:54:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 9/9 transitions.
Ending property specific reduction for GPPP-PT-C0001N0000100000-UpperBounds-06 in 846 ms.
[2023-03-11 22:54:56] [INFO ] Flatten gal took : 15 ms
[2023-03-11 22:54:56] [INFO ] Applying decomposition
[2023-03-11 22:54:56] [INFO ] Flatten gal took : 3 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/graph2385592180786016883.txt' '-o' '/tmp/graph2385592180786016883.bin' '-w' '/tmp/graph2385592180786016883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2385592180786016883.bin' '-l' '-1' '-v' '-w' '/tmp/graph2385592180786016883.weights' '-q' '0' '-e' '0.001'
[2023-03-11 22:54:56] [INFO ] Decomposing Gal with order
[2023-03-11 22:54:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 22:54:56] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-11 22:54:56] [INFO ] Flatten gal took : 102 ms
[2023-03-11 22:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 22:54:56] [INFO ] Time to serialize gal into /tmp/UpperBounds3751479464436933101.gal : 1 ms
[2023-03-11 22:54:56] [INFO ] Time to serialize properties into /tmp/UpperBounds3229953250352298774.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/UpperBounds3751479464436933101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3229953250352298774.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...274
Loading property file /tmp/UpperBounds3229953250352298774.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,37,0.014949,3552,138,80,427,181,68,418,46,322,0
Total reachable state count : 37

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property GPPP-PT-C0001N0000100000-UpperBounds-06 :0 <= i2.u0.E4P <= 1
FORMULA GPPP-PT-C0001N0000100000-UpperBounds-06 1 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
GPPP-PT-C0001N0000100000-UpperBounds-06,0,0.015961,3552,1,0,427,181,98,418,62,322,117
Total runtime 4694 ms.

BK_STOP 1678575296650

--------------------
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="GPPP-PT-C0001N0000100000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is GPPP-PT-C0001N0000100000, 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 r191-tall-167838876300102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000100000.tgz
mv GPPP-PT-C0001N0000100000 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 ;