About the Execution of 2021-gold for QuasiCertifProtocol-COL-32
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-165277027200355.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-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027200355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 7.3K Apr 30 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 131K 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-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652842275089
Running Version 0
[2022-05-18 02:51:16] [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:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:51:16] [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:51:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 02:51:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 663 ms
[2022-05-18 02:51:17] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 02:51:17] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 6 ms.
[2022-05-18 02:51:17] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_9772227771759451072.dot
// Phase 1: matrix 26 rows 30 cols
[2022-05-18 02:51:17] [INFO ] Computed 5 place invariants in 8 ms
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 02:51:17] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 35 ms.
[2022-05-18 02:51:17] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 26 rows 30 cols
[2022-05-18 02:51:17] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 02:51:18] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 5 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 02:51:18] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:18] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 02:51:18] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:51:18] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:18] [INFO ] Added : 12 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 02:51:18] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:18] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:51:18] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:51:18] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:18] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:18] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 02:51:18] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:51:18] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:18] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 9 ms.
[2022-05-18 02:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-18 02:51:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:19] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:51:19] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 02:51:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 02:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-18 02:51:19] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:51:19] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [1, 33, -1, 1, -1, 1, 1, 1, 1089, 33, 33, -1, 33, 19, 1]
[2022-05-18 02:51:19] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 15 ms.
[2022-05-18 02:51:19] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_15850213684080445820.dot
Incomplete random walk after 10000 steps, including 268 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 15) seen :69
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :64
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :47
// Phase 1: matrix 506 rows 3806 cols
[2022-05-18 02:51:20] [INFO ] Computed 3301 place invariants in 207 ms
[2022-05-18 02:51:20] [INFO ] [Real]Absence check using 37 positive place invariants in 88 ms returned sat
[2022-05-18 02:51:21] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 646 ms returned sat
[2022-05-18 02:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:23] [INFO ] [Real]Absence check using state equation in 2225 ms returned sat
[2022-05-18 02:51:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 82 ms returned sat
[2022-05-18 02:51:24] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 673 ms returned sat
[2022-05-18 02:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:28] [INFO ] [Nat]Absence check using state equation in 3914 ms returned unknown
[2022-05-18 02:51:28] [INFO ] [Real]Absence check using 37 positive place invariants in 79 ms returned sat
[2022-05-18 02:51:29] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 829 ms returned sat
[2022-05-18 02:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:32] [INFO ] [Real]Absence check using state equation in 2944 ms returned sat
[2022-05-18 02:51:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 77 ms returned sat
[2022-05-18 02:51:34] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 789 ms returned sat
[2022-05-18 02:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:37] [INFO ] [Nat]Absence check using state equation in 3814 ms returned unknown
[2022-05-18 02:51:38] [INFO ] [Real]Absence check using 37 positive place invariants in 68 ms returned sat
[2022-05-18 02:51:39] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 820 ms returned sat
[2022-05-18 02:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:42] [INFO ] [Real]Absence check using state equation in 3817 ms returned unknown
[2022-05-18 02:51:43] [INFO ] [Real]Absence check using 37 positive place invariants in 79 ms returned sat
[2022-05-18 02:51:44] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 787 ms returned sat
[2022-05-18 02:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:47] [INFO ] [Real]Absence check using state equation in 2845 ms returned sat
[2022-05-18 02:51:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:47] [INFO ] [Nat]Absence check using 37 positive place invariants in 69 ms returned sat
[2022-05-18 02:51:48] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 787 ms returned sat
[2022-05-18 02:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:50] [INFO ] [Nat]Absence check using state equation in 2304 ms returned sat
[2022-05-18 02:51:50] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 44 ms.
[2022-05-18 02:51:52] [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 3
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.refineWithCausalOrder(DeadlockTester.java:858)
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:52] [INFO ] [Real]Absence check using 37 positive place invariants in 69 ms returned sat
[2022-05-18 02:51:53] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 728 ms returned sat
[2022-05-18 02:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:55] [INFO ] [Real]Absence check using state equation in 2309 ms returned sat
[2022-05-18 02:51:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:51:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 79 ms returned sat
[2022-05-18 02:51:56] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 731 ms returned sat
[2022-05-18 02:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:51:58] [INFO ] [Nat]Absence check using state equation in 1894 ms returned sat
[2022-05-18 02:51:58] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 46 ms.
[2022-05-18 02:52:00] [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 4
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
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:52:01] [INFO ] [Real]Absence check using 37 positive place invariants in 83 ms returned sat
[2022-05-18 02:52:01] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 609 ms returned sat
[2022-05-18 02:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:04] [INFO ] [Real]Absence check using state equation in 2256 ms returned sat
[2022-05-18 02:52:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:52:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 67 ms returned sat
[2022-05-18 02:52:05] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 697 ms returned sat
[2022-05-18 02:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:09] [INFO ] [Nat]Absence check using state equation in 3910 ms returned unknown
[2022-05-18 02:52:09] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2022-05-18 02:52:10] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 730 ms returned sat
[2022-05-18 02:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:14] [INFO ] [Real]Absence check using state equation in 3858 ms returned unknown
[2022-05-18 02:52:14] [INFO ] [Real]Absence check using 37 positive place invariants in 69 ms returned sat
[2022-05-18 02:52:15] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 828 ms returned sat
[2022-05-18 02:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:18] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2022-05-18 02:52:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:52:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 70 ms returned sat
[2022-05-18 02:52:19] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 816 ms returned sat
[2022-05-18 02:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:22] [INFO ] [Nat]Absence check using state equation in 2793 ms returned sat
[2022-05-18 02:52:22] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 84 ms.
[2022-05-18 02:52:23] [INFO ] Added : 35 causal constraints over 7 iterations in 825 ms. Result :sat
Minimization took 99 ms.
[2022-05-18 02:52:23] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2022-05-18 02:52:24] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 792 ms returned sat
[2022-05-18 02:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:25] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2022-05-18 02:52:26] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 49 ms.
[2022-05-18 02:52:31] [INFO ] Deduced a trap composed of 6 places in 2920 ms of which 12 ms to minimize.
[2022-05-18 02:52: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: Stream close... while checking expression at index 8
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:2242)
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:52:31] [INFO ] [Real]Absence check using 37 positive place invariants in 69 ms returned sat
[2022-05-18 02:52:32] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 815 ms returned sat
[2022-05-18 02:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:34] [INFO ] [Real]Absence check using state equation in 2063 ms returned unsat
[2022-05-18 02:52:34] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2022-05-18 02:52:35] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 817 ms returned sat
[2022-05-18 02:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:39] [INFO ] [Real]Absence check using state equation in 3833 ms returned unknown
[2022-05-18 02:52:39] [INFO ] [Real]Absence check using 37 positive place invariants in 68 ms returned sat
[2022-05-18 02:52:40] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 728 ms returned sat
[2022-05-18 02:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:42] [INFO ] [Real]Absence check using state equation in 2336 ms returned sat
[2022-05-18 02:52:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:52:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 66 ms returned sat
[2022-05-18 02:52:44] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 685 ms returned sat
[2022-05-18 02:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:52:48] [INFO ] [Nat]Absence check using state equation in 3985 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 33, 2147483647, 2147483647, 1, 1, 1089, 33, 33, 33, 33, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 31, 0, 33, 0, 0]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1291 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3737 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.25 ms
Discarding 69 places :
Also discarding 0 output transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 3704 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 3703 transition count 404
Ensure Unique test removed 33 places
Iterating post reduction 1 with 33 rules applied. Total rules applied 169 place count 3670 transition count 404
Applied a total of 169 rules in 646 ms. Remains 3670 /3806 variables (removed 136) and now considering 404/506 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 3670/3806 places, 404/506 transitions.
// Phase 1: matrix 404 rows 3670 cols
[2022-05-18 02:52:48] [INFO ] Computed 3266 place invariants in 60 ms
Incomplete random walk after 1000000 steps, including 16003 resets, run finished after 24000 ms. (steps per millisecond=41 ) properties (out of 11) seen :73
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 725 resets, run finished after 2501 ms. (steps per millisecond=399 ) properties (out of 9) seen :69
Incomplete Best-First random walk after 1000001 steps, including 725 resets, run finished after 3259 ms. (steps per millisecond=306 ) properties (out of 9) seen :69
Incomplete Best-First random walk after 1000001 steps, including 691 resets, run finished after 2886 ms. (steps per millisecond=346 ) properties (out of 9) seen :72
Incomplete Best-First random walk after 1000001 steps, including 723 resets, run finished after 2774 ms. (steps per millisecond=360 ) properties (out of 9) seen :69
Incomplete Best-First random walk after 1000001 steps, including 724 resets, run finished after 2435 ms. (steps per millisecond=410 ) properties (out of 9) seen :69
Interrupted Best-First random walk after 336798 steps, including 243 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen :{2=33, 3=14, 6=21}
Incomplete Best-First random walk after 1000000 steps, including 485 resets, run finished after 2612 ms. (steps per millisecond=382 ) properties (out of 9) seen :90
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 728 resets, run finished after 2956 ms. (steps per millisecond=338 ) properties (out of 8) seen :47
// Phase 1: matrix 404 rows 3670 cols
[2022-05-18 02:53:37] [INFO ] Computed 3266 place invariants in 35 ms
[2022-05-18 02:53:38] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 712 ms returned sat
[2022-05-18 02:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:53:39] [INFO ] [Real]Absence check using state equation in 1302 ms returned sat
[2022-05-18 02:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:53:40] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 775 ms returned sat
[2022-05-18 02:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:53:42] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2022-05-18 02:53:42] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 37 ms.
[2022-05-18 02:53:43] [INFO ] Added : 34 causal constraints over 7 iterations in 770 ms. Result :sat
Minimization took 257 ms.
[2022-05-18 02:53:44] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 736 ms returned sat
[2022-05-18 02:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:53:45] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2022-05-18 02:53:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:53:46] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 743 ms returned sat
[2022-05-18 02:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:53:48] [INFO ] [Nat]Absence check using state equation in 1417 ms returned sat
[2022-05-18 02:53:48] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 35 ms.
[2022-05-18 02:53:50] [INFO ] Added : 101 causal constraints over 21 iterations in 1817 ms. Result :sat
Minimization took 1131 ms.
[2022-05-18 02:53:52] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 755 ms returned sat
[2022-05-18 02:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:53:53] [INFO ] [Real]Absence check using state equation in 1314 ms returned unsat
[2022-05-18 02:53:54] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 739 ms returned sat
[2022-05-18 02:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:53:56] [INFO ] [Real]Absence check using state equation in 2048 ms returned sat
[2022-05-18 02:53:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:53:58] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 724 ms returned sat
[2022-05-18 02:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:00] [INFO ] [Nat]Absence check using state equation in 2085 ms returned sat
[2022-05-18 02:54:00] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 56 ms.
[2022-05-18 02:54:00] [INFO ] Added : 35 causal constraints over 7 iterations in 765 ms. Result :sat
Minimization took 426 ms.
[2022-05-18 02:54:02] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 752 ms returned sat
[2022-05-18 02:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:03] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2022-05-18 02:54:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:54:04] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 714 ms returned sat
[2022-05-18 02:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:05] [INFO ] [Nat]Absence check using state equation in 1184 ms returned sat
[2022-05-18 02:54:06] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 36 ms.
[2022-05-18 02:54:08] [INFO ] Added : 134 causal constraints over 27 iterations in 2495 ms. Result :sat
Minimization took 241 ms.
[2022-05-18 02:54:10] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 897 ms returned sat
[2022-05-18 02:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:11] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2022-05-18 02:54:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:54:12] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 925 ms returned sat
[2022-05-18 02:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:13] [INFO ] [Nat]Absence check using state equation in 1276 ms returned sat
[2022-05-18 02:54:14] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 45 ms.
[2022-05-18 02:54:16] [INFO ] Added : 134 causal constraints over 27 iterations in 2373 ms. Result :sat
Minimization took 737 ms.
[2022-05-18 02:54:18] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 719 ms returned sat
[2022-05-18 02:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:19] [INFO ] [Real]Absence check using state equation in 1545 ms returned sat
[2022-05-18 02:54:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:54:20] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 754 ms returned sat
[2022-05-18 02:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:22] [INFO ] [Nat]Absence check using state equation in 1719 ms returned sat
[2022-05-18 02:54:22] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 35 ms.
[2022-05-18 02:54:24] [INFO ] Added : 101 causal constraints over 21 iterations in 2031 ms. Result :sat
Minimization took 280 ms.
[2022-05-18 02:54:26] [INFO ] [Real]Absence check using 0 positive and 3266 generalized place invariants in 705 ms returned sat
[2022-05-18 02:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:28] [INFO ] [Real]Absence check using state equation in 1829 ms returned sat
[2022-05-18 02:54:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:54:29] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 718 ms returned sat
[2022-05-18 02:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:31] [INFO ] [Nat]Absence check using state equation in 1960 ms returned sat
[2022-05-18 02:54:31] [INFO ] Computed and/alt/rep : 269/302/269 causal constraints (skipped 102 transitions) in 37 ms.
[2022-05-18 02:54:32] [INFO ] Added : 68 causal constraints over 14 iterations in 1304 ms. Result :sat
Minimization took 555 ms.
Current structural bounds on expressions (after SMT) : [1, 33, 33, 2147483647, 1, 1089, 33, 33] Max seen :[0, 0, 33, 24, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 10300 steps, including 120 resets, run finished after 254 ms. (steps per millisecond=40 ) properties (out of 7) seen :72 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15100 steps, including 125 resets, run finished after 471 ms. (steps per millisecond=32 ) properties (out of 4) seen :66 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 23500 steps, including 139 resets, run finished after 940 ms. (steps per millisecond=25 ) properties (out of 3) seen :1145 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 1089 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24500 steps, including 158 resets, run finished after 364 ms. (steps per millisecond=67 ) properties (out of 2) seen :56 could not realise parikh vector
Incomplete Parikh walk after 6900 steps, including 99 resets, run finished after 33 ms. (steps per millisecond=209 ) properties (out of 2) seen :33 could not realise parikh vector
Incomplete Parikh walk after 20200 steps, including 154 resets, run finished after 257 ms. (steps per millisecond=78 ) properties (out of 2) seen :66 could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6900 steps, including 98 resets, run finished after 30 ms. (steps per millisecond=230 ) properties (out of 1) seen :33 could not realise parikh vector
Support contains 33 out of 3670 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3670/3670 places, 404/404 transitions.
Graph (complete) has 41849 edges and 3670 vertex of which 168 are kept as prefixes of interest. Removing 3502 places using SCC suffix rule.2 ms
Discarding 3502 places :
Also discarding 300 output transitions
Drop transitions removed 300 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 135 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 134 transition count 68
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 71 place count 134 transition count 35
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 170 place count 68 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 67 transition count 34
Applied a total of 171 rules in 22 ms. Remains 67 /3670 variables (removed 3603) and now considering 34/404 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/3670 places, 34/404 transitions.
// Phase 1: matrix 34 rows 67 cols
[2022-05-18 02:54:35] [INFO ] Computed 33 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 28571 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :33
Incomplete Best-First random walk after 1000001 steps, including 1680 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 1) seen :33
// Phase 1: matrix 34 rows 67 cols
[2022-05-18 02:54:38] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-18 02:54:38] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 6 ms returned sat
[2022-05-18 02:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:54:38] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [33] Max seen :[33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652842479454
--------------------
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-32"
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-32, 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-165277027200355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 ;