About the Execution of ITS-Tools for ClientsAndServers-PT-N1000P0
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r045-oct2-162038291700243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 ClientsAndServers-PT-N1000P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.1K May 5 16:51 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 ClientsAndServers-PT-N1000P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620571026349
Running Version 0
[2021-05-09 14:37:07] [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]
[2021-05-09 14:37:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:37:07] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-09 14:37:07] [INFO ] Transformed 25 places.
[2021-05-09 14:37:07] [INFO ] Transformed 18 transitions.
[2021-05-09 14:37:07] [INFO ] Parsed PT model containing 25 places and 18 transitions in 49 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:37:07] [INFO ] Computed 8 place invariants in 5 ms
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-14 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-04 3000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 16004 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1778 ) properties (out of 13) seen :32000
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-13 8000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-10 8000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-02 8000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-00 8000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :137
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :492
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :129
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :93
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :113
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :227
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :468
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:37:07] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-09 14:37:08] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-09 14:37:08] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:37:08] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:37:08] [INFO ] Added : 13 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Added : 12 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 14:37:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:08] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [2000, 2000, 2000, 2000, 4000, 2000, 2000, 8000, 2000] Max seen :[164, 164, 21, 14, 36, 21, 111, 22, 164]
Incomplete Parikh walk after 800000 steps, including 99 resets, run finished after 458 ms. (steps per millisecond=1746 ) properties (out of 9) seen :6184 could not realise parikh vector
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10200000 steps, including 160 resets, run finished after 6542 ms. (steps per millisecond=1559 ) properties (out of 6) seen :12597 could not realise parikh vector
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-07 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1000000 steps, including 99 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 2600000 steps, including 99 resets, run finished after 1294 ms. (steps per millisecond=2009 ) properties (out of 3) seen :6000 could not realise parikh vector
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 3600000 steps, including 99 resets, run finished after 1669 ms. (steps per millisecond=2156 ) properties (out of 1) seen :420 could not realise parikh vector
Incomplete Parikh walk after 2800000 steps, including 99 resets, run finished after 1381 ms. (steps per millisecond=2027 ) properties (out of 1) seen :2000 could not realise parikh vector
Incomplete Parikh walk after 2600000 steps, including 99 resets, run finished after 1241 ms. (steps per millisecond=2095 ) properties (out of 1) seen :2000 could not realise parikh vector
Incomplete Parikh walk after 800000 steps, including 99 resets, run finished after 286 ms. (steps per millisecond=2797 ) properties (out of 1) seen :1 could not realise parikh vector
Incomplete Parikh walk after 600300 steps, including 99 resets, run finished after 223 ms. (steps per millisecond=2691 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
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 19 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 11 transition count 7
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 11 transition count 4
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 5 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 2 transition count 2
Applied a total of 39 rules in 20 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-09 14:37:22] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000129 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11495 ) properties (out of 1) seen :8000
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-11 8000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1620571042359
--------------------
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="ClientsAndServers-PT-N1000P0"
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 ClientsAndServers-PT-N1000P0, 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 r045-oct2-162038291700243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 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 ;