About the Execution of ITS-Tools for GPPP-PT-C0100N0000100000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576000269.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-C0100N0000100000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576000269
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.3K Apr 29 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 18:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:34 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652706662126
Running Version 202205111006
[2022-05-16 13:11:04] [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 13:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:11:04] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-16 13:11:04] [INFO ] Transformed 33 places.
[2022-05-16 13:11:04] [INFO ] Transformed 22 transitions.
[2022-05-16 13:11:04] [INFO ] Parsed PT model containing 33 places and 22 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 13:11:04] [INFO ] Computed 12 place invariants in 18 ms
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-06 200000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-01 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10223 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=538 ) properties (out of 14) seen :3040
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-04 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-02 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :1029
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :1036
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1027
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :1036
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1032
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :1001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1010
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :1317
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :1030
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :1107
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 13:11:04] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-16 13:11:04] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2022-05-16 13:11:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-16 13:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-16 13:11:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 306 ms returned sat
[2022-05-16 13:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:10] [INFO ] [Nat]Absence check using state equation in 4638 ms returned unknown
[2022-05-16 13:11:10] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:10] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 13:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:11:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 13:11:10] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 176 ms returned sat
[2022-05-16 13:11:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:14] [INFO ] [Nat]Absence check using state equation in 3773 ms returned sat
[2022-05-16 13:11:14] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 13:11:14] [INFO ] Added : 18 causal constraints over 6 iterations in 162 ms. Result :sat
Minimization took 837 ms.
[2022-05-16 13:11:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 13:11:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:15] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2022-05-16 13:11:15] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 13:11:15] [INFO ] Added : 13 causal constraints over 3 iterations in 178 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 13:11:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:15] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 13:11:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 200 ms returned sat
[2022-05-16 13:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:16] [INFO ] [Nat]Absence check using state equation in 361 ms returned unsat
[2022-05-16 13:11:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:16] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 13:11:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:11:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 13:11:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 13:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using state equation in 1919 ms returned unsat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 13:11:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 13:11:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 13:11:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 253 ms returned sat
[2022-05-16 13:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:19] [INFO ] [Nat]Absence check using state equation in 133 ms returned unsat
[2022-05-16 13:11:19] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 13:11:19] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-16 13:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:19] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-16 13:11:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 13:11:19] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 539 ms returned sat
[2022-05-16 13:11:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:22] [INFO ] [Nat]Absence check using state equation in 2730 ms returned sat
[2022-05-16 13:11:22] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 13:11:22] [INFO ] Added : 7 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [700, 700, 450, 10, 1, 300, 2, 400, 300, 10, 450] Max seen :[9, 9, 3, 10, 1, 300, 2, 400, 300, 10, 397]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-13 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-11 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-09 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 34 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 13:11:22] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 13:11:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/33 places, 14/22 transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 13:11:22] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000025 steps, including 793 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 4) seen :422
Incomplete Best-First random walk after 1000001 steps, including 167 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 4) seen :79
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 4) seen :83
Incomplete Best-First random walk after 1000001 steps, including 167 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 4) seen :78
Incomplete Best-First random walk after 1000001 steps, including 295 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 4) seen :410
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 13:11:25] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 13:11:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 13:11:25] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 13:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 13:11:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:11:25] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 13:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:25] [INFO ] [Nat]Absence check using state equation in 44 ms returned unsat
[2022-05-16 13:11:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:26] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 13:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 13:11:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:11:26] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-16 13:11:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:27] [INFO ] [Nat]Absence check using state equation in 1151 ms returned unsat
[2022-05-16 13:11:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:27] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 13:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:27] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 13:11:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:27] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-16 13:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:27] [INFO ] [Nat]Absence check using state equation in 352 ms returned unsat
[2022-05-16 13:11:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:27] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 13:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 13:11:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:28] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 766 ms returned sat
[2022-05-16 13:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:34] [INFO ] [Nat]Absence check using state equation in 6029 ms returned unknown
Current structural bounds on expressions (after SMT) : [10, 10, 4, 450] Max seen :[10, 10, 4, 398]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 14/14 transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 13:11:34] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000026 steps, including 793 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 1) seen :398
Incomplete Best-First random walk after 1000001 steps, including 295 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 1) seen :398
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 13:11:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 13:11:35] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 13:11:35] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 13:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:35] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 13:11:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:11:36] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 911 ms returned sat
[2022-05-16 13:11:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:42] [INFO ] [Nat]Absence check using state equation in 6034 ms returned unknown
Current structural bounds on expressions (after SMT) : [450] Max seen :[398]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 13:11:42] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 13:11:42] [INFO ] Implicit Places using invariants in 69 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 20/24 places, 14/14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 15 transition count 9
Applied a total of 10 rules in 4 ms. Remains 15 /20 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 15 cols
[2022-05-16 13:11:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 13:11:42] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 9 rows 15 cols
[2022-05-16 13:11:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 13:11:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 13:11:42] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 14/24 places, 9/14 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 14/24 places, 9/14 transitions.
// Phase 1: matrix 9 rows 14 cols
[2022-05-16 13:11:42] [INFO ] Invariants computation overflowed in 2 ms
Incomplete random walk after 1000181 steps, including 1220 resets, run finished after 348 ms. (steps per millisecond=2874 ) properties (out of 1) seen :398
Incomplete Best-First random walk after 1000001 steps, including 610 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 1) seen :398
// Phase 1: matrix 9 rows 14 cols
[2022-05-16 13:11:43] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 13:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 13:11:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:11:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [398] Max seen :[398]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-15 398 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 39483 ms.
BK_STOP 1652706703761
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000100000"
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-C0100N0000100000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260576000269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;