About the Execution of ITS-Tools for QuasiCertifProtocol-COL-28
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.r168-tall-165277017400941.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 QuasiCertifProtocol-COL-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400941
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 7.7K Apr 30 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 120K 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 QuasiCertifProtocol-COL-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652989065077
Running Version 202205111006
[2022-05-19 19:37:46] [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-19 19:37:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:37:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 19:37:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 19:37:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 687 ms
[2022-05-19 19:37:47] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2022-05-19 19:37:47] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2022-05-19 19:37:47] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 19:37:47] [INFO ] Computed 5 place invariants in 7 ms
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-10 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 19:37:47] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 19:37:47] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 19:37:47] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 8 ms.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 19:37:47] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 19:37:47] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 19:37:47] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 19:37:47] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 19:37:47] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:47] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 19:37:47] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 19:37:48] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 19:37:48] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 19:37:48] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 19:37:48] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 19:37:48] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 19:37:48] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 19:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-19 19:37:48] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 19:37:48] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, 29, 29, 29, -1, 1, -1, -1, 1, -1, 1, 29, 29, -1]
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2022-05-19 19:37:48] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 37 ms.
[2022-05-19 19:37:48] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :23
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :28
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :17
// Phase 1: matrix 446 rows 2998 cols
[2022-05-19 19:37:49] [INFO ] Computed 2553 place invariants in 106 ms
[2022-05-19 19:37:50] [INFO ] [Real]Absence check using 4 positive place invariants in 43 ms returned sat
[2022-05-19 19:37:50] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 470 ms returned sat
[2022-05-19 19:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:51] [INFO ] [Real]Absence check using state equation in 1326 ms returned sat
[2022-05-19 19:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:37:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 29 ms returned sat
[2022-05-19 19:37:52] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 509 ms returned sat
[2022-05-19 19:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:37:54] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2022-05-19 19:37:54] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 46 ms.
[2022-05-19 19:37:56] [INFO ] Added : 134 causal constraints over 27 iterations in 2009 ms. Result :sat
Minimization took 163 ms.
[2022-05-19 19:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-19 19:37:57] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 541 ms returned sat
[2022-05-19 19:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:01] [INFO ] [Real]Absence check using state equation in 4175 ms returned unknown
[2022-05-19 19:38:01] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:38:02] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 479 ms returned sat
[2022-05-19 19:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:06] [INFO ] [Real]Absence check using state equation in 4147 ms returned unknown
[2022-05-19 19:38:06] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-19 19:38:07] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 549 ms returned sat
[2022-05-19 19:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:08] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2022-05-19 19:38:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 41 ms.
[2022-05-19 19:38:10] [INFO ] Added : 119 causal constraints over 24 iterations in 2006 ms. Result :sat
Minimization took 188 ms.
[2022-05-19 19:38:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-19 19:38:11] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 546 ms returned sat
[2022-05-19 19:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:13] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2022-05-19 19:38:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 46 ms.
[2022-05-19 19:38:14] [INFO ] Added : 119 causal constraints over 24 iterations in 1843 ms. Result :sat
Minimization took 144 ms.
[2022-05-19 19:38:15] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2022-05-19 19:38:15] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 468 ms returned sat
[2022-05-19 19:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:17] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2022-05-19 19:38:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-19 19:38:18] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 475 ms returned sat
[2022-05-19 19:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:20] [INFO ] [Nat]Absence check using state equation in 1690 ms returned sat
[2022-05-19 19:38:20] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2022-05-19 19:38:21] [INFO ] Added : 60 causal constraints over 12 iterations in 971 ms. Result :sat
Minimization took 219 ms.
[2022-05-19 19:38:21] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2022-05-19 19:38:22] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 526 ms returned sat
[2022-05-19 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:23] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2022-05-19 19:38:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:38:24] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 442 ms returned sat
[2022-05-19 19:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:25] [INFO ] [Nat]Absence check using state equation in 1388 ms returned sat
[2022-05-19 19:38:25] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 40 ms.
[2022-05-19 19:38:26] [INFO ] Added : 30 causal constraints over 6 iterations in 543 ms. Result :sat
Minimization took 154 ms.
[2022-05-19 19:38:26] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-05-19 19:38:27] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 444 ms returned sat
[2022-05-19 19:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:28] [INFO ] [Real]Absence check using state equation in 1447 ms returned sat
[2022-05-19 19:38:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2022-05-19 19:38:29] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 517 ms returned sat
[2022-05-19 19:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:31] [INFO ] [Nat]Absence check using state equation in 1576 ms returned sat
[2022-05-19 19:38:31] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2022-05-19 19:38:31] [INFO ] Added : 29 causal constraints over 6 iterations in 544 ms. Result :sat
Minimization took 194 ms.
[2022-05-19 19:38:32] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-05-19 19:38:32] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 503 ms returned sat
[2022-05-19 19:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:36] [INFO ] [Real]Absence check using state equation in 3337 ms returned sat
[2022-05-19 19:38:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2022-05-19 19:38:37] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 511 ms returned sat
[2022-05-19 19:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:40] [INFO ] [Nat]Absence check using state equation in 3546 ms returned sat
[2022-05-19 19:38:40] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2022-05-19 19:38:43] [INFO ] Deduced a trap composed of 6 places in 1853 ms of which 16 ms to minimize.
[2022-05-19 19:38:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 19:38:43] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:38:43] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 499 ms returned sat
[2022-05-19 19:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:45] [INFO ] [Real]Absence check using state equation in 1310 ms returned sat
[2022-05-19 19:38:45] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2022-05-19 19:38:47] [INFO ] Added : 134 causal constraints over 27 iterations in 2304 ms. Result :sat
Minimization took 203 ms.
[2022-05-19 19:38:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:38:48] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 510 ms returned sat
[2022-05-19 19:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:50] [INFO ] [Nat]Absence check using state equation in 1350 ms returned sat
[2022-05-19 19:38:50] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2022-05-19 19:38:52] [INFO ] Added : 134 causal constraints over 27 iterations in 2082 ms. Result :sat
Minimization took 169 ms.
[2022-05-19 19:38:52] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:38:53] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 617 ms returned sat
[2022-05-19 19:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:55] [INFO ] [Real]Absence check using state equation in 1994 ms returned sat
[2022-05-19 19:38:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:38:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2022-05-19 19:38:56] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 648 ms returned sat
[2022-05-19 19:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:38:58] [INFO ] [Nat]Absence check using state equation in 2167 ms returned sat
[2022-05-19 19:38:58] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2022-05-19 19:39:02] [INFO ] Deduced a trap composed of 6 places in 1888 ms of which 5 ms to minimize.
[2022-05-19 19:39:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 19:39:02] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2022-05-19 19:39:03] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 504 ms returned sat
[2022-05-19 19:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:39:07] [INFO ] [Real]Absence check using state equation in 3844 ms returned sat
[2022-05-19 19:39:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:39:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:39:07] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 497 ms returned sat
[2022-05-19 19:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:39:11] [INFO ] [Nat]Absence check using state equation in 3952 ms returned sat
[2022-05-19 19:39:12] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 1 ms to minimize.
[2022-05-19 19:39:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 19:39:12] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2022-05-19 19:39:13] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 511 ms returned sat
[2022-05-19 19:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:39:17] [INFO ] [Real]Absence check using state equation in 4098 ms returned sat
[2022-05-19 19:39:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:39:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-19 19:39:18] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 504 ms returned sat
[2022-05-19 19:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:39:22] [INFO ] [Nat]Absence check using state equation in 4093 ms returned sat
[2022-05-19 19:39:22] [INFO ] Deduced a trap composed of 9 places in 478 ms of which 3 ms to minimize.
[2022-05-19 19:39:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 19:39:23] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-05-19 19:39:23] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 594 ms returned sat
[2022-05-19 19:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:39:25] [INFO ] [Real]Absence check using state equation in 2181 ms returned sat
[2022-05-19 19:39:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:39:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 32 ms returned sat
[2022-05-19 19:39:26] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 609 ms returned sat
[2022-05-19 19:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:39:29] [INFO ] [Nat]Absence check using state equation in 2460 ms returned sat
[2022-05-19 19:39:29] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2022-05-19 19:39:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 29, 29, 29, 2147483647, 1, 2147483647, 2147483647, 1, 2147483647, 29, 29, 2147483647] Max seen :[0, 0, 0, 0, 0, 0, 28, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-13 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-14 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1798 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2064 are kept as prefixes of interest. Removing 934 places using SCC suffix rule.17 ms
Discarding 934 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Drop transitions removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 2006 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 239 place count 2005 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 2004 transition count 206
Ensure Unique test removed 29 places
Iterating post reduction 2 with 29 rules applied. Total rules applied 269 place count 1975 transition count 206
Applied a total of 269 rules in 157 ms. Remains 1975 /2998 variables (removed 1023) and now considering 206/446 (removed 240) transitions.
Finished structural reductions, in 1 iterations. Remains : 1975/2998 places, 206/446 transitions.
// Phase 1: matrix 206 rows 1975 cols
[2022-05-19 19:39:33] [INFO ] Computed 1769 place invariants in 13 ms
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-15 841 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-11 841 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-08 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 4830 resets, run finished after 9793 ms. (steps per millisecond=102 ) properties (out of 1) seen :29
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-02 29 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 117353 ms.
BK_STOP 1652989183637
--------------------
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="QuasiCertifProtocol-COL-28"
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 QuasiCertifProtocol-COL-28, 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 r168-tall-165277017400941"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;