About the Execution of ITS-Tools 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.r096-smll-165260575900245.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 itstools
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 r096-smll-165260575900245
=====================================================================
--------------------
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 1652697607603
Running Version 202205111006
[2022-05-16 10:40:10] [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-16 10:40:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:40:10] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-16 10:40:10] [INFO ] Transformed 33 places.
[2022-05-16 10:40:10] [INFO ] Transformed 22 transitions.
[2022-05-16 10:40:10] [INFO ] Parsed PT model containing 33 places and 22 transitions in 391 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 119 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 10:40:10] [INFO ] Computed 12 place invariants in 14 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 10017 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :2246
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 :712
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :719
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :736
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 :753
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 :723
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :1120
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 :740
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 :719
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :1121
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :737
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 10:40:11] [INFO ] Computed 12 place invariants in 15 ms
[2022-05-16 10:40:11] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2022-05-16 10:40:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-16 10:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-16 10:40:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-16 10:40:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 602 ms returned sat
[2022-05-16 10:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:16] [INFO ] [Nat]Absence check using state equation in 4331 ms returned unknown
[2022-05-16 10:40:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:16] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:16] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 10:40:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 152 ms returned sat
[2022-05-16 10:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:21] [INFO ] [Nat]Absence check using state equation in 4826 ms returned unknown
[2022-05-16 10:40:21] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:40:21] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 10:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:21] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-16 10:40:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:40:21] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2022-05-16 10:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:26] [INFO ] [Nat]Absence check using state equation in 4959 ms returned unknown
[2022-05-16 10:40:26] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-16 10:40:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 10:40:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2022-05-16 10:40:28] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1708 ms returned sat
[2022-05-16 10:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:31] [INFO ] [Nat]Absence check using state equation in 3246 ms returned unknown
[2022-05-16 10:40:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:40:31] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 10:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-16 10:40:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:40:32] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-16 10:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:37] [INFO ] [Nat]Absence check using state equation in 4964 ms returned unknown
[2022-05-16 10:40:37] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 10:40:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2022-05-16 10:40:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:37] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-16 10:40:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 16 ms returned sat
[2022-05-16 10:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:42] [INFO ] [Nat]Absence check using state equation in 4959 ms returned unknown
[2022-05-16 10:40:42] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:42] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 10:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:42] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 10:40:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:42] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 38 ms returned sat
[2022-05-16 10:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:45] [INFO ] [Nat]Absence check using state equation in 3143 ms returned sat
[2022-05-16 10:40:45] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 10:40:45] [INFO ] Added : 13 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 22 ms.
[2022-05-16 10:40:45] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:45] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-16 10:40:45] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:45] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:40:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 10:40:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 10:40:47] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1352 ms returned sat
[2022-05-16 10:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:47] [INFO ] [Nat]Absence check using state equation in 650 ms returned unsat
Current structural bounds on expressions (after SMT) : [8, 1300, 200, 200, 200, 400, 200, 8, 300, 10] Max seen :[1, 402, 8, 10, 8, 400, 8, 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
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 9 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 0 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 1 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 62 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-16 10:40:47] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 10:40:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/33 places, 16/22 transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-16 10:40:47] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000133 steps, including 776 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 7) seen :442
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 7) seen :434
Incomplete Best-First random walk after 1000000 steps, including 326 resets, run finished after 747 ms. (steps per millisecond=1338 ) properties (out of 7) seen :416
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 7) seen :421
Incomplete Best-First random walk after 1000001 steps, including 159 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 7) seen :435
Incomplete Best-First random walk after 1000000 steps, including 166 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 7) seen :415
Incomplete Best-First random walk after 1000000 steps, including 164 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 7) seen :415
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 7) seen :431
// Phase 1: matrix 16 rows 26 cols
[2022-05-16 10:40:53] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 10:40:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 20 ms returned unsat
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 10:40:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 151 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned unsat
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 10:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:40:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 10:40:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:40:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:40:54] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1153 ms returned sat
[2022-05-16 10:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:00] [INFO ] [Nat]Absence check using state equation in 6034 ms returned unknown
[2022-05-16 10:41:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:00] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 10:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 10:41:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:01] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 158 ms returned sat
[2022-05-16 10:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:07] [INFO ] [Nat]Absence check using state equation in 6022 ms returned unknown
[2022-05-16 10:41:07] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-16 10:41:07] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:07] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 10:41:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 20 ms returned sat
[2022-05-16 10:41:10] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3044 ms returned sat
[2022-05-16 10:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:11] [INFO ] [Nat]Absence check using state equation in 1236 ms returned unsat
[2022-05-16 10:41:11] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:41:11] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 10:41:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:41:12] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1313 ms returned sat
[2022-05-16 10:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:18] [INFO ] [Nat]Absence check using state equation in 6058 ms returned unknown
[2022-05-16 10:41:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:18] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 10:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 10:41:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:41:19] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 407, 200, 200, 10, 200, 2] Max seen :[2, 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-01 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 2 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-16 10:41:19] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000055 steps, including 776 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 3) seen :30
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 3) seen :12
Incomplete Best-First random walk after 1000001 steps, including 158 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 3) seen :22
Incomplete Best-First random walk after 1000000 steps, including 164 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 3) seen :12
// Phase 1: matrix 16 rows 26 cols
[2022-05-16 10:41:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 10:41:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:41:21] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 10:41:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:41:22] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1069 ms returned sat
[2022-05-16 10:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:28] [INFO ] [Nat]Absence check using state equation in 6046 ms returned unknown
[2022-05-16 10:41:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:28] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 10:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:28] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 10:41:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:28] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 266 ms returned sat
[2022-05-16 10:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:34] [INFO ] [Nat]Absence check using state equation in 6049 ms returned unknown
[2022-05-16 10:41:34] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 10:41:34] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 10:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 10:41:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:41:35] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 888 ms returned sat
[2022-05-16 10:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:41] [INFO ] [Nat]Absence check using state equation in 6030 ms returned unknown
Current structural bounds on expressions (after SMT) : [200, 200, 200] Max seen :[10, 10, 10]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, 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-16 10:41:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 10:41:41] [INFO ] Implicit Places using invariants in 42 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 24/26 places, 16/16 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global 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 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 15
Applied a total of 2 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 23 cols
[2022-05-16 10:41:41] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 10:41:41] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2022-05-16 10:41:41] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 10:41:42] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 164 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 21/26 places, 15/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 21/26 places, 15/16 transitions.
// Phase 1: matrix 15 rows 21 cols
[2022-05-16 10:41:42] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000008 steps, including 1129 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 3) seen :30
Incomplete Best-First random walk after 1000000 steps, including 289 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 3) seen :12
Incomplete Best-First random walk after 1000001 steps, including 280 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 1000001 steps, including 293 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 3) seen :12
// Phase 1: matrix 15 rows 21 cols
[2022-05-16 10:41:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:41:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 10:41:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:43] [INFO ] [Nat]Absence check using state equation in 38 ms returned unsat
[2022-05-16 10:41:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 10:41:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 10:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:44] [INFO ] [Nat]Absence check using state equation in 194 ms returned unsat
[2022-05-16 10:41:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-16 10:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:44] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 10:41:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:41:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 10:41:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-16 10:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:41:44] [INFO ] [Nat]Absence check using state equation in 75 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 10] Max seen :[10, 10, 10]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-07 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-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 94009 ms.
BK_STOP 1652697704407
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-C0100N0000000100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r096-smll-165260575900245"
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 ;