About the Execution of 2022-gold for GPPP-PT-C0100N0000010000
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-167838876300109.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-C0100N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876300109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:42 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 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:45 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-C0100N0000010000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678575573610
Running Version 202205111006
[2023-03-11 22:59:34] [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:59:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 22:59:35] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-11 22:59:35] [INFO ] Transformed 33 places.
[2023-03-11 22:59:35] [INFO ] Transformed 22 transitions.
[2023-03-11 22:59:35] [INFO ] Parsed PT model containing 33 places and 22 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:59:35] [INFO ] Computed 12 place invariants in 10 ms
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-12 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-01 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10635 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=759 ) properties (out of 12) seen :43437
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-10 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :42504
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :41707
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :41837
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :41819
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :42383
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :41839
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :42513
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :41870
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :42516
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :41706
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:59:35] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 22:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-11 22:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 640 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2023-03-11 22:59:36] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-11 22:59:36] [INFO ] Added : 17 causal constraints over 4 iterations in 85 ms. Result :sat
Minimization took 36 ms.
[2023-03-11 22:59:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-11 22:59:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned unsat
[2023-03-11 22:59:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-11 22:59:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 791 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:38] [INFO ] [Nat]Absence check using state equation in 333 ms returned unsat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-11 22:59:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:38] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-11 22:59:38] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 22:59:38] [INFO ] Added : 11 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 17 ms.
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 22:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 22:59:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:39] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 768 ms returned sat
[2023-03-11 22:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:43] [INFO ] [Nat]Absence check using state equation in 4220 ms returned unknown
[2023-03-11 22:59:43] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2023-03-11 22:59:43] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 22:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:43] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-11 22:59:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:44] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1133 ms returned sat
[2023-03-11 22:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:44] [INFO ] [Nat]Absence check using state equation in 48 ms returned unsat
[2023-03-11 22:59:44] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 22:59:44] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-11 22:59:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:45] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [400, 41400, 10, 10, 300, 450, 300, 700, 1104, 400] Max seen :[400, 40000, 10, 10, 300, 3, 300, 10, 1104, 400]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-15 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-14 1104 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-11 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-05 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-00 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 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 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 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 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 8 place count 28 transition count 17
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 11 place count 26 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 25 transition count 15
Applied a total of 13 rules in 44 ms. Remains 25 /33 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 25 cols
[2023-03-11 22:59:45] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 22:59:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/33 places, 15/22 transitions.
// Phase 1: matrix 15 rows 25 cols
[2023-03-11 22:59:45] [INFO ] Computed 10 place invariants in 4 ms
Incomplete random walk after 1000034 steps, including 789 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 3) seen :40014
Incomplete Best-First random walk after 1000000 steps, including 333 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 3) seen :40009
Incomplete Best-First random walk after 1000001 steps, including 166 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 3) seen :40006
Incomplete Best-First random walk after 1000000 steps, including 166 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 3) seen :40013
// Phase 1: matrix 15 rows 25 cols
[2023-03-11 22:59:46] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 22:59:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-11 22:59:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 22:59:52] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6005 ms returned unknown
[2023-03-11 22:59:52] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 22:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned unsat
[2023-03-11 22:59:52] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 22:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:53] [INFO ] [Nat]Absence check using state equation in 56 ms returned unsat
Current structural bounds on expressions (after SMT) : [41400, 4, 10] Max seen :[40007, 4, 10]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25/25 places, 15/15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 14
Applied a total of 2 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 14/15 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 14/15 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 22:59:53] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000057 steps, including 793 resets, run finished after 254 ms. (steps per millisecond=3937 ) properties (out of 1) seen :40000
Incomplete Best-First random walk after 1000001 steps, including 335 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties (out of 1) seen :40007
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 22:59:53] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 22:59:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:53] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:53] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 22:59:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-11 22:59:53] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 22:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:53] [INFO ] [Nat]Absence check using state equation in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : [40007] Max seen :[40007]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-02 40007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18985 ms.
BK_STOP 1678575593875
--------------------
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-C0100N0000010000"
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-C0100N0000010000, 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-167838876300109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 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 ;