Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948500853.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r295-tall-167873948500853
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:23 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 1678916845922

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:47:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 21:47:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:47:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 21:47:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 21:47:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 703 ms
[2023-03-15 21:47:28] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 21:47:28] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-15 21:47:28] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 21:47:28] [INFO ] Computed 5 place invariants in 6 ms
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-15 21:47:28] [INFO ] Invariant cache hit.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 21:47:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:47:28] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 21:47:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 21:47:28] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 21:47:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 21:47:28] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 21:47:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-15 21:47:28] [INFO ] Added : 10 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:47:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:47:28] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 21:47:28] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:47:28] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:47:29] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:47:29] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:47:29] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 21:47:29] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:47:29] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:47:29] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:47:29] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 21:47:29] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:47:29] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:47:29] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 19, 33, 1, 1, -1, 33, 33, -1, 19, 33, 33, -1]
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-15 21:47:29] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 37 ms.
[2023-03-15 21:47:29] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :69
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :123
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :33
// Phase 1: matrix 506 rows 3806 cols
[2023-03-15 21:47:30] [INFO ] Computed 3301 place invariants in 177 ms
[2023-03-15 21:47:30] [INFO ] [Real]Absence check using 37 positive place invariants in 74 ms returned sat
[2023-03-15 21:47:31] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 692 ms returned sat
[2023-03-15 21:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:33] [INFO ] [Real]Absence check using state equation in 2380 ms returned sat
[2023-03-15 21:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 73 ms returned sat
[2023-03-15 21:47:35] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 752 ms returned sat
[2023-03-15 21:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:38] [INFO ] [Nat]Absence check using state equation in 3835 ms returned unknown
[2023-03-15 21:47:39] [INFO ] [Real]Absence check using 37 positive place invariants in 72 ms returned sat
[2023-03-15 21:47:40] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 807 ms returned sat
[2023-03-15 21:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:41] [INFO ] [Real]Absence check using state equation in 1770 ms returned sat
[2023-03-15 21:47:42] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2023-03-15 21:47:46] [INFO ] Deduced a trap composed of 6 places in 2840 ms of which 11 ms to minimize.
[2023-03-15 21:47:46] [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 1
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:47:47] [INFO ] [Real]Absence check using 37 positive place invariants in 69 ms returned sat
[2023-03-15 21:47:47] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 790 ms returned sat
[2023-03-15 21:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:49] [INFO ] [Real]Absence check using state equation in 1568 ms returned sat
[2023-03-15 21:47:49] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 37 ms.
[2023-03-15 21:47:51] [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 2
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:47:52] [INFO ] [Real]Absence check using 37 positive place invariants in 65 ms returned sat
[2023-03-15 21:47:52] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 689 ms returned sat
[2023-03-15 21:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:55] [INFO ] [Real]Absence check using state equation in 2256 ms returned sat
[2023-03-15 21:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:47:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 65 ms returned sat
[2023-03-15 21:47:56] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 702 ms returned sat
[2023-03-15 21:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:47:58] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2023-03-15 21:47:58] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2023-03-15 21:48:02] [INFO ] Deduced a trap composed of 6 places in 2711 ms of which 4 ms to minimize.
[2023-03-15 21:48:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:48:03] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2023-03-15 21:48:03] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 688 ms returned sat
[2023-03-15 21:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:06] [INFO ] [Real]Absence check using state equation in 2239 ms returned sat
[2023-03-15 21:48:06] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 45 ms.
[2023-03-15 21:48:07] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:48:08] [INFO ] [Real]Absence check using 37 positive place invariants in 66 ms returned sat
[2023-03-15 21:48:09] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 777 ms returned sat
[2023-03-15 21:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:12] [INFO ] [Real]Absence check using state equation in 2935 ms returned sat
[2023-03-15 21:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:48:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 66 ms returned sat
[2023-03-15 21:48:13] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 763 ms returned sat
[2023-03-15 21:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:17] [INFO ] [Nat]Absence check using state equation in 3880 ms returned unknown
[2023-03-15 21:48:17] [INFO ] [Real]Absence check using 37 positive place invariants in 64 ms returned sat
[2023-03-15 21:48:18] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1001 ms returned sat
[2023-03-15 21:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:22] [INFO ] [Real]Absence check using state equation in 3651 ms returned unknown
[2023-03-15 21:48:22] [INFO ] [Real]Absence check using 37 positive place invariants in 68 ms returned sat
[2023-03-15 21:48:23] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 774 ms returned sat
[2023-03-15 21:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:24] [INFO ] [Real]Absence check using state equation in 1524 ms returned unsat
[2023-03-15 21:48:25] [INFO ] [Real]Absence check using 37 positive place invariants in 62 ms returned sat
[2023-03-15 21:48:26] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 781 ms returned sat
[2023-03-15 21:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:27] [INFO ] [Real]Absence check using state equation in 1545 ms returned sat
[2023-03-15 21:48:27] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-15 21:48:32] [INFO ] Deduced a trap composed of 6 places in 2706 ms of which 4 ms to minimize.
[2023-03-15 21:48:32] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:48:32] [INFO ] [Real]Absence check using 37 positive place invariants in 68 ms returned sat
[2023-03-15 21:48:33] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 694 ms returned sat
[2023-03-15 21:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:36] [INFO ] [Real]Absence check using state equation in 2404 ms returned sat
[2023-03-15 21:48:36] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2023-03-15 21:48:40] [INFO ] Deduced a trap composed of 6 places in 2789 ms of which 6 ms to minimize.
[2023-03-15 21:48:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:48:40] [INFO ] [Real]Absence check using 37 positive place invariants in 69 ms returned sat
[2023-03-15 21:48:41] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 816 ms returned sat
[2023-03-15 21:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:45] [INFO ] [Real]Absence check using state equation in 3782 ms returned unknown
[2023-03-15 21:48:45] [INFO ] [Real]Absence check using 37 positive place invariants in 67 ms returned sat
[2023-03-15 21:48:46] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 797 ms returned sat
[2023-03-15 21:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:48:48] [INFO ] [Real]Absence check using state equation in 2129 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2147483647, 33, 1, 1, 2147483647, 33, 33, 19, 33, 33, 33] Max seen :[0, 0, 0, 0, 0, 24, 0, 33, 0, 0, 0, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 202 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3804 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Discarding 66 places :
Implicit places reduction removed 66 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 202 rules applied. Total rules applied 203 place count 3738 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 204 place count 3737 transition count 370
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 204 place count 3737 transition count 337
Deduced a syphon composed of 33 places in 2 ms
Ensure Unique test removed 65 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 335 place count 3639 transition count 337
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 335 place count 3639 transition count 336
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 338 place count 3637 transition count 336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 3636 transition count 335
Applied a total of 339 rules in 901 ms. Remains 3636 /3806 variables (removed 170) and now considering 335/506 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 3636/3806 places, 335/506 transitions.
// Phase 1: matrix 335 rows 3636 cols
[2023-03-15 21:48:49] [INFO ] Computed 3301 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 13794 resets, run finished after 9252 ms. (steps per millisecond=108 ) properties (out of 10) seen :105
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 472 resets, run finished after 2910 ms. (steps per millisecond=343 ) properties (out of 7) seen :114
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 457931 steps, including 106 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=91 )
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 19 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 615 resets, run finished after 3693 ms. (steps per millisecond=270 ) properties (out of 3) seen :66
[2023-03-15 21:49:10] [INFO ] Invariant cache hit.
[2023-03-15 21:49:11] [INFO ] [Real]Absence check using 1090 positive place invariants in 250 ms returned sat
[2023-03-15 21:49:11] [INFO ] [Real]Absence check using 1090 positive and 2211 generalized place invariants in 481 ms returned sat
[2023-03-15 21:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:49:12] [INFO ] [Real]Absence check using state equation in 1171 ms returned unsat
[2023-03-15 21:49:13] [INFO ] [Real]Absence check using 1090 positive place invariants in 245 ms returned sat
[2023-03-15 21:49:13] [INFO ] [Real]Absence check using 1090 positive and 2211 generalized place invariants in 469 ms returned sat
[2023-03-15 21:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:49:14] [INFO ] [Real]Absence check using state equation in 1069 ms returned unsat
[2023-03-15 21:49:15] [INFO ] [Real]Absence check using 1090 positive place invariants in 230 ms returned sat
[2023-03-15 21:49:16] [INFO ] [Real]Absence check using 1090 positive and 2211 generalized place invariants in 704 ms returned sat
[2023-03-15 21:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:49:17] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-15 21:49:17] [INFO ] Computed and/alt/rep : 201/201/201 causal constraints (skipped 101 transitions) in 27 ms.
[2023-03-15 21:49:19] [INFO ] Added : 100 causal constraints over 20 iterations in 1711 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : [33, 33, 33] Max seen :[33, 33, 14]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 112666 ms.
ITS solved all properties within timeout

BK_STOP 1678916960881

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r295-tall-167873948500853"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;