About the Execution of 2021-gold for GPPP-PT-C0100N0000000100
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-165260580400091.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-C0100N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580400091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 7.5K Apr 29 18:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 18:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652646211350
Running Version 0
[2022-05-15 20:23: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]
[2022-05-15 20:23:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:23:34] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2022-05-15 20:23:34] [INFO ] Transformed 33 places.
[2022-05-15 20:23:34] [INFO ] Transformed 22 transitions.
[2022-05-15 20:23:34] [INFO ] Parsed PT model containing 33 places and 22 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:23:34] [INFO ] Computed 12 place invariants in 13 ms
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10030 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 13) seen :2243
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-09 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :723
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :719
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :731
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :731
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :729
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :1120
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :731
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :720
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :1120
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :748
// Phase 1: matrix 22 rows 33 cols
[2022-05-15 20:23:35] [INFO ] Computed 12 place invariants in 15 ms
[2022-05-15 20:23:35] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2022-05-15 20:23:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-15 20:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:35] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-15 20:23:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2022-05-15 20:23:35] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned unsat
[2022-05-15 20:23:35] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-15 20:23:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-15 20:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:35] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-15 20:23:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-15 20:23:38] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2187 ms returned sat
[2022-05-15 20:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:38] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2022-05-15 20:23:38] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-15 20:23:38] [INFO ] Added : 20 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 88 ms.
[2022-05-15 20:23:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-15 20:23:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-15 20:23:39] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 799 ms returned sat
[2022-05-15 20:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:41] [INFO ] [Nat]Absence check using state equation in 2277 ms returned sat
[2022-05-15 20:23:41] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 20:23:41] [INFO ] Added : 19 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 122 ms.
[2022-05-15 20:23:41] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:41] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-15 20:23:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:44] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3020 ms returned sat
[2022-05-15 20:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:45] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2022-05-15 20:23:45] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 20:23:45] [INFO ] Added : 19 causal constraints over 4 iterations in 85 ms. Result :sat
Minimization took 88 ms.
[2022-05-15 20:23:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:45] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 20:23:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-15 20:23:48] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2615 ms returned sat
[2022-05-15 20:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:50] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2022-05-15 20:23:50] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 20:23:50] [INFO ] Added : 19 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 45 ms.
[2022-05-15 20:23:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:23:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2022-05-15 20:23:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 20:23:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 20:23:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 558 ms returned sat
[2022-05-15 20:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:55] [INFO ] [Nat]Absence check using state equation in 4429 ms returned unknown
[2022-05-15 20:23:55] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-15 20:23:55] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-15 20:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:23:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:55] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 79 ms returned sat
[2022-05-15 20:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:56] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2022-05-15 20:23:56] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 20:23:56] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 38 ms.
[2022-05-15 20:23:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2022-05-15 20:23:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:23:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-15 20:23:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 20:23:57] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1441 ms returned sat
[2022-05-15 20:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:59] [INFO ] [Nat]Absence check using state equation in 1976 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1300, 200, 200, 200, 400, 200, 8, 300, 10] Max seen :[2, 404, 7, 9, 7, 400, 7, 1, 300, 10]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-14 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-06 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 170800 steps, including 99 resets, run finished after 360 ms. (steps per millisecond=474 ) properties (out of 6) seen :402 could not realise parikh vector
Incomplete Parikh walk after 269100 steps, including 99 resets, run finished after 407 ms. (steps per millisecond=661 ) properties (out of 6) seen :423 could not realise parikh vector
Incomplete Parikh walk after 215700 steps, including 99 resets, run finished after 320 ms. (steps per millisecond=674 ) properties (out of 6) seen :446 could not realise parikh vector
Incomplete Parikh walk after 273900 steps, including 99 resets, run finished after 394 ms. (steps per millisecond=695 ) properties (out of 6) seen :428 could not realise parikh vector
Incomplete Parikh walk after 7100 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=507 ) properties (out of 6) seen :436 could not realise parikh vector
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 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 0 with 3 rules applied. Total rules applied 9 place count 27 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 26 transition count 16
Applied a total of 11 rules in 39 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-15 20:24:01] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 20:24:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/33 places, 16/22 transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-15 20:24:01] [INFO ] Computed 10 place invariants in 8 ms
Incomplete random walk after 1000105 steps, including 776 resets, run finished after 577 ms. (steps per millisecond=1733 ) properties (out of 6) seen :440
Incomplete Best-First random walk after 1000000 steps, including 326 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 6) seen :415
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 6) seen :420
Incomplete Best-First random walk after 1000001 steps, including 159 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 6) seen :431
Incomplete Best-First random walk after 1000000 steps, including 166 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 6) seen :414
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 613 ms. (steps per millisecond=1631 ) properties (out of 6) seen :414
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 6) seen :430
// Phase 1: matrix 16 rows 26 cols
[2022-05-15 20:24:05] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 20:24:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:05] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 20:24:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:05] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 375 ms returned sat
[2022-05-15 20:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned unsat
[2022-05-15 20:24:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:05] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:24:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:07] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1640 ms returned sat
[2022-05-15 20:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:13] [INFO ] [Nat]Absence check using state equation in 6034 ms returned unknown
[2022-05-15 20:24:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:13] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-15 20:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:13] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 20:24:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 20:24:13] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 295 ms returned sat
[2022-05-15 20:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using state equation in 3952 ms returned unsat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 20:24:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 384 ms returned sat
[2022-05-15 20:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:20] [INFO ] [Nat]Absence check using state equation in 2284 ms returned unsat
[2022-05-15 20:24:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:20] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-15 20:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:24:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:22] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1837 ms returned sat
[2022-05-15 20:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:28] [INFO ] [Nat]Absence check using state equation in 6030 ms returned unknown
[2022-05-15 20:24:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:28] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-15 20:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 20:24:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:28] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [407, 200, 10, 10, 200, 2] Max seen :[407, 10, 10, 10, 10, 2]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-01 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 16/16 transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-15 20:24:28] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000013 steps, including 776 resets, run finished after 291 ms. (steps per millisecond=3436 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 2) seen :11
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 2) seen :11
// Phase 1: matrix 16 rows 26 cols
[2022-05-15 20:24:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 20:24:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:31] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1858 ms returned sat
[2022-05-15 20:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:37] [INFO ] [Nat]Absence check using state equation in 6033 ms returned unknown
[2022-05-15 20:24:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:37] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:37] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 20:24:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:39] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1821 ms returned sat
[2022-05-15 20:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:45] [INFO ] [Nat]Absence check using state equation in 6030 ms returned unknown
Current structural bounds on expressions (after SMT) : [200, 200] Max seen :[10, 10]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 16/16 transitions.
Starting structural reductions, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-15 20:24:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 20:24:45] [INFO ] Implicit Places using invariants in 35 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
[2022-05-15 20:24:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2022-05-15 20:24:45] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 20:24:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 24/26 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 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 4 place count 22 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 22 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 21 transition count 13
Applied a total of 6 rules in 4 ms. Remains 21 /24 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 21 cols
[2022-05-15 20:24:45] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 20:24:45] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 13 rows 21 cols
[2022-05-15 20:24:45] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 20:24:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 71 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 19/26 places, 13/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2022-05-15 20:24:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2022-05-15 20:24:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:24:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/26 places, 13/16 transitions.
// Phase 1: matrix 13 rows 19 cols
[2022-05-15 20:24:45] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000158 steps, including 1160 resets, run finished after 281 ms. (steps per millisecond=3559 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 294 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 2) seen :11
Incomplete Best-First random walk after 1000001 steps, including 298 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 2) seen :11
// Phase 1: matrix 13 rows 19 cols
[2022-05-15 20:24:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:24:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-15 20:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 20:24:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 20:24:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 20:24:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3188 ms returned sat
[2022-05-15 20:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:53] [INFO ] [Nat]Absence check using state equation in 3562 ms returned unsat
[2022-05-15 20:24:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-15 20:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-15 20:24:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:24:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2906 ms returned sat
[2022-05-15 20:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:02] [INFO ] [Nat]Absence check using state equation in 6035 ms returned unknown
Current structural bounds on expressions (after SMT) : [10, 200] Max seen :[10, 10]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19/19 places, 13/13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 12
Applied a total of 2 rules in 8 ms. Remains 18 /19 variables (removed 1) and now considering 12/13 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/19 places, 12/13 transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:02] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000029 steps, including 1176 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 301 resets, run finished after 577 ms. (steps per millisecond=1733 ) properties (out of 1) seen :10
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:03] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 20:25:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:25:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-15 20:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 20:25:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:25:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 20:25:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-05-15 20:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:09] [INFO ] [Nat]Absence check using state equation in 6136 ms returned unknown
Current structural bounds on expressions (after SMT) : [200] Max seen :[10]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:25:09] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:25:10] [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.
[2022-05-15 20:25:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:25:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting property specific reduction for GPPP-PT-C0100N0000000100-UpperBounds-07
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:10] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 10051 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=2512 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :10
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:10] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 20:25:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:25:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-15 20:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-15 20:25:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:25:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:25:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-05-15 20:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:15] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
Current structural bounds on expressions (after SMT) : [787] Max seen :[10]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:25:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:15] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 1176 resets, run finished after 276 ms. (steps per millisecond=3623 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 301 resets, run finished after 338 ms. (steps per millisecond=2958 ) properties (out of 1) seen :10
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:25:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-15 20:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-15 20:25:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:25:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-05-15 20:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:25:21] [INFO ] [Nat]Absence check using state equation in 6082 ms returned unknown
Current structural bounds on expressions (after SMT) : [787] Max seen :[10]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 20:25:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 20:25:21] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-15 20:25:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-15 20:25:21] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 20:25:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Ending property specific reduction for GPPP-PT-C0100N0000000100-UpperBounds-07 in 11905 ms.
[2022-05-15 20:25:22] [INFO ] Flatten gal took : 27 ms
[2022-05-15 20:25:22] [INFO ] Applying decomposition
[2022-05-15 20:25:22] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3166249607873590417.txt, -o, /tmp/graph3166249607873590417.bin, -w, /tmp/graph3166249607873590417.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3166249607873590417.bin, -l, -1, -v, -w, /tmp/graph3166249607873590417.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-15 20:25:22] [INFO ] Decomposing Gal with order
[2022-05-15 20:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:25:22] [INFO ] Removed a total of 3 redundant transitions.
[2022-05-15 20:25:22] [INFO ] Flatten gal took : 35 ms
[2022-05-15 20:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 20:25:22] [INFO ] Time to serialize gal into /tmp/UpperBounds7150128842185134967.gal : 2 ms
[2022-05-15 20:25:22] [INFO ] Time to serialize properties into /tmp/UpperBounds1966662984729772822.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7150128842185134967.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1966662984729772822.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7150128842185134967.gal -t CGAL -reachable-file /tmp/UpperBounds1966662984729772822.prop --nowitness
Loading property file /tmp/UpperBounds1966662984729772822.prop.
Detected timeout of ITS tools.
[2022-05-15 20:45:57] [INFO ] Flatten gal took : 4 ms
[2022-05-15 20:45:57] [INFO ] Time to serialize gal into /tmp/UpperBounds14935942421319125266.gal : 8 ms
[2022-05-15 20:45:57] [INFO ] Time to serialize properties into /tmp/UpperBounds3560088928446722449.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14935942421319125266.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3560088928446722449.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14935942421319125266.gal -t CGAL -reachable-file /tmp/UpperBounds3560088928446722449.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3560088928446722449.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,4.34447e+07,10.7381,164456,2,231737,5,873455,6,0,91,778075,0
Total reachable state count : 43444723
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property GPPP-PT-C0100N0000000100-UpperBounds-07 :0 <= _3PG <= 10
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-07 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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-C0100N0000000100-UpperBounds-07,0,10.7649,164456,1,0,7,873455,9,1,127,778075,4
BK_STOP 1652647569633
--------------------
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-C0100N0000000100"
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-C0100N0000000100, 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-165260580400091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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 ;