Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128100571.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100571
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 44K May 5 16:51 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 Peterson-COL-4-UpperBounds-00
FORMULA_NAME Peterson-COL-4-UpperBounds-01
FORMULA_NAME Peterson-COL-4-UpperBounds-02
FORMULA_NAME Peterson-COL-4-UpperBounds-03
FORMULA_NAME Peterson-COL-4-UpperBounds-04
FORMULA_NAME Peterson-COL-4-UpperBounds-05
FORMULA_NAME Peterson-COL-4-UpperBounds-06
FORMULA_NAME Peterson-COL-4-UpperBounds-07
FORMULA_NAME Peterson-COL-4-UpperBounds-08
FORMULA_NAME Peterson-COL-4-UpperBounds-09
FORMULA_NAME Peterson-COL-4-UpperBounds-10
FORMULA_NAME Peterson-COL-4-UpperBounds-11
FORMULA_NAME Peterson-COL-4-UpperBounds-12
FORMULA_NAME Peterson-COL-4-UpperBounds-13
FORMULA_NAME Peterson-COL-4-UpperBounds-14
FORMULA_NAME Peterson-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621007613224

Running Version 0
[2021-05-14 15:53:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 15:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:53:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 15:53:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:53:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2021-05-14 15:53:47] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2021-05-14 15:53:47] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 15:53:47] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_347399836607662003.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:53:47] [INFO ] Computed 1 place invariants in 7 ms
FORMULA Peterson-COL-4-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-14 15:53:47] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 22 ms.
[2021-05-14 15:53:47] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:53:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 15:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 15:53:47] [INFO ] Added : 11 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 5 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:53:47] [INFO ] Added : 12 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:53:47] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:53:47] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 15:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:53:47] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:53:47] [INFO ] Added : 11 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:53:47] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 15:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:47] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:53:47] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:53:47] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:53:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:53:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:53:48] [INFO ] Added : 12 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:53:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:53:48] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:53:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:53:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:53:48] [INFO ] Added : 11 causal constraints over 4 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]
[2021-05-14 15:53:48] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 11 ms.
[2021-05-14 15:53:48] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_12036324857331729104.dot
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 40 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :47
FORMULA Peterson-COL-4-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :15
FORMULA Peterson-COL-4-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-14 15:53:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 15:53:48] [INFO ] Computed 19 place invariants in 16 ms
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-14 15:53:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 15:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:48] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-14 15:53:48] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 15:53:48] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 15:53:48] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 4 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 0 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 0 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 8 ms to minimize.
[2021-05-14 15:53:49] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 100 places in 72 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:53:50] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 0 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 1 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 149 places in 109 ms of which 0 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 151 places in 103 ms of which 0 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 115 places in 91 ms of which 2 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2021-05-14 15:53:51] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:53:52] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2021-05-14 15:53:53] [INFO ] Deduced a trap composed of 2 places in 145 ms of which 0 ms to minimize.
[2021-05-14 15:53:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 15:53:53] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-14 15:53:53] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 15:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:53] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-14 15:53:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:53:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 15:53:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 15:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:53:54] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-14 15:53:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 15:53:54] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 0 ms to minimize.
[2021-05-14 15:53:54] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 1 ms to minimize.
[2021-05-14 15:53:54] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2021-05-14 15:53:54] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 1 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 0 ms to minimize.
[2021-05-14 15:53:55] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 0 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 0 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 1 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 0 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 0 ms to minimize.
[2021-05-14 15:53:56] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 0 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 1 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 0 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 0 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 1 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2021-05-14 15:53:57] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3770 ms
[2021-05-14 15:53:58] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 41 ms.
[2021-05-14 15:53:58] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 4]
Support contains 105 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 480 transition count 610
Reduce places removed 80 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 400 transition count 530
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 320 place count 320 transition count 495
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 390 place count 285 transition count 495
Applied a total of 390 rules in 66 ms. Remains 285 /480 variables (removed 195) and now considering 495/690 (removed 195) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/480 places, 495/690 transitions.
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 285 cols
[2021-05-14 15:53:59] [INFO ] Computed 19 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3860 ms. (steps per millisecond=259 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=500 ) properties (out of 2) seen :2
[2021-05-14 15:54:05] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2021-05-14 15:54:05] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-14 15:54:05] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-14 15:54:05] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 15:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:54:06] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-14 15:54:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:54:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 15:54:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 15:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:54:06] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-14 15:54:06] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 15:54:06] [INFO ] [Nat]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 0 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 0 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2021-05-14 15:54:06] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:54:07] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:54:08] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:54:09] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2021-05-14 15:54:10] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:54:11] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 0 ms to minimize.
[2021-05-14 15:54: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: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 15:54:51] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 15:54:51] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 15:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:54:51] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-14 15:54:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:54:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-14 15:54:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 15:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:54:51] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-14 15:54:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 16 ms returned sat
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:54:51] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:54:52] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:54:53] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:54:54] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:54:54] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:54:54] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 2736 ms
[2021-05-14 15:54:54] [INFO ] Computed and/alt/rep : 394/911/394 causal constraints (skipped 36 transitions) in 25 ms.
[2021-05-14 15:54:55] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2021-05-14 15:54:56] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 0 ms to minimize.
[2021-05-14 15:54:56] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2021-05-14 15:54:56] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2021-05-14 15:54:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 488 ms
[2021-05-14 15:54:56] [INFO ] Added : 348 causal constraints over 70 iterations in 2208 ms. Result :sat
Minimization took 160 ms.
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 4]
Incomplete Parikh walk after 72400 steps, including 995 resets, run finished after 334 ms. (steps per millisecond=216 ) properties (out of 2) seen :5 could not realise parikh vector
Support contains 105 out of 285 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 285/285 places, 495/495 transitions.
Applied a total of 0 rules in 18 ms. Remains 285 /285 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 495/495 transitions.
Starting structural reductions, iteration 0 : 285/285 places, 495/495 transitions.
Applied a total of 0 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2021-05-14 15:54:56] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2021-05-14 15:54:56] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-14 15:54:57] [INFO ] Implicit Places using invariants in 111 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 113 ms to find 5 implicit places.
[2021-05-14 15:54:57] [INFO ] Redundant transitions in 28 ms returned []
[2021-05-14 15:54:57] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 15:54:57] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-14 15:54:57] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Starting structural reductions, iteration 1 : 280/285 places, 495/495 transitions.
Applied a total of 0 rules in 13 ms. Remains 280 /280 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2021-05-14 15:54:57] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-14 15:54:57] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 15:54:57] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 15:54:57] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 2 iterations. Remains : 280/285 places, 495/495 transitions.
Normalized transition count is 435 out of 495 initially.
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 15:54:57] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3763 ms. (steps per millisecond=265 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1982 ms. (steps per millisecond=504 ) properties (out of 2) seen :2
[2021-05-14 15:55:04] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 280 cols
[2021-05-14 15:55:04] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 15:55:04] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-14 15:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:55:04] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-14 15:55:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:55:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-14 15:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:55:04] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-14 15:55:04] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 15:55:04] [INFO ] [Nat]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:55:04] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:55:05] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:55:06] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2021-05-14 15:55:07] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 63 places in 3378 ms of which 1 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:55:11] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2021-05-14 15:55:12] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2021-05-14 15:55:15] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2021-05-14 15:55:17] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:55:49] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2021-05-14 15:55:49] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 15:55:49] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-14 15:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:55:49] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-14 15:55:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:55:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-14 15:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:55:49] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-14 15:55:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 17 ms returned sat
[2021-05-14 15:55:49] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2021-05-14 15:55:49] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2021-05-14 15:55:49] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2021-05-14 15:55:49] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2021-05-14 15:55:49] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 3 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2021-05-14 15:55:50] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2021-05-14 15:55:51] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:55:52] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 3013 ms
[2021-05-14 15:55:52] [INFO ] Computed and/alt/rep : 394/911/394 causal constraints (skipped 36 transitions) in 26 ms.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2021-05-14 15:55:54] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:55:55] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:55:56] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:55:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1945 ms
[2021-05-14 15:55:56] [INFO ] Added : 335 causal constraints over 68 iterations in 3577 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : [5, 5] Max seen :[1, 4]
Incomplete Parikh walk after 84500 steps, including 1000 resets, run finished after 331 ms. (steps per millisecond=255 ) properties (out of 2) seen :6 could not realise parikh vector
FORMULA Peterson-COL-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 495/495 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 280 transition count 459
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 244 transition count 459
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 72 place count 244 transition count 395
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 200 place count 180 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 240 place count 160 transition count 375
Applied a total of 240 rules in 24 ms. Remains 160 /280 variables (removed 120) and now considering 375/495 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/280 places, 375/495 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2021-05-14 15:55:56] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2188 ms. (steps per millisecond=457 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 1) seen :1
[2021-05-14 15:55:59] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2021-05-14 15:55:59] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 15:55:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-14 15:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:55:59] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-14 15:55:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:55:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-14 15:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:55:59] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-14 15:55:59] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 15:55:59] [INFO ] [Nat]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 6 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:55:59] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:00] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:56:01] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 0 ms to minimize.
[2021-05-14 15:56:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:56:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2021-05-14 15:56:04] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:56:04] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:56:05] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:56:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:56:05] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:56:05] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2021-05-14 15:56:06] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:56:08] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2021-05-14 15:56:09] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:56:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 78 trap constraints in 11079 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA Peterson-COL-4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621007771777

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-4"
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 Peterson-COL-4, 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 r140-tall-162089128100571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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