fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r191-tall-167838876200040
Last Updated
May 14, 2023

About the Execution of 2022-gold for FamilyReunion-COL-L00050M0005C002P002G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1056.352 270453.00 311278.00 672.40 51 51 2 51 51 51 51 51 51 51 51 51 51 2 51 51 normal

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.r191-tall-167838876200040.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 gold2022
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876200040
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.2K Feb 26 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 12:26 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 137K 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-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678564086275

Running Version 202205111006
[2023-03-11 19:48:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 19:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:48:07] [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-11 19:48:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 19:48:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 665 ms
[2023-03-11 19:48:08] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2023-03-11 19:48:08] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-11 19:48:08] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 7 ms.
[2023-03-11 19:48:08] [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-11 19:48:08] [INFO ] Computed 33 place invariants in 14 ms
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 19:48:08] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-11 19:48:08] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 19:48:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-11 19:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:08] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-11 19:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-11 19:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 19:48:08] [INFO ] Added : 13 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 18 ms.
[2023-03-11 19:48:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:08] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-11 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 19:48:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 19:48:09] [INFO ] Added : 37 causal constraints over 8 iterations in 58 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-11 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 19:48:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 19:48:09] [INFO ] Added : 60 causal constraints over 12 iterations in 83 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-11 19:48:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 19:48:09] [INFO ] Added : 50 causal constraints over 10 iterations in 81 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-11 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 19:48:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:09] [INFO ] Added : 40 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:09] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 19:48:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:10] [INFO ] Added : 53 causal constraints over 11 iterations in 76 ms. Result :sat
Minimization took 16 ms.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:10] [INFO ] Added : 24 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:10] [INFO ] Added : 23 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 19:48:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:10] [INFO ] Added : 33 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:10] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-11 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 19:48:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:11] [INFO ] Added : 38 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 19:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:11] [INFO ] Added : 55 causal constraints over 11 iterations in 86 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 19:48:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:11] [INFO ] Added : 60 causal constraints over 12 iterations in 71 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 19:48:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:11] [INFO ] Added : 21 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-11 19:48:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 19:48:11] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [51, 102, 6, 51, 102, 51, 120, 51, 255, 51, 51, 102, 51, 6, 51, 51]
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 :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 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
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 :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
[2023-03-11 19:48:11] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 81 ms.
[2023-03-11 19:48:11] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 51 places in 54 ms
Reduce places removed 64 places and 0 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :22
// Phase 1: matrix 9336 rows 11403 cols
[2023-03-11 19:48:14] [INFO ] Computed 2767 place invariants in 1048 ms
[2023-03-11 19:48:15] [INFO ] [Real]Absence check using 59 positive place invariants in 191 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1327 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using state equation in 2326 ms returned unknown
[2023-03-11 19:48:20] [INFO ] [Real]Absence check using 59 positive place invariants in 182 ms returned sat
[2023-03-11 19:48:21] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1251 ms returned sat
[2023-03-11 19:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:24] [INFO ] [Real]Absence check using state equation in 2505 ms returned unknown
[2023-03-11 19:48:25] [INFO ] [Real]Absence check using 59 positive place invariants in 206 ms returned sat
[2023-03-11 19:48:27] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1554 ms returned unsat
[2023-03-11 19:48:28] [INFO ] [Real]Absence check using 59 positive place invariants in 181 ms returned sat
[2023-03-11 19:48:29] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1365 ms returned sat
[2023-03-11 19:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:32] [INFO ] [Real]Absence check using state equation in 2451 ms returned unknown
[2023-03-11 19:48:33] [INFO ] [Real]Absence check using 59 positive place invariants in 198 ms returned sat
[2023-03-11 19:48:34] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1292 ms returned sat
[2023-03-11 19:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:37] [INFO ] [Real]Absence check using state equation in 2401 ms returned unknown
[2023-03-11 19:48:38] [INFO ] [Real]Absence check using 59 positive place invariants in 186 ms returned sat
[2023-03-11 19:48:39] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1437 ms returned sat
[2023-03-11 19:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:42] [INFO ] [Real]Absence check using state equation in 2330 ms returned unknown
[2023-03-11 19:48:43] [INFO ] [Real]Absence check using 59 positive place invariants in 229 ms returned sat
[2023-03-11 19:48:47] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 3616 ms returned sat
[2023-03-11 19:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 19:48:48] [INFO ] [Real]Absence check using 59 positive place invariants in 198 ms returned sat
[2023-03-11 19:48:49] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1194 ms returned sat
[2023-03-11 19:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 19:48:53] [INFO ] [Real]Absence check using 59 positive place invariants in 186 ms returned sat
[2023-03-11 19:48:55] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1325 ms returned sat
[2023-03-11 19:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 19:48:58] [INFO ] [Real]Absence check using 59 positive place invariants in 180 ms returned sat
[2023-03-11 19:48:59] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1275 ms returned sat
[2023-03-11 19:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:49:02] [INFO ] [Real]Absence check using state equation in 2601 ms returned unknown
[2023-03-11 19:49:04] [INFO ] [Real]Absence check using 59 positive place invariants in 275 ms returned sat
[2023-03-11 19:49:07] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 2292 ms returned sat
[2023-03-11 19:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:49:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 19:49:08] [INFO ] [Real]Absence check using 59 positive place invariants in 212 ms returned sat
[2023-03-11 19:49:10] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1601 ms returned sat
[2023-03-11 19:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:49: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 19:49:14] [INFO ] [Real]Absence check using 59 positive place invariants in 194 ms returned sat
[2023-03-11 19:49:15] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1337 ms returned sat
[2023-03-11 19:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:49:17] [INFO ] [Real]Absence check using state equation in 1866 ms returned unknown
[2023-03-11 19:49:18] [INFO ] [Real]Absence check using 59 positive place invariants in 216 ms returned sat
[2023-03-11 19:49:20] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1259 ms returned unsat
[2023-03-11 19:49:21] [INFO ] [Real]Absence check using 59 positive place invariants in 200 ms returned sat
[2023-03-11 19:49:22] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1318 ms returned sat
[2023-03-11 19:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:49:25] [INFO ] [Real]Absence check using state equation in 2517 ms returned unknown
[2023-03-11 19:49:26] [INFO ] [Real]Absence check using 59 positive place invariants in 197 ms returned sat
[2023-03-11 19:49:27] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1407 ms returned sat
[2023-03-11 19:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:49:30] [INFO ] [Real]Absence check using state equation in 2412 ms returned unknown
Current structural bounds on expressions (after SMT) : [51, 102, 2, 51, 102, 51, 120, 51, 255, 51, 51, 102, 51, 2, 51, 51] Max seen :[13, 8, 2, 14, 11, 38, 8, 8, 24, 11, 31, 8, 9, 2, 10, 24]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1938 out of 11403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Graph (complete) has 16989 edges and 11403 vertex of which 10567 are kept as prefixes of interest. Removing 836 places using SCC suffix rule.23 ms
Discarding 836 places :
Also discarding 615 output transitions
Drop transitions removed 615 transitions
Discarding 1275 places :
Implicit places reduction removed 1275 places
Drop transitions removed 2142 transitions
Trivial Post-agglo rules discarded 2142 transitions
Performed 2142 trivial Post agglomeration. Transition count delta: 2142
Iterating post reduction 0 with 3417 rules applied. Total rules applied 3418 place count 9292 transition count 6579
Reduce places removed 2142 places and 0 transitions.
Performed 561 Post agglomeration using F-continuation condition.Transition count delta: 561
Iterating post reduction 1 with 2703 rules applied. Total rules applied 6121 place count 7150 transition count 6018
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 2 with 561 rules applied. Total rules applied 6682 place count 6589 transition count 6018
Performed 816 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 816 Pre rules applied. Total rules applied 6682 place count 6589 transition count 5202
Deduced a syphon composed of 816 places in 14 ms
Ensure Unique test removed 459 places
Reduce places removed 1275 places and 0 transitions.
Iterating global reduction 3 with 2091 rules applied. Total rules applied 8773 place count 5314 transition count 5202
Discarding 204 places :
Implicit places reduction removed 204 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 8977 place count 5110 transition count 5202
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 8977 place count 5110 transition count 5151
Deduced a syphon composed of 51 places in 10 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 9079 place count 5059 transition count 5151
Discarding 612 places :
Symmetric choice reduction at 4 with 612 rule applications. Total rules 9691 place count 4447 transition count 4539
Iterating global reduction 4 with 612 rules applied. Total rules applied 10303 place count 4447 transition count 4539
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 10310 place count 4440 transition count 4182
Iterating global reduction 4 with 7 rules applied. Total rules applied 10317 place count 4440 transition count 4182
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 10368 place count 4389 transition count 4182
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 10368 place count 4389 transition count 4131
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 10470 place count 4338 transition count 4131
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 3 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 255 rules applied. Total rules applied 10725 place count 4185 transition count 4029
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 5 with 408 rules applied. Total rules applied 11133 place count 4185 transition count 3621
Ensure Unique test removed 357 places
Reduce places removed 765 places and 0 transitions.
Iterating post reduction 5 with 765 rules applied. Total rules applied 11898 place count 3420 transition count 3621
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 11949 place count 3369 transition count 3570
Applied a total of 11949 rules in 2977 ms. Remains 3369 /11403 variables (removed 8034) and now considering 3570/9336 (removed 5766) transitions.
Finished structural reductions, in 1 iterations. Remains : 3369/11403 places, 3570/9336 transitions.
// Phase 1: matrix 3570 rows 3369 cols
[2023-03-11 19:49:33] [INFO ] Computed 156 place invariants in 67 ms
Finished random walk after 898441 steps, including 704 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=29 )
Finished Best-First random walk after 791489 steps, including 15 resets, run visited all 14 properties in 5001 ms. (steps per millisecond=158 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 2339 ms. (steps per millisecond=427 ) properties (out of 13) seen :247
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 783979 steps, including 15 resets, run visited all 12 properties in 5001 ms. (steps per millisecond=156 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 2403 ms. (steps per millisecond=416 ) properties (out of 11) seen :183
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 4057 ms. (steps per millisecond=246 ) properties (out of 10) seen :162
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 2215 ms. (steps per millisecond=451 ) properties (out of 9) seen :159
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 2226 ms. (steps per millisecond=449 ) properties (out of 9) seen :195
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 904850 steps, including 19 resets, run visited all 8 properties in 5002 ms. (steps per millisecond=180 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 3570 rows 3369 cols
[2023-03-11 19:50:31] [INFO ] Computed 156 place invariants in 56 ms
[2023-03-11 19:50:31] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 62 ms returned sat
[2023-03-11 19:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:50:33] [INFO ] [Real]Absence check using state equation in 1603 ms returned sat
[2023-03-11 19:50:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:50:34] [INFO ] [Nat]Absence check using 0 positive and 156 generalized place invariants in 62 ms returned sat
[2023-03-11 19:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:50:35] [INFO ] [Nat]Absence check using state equation in 1525 ms returned sat
[2023-03-11 19:50:35] [INFO ] Computed and/alt/rep : 3111/3825/3111 causal constraints (skipped 153 transitions) in 210 ms.
[2023-03-11 19:50:47] [INFO ] Added : 322 causal constraints over 65 iterations in 11399 ms. Result :sat
[2023-03-11 19:50:47] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 78 ms returned sat
[2023-03-11 19:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:50:49] [INFO ] [Real]Absence check using state equation in 1525 ms returned sat
[2023-03-11 19:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:50:49] [INFO ] [Nat]Absence check using 0 positive and 156 generalized place invariants in 63 ms returned sat
[2023-03-11 19:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:50:51] [INFO ] [Nat]Absence check using state equation in 1626 ms returned sat
[2023-03-11 19:50:51] [INFO ] Computed and/alt/rep : 3111/3825/3111 causal constraints (skipped 153 transitions) in 185 ms.
[2023-03-11 19:51:11] [INFO ] Added : 535 causal constraints over 107 iterations in 20027 ms.(timeout) Result :sat
[2023-03-11 19:51:11] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 60 ms returned sat
[2023-03-11 19:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:13] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2023-03-11 19:51:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:51:14] [INFO ] [Nat]Absence check using 0 positive and 156 generalized place invariants in 60 ms returned sat
[2023-03-11 19:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:16] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2023-03-11 19:51:16] [INFO ] Computed and/alt/rep : 3111/3825/3111 causal constraints (skipped 153 transitions) in 185 ms.
[2023-03-11 19:51:36] [INFO ] Added : 575 causal constraints over 115 iterations in 20087 ms.(timeout) Result :sat
[2023-03-11 19:51:37] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 59 ms returned sat
[2023-03-11 19:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:38] [INFO ] [Real]Absence check using state equation in 1465 ms returned unsat
[2023-03-11 19:51:39] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 57 ms returned sat
[2023-03-11 19:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:40] [INFO ] [Real]Absence check using state equation in 1390 ms returned sat
[2023-03-11 19:51:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:51:40] [INFO ] [Nat]Absence check using 0 positive and 156 generalized place invariants in 60 ms returned sat
[2023-03-11 19:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:42] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2023-03-11 19:51:42] [INFO ] Computed and/alt/rep : 3111/3825/3111 causal constraints (skipped 153 transitions) in 161 ms.
[2023-03-11 19:51:43] [INFO ] Added : 4 causal constraints over 1 iterations in 552 ms. Result :sat
[2023-03-11 19:51:43] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 58 ms returned sat
[2023-03-11 19:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:45] [INFO ] [Real]Absence check using state equation in 2223 ms returned unsat
[2023-03-11 19:51:46] [INFO ] [Real]Absence check using 0 positive and 156 generalized place invariants in 59 ms returned sat
[2023-03-11 19:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:47] [INFO ] [Real]Absence check using state equation in 1449 ms returned sat
[2023-03-11 19:51:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:51:48] [INFO ] [Nat]Absence check using 0 positive and 156 generalized place invariants in 81 ms returned sat
[2023-03-11 19:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:49] [INFO ] [Nat]Absence check using state equation in 1455 ms returned sat
[2023-03-11 19:51:49] [INFO ] Computed and/alt/rep : 3111/3825/3111 causal constraints (skipped 153 transitions) in 172 ms.
[2023-03-11 19:51:56] [INFO ] Added : 203 causal constraints over 41 iterations in 6707 ms. Result :sat
Current structural bounds on expressions (after SMT) : [102, 102, 120, 51, 51, 51, 51] Max seen :[17, 15, 16, 51, 47, 51, 21]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 612 out of 3369 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3369/3369 places, 3570/3570 transitions.
Graph (complete) has 4845 edges and 3369 vertex of which 3267 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.1 ms
Discarding 102 places :
Also discarding 102 output transitions
Drop transitions removed 102 transitions
Drop transitions removed 1428 transitions
Trivial Post-agglo rules discarded 1428 transitions
Performed 1428 trivial Post agglomeration. Transition count delta: 1428
Iterating post reduction 0 with 1428 rules applied. Total rules applied 1429 place count 3267 transition count 2040
Reduce places removed 1428 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 1 with 1530 rules applied. Total rules applied 2959 place count 1839 transition count 1938
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 3061 place count 1737 transition count 1938
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 3061 place count 1737 transition count 1683
Deduced a syphon composed of 255 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 561 rules applied. Total rules applied 3622 place count 1431 transition count 1683
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3877 place count 1176 transition count 1428
Iterating global reduction 3 with 255 rules applied. Total rules applied 4132 place count 1176 transition count 1428
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 4234 place count 1125 transition count 1377
Applied a total of 4234 rules in 301 ms. Remains 1125 /3369 variables (removed 2244) and now considering 1377/3570 (removed 2193) transitions.
Finished structural reductions, in 1 iterations. Remains : 1125/3369 places, 1377/3570 transitions.
// Phase 1: matrix 1377 rows 1125 cols
[2023-03-11 19:51:59] [INFO ] Computed 105 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 1779 resets, run finished after 15728 ms. (steps per millisecond=63 ) properties (out of 5) seen :126
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 4053 ms. (steps per millisecond=246 ) properties (out of 5) seen :110
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 2360 ms. (steps per millisecond=423 ) properties (out of 5) seen :121
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2227 ms. (steps per millisecond=449 ) properties (out of 5) seen :142
Finished Best-First random walk after 829442 steps, including 35 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=165 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1377 rows 1125 cols
[2023-03-11 19:52:29] [INFO ] Computed 105 place invariants in 12 ms
[2023-03-11 19:52:29] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 31 ms returned sat
[2023-03-11 19:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:29] [INFO ] [Real]Absence check using state equation in 294 ms returned unsat
[2023-03-11 19:52:30] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 29 ms returned sat
[2023-03-11 19:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:30] [INFO ] [Real]Absence check using state equation in 409 ms returned unsat
[2023-03-11 19:52:30] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 30 ms returned sat
[2023-03-11 19:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:31] [INFO ] [Real]Absence check using state equation in 420 ms returned unsat
[2023-03-11 19:52:31] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 26 ms returned sat
[2023-03-11 19:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:31] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2023-03-11 19:52:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:52:31] [INFO ] [Nat]Absence check using 0 positive and 105 generalized place invariants in 26 ms returned sat
[2023-03-11 19:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:32] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-11 19:52:32] [INFO ] Computed and/alt/rep : 918/1734/918 causal constraints (skipped 153 transitions) in 62 ms.
[2023-03-11 19:52:35] [INFO ] Added : 216 causal constraints over 44 iterations in 3305 ms. Result :sat
Minimization took 866 ms.
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51] Max seen :[51, 51, 51, 22]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14 51 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 269130 ms.

BK_STOP 1678564356728

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, 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 r191-tall-167838876200040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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