About the Execution of 2021-gold 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.r179-tall-165277027200352.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is QuasiCertifProtocol-COL-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027200352
=====================================================================
--------------------
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 1652842223146
Running Version 0
[2022-05-18 02:50:24] [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-18 02:50:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:50:24] [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.
[2022-05-18 02:50:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 02:50:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2022-05-18 02:50:25] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 02:50:25] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 4 ms.
[2022-05-18 02:50:25] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6446651291076510504.dot
// Phase 1: matrix 26 rows 30 cols
[2022-05-18 02:50:25] [INFO ] Computed 5 place invariants in 15 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
[2022-05-18 02:50:25] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions in 53 ms.
[2022-05-18 02:50:25] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 26 rows 30 cols
[2022-05-18 02:50:25] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-18 02:50:25] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-18 02:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 02:50:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-18 02:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 02:50:26] [INFO ] Added : 12 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-18 02:50:26] [INFO ] Added : 10 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:50:26] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 02:50:26] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:50:26] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:50:26] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 02:50:26] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:50:26] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 02:50:26] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:50:26] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 02:50:26] [INFO ] Added : 10 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:50:26] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:50:26] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:50:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:50:26] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:50:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:50:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:50:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:50:27] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1, 29, 29, 29, -1, 1, -1, -1, 1, -1, 1, 29, 29, -1]
[2022-05-18 02:50:27] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions in 28 ms.
[2022-05-18 02:50:27] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_8863735807974351820.dot
Incomplete random walk after 10000 steps, including 302 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 14) seen :22
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 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :20
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :27
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 173 ms. (steps per millisecond=57 ) 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 :18
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 13) seen :16
// Phase 1: matrix 446 rows 2998 cols
[2022-05-18 02:50:28] [INFO ] Computed 2553 place invariants in 155 ms
[2022-05-18 02:50:28] [INFO ] [Real]Absence check using 4 positive place invariants in 32 ms returned sat
[2022-05-18 02:50:29] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 490 ms returned sat
[2022-05-18 02:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:30] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2022-05-18 02:50:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2022-05-18 02:50:31] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 447 ms returned sat
[2022-05-18 02:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:32] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2022-05-18 02:50:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 44 ms.
[2022-05-18 02:50:34] [INFO ] Added : 134 causal constraints over 27 iterations in 2131 ms. Result :sat
Minimization took 181 ms.
[2022-05-18 02:50:35] [INFO ] [Real]Absence check using 4 positive place invariants in 29 ms returned sat
[2022-05-18 02:50:35] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 533 ms returned sat
[2022-05-18 02:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:40] [INFO ] [Real]Absence check using state equation in 4179 ms returned unknown
[2022-05-18 02:50:40] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:50:40] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 508 ms returned sat
[2022-05-18 02:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:45] [INFO ] [Real]Absence check using state equation in 4187 ms returned unknown
[2022-05-18 02:50:45] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-18 02:50:45] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 523 ms returned sat
[2022-05-18 02:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:47] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2022-05-18 02:50:47] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2022-05-18 02:50:49] [INFO ] Added : 119 causal constraints over 24 iterations in 2104 ms. Result :sat
Minimization took 185 ms.
[2022-05-18 02:50:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-18 02:50:50] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 557 ms returned sat
[2022-05-18 02:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:51] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2022-05-18 02:50:51] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2022-05-18 02:50:53] [INFO ] Added : 119 causal constraints over 24 iterations in 1944 ms. Result :sat
Minimization took 163 ms.
[2022-05-18 02:50:54] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2022-05-18 02:50:54] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 513 ms returned sat
[2022-05-18 02:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:56] [INFO ] [Real]Absence check using state equation in 1641 ms returned sat
[2022-05-18 02:50:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:50:57] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 487 ms returned sat
[2022-05-18 02:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:58] [INFO ] [Nat]Absence check using state equation in 1683 ms returned sat
[2022-05-18 02:50:58] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2022-05-18 02:50:59] [INFO ] Added : 60 causal constraints over 12 iterations in 980 ms. Result :sat
Minimization took 232 ms.
[2022-05-18 02:51:00] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:51:00] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 468 ms returned sat
[2022-05-18 02:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:02] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2022-05-18 02:51:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:51:02] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 456 ms returned sat
[2022-05-18 02:51:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:04] [INFO ] [Nat]Absence check using state equation in 1293 ms returned sat
[2022-05-18 02:51:04] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 60 ms.
[2022-05-18 02:51:04] [INFO ] Added : 30 causal constraints over 6 iterations in 550 ms. Result :sat
Minimization took 152 ms.
[2022-05-18 02:51:05] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2022-05-18 02:51:05] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 483 ms returned sat
[2022-05-18 02:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:07] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2022-05-18 02:51:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:51:08] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 486 ms returned sat
[2022-05-18 02:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:09] [INFO ] [Nat]Absence check using state equation in 1488 ms returned sat
[2022-05-18 02:51:09] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2022-05-18 02:51:10] [INFO ] Added : 31 causal constraints over 7 iterations in 617 ms. Result :sat
Minimization took 219 ms.
[2022-05-18 02:51:10] [INFO ] [Real]Absence check using 4 positive place invariants in 29 ms returned sat
[2022-05-18 02:51:11] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 459 ms returned sat
[2022-05-18 02:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:14] [INFO ] [Real]Absence check using state equation in 3140 ms returned sat
[2022-05-18 02:51:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2022-05-18 02:51:15] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 470 ms returned sat
[2022-05-18 02:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 3335 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 29 ms.
[2022-05-18 02:51:21] [INFO ] Deduced a trap composed of 6 places in 1885 ms of which 32 ms to minimize.
[2022-05-18 02:51:21] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 02:51:21] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-18 02:51:22] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 511 ms returned sat
[2022-05-18 02:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:23] [INFO ] [Real]Absence check using state equation in 1388 ms returned sat
[2022-05-18 02:51:23] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2022-05-18 02:51:26] [INFO ] Added : 134 causal constraints over 27 iterations in 2390 ms. Result :sat
Minimization took 174 ms.
[2022-05-18 02:51:26] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2022-05-18 02:51:27] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 612 ms returned sat
[2022-05-18 02:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:29] [INFO ] [Real]Absence check using state equation in 1917 ms returned sat
[2022-05-18 02:51:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:51:30] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 622 ms returned sat
[2022-05-18 02:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:32] [INFO ] [Nat]Absence check using state equation in 1899 ms returned sat
[2022-05-18 02:51:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2022-05-18 02:51:33] [INFO ] Added : 120 causal constraints over 24 iterations in 1769 ms. Result :sat
Minimization took 319 ms.
[2022-05-18 02:51:34] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2022-05-18 02:51:35] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 479 ms returned sat
[2022-05-18 02:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:38] [INFO ] [Real]Absence check using state equation in 3857 ms returned sat
[2022-05-18 02:51:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 26 ms returned sat
[2022-05-18 02:51:39] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 465 ms returned sat
[2022-05-18 02:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:44] [INFO ] [Nat]Absence check using state equation in 4260 ms returned unknown
[2022-05-18 02:51:44] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-18 02:51:44] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 493 ms returned sat
[2022-05-18 02:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:48] [INFO ] [Real]Absence check using state equation in 3885 ms returned sat
[2022-05-18 02:51:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:51:49] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 499 ms returned sat
[2022-05-18 02:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:53] [INFO ] [Nat]Absence check using state equation in 3827 ms returned sat
[2022-05-18 02:51:53] [INFO ] Deduced a trap composed of 9 places in 503 ms of which 2 ms to minimize.
[2022-05-18 02:51:53] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 02:51:54] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2022-05-18 02:51:54] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 599 ms returned sat
[2022-05-18 02:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:56] [INFO ] [Real]Absence check using state equation in 1754 ms returned sat
[2022-05-18 02:51:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2022-05-18 02:51:57] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 560 ms returned sat
[2022-05-18 02:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:59] [INFO ] [Nat]Absence check using state equation in 1977 ms returned sat
[2022-05-18 02:51:59] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2022-05-18 02:52:03] [INFO ] Deduced a trap composed of 6 places in 1823 ms of which 4 ms to minimize.
[2022-05-18 02:52:03] [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 12
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
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, 27, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 12100 steps, including 119 resets, run finished after 594 ms. (steps per millisecond=20 ) properties (out of 13) seen :1018 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-14 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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
Incomplete Parikh walk after 3200 steps, including 95 resets, run finished after 124 ms. (steps per millisecond=25 ) properties (out of 7) seen :29 could not realise parikh vector
Incomplete Parikh walk after 3200 steps, including 95 resets, run finished after 114 ms. (steps per millisecond=28 ) properties (out of 7) seen :30 could not realise parikh vector
Incomplete Parikh walk after 6200 steps, including 98 resets, run finished after 225 ms. (steps per millisecond=27 ) properties (out of 7) seen :58 could not realise parikh vector
Incomplete Parikh walk after 15300 steps, including 134 resets, run finished after 799 ms. (steps per millisecond=19 ) properties (out of 7) seen :1798 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15500 steps, including 156 resets, run finished after 791 ms. (steps per millisecond=19 ) properties (out of 6) seen :1450 could not realise parikh vector
Support contains 1798 out of 2998 places. Attempting structural reductions.
Starting structural reductions, 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.25 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 178 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-18 02:52:06] [INFO ] Computed 1769 place invariants in 9 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 10415 ms. (steps per millisecond=96 ) 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.
BK_STOP 1652842339549
--------------------
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="QuasiCertifProtocol-COL-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is 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 r179-tall-165277027200352"
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 ;