Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K Feb 26 11:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 11:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 11:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 135K Mar 5 18:22 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 FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679457875668

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-22 04:04:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 04:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:04:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 04:04:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 04:04:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 499 ms
[2023-03-22 04:04:37] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2023-03-22 04:04:37] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 04:04:37] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-22 04:04:37] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2023-03-22 04:04:37] [INFO ] Computed 33 place invariants in 15 ms
[2023-03-22 04:04:37] [INFO ] Invariant cache hit.
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-22 04:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-22 04:04:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:04:38] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:04:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 04:04:38] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 04:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 04:04:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:04:38] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 14 ms.
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:38] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 04:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:38] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:04:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:04:38] [INFO ] Added : 59 causal constraints over 12 iterations in 80 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-22 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 04:04:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 04:04:39] [INFO ] Added : 40 causal constraints over 8 iterations in 59 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-22 04:04:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:04:39] [INFO ] Added : 44 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 04:04:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:04:39] [INFO ] Added : 45 causal constraints over 9 iterations in 65 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-22 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:04:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:04:39] [INFO ] Added : 64 causal constraints over 13 iterations in 102 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 04:04:40] [INFO ] Added : 37 causal constraints over 8 iterations in 57 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:04:40] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:04:40] [INFO ] Added : 28 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:04:40] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:04:40] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:04:40] [INFO ] Added : 44 causal constraints over 9 iterations in 48 ms. Result :sat
Minimization took 13 ms.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:40] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:04:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:04:41] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 04:04:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:04:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:04:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:04:41] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 04:04:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:04:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-22 04:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-22 04:04:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:04:41] [INFO ] Added : 34 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [21, 21, 6, 42, 42, 42, 2, 168, 21, 21, 21, 462, 21, 21, 420, 21]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2023-03-22 04:04:41] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 38 ms.
[2023-03-22 04:04:41] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 21 places in 18 ms
Reduce places removed 30 places and 0 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 16) seen :128
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :34
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :45
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-10 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-08 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :6
// Phase 1: matrix 2438 rows 3065 cols
[2023-03-22 04:04:41] [INFO ] Computed 747 place invariants in 134 ms
[2023-03-22 04:04:42] [INFO ] [Real]Absence check using 26 positive place invariants in 35 ms returned sat
[2023-03-22 04:04:42] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 202 ms returned sat
[2023-03-22 04:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:43] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-22 04:04:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:44] [INFO ] [Nat]Absence check using 26 positive place invariants in 35 ms returned sat
[2023-03-22 04:04:44] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 208 ms returned sat
[2023-03-22 04:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:45] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2023-03-22 04:04:45] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 120 ms.
[2023-03-22 04:04:50] [INFO ] Deduced a trap composed of 61 places in 1878 ms of which 7 ms to minimize.
[2023-03-22 04:04:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:04:51] [INFO ] [Real]Absence check using 26 positive place invariants in 33 ms returned sat
[2023-03-22 04:04:51] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 204 ms returned unsat
[2023-03-22 04:04:51] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:04:51] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 199 ms returned sat
[2023-03-22 04:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:52] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2023-03-22 04:04:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:04:53] [INFO ] [Nat]Absence check using 26 positive place invariants in 36 ms returned sat
[2023-03-22 04:04:53] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 224 ms returned sat
[2023-03-22 04:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:04:54] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2023-03-22 04:04:55] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 128 ms.
[2023-03-22 04:04:59] [INFO ] Deduced a trap composed of 61 places in 1847 ms of which 3 ms to minimize.
[2023-03-22 04:04:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:00] [INFO ] [Real]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-22 04:05:00] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 199 ms returned sat
[2023-03-22 04:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:01] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2023-03-22 04:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 34 ms returned sat
[2023-03-22 04:05:02] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 203 ms returned sat
[2023-03-22 04:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:03] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2023-03-22 04:05:03] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 112 ms.
[2023-03-22 04:05:08] [INFO ] Deduced a trap composed of 61 places in 1743 ms of which 3 ms to minimize.
[2023-03-22 04:05:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:08] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:05:08] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 181 ms returned sat
[2023-03-22 04:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:10] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2023-03-22 04:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:10] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-22 04:05:10] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 184 ms returned sat
[2023-03-22 04:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:11] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2023-03-22 04:05:11] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 118 ms.
[2023-03-22 04:05:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:15] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:05:15] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 200 ms returned sat
[2023-03-22 04:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:16] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2023-03-22 04:05:17] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 111 ms.
[2023-03-22 04:05:21] [INFO ] Deduced a trap composed of 61 places in 1707 ms of which 8 ms to minimize.
[2023-03-22 04:05:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:22] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:05:22] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 180 ms returned sat
[2023-03-22 04:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:23] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2023-03-22 04:05:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:23] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-22 04:05:24] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 196 ms returned sat
[2023-03-22 04:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:25] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2023-03-22 04:05:25] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 107 ms.
[2023-03-22 04:05:30] [INFO ] Deduced a trap composed of 61 places in 1893 ms of which 3 ms to minimize.
[2023-03-22 04:05:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:30] [INFO ] [Real]Absence check using 26 positive place invariants in 33 ms returned sat
[2023-03-22 04:05:31] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 234 ms returned sat
[2023-03-22 04:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:32] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2023-03-22 04:05:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:05:32] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 225 ms returned sat
[2023-03-22 04:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:34] [INFO ] [Nat]Absence check using state equation in 1321 ms returned sat
[2023-03-22 04:05:34] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 122 ms.
[2023-03-22 04:05:39] [INFO ] Deduced a trap composed of 61 places in 1931 ms of which 3 ms to minimize.
[2023-03-22 04:05:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:39] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:05:39] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 198 ms returned sat
[2023-03-22 04:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:41] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2023-03-22 04:05:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:41] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-22 04:05:41] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 198 ms returned sat
[2023-03-22 04:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:42] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2023-03-22 04:05:43] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 107 ms.
[2023-03-22 04:05:48] [INFO ] Deduced a trap composed of 61 places in 1858 ms of which 3 ms to minimize.
[2023-03-22 04:05:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:48] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-22 04:05:48] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 202 ms returned sat
[2023-03-22 04:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:49] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2023-03-22 04:05:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:50] [INFO ] [Nat]Absence check using 26 positive place invariants in 37 ms returned sat
[2023-03-22 04:05:50] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 190 ms returned sat
[2023-03-22 04:05:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:51] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2023-03-22 04:05:51] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 117 ms.
[2023-03-22 04:05:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:05:55] [INFO ] [Real]Absence check using 26 positive place invariants in 37 ms returned sat
[2023-03-22 04:05:55] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 197 ms returned sat
[2023-03-22 04:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:56] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2023-03-22 04:05:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:05:57] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-22 04:05:57] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 206 ms returned sat
[2023-03-22 04:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:05:58] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2023-03-22 04:05:58] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 92 ms.
[2023-03-22 04:06:03] [INFO ] Deduced a trap composed of 61 places in 1896 ms of which 4 ms to minimize.
[2023-03-22 04:06:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:06:03] [INFO ] [Real]Absence check using 26 positive place invariants in 38 ms returned sat
[2023-03-22 04:06:04] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 202 ms returned sat
[2023-03-22 04:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:05] [INFO ] [Real]Absence check using state equation in 1468 ms returned sat
[2023-03-22 04:06:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:06:06] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-22 04:06:06] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 201 ms returned sat
[2023-03-22 04:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:07] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2023-03-22 04:06:07] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 105 ms.
[2023-03-22 04:06:12] [INFO ] Deduced a trap composed of 61 places in 1839 ms of which 3 ms to minimize.
[2023-03-22 04:06:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [21, 2, 42, 42, 42, 168, 21, 462, 21, 21, 420, 21] Max seen :[5, 2, 5, 6, 8, 14, 6, 7, 4, 12, 8, 5]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 318 out of 3065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Graph (complete) has 4456 edges and 3065 vertex of which 2483 are kept as prefixes of interest. Removing 582 places using SCC suffix rule.6 ms
Discarding 582 places :
Also discarding 443 output transitions
Drop transitions removed 443 transitions
Discarding 420 places :
Implicit places reduction removed 420 places
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 966 rules applied. Total rules applied 967 place count 2063 transition count 1449
Reduce places removed 546 places and 0 transitions.
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Iterating post reduction 1 with 735 rules applied. Total rules applied 1702 place count 1517 transition count 1260
Reduce places removed 189 places and 0 transitions.
Iterating post reduction 2 with 189 rules applied. Total rules applied 1891 place count 1328 transition count 1260
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 1891 place count 1328 transition count 1113
Deduced a syphon composed of 147 places in 2 ms
Ensure Unique test removed 42 places
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 2227 place count 1139 transition count 1113
Discarding 126 places :
Symmetric choice reduction at 3 with 126 rule applications. Total rules 2353 place count 1013 transition count 987
Iterating global reduction 3 with 126 rules applied. Total rules applied 2479 place count 1013 transition count 987
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2479 place count 1013 transition count 966
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2521 place count 992 transition count 966
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2522 place count 991 transition count 945
Iterating global reduction 3 with 1 rules applied. Total rules applied 2523 place count 991 transition count 945
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 2649 place count 928 transition count 882
Free-agglomeration rule (complex) applied 84 times.
Iterating global reduction 3 with 84 rules applied. Total rules applied 2733 place count 928 transition count 798
Ensure Unique test removed 21 places
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 3 with 105 rules applied. Total rules applied 2838 place count 823 transition count 798
Applied a total of 2838 rules in 443 ms. Remains 823 /3065 variables (removed 2242) and now considering 798/2438 (removed 1640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 823/3065 places, 798/2438 transitions.
// Phase 1: matrix 798 rows 823 cols
[2023-03-22 04:06:13] [INFO ] Computed 128 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2262 resets, run finished after 6568 ms. (steps per millisecond=152 ) properties (out of 11) seen :130
Incomplete Best-First random walk after 1000001 steps, including 128 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties (out of 11) seen :60
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 93 resets, run finished after 1246 ms. (steps per millisecond=802 ) properties (out of 10) seen :123
Incomplete Best-First random walk after 1000001 steps, including 93 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 10) seen :119
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 10) seen :68
Incomplete Best-First random walk after 1000001 steps, including 87 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 10) seen :58
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 91 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties (out of 9) seen :129
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-12 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 146 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties (out of 8) seen :42
Incomplete Best-First random walk after 1000000 steps, including 113 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 8) seen :78
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 04:06:29] [INFO ] Invariant cache hit.
[2023-03-22 04:06:29] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 21 ms returned sat
[2023-03-22 04:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:29] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-22 04:06:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:06:29] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-22 04:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:29] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-22 04:06:29] [INFO ] Computed and/alt/rep : 651/1071/651 causal constraints (skipped 84 transitions) in 39 ms.
[2023-03-22 04:06:31] [INFO ] Added : 237 causal constraints over 48 iterations in 2194 ms. Result :sat
Minimization took 420 ms.
[2023-03-22 04:06:32] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-22 04:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:32] [INFO ] [Real]Absence check using state equation in 257 ms returned unsat
[2023-03-22 04:06:32] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-22 04:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:33] [INFO ] [Real]Absence check using state equation in 313 ms returned unsat
[2023-03-22 04:06:33] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-22 04:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:33] [INFO ] [Real]Absence check using state equation in 223 ms returned unsat
[2023-03-22 04:06:33] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-22 04:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:33] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-22 04:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:06:33] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-22 04:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:34] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-03-22 04:06:34] [INFO ] Computed and/alt/rep : 651/1071/651 causal constraints (skipped 84 transitions) in 35 ms.
[2023-03-22 04:06:34] [INFO ] Added : 35 causal constraints over 8 iterations in 386 ms. Result :sat
Minimization took 139 ms.
[2023-03-22 04:06:34] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-22 04:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:35] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2023-03-22 04:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:06:35] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-22 04:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:35] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-22 04:06:35] [INFO ] Computed and/alt/rep : 651/1071/651 causal constraints (skipped 84 transitions) in 35 ms.
[2023-03-22 04:06:36] [INFO ] Added : 126 causal constraints over 26 iterations in 1138 ms. Result :sat
Minimization took 211 ms.
[2023-03-22 04:06:36] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 21 ms returned sat
[2023-03-22 04:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:37] [INFO ] [Real]Absence check using state equation in 125 ms returned unsat
Current structural bounds on expressions (after SMT) : [42, 21, 21, 21, 462, 21, 21] Max seen :[10, 21, 21, 21, 16, 12, 21]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-14 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-13 21 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 84 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 798/798 transitions.
Graph (complete) has 1197 edges and 823 vertex of which 655 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.1 ms
Discarding 168 places :
Also discarding 105 output transitions
Drop transitions removed 105 transitions
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 655 transition count 483
Reduce places removed 210 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 273 rules applied. Total rules applied 484 place count 445 transition count 420
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 547 place count 382 transition count 420
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 547 place count 382 transition count 378
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 631 place count 340 transition count 378
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 654 place count 317 transition count 315
Iterating global reduction 3 with 23 rules applied. Total rules applied 677 place count 317 transition count 315
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 63 rules applied. Total rules applied 740 place count 296 transition count 273
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 761 place count 275 transition count 273
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 782 place count 275 transition count 252
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 824 place count 233 transition count 252
Applied a total of 824 rules in 39 ms. Remains 233 /823 variables (removed 590) and now considering 252/798 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 233/823 places, 252/798 transitions.
// Phase 1: matrix 252 rows 233 cols
[2023-03-22 04:06:37] [INFO ] Computed 23 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 7874 resets, run finished after 3632 ms. (steps per millisecond=275 ) properties (out of 2) seen :29
Incomplete Best-First random walk after 1000001 steps, including 316 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 2) seen :36
Incomplete Best-First random walk after 1000001 steps, including 355 resets, run finished after 1281 ms. (steps per millisecond=780 ) properties (out of 2) seen :22
[2023-03-22 04:06:43] [INFO ] Invariant cache hit.
[2023-03-22 04:06:43] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-22 04:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:43] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2023-03-22 04:06:43] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 5 ms returned sat
[2023-03-22 04:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:06:43] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 21] Max seen :[21, 21]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-11 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 126008 ms.

BK_STOP 1679458005119

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FamilyReunion-COL-L00020M0002C001P001G001"
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-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, 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 r165-tall-167838850200309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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