fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271820800381
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for LamportFastMutEx-COL-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16221.943 3600000.00 2821667.00 517370.50 42 7 42 6 6 1 6 7 6 6 6 1 ? 7 7 7 normal

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.r132-tall-165271820800381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820800381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 6.9K Apr 29 19:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 19:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K 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 LamportFastMutEx-COL-7-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652781152744

Running Version 202205111006
[2022-05-17 09:52:33] [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-17 09:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:52:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 09:52:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 09:52:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2022-05-17 09:52:34] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2022-05-17 09:52:34] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2022-05-17 09:52:34] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2022-05-17 09:52:34] [INFO ] Computed 2 place invariants in 7 ms
FORMULA LamportFastMutEx-COL-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 17 rows 15 cols
[2022-05-17 09:52:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-17 09:52:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 09:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 09:52:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 09:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 09:52:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 09:52:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 09:52:34] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 11 ms.
[2022-05-17 09:52:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 09:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 09:52:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 09:52:35] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 09:52:35] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 09:52:35] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 09:52:35] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 17 ms.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:52:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:52:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 09:52:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:52:35] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [49, 49, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 09:52:35] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 24 ms.
[2022-05-17 09:52:35] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :99
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :82
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :99
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :84
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :80
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :77
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :35
FORMULA LamportFastMutEx-COL-7-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :32
[2022-05-17 09:52:36] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:36] [INFO ] Computed 65 place invariants in 12 ms
[2022-05-17 09:52:36] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:36] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-05-17 09:52:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 20 ms returned sat
[2022-05-17 09:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:36] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 09:52:36] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:52:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 66 ms returned sat
[2022-05-17 09:52:36] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2022-05-17 09:52:36] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2022-05-17 09:52:36] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:52:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 857 ms
[2022-05-17 09:52:37] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 28 ms.
[2022-05-17 09:52:38] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2022-05-17 09:52:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-17 09:52:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-17 09:52:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2022-05-17 09:52:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 352 ms
[2022-05-17 09:52:38] [INFO ] Added : 93 causal constraints over 20 iterations in 928 ms. Result :sat
Minimization took 239 ms.
[2022-05-17 09:52:38] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-17 09:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:38] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-17 09:52:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2022-05-17 09:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:38] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 09:52:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 45 ms returned sat
[2022-05-17 09:52:38] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2022-05-17 09:52:39] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-17 09:52:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 1784 ms
[2022-05-17 09:52:40] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:40] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-17 09:52:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:40] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-17 09:52:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:52:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 969 ms
[2022-05-17 09:52:41] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:42] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-17 09:52:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:42] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-17 09:52:42] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 09:52:42] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 970 ms
[2022-05-17 09:52:43] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:43] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-17 09:52:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2022-05-17 09:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:43] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 09:52:43] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2022-05-17 09:52:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1074 ms
[2022-05-17 09:52:44] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:44] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-17 09:52:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-17 09:52:44] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-17 09:52:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 3 ms to minimize.
[2022-05-17 09:52:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 643 ms
[2022-05-17 09:52:45] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 28 ms.
[2022-05-17 09:52:45] [INFO ] Added : 60 causal constraints over 13 iterations in 371 ms. Result :sat
Minimization took 123 ms.
[2022-05-17 09:52:45] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:46] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-17 09:52:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:46] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 09:52:46] [INFO ] [Nat]Added 91 Read/Feed constraints in 30 ms returned sat
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-17 09:52:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-17 09:52:47] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:52:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 856 ms
[2022-05-17 09:52:47] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:52:48] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:52:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 635 ms
[2022-05-17 09:52:49] [INFO ] Added : 238 causal constraints over 49 iterations in 2245 ms. Result :sat
Minimization took 157 ms.
[2022-05-17 09:52:49] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:49] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-17 09:52:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 09:52:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2022-05-17 09:52:49] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2022-05-17 09:52:49] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-05-17 09:52:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1191 ms
[2022-05-17 09:52:50] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-17 09:52:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:51] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 09:52:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2022-05-17 09:52:51] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:52:51] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2022-05-17 09:52:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2022-05-17 09:52:51] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2022-05-17 09:52:51] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:52:51] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2022-05-17 09:52:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 09:52:52] [INFO ] Added : 77 causal constraints over 16 iterations in 663 ms. Result :sat
Minimization took 136 ms.
[2022-05-17 09:52:52] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:52] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-17 09:52:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:52] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 09:52:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2022-05-17 09:52:52] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-05-17 09:52:52] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2022-05-17 09:52:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-17 09:52:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2022-05-17 09:52:52] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 25 ms.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-17 09:52:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 681 ms
[2022-05-17 09:52:54] [INFO ] Added : 127 causal constraints over 27 iterations in 1365 ms. Result :sat
Minimization took 195 ms.
[2022-05-17 09:52:54] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:54] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-17 09:52:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:52:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:52:54] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-17 09:52:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2022-05-17 09:52:54] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 23 ms.
[2022-05-17 09:52:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-05-17 09:52:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-17 09:52:55] [INFO ] Added : 122 causal constraints over 25 iterations in 792 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : [49, 42, 6, 6, 6, 7, 7, 6, 7, 7, 7] Max seen :[28, 42, 6, 6, 6, 5, 5, 6, 1, 2, 4]
FORMULA LamportFastMutEx-COL-7-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-02 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 77 out of 219 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 30 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Normalized transition count is 336 out of 462 initially.
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:52:57] [INFO ] Computed 65 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2848 ms. (steps per millisecond=351 ) properties (out of 5) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1544 ms. (steps per millisecond=647 ) properties (out of 5) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 5) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 5) seen :35
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 5) seen :38
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 5) seen :28
FORMULA LamportFastMutEx-COL-7-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-17 09:53:04] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2022-05-17 09:53:04] [INFO ] Computed 65 place invariants in 7 ms
[2022-05-17 09:53:04] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2022-05-17 09:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:04] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-17 09:53:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2022-05-17 09:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-17 09:53:04] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:53:04] [INFO ] [Nat]Added 91 Read/Feed constraints in 103 ms returned sat
[2022-05-17 09:53:04] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-17 09:53:04] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-17 09:53:04] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:53:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:53:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1113 ms
[2022-05-17 09:53:05] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2022-05-17 09:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:05] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-17 09:53:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:05] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 09:53:05] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:53:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 964 ms
[2022-05-17 09:53:06] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2022-05-17 09:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:07] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-17 09:53:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:07] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-17 09:53:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 09:53:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-17 09:53:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-17 09:53:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 828 ms
[2022-05-17 09:53:08] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-17 09:53:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2022-05-17 09:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:08] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-17 09:53:08] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2022-05-17 09:53:08] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2022-05-17 09:53:08] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-17 09:53:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2022-05-17 09:53:08] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 22 ms.
[2022-05-17 09:53:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:53:09] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-17 09:53:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2022-05-17 09:53:09] [INFO ] Added : 77 causal constraints over 16 iterations in 616 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [42, 6, 6, 7] Max seen :[42, 6, 6, 1]
FORMULA LamportFastMutEx-COL-7-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-00 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 59 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/219 places, 448/462 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2022-05-17 09:53:09] [INFO ] Computed 65 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2067 ms. (steps per millisecond=483 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 1) seen :1
[2022-05-17 09:53:12] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2022-05-17 09:53:12] [INFO ] Computed 65 place invariants in 6 ms
[2022-05-17 09:53:12] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:12] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-17 09:53:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2022-05-17 09:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:12] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 09:53:12] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-17 09:53:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2022-05-17 09:53:12] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 21 ms.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2022-05-17 09:53:13] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-17 09:53:14] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2022-05-17 09:53:14] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2022-05-17 09:53:14] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2022-05-17 09:53:14] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:53:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1388 ms
[2022-05-17 09:53:14] [INFO ] Added : 110 causal constraints over 22 iterations in 1989 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:53:14] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2022-05-17 09:53:14] [INFO ] Computed 65 place invariants in 3 ms
[2022-05-17 09:53:15] [INFO ] Implicit Places using invariants in 201 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 203 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 198/205 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:15] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 1) seen :1
[2022-05-17 09:53:17] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:17] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 09:53:17] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:17] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-17 09:53:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:17] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:17] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 09:53:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:53:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2022-05-17 09:53:18] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:53:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 09:53:18] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2022-05-17 09:53:18] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-17 09:53:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2022-05-17 09:53:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2022-05-17 09:53:18] [INFO ] Added : 101 causal constraints over 21 iterations in 656 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:53:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:19] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 09:53:19] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-17 09:53:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:19] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:53:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:53:19] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2022-05-17 09:53:19] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-17 09:53:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:19] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:53:19] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting property specific reduction for LamportFastMutEx-COL-7-UpperBounds-12
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:19] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2022-05-17 09:53:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:19] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:53:19] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:19] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-17 09:53:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-17 09:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:20] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-17 09:53:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:53:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2022-05-17 09:53:20] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2022-05-17 09:53:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 09:53:20] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2022-05-17 09:53:20] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-05-17 09:53:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2022-05-17 09:53:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2022-05-17 09:53:20] [INFO ] Added : 101 causal constraints over 21 iterations in 645 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:21] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1958 ms. (steps per millisecond=510 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 1) seen :1
[2022-05-17 09:53:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:23] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:53:23] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2022-05-17 09:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:24] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-17 09:53:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:53:24] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2022-05-17 09:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:53:24] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-17 09:53:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:53:24] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2022-05-17 09:53:24] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-05-17 09:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 09:53:24] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2022-05-17 09:53:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-05-17 09:53:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2022-05-17 09:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2022-05-17 09:53:24] [INFO ] Added : 101 causal constraints over 21 iterations in 650 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2022-05-17 09:53:25] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:25] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:53:25] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 09:53:25] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:25] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 09:53:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-17 09:53:25] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2022-05-17 09:53:25] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-17 09:53:25] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2022-05-17 09:53:25] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 09:53:25] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-COL-7-UpperBounds-12 in 6180 ms.
[2022-05-17 09:53:26] [INFO ] Flatten gal took : 86 ms
[2022-05-17 09:53:26] [INFO ] Applying decomposition
[2022-05-17 09:53:26] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2052357929586967511.txt' '-o' '/tmp/graph2052357929586967511.bin' '-w' '/tmp/graph2052357929586967511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2052357929586967511.bin' '-l' '-1' '-v' '-w' '/tmp/graph2052357929586967511.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:53:26] [INFO ] Decomposing Gal with order
[2022-05-17 09:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:53:26] [INFO ] Removed a total of 663 redundant transitions.
[2022-05-17 09:53:26] [INFO ] Flatten gal took : 84 ms
[2022-05-17 09:53:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 17 ms.
[2022-05-17 09:53:26] [INFO ] Time to serialize gal into /tmp/UpperBounds4257261590101870120.gal : 77 ms
[2022-05-17 09:53:26] [INFO ] Time to serialize properties into /tmp/UpperBounds14607856424905684916.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4257261590101870120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14607856424905684916.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds14607856424905684916.prop.
Detected timeout of ITS tools.
[2022-05-17 10:14:02] [INFO ] Applying decomposition
[2022-05-17 10:14:03] [INFO ] Flatten gal took : 310 ms
[2022-05-17 10:14:03] [INFO ] Decomposing Gal with order
[2022-05-17 10:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:14:04] [INFO ] Removed a total of 1073 redundant transitions.
[2022-05-17 10:14:04] [INFO ] Flatten gal took : 399 ms
[2022-05-17 10:14:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 778 ms.
[2022-05-17 10:14:05] [INFO ] Time to serialize gal into /tmp/UpperBounds4323947239436664754.gal : 23 ms
[2022-05-17 10:14:05] [INFO ] Time to serialize properties into /tmp/UpperBounds4722068366139925626.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4323947239436664754.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4722068366139925626.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds4722068366139925626.prop.
Detected timeout of ITS tools.
[2022-05-17 10:34:42] [INFO ] Flatten gal took : 364 ms
[2022-05-17 10:34:43] [INFO ] Input system was already deterministic with 448 transitions.
[2022-05-17 10:34:44] [INFO ] Transformed 198 places.
[2022-05-17 10:34:44] [INFO ] Transformed 448 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 10:34:44] [INFO ] Time to serialize gal into /tmp/UpperBounds10244798223907163118.gal : 32 ms
[2022-05-17 10:34:44] [INFO ] Time to serialize properties into /tmp/UpperBounds1842727403394209720.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10244798223907163118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1842727403394209720.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1842727403394209720.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-7, 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 r132-tall-165271820800381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 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 ;