About the Execution of 2021-gold for GPPP-PT-C0100N0000100000
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.r107-smll-165260580400100.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 GPPP-PT-C0100N0000100000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580400100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.3K Apr 29 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 18:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:34 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:34 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-C0100N0000100000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652646426187
Running Version 0
[2022-05-15 20:27:09] [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-15 20:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:27:09] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2022-05-15 20:27:09] [INFO ] Transformed 33 places.
[2022-05-15 20:27:09] [INFO ] Transformed 22 transitions.
[2022-05-15 20:27:09] [INFO ] Parsed PT model containing 33 places and 22 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:27:09] [INFO ] Computed 12 place invariants in 10 ms
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-06 200000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-01 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10498 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=552 ) properties (out of 14) seen :3034
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-04 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-02 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :1032
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :1033
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1025
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :1045
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1035
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :1001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :1011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :1001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :1311
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :1042
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :1109
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:27:09] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-15 20:27:10] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2022-05-15 20:27:10] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:10] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-15 20:27:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-15 20:27:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2449 ms returned sat
[2022-05-15 20:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:14] [INFO ] [Nat]Absence check using state equation in 2301 ms returned sat
[2022-05-15 20:27:14] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 20:27:15] [INFO ] Added : 17 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 48 ms.
[2022-05-15 20:27:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:27:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:15] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-15 20:27:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:27:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2427 ms returned sat
[2022-05-15 20:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:19] [INFO ] [Nat]Absence check using state equation in 1940 ms returned sat
[2022-05-15 20:27:19] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 20:27:19] [INFO ] Added : 17 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 214 ms.
[2022-05-15 20:27:19] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:27:19] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-15 20:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 20:27:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:19] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-15 20:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:20] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-15 20:27:20] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 20:27:20] [INFO ] Added : 10 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 17 ms.
[2022-05-15 20:27:20] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:27:20] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-15 20:27:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:27:20] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 640 ms returned sat
[2022-05-15 20:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:23] [INFO ] [Nat]Absence check using state equation in 2612 ms returned sat
[2022-05-15 20:27:23] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 20:27:23] [INFO ] Added : 18 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 30 ms.
[2022-05-15 20:27:23] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:27:23] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 20:27:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:23] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:27] [INFO ] [Nat]Absence check using state equation in 3717 ms returned sat
[2022-05-15 20:27:27] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 20:27:27] [INFO ] Added : 18 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 1188 ms.
[2022-05-15 20:27:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:28] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:27:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:28] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:27:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:27:28] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 226 ms returned sat
[2022-05-15 20:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:33] [INFO ] [Nat]Absence check using state equation in 4760 ms returned unknown
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 20:27:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:33] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 20:27:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 20:27:38] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4988 ms returned unknown
[2022-05-15 20:27:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:27:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 20:27:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:39] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 418 ms returned sat
[2022-05-15 20:27:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:40] [INFO ] [Nat]Absence check using state equation in 1660 ms returned unsat
Current structural bounds on expressions (after SMT) : [700, 700, 450, 3500, 600, 300, 8, 400, 300, 700, 398] Max seen :[7, 7, 3, 7, 1, 300, 1, 400, 300, 10, 398]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-15 398 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-13 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-11 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-09 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 103100 steps, including 98 resets, run finished after 211 ms. (steps per millisecond=488 ) properties (out of 7) seen :27 could not realise parikh vector
Incomplete Parikh walk after 80900 steps, including 98 resets, run finished after 211 ms. (steps per millisecond=383 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 126700 steps, including 99 resets, run finished after 184 ms. (steps per millisecond=688 ) properties (out of 7) seen :38 could not realise parikh vector
Incomplete Parikh walk after 122700 steps, including 99 resets, run finished after 199 ms. (steps per millisecond=616 ) properties (out of 7) seen :26 could not realise parikh vector
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions, 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 5 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 1 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 30 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:27:41] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 20:27:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/33 places, 14/22 transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:27:41] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000040 steps, including 793 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 7) seen :47
Incomplete Best-First random walk after 1000000 steps, including 167 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 7) seen :35
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 7) seen :41
Incomplete Best-First random walk after 1000001 steps, including 166 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 7) seen :41
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 7) seen :26
Incomplete Best-First random walk after 1000001 steps, including 166 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties (out of 7) seen :40
Incomplete Best-First random walk after 1000000 steps, including 201 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 7) seen :29
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:27:45] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-15 20:27:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 20:27:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:45] [INFO ] [Nat]Absence check using state equation in 54 ms returned unsat
[2022-05-15 20:27:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:45] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 20:27:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using state equation in 6009 ms returned unknown
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:27:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using state equation in 69 ms returned unsat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-15 20:27:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned unsat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:27:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned unsat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:27:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-05-15 20:27:52] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned unsat
[2022-05-15 20:27:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:27:52] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:27:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:27:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:27:52] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:27:58] [INFO ] [Nat]Absence check using state equation in 6909 ms returned unknown
Current structural bounds on expressions (after SMT) : [10, 700, 4, 10, 1, 2, 700] Max seen :[10, 10, 4, 10, 1, 2, 10]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 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.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:27:58] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000092 steps, including 793 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 201 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 2) seen :11
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:28:00] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 20:28:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:28:00] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 20:28:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:28:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:28:00] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:06] [INFO ] [Nat]Absence check using state equation in 6016 ms returned unknown
[2022-05-15 20:28:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:28:06] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:28:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:28:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:28:06] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:28:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:13] [INFO ] [Nat]Absence check using state equation in 6368 ms returned unsat
Current structural bounds on expressions (after SMT) : [700, 10] Max seen :[10, 10]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 3 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.
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:28:13] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000023 steps, including 793 resets, run finished after 296 ms. (steps per millisecond=3378 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 1) seen :10
// Phase 1: matrix 14 rows 24 cols
[2022-05-15 20:28:13] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 20:28:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 20:28:13] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 20:28:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:28:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:28:14] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:19] [INFO ] [Nat]Absence check using state equation in 5749 ms returned sat
[2022-05-15 20:28:19] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 20:28:19] [INFO ] Added : 12 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 3019 ms.
Current structural bounds on expressions (after SMT) : [700] Max seen :[10]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 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, 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
[2022-05-15 20:28:22] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 20:28:22] [INFO ] Implicit Places using invariants in 42 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
[2022-05-15 20:28:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2022-05-15 20:28:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:28:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 14/14 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 12
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 6 place count 17 transition count 11
Applied a total of 6 rules in 7 ms. Remains 17 /20 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 17 cols
[2022-05-15 20:28:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 20:28:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 11 rows 17 cols
[2022-05-15 20:28:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 20:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:28:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 58 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/24 places, 11/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-15 20:28:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2022-05-15 20:28:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 20:28:23] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/24 places, 11/14 transitions.
// Phase 1: matrix 11 rows 16 cols
[2022-05-15 20:28:23] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000194 steps, including 1187 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 303 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 1) seen :10
// Phase 1: matrix 11 rows 16 cols
[2022-05-15 20:28:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 20:28:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:28:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-15 20:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 20:28:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:28:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 20:28:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 48 ms returned sat
[2022-05-15 20:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:28:26] [INFO ] [Nat]Absence check using state equation in 2086 ms returned unsat
Current structural bounds on expressions (after SMT) : [10] Max seen :[10]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652646507310
--------------------
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="GPPP-PT-C0100N0000100000"
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 GPPP-PT-C0100N0000100000, 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 r107-smll-165260580400100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;