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.r168-tall-165277016600397.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 PhilosophersDyn-COL-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 8.2K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 34K 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 PhilosophersDyn-COL-50-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652840585211

Running Version 202205111006
[2022-05-18 02:23:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 02:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:23:06] [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-18 02:23:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 02:23:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 589 ms
[2022-05-18 02:23:07] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 2850 PT places and 257600.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2022-05-18 02:23:07] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2022-05-18 02:23:07] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2022-05-18 02:23:07] [INFO ] Computed 3 place invariants in 5 ms
FORMULA PhilosophersDyn-COL-50-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 7 rows 8 cols
[2022-05-18 02:23:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:23:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 02:23:07] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:23:07] [INFO ] Added : 5 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:07] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:07] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:07] [INFO ] Added : 4 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:07] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 02:23:07] [INFO ] Added : 5 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 02:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:07] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:07] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 02:23:08] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-18 02:23:08] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:08] [INFO ] Added : 5 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-18 02:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-18 02:23:08] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-18 02:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-18 02:23:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 12 ms.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-18 02:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:23:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-18 02:23:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-18 02:23:08] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 02:23:08] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, -1, 50, 50]
Domain [Philosopher(50), Philosopher(50)] of place Neighbourhood breaks symmetries in sort Philosopher
[2022-05-18 02:23:09] [INFO ] Unfolded HLPN to a Petri net with 2850 places and 257550 transitions 2154950 arcs in 1680 ms.
[2022-05-18 02:23:09] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 1225 transitions
Reduce redundant transitions removed 1225 transitions.
Incomplete random walk after 10000 steps, including 1117 resets, run finished after 5892 ms. (steps per millisecond=1 ) properties (out of 14) seen :42
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :37
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :30
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :42
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :42
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :37
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :37
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :30
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 14) seen :38
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :37
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :42
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :30
[2022-05-18 02:23:19] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:25:19] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 02:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25: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: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:25:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 02:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:26:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2147483647, 50, 50] Max seen :[2, 4, 2, 4, 4, 2, 2, 4, 4, 4, 2, 2, 2, 4]
Support contains 2750 out of 2850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2850/2850 places, 256325/256325 transitions.
Applied a total of 0 rules in 5218 ms. Remains 2850 /2850 variables (removed 0) and now considering 256325/256325 (removed 0) transitions.
[2022-05-18 02:26:34] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:28:34] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 02:29:05] [INFO ] Performed 63996/256325 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 02:29:34] [INFO ] Dead Transitions using invariants and state equation in 180245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 256325/256325 transitions.
Normalized transition count is 246525 out of 256325 initially.
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:31:35] [WARNING] Invariant computation timed out after 120 seconds.
Finished random walk after 39406 steps, including 4401 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 598615 steps, including 424 resets, run visited all 14 properties in 5005 ms. (steps per millisecond=119 )
Interrupted Best-First random walk after 410669 steps, including 249 resets, run timeout after 5004 ms. (steps per millisecond=82 ) properties seen 30
Finished Best-First random walk after 643307 steps, including 456 resets, run visited all 14 properties in 5001 ms. (steps per millisecond=128 )
Finished Best-First random walk after 444977 steps, including 316 resets, run visited all 14 properties in 5004 ms. (steps per millisecond=88 )
Finished Best-First random walk after 81420 steps, including 57 resets, run visited all 14 properties in 5029 ms. (steps per millisecond=16 )
Finished Best-First random walk after 553063 steps, including 392 resets, run visited all 14 properties in 5006 ms. (steps per millisecond=110 )
Finished Best-First random walk after 484920 steps, including 343 resets, run visited all 14 properties in 5017 ms. (steps per millisecond=96 )
Finished Best-First random walk after 647390 steps, including 460 resets, run visited all 14 properties in 5001 ms. (steps per millisecond=129 )
Interrupted Best-First random walk after 891467 steps, including 542 resets, run timeout after 5003 ms. (steps per millisecond=178 ) properties seen 30
Finished Best-First random walk after 135318 steps, including 95 resets, run visited all 14 properties in 5003 ms. (steps per millisecond=27 )
Finished Best-First random walk after 690792 steps, including 490 resets, run visited all 14 properties in 5005 ms. (steps per millisecond=138 )
Finished Best-First random walk after 474430 steps, including 334 resets, run visited all 14 properties in 5017 ms. (steps per millisecond=94 )
Finished Best-First random walk after 594950 steps, including 422 resets, run visited all 14 properties in 5001 ms. (steps per millisecond=118 )
Interrupted Best-First random walk after 569912 steps, including 346 resets, run timeout after 5002 ms. (steps per millisecond=113 ) properties seen 30
[2022-05-18 02:33:15] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:35:08] [INFO ] Invariants computation overflowed in 709738 ms
[2022-05-18 02:35:15] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 02:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:36:00] [INFO ] [Real]Absence check using state equation in 44624 ms returned unknown
[2022-05-18 02:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:36:45] [INFO ] [Real]Absence check using state equation in 44765 ms returned unknown
[2022-05-18 02:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:37:31] [INFO ] [Real]Absence check using state equation in 44780 ms returned unknown
[2022-05-18 02:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:38:16] [INFO ] [Real]Absence check using state equation in 44593 ms returned unknown
[2022-05-18 02:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:39:01] [INFO ] [Real]Absence check using state equation in 44785 ms returned unknown
[2022-05-18 02:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:39:28] [INFO ] Invariants computation overflowed in 773875 ms
[2022-05-18 02:39:46] [INFO ] [Real]Absence check using state equation in 44651 ms returned unknown
[2022-05-18 02:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:40:31] [INFO ] [Real]Absence check using state equation in 44730 ms returned unknown
[2022-05-18 02:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:41:16] [INFO ] [Real]Absence check using state equation in 44718 ms returned unknown
[2022-05-18 02:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:42:01] [INFO ] [Real]Absence check using state equation in 44666 ms returned unknown
[2022-05-18 02:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:42:45] [INFO ] Invariants computation overflowed in 790158 ms
[2022-05-18 02:42:46] [INFO ] [Real]Absence check using state equation in 44425 ms returned unknown
[2022-05-18 02:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:43:31] [INFO ] [Real]Absence check using state equation in 44729 ms returned unknown
[2022-05-18 02:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:44:16] [INFO ] [Real]Absence check using state equation in 44740 ms returned unknown
[2022-05-18 02:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:45:01] [INFO ] [Real]Absence check using state equation in 44711 ms returned unknown
[2022-05-18 02:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:45:17] [INFO ] Invariants computation overflowed in 721446 ms
[2022-05-18 02:45:46] [INFO ] [Real]Absence check using state equation in 44794 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2147483647, 50, 50] Max seen :[2, 4, 2, 4, 4, 2, 2, 4, 4, 4, 2, 2, 2, 4]
Support contains 2750 out of 2850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2850/2850 places, 256325/256325 transitions.
Applied a total of 0 rules in 5179 ms. Remains 2850 /2850 variables (removed 0) and now considering 256325/256325 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 256325/256325 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2850/2850 places, 256325/256325 transitions.
Applied a total of 0 rules in 5097 ms. Remains 2850 /2850 variables (removed 0) and now considering 256325/256325 (removed 0) transitions.
[2022-05-18 02:45:56] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:47:56] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 02:48:08] [INFO ] Implicit Places using invariants in 132243 ms returned []
Implicit Place search using SMT only with invariants took 132246 ms to find 0 implicit places.
[2022-05-18 02:48:09] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:50:09] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 02:50:39] [INFO ] Performed 52596/256325 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 02:51:09] [INFO ] Dead Transitions using invariants and state equation in 180192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 256325/256325 transitions.
Starting property specific reduction for PhilosophersDyn-COL-50-UpperBounds-01
Normalized transition count is 246525 out of 256325 initially.
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:53:09] [WARNING] Invariant computation timed out after 120 seconds.
Incomplete random walk after 10000 steps, including 1115 resets, run finished after 8005 ms. (steps per millisecond=1 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :2
[2022-05-18 02:53:18] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 02:55:18] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 02:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 50 out of 2850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2850/2850 places, 256325/256325 transitions.
Free-agglomeration rule (complex) applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 2850 transition count 256275
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 100 place count 2800 transition count 256275
Applied a total of 100 rules in 161323 ms. Remains 2800 /2850 variables (removed 50) and now considering 256275/256325 (removed 50) transitions.
[2022-05-18 02:58:04] [INFO ] Flow matrix only has 246475 transitions (discarded 9800 similar events)
// Phase 1: matrix 246475 rows 2800 cols
[2022-05-18 02:59:01] [INFO ] Invariants computation overflowed in 784985 ms
[2022-05-18 03:00:04] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 03:00:35] [INFO ] Performed 49037/256275 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 03:01:04] [INFO ] Dead Transitions using invariants and state equation in 180244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2800/2850 places, 256275/256325 transitions.
Normalized transition count is 246475 out of 256275 initially.
// Phase 1: matrix 246475 rows 2800 cols
[2022-05-18 03:02:24] [INFO ] Invariants computation overflowed in 855817 ms
[2022-05-18 03:03:05] [WARNING] Invariant computation timed out after 120 seconds.
Finished random walk after 37439 steps, including 4170 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 514481 steps, including 366 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=102 )
[2022-05-18 03:03:41] [INFO ] Flow matrix only has 246475 transitions (discarded 9800 similar events)
// Phase 1: matrix 246475 rows 2800 cols
[2022-05-18 03:05:41] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 03:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:06:20] [INFO ] [Real]Absence check using state equation in 38543 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 50 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2800/2800 places, 256275/256275 transitions.
Applied a total of 0 rules in 107013 ms. Remains 2800 /2800 variables (removed 0) and now considering 256275/256275 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2800/2800 places, 256275/256275 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2800/2800 places, 256275/256275 transitions.
[2022-05-18 03:08:55] [INFO ] Invariants computation overflowed in 1066403 ms
Applied a total of 0 rules in 97361 ms. Remains 2800 /2800 variables (removed 0) and now considering 256275/256275 (removed 0) transitions.
[2022-05-18 03:09:44] [INFO ] Flow matrix only has 246475 transitions (discarded 9800 similar events)
// Phase 1: matrix 246475 rows 2800 cols
[2022-05-18 03:11:44] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 03:12:15] [INFO ] Performed 2505/2800 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-18 03:12:24] [INFO ] Invariants computation overflowed in 1146792 ms
[2022-05-18 03:12:45] [INFO ] Performed 2657/2800 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-18 03:12:45] [INFO ] Implicit Places using invariants in 181178 ms returned []
Implicit Place search using SMT only with invariants took 181178 ms to find 0 implicit places.
[2022-05-18 03:12:46] [INFO ] Flow matrix only has 246475 transitions (discarded 9800 similar events)
// Phase 1: matrix 246475 rows 2800 cols
[2022-05-18 03:14:46] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 03:15:16] [INFO ] Performed 38518/256275 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-18 03:15:46] [INFO ] Dead Transitions using invariants and state equation in 180378 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2800/2800 places, 256275/256275 transitions.
Ending property specific reduction for PhilosophersDyn-COL-50-UpperBounds-01 in 1477419 ms.
Starting property specific reduction for PhilosophersDyn-COL-50-UpperBounds-02
Normalized transition count is 246525 out of 256325 initially.
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 03:17:47] [WARNING] Invariant computation timed out after 120 seconds.
Incomplete random walk after 10000 steps, including 1117 resets, run finished after 13718 ms. (steps per millisecond=0 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :4
[2022-05-18 03:18:02] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2022-05-18 03:20:02] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-18 03:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 50 out of 2850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2850/2850 places, 256325/256325 transitions.
[2022-05-18 03:20:59] [INFO ] Invariants computation overflowed in 1375000 ms
Free-agglomeration rule (complex) applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 2850 transition count 256275
Reduce places removed 50 places and 0 transitions.

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="PhilosophersDyn-COL-50"
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 PhilosophersDyn-COL-50, 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 r168-tall-165277016600397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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