MCC'2025- Execution of r097-smll-174860111800016

About the Execution of 2024-gold for FamilyReunion-COL-L00100M0010C005P005G002

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15685.880	602320.00	681385.00	2118.60	101 3 101 101 101 101 101 101 101 11 101 101 3 101 101 101	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800016.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 140K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748670156690

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00100M0010C005P005G002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-05-31 05:42:39] [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]
[2025-05-31 05:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:42:39] [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.
[2025-05-31 05:42:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-31 05:42:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1737 ms
[2025-05-31 05:42:41] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2025-05-31 05:42:41] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 86 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2025-05-31 05:42:41] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 11 ms.
[2025-05-31 05:42:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2025-05-31 05:42:41] [INFO ] Computed 33 invariants in 38 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 11, 101, 101, 3, 101, 202, 101]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-09 11 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-05-31 05:42:41] [INFO ] Invariant cache hit.
[2025-05-31 05:42:41] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-05-31 05:42:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 19 ms returned sat
[2025-05-31 05:42:42] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-05-31 05:42:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 39 ms.
[2025-05-31 05:42:42] [INFO ] Added : 2 causal constraints over 1 iterations in 106 ms. Result :sat
Minimization took 77 ms.
[2025-05-31 05:42:42] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2025-05-31 05:42:42] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-05-31 05:42:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 16 ms.
[2025-05-31 05:42:42] [INFO ] Added : 64 causal constraints over 13 iterations in 252 ms. Result :sat
Minimization took 37 ms.
[2025-05-31 05:42:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:43] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2025-05-31 05:42:43] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-31 05:42:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 14 ms.
[2025-05-31 05:42:43] [INFO ] Added : 64 causal constraints over 13 iterations in 202 ms. Result :sat
Minimization took 39 ms.
[2025-05-31 05:42:43] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2025-05-31 05:42:43] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-31 05:42:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 19 ms.
[2025-05-31 05:42:43] [INFO ] Added : 53 causal constraints over 11 iterations in 190 ms. Result :sat
Minimization took 40 ms.
[2025-05-31 05:42:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2025-05-31 05:42:43] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2025-05-31 05:42:43] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-31 05:42:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 05:42:44] [INFO ] Added : 53 causal constraints over 11 iterations in 139 ms. Result :sat
Minimization took 31 ms.
[2025-05-31 05:42:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2025-05-31 05:42:44] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-31 05:42:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2025-05-31 05:42:44] [INFO ] Added : 23 causal constraints over 5 iterations in 89 ms. Result :sat
Minimization took 31 ms.
[2025-05-31 05:42:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2025-05-31 05:42:44] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-31 05:42:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2025-05-31 05:42:44] [INFO ] Added : 23 causal constraints over 5 iterations in 82 ms. Result :sat
Minimization took 30 ms.
[2025-05-31 05:42:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2025-05-31 05:42:44] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-31 05:42:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 14 ms.
[2025-05-31 05:42:44] [INFO ] Added : 19 causal constraints over 4 iterations in 81 ms. Result :sat
Minimization took 30 ms.
[2025-05-31 05:42:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-31 05:42:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:45] [INFO ] Added : 19 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 30 ms.
[2025-05-31 05:42:45] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-31 05:42:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:45] [INFO ] Added : 44 causal constraints over 9 iterations in 151 ms. Result :sat
Minimization took 37 ms.
[2025-05-31 05:42:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-05-31 05:42:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:45] [INFO ] Added : 44 causal constraints over 9 iterations in 126 ms. Result :sat
Minimization took 35 ms.
[2025-05-31 05:42:45] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2025-05-31 05:42:45] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-05-31 05:42:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:46] [INFO ] Added : 5 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 28 ms.
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-05-31 05:42:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 18 ms.
[2025-05-31 05:42:46] [INFO ] Added : 10 causal constraints over 2 iterations in 59 ms. Result :sat
Minimization took 29 ms.
[2025-05-31 05:42:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-31 05:42:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:42:46] [INFO ] Added : 10 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 27 ms.
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-05-31 05:42:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:42:46] [INFO ] Added : 2 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 26 ms.
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2025-05-31 05:42:46] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-31 05:42:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:47] [INFO ] Added : 48 causal constraints over 10 iterations in 156 ms. Result :sat
Minimization took 36 ms.
[2025-05-31 05:42:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2025-05-31 05:42:47] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-31 05:42:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:42:47] [INFO ] Added : 48 causal constraints over 10 iterations in 136 ms. Result :sat
Minimization took 36 ms.
[2025-05-31 05:42:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2025-05-31 05:42:47] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-31 05:42:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:42:47] [INFO ] Added : 52 causal constraints over 11 iterations in 171 ms. Result :sat
Minimization took 38 ms.
[2025-05-31 05:42:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 05:42:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2025-05-31 05:42:48] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-31 05:42:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:48] [INFO ] Added : 52 causal constraints over 11 iterations in 145 ms. Result :sat
Minimization took 37 ms.
[2025-05-31 05:42:48] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-05-31 05:42:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2025-05-31 05:42:48] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-05-31 05:42:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:48] [INFO ] Added : 65 causal constraints over 13 iterations in 201 ms. Result :sat
Minimization took 40 ms.
[2025-05-31 05:42:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2025-05-31 05:42:48] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-31 05:42:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 05:42:48] [INFO ] Added : 65 causal constraints over 13 iterations in 176 ms. Result :sat
Minimization took 39 ms.
[2025-05-31 05:42:49] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-31 05:42:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:49] [INFO ] Added : 6 causal constraints over 2 iterations in 46 ms. Result :sat
Minimization took 27 ms.
[2025-05-31 05:42:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-31 05:42:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:49] [INFO ] Added : 6 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 26 ms.
[2025-05-31 05:42:49] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-31 05:42:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 16 ms.
[2025-05-31 05:42:49] [INFO ] Added : 43 causal constraints over 9 iterations in 212 ms. Result :sat
Minimization took 63 ms.
[2025-05-31 05:42:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2025-05-31 05:42:50] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-05-31 05:42:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 27 ms.
[2025-05-31 05:42:50] [INFO ] Added : 43 causal constraints over 9 iterations in 138 ms. Result :sat
Minimization took 35 ms.
[2025-05-31 05:42:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 05:42:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2025-05-31 05:42:50] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-31 05:42:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:42:50] [INFO ] Added : 42 causal constraints over 9 iterations in 163 ms. Result :sat
Minimization took 38 ms.
[2025-05-31 05:42:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:42:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-31 05:42:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 36 ms returned sat
[2025-05-31 05:42:50] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-31 05:42:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:42:50] [INFO ] Added : 42 causal constraints over 9 iterations in 126 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
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 6
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 :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 3
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
[2025-05-31 05:42:51] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 422 ms.
[2025-05-31 05:42:51] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Deduced a syphon composed of 101 places in 366 ms
Reduce places removed 122 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
// Phase 1: matrix 31114 rows 36917 cols
[2025-05-31 05:43:04] [INFO ] Computed 8803 invariants in 12380 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
RANDOM walk for 10000 steps (2 resets) in 1827 ms. (5 steps per ms)
BEST_FIRST walk for 150014 steps (30 resets) in 1543 ms. (97 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 0, 0, 100, 34, 4, 26, 46, 70, 4, 1, 0, 64, 5, 5] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
[2025-05-31 05:43:08] [INFO ] Invariant cache hit.
[2025-05-31 05:43:13] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:43:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:43:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:43:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:43:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:43:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:43:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[18, 0, 0, 100, 34, 4, 26, 46, 70, 4, 1, 0, 64, 5, 5] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 0, 0, 100, 34, 4, 26, 46, 70, 4, 1, 0, 64, 5, 5] Max Struct:[101, 12, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
Support contains 5365 out of 36917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36917/36917 places, 31114/31114 transitions.
Graph (complete) has 56168 edges and 36917 vertex of which 36493 are kept as prefixes of interest. Removing 424 places using SCC suffix rule.79 ms
Discarding 424 places :
Also discarding 107 output transitions
Drop transitions (Output transitions of discarded places.) removed 107 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 3636 places :
Implicit places reduction removed 3636 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7373 transitions
Trivial Post-agglo rules discarded 7373 transitions
Performed 7373 trivial Post agglomeration. Transition count delta: 7373
Iterating post reduction 0 with 11110 rules applied. Total rules applied 11111 place count 32857 transition count 23533
Reduce places removed 7373 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 8585 rules applied. Total rules applied 19696 place count 25484 transition count 22321
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 20908 place count 24272 transition count 22321
Performed 2929 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2929 Pre rules applied. Total rules applied 20908 place count 24272 transition count 19392
Deduced a syphon composed of 2929 places in 20 ms
Ensure Unique test removed 1818 places
Reduce places removed 4747 places and 0 transitions.
Iterating global reduction 3 with 7676 rules applied. Total rules applied 28584 place count 19525 transition count 19392
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 29190 place count 19525 transition count 18786
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 29796 place count 18919 transition count 18786
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 27 ms
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 5 with 707 rules applied. Total rules applied 30503 place count 18515 transition count 18483
Free-agglomeration rule (complex) applied 3131 times.
Iterating global reduction 5 with 3131 rules applied. Total rules applied 33634 place count 18515 transition count 15352
Ensure Unique test removed 101 places
Reduce places removed 3232 places and 0 transitions.
Iterating post reduction 5 with 3232 rules applied. Total rules applied 36866 place count 15283 transition count 15352
Discarding 2530 places :
Symmetric choice reduction at 6 with 2530 rule applications. Total rules 39396 place count 12753 transition count 12322
Iterating global reduction 6 with 2530 rules applied. Total rules applied 41926 place count 12753 transition count 12322
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 6 with 707 rules applied. Total rules applied 42633 place count 12652 transition count 11716
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 42734 place count 12551 transition count 11716
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 42734 place count 12551 transition count 11615
Deduced a syphon composed of 101 places in 12 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 42936 place count 12450 transition count 11615
Applied a total of 42936 rules in 12754 ms. Remains 12450 /36917 variables (removed 24467) and now considering 11615/31114 (removed 19499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12775 ms. Remains : 12450/36917 places, 11615/31114 transitions.
// Phase 1: matrix 11615 rows 12450 cols
[2025-05-31 05:44:36] [INFO ] Computed 2835 invariants in 846 ms
Current structural bounds on expressions (after invariants) : Max Seen:[18, 0, 0, 100, 34, 4, 26, 46, 70, 4, 1, 0, 64, 5, 5] Max Struct:[101, 3, 101, 101, 101, 202, 101, 101, 101, 101, 101, 3, 101, 202, 101]
RANDOM walk for 198049 steps (97 resets) in 30001 ms. (6 steps per ms)
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-00 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-02 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-07 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-13 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-08 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-11 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3285612 steps (10 resets) in 35011 ms. (93 steps per ms)
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-15 101 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[34, 101, 33, 20, 23] Max Struct:[101, 202, 101, 101, 202]
[2025-05-31 05:45:41] [INFO ] Invariant cache hit.
[2025-05-31 05:45:44] [INFO ] [Real]Absence check using 1 positive place invariants in 591 ms returned sat
[2025-05-31 05:45:47] [INFO ] [Real]Absence check using 1 positive and 2834 generalized place invariants in 2314 ms returned sat
[2025-05-31 05:46:07] [INFO ] [Real]Absence check using state equation in 20320 ms returned sat
[2025-05-31 05:46:09] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 1061 ms.
[2025-05-31 05:46:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:46:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 404 ms returned sat
[2025-05-31 05:46:31] [INFO ] [Nat]Absence check using 1 positive and 2834 generalized place invariants in 1638 ms returned sat
[2025-05-31 05:46:51] [INFO ] [Nat]Absence check using state equation in 20437 ms returned sat
[2025-05-31 05:46:54] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 1231 ms.
[2025-05-31 05:47: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 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 05:47:15] [INFO ] [Real]Absence check using 1 positive place invariants in 580 ms returned sat
[2025-05-31 05:47:18] [INFO ] [Real]Absence check using 1 positive and 2834 generalized place invariants in 2382 ms returned unsat
[2025-05-31 05:47:21] [INFO ] [Real]Absence check using 1 positive place invariants in 412 ms returned sat
[2025-05-31 05:47:22] [INFO ] [Real]Absence check using 1 positive and 2834 generalized place invariants in 1942 ms returned sat
[2025-05-31 05:47:44] [INFO ] [Real]Absence check using state equation in 21648 ms returned sat
[2025-05-31 05:47:47] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 1009 ms.
[2025-05-31 05:48:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:48:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 443 ms returned sat
[2025-05-31 05:48:07] [INFO ] [Nat]Absence check using 1 positive and 2834 generalized place invariants in 1964 ms returned sat
[2025-05-31 05:48:28] [INFO ] [Nat]Absence check using state equation in 20415 ms returned sat
[2025-05-31 05:48:30] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 864 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2025-05-31 05:48:51] [INFO ] [Real]Absence check using 1 positive place invariants in 492 ms returned sat
[2025-05-31 05:48:54] [INFO ] [Real]Absence check using 1 positive and 2834 generalized place invariants in 2559 ms returned sat
[2025-05-31 05:49:12] [INFO ] [Real]Absence check using state equation in 18742 ms returned sat
[2025-05-31 05:49:15] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 1062 ms.
[2025-05-31 05:49:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:49:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 411 ms returned sat
[2025-05-31 05:49:38] [INFO ] [Nat]Absence check using 1 positive and 2834 generalized place invariants in 1725 ms returned sat
[2025-05-31 05:49:58] [INFO ] [Nat]Absence check using state equation in 19878 ms returned sat
[2025-05-31 05:49:59] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 952 ms.
[2025-05-31 05:50:19] [INFO ] Added : 65 causal constraints over 13 iterations in 20137 ms.(timeout) Result :unknown
[2025-05-31 05:50:21] [INFO ] [Real]Absence check using 1 positive place invariants in 373 ms returned sat
[2025-05-31 05:50:23] [INFO ] [Real]Absence check using 1 positive and 2834 generalized place invariants in 1708 ms returned sat
[2025-05-31 05:50:41] [INFO ] [Real]Absence check using state equation in 18464 ms returned sat
[2025-05-31 05:50:44] [INFO ] Computed and/alt/rep : 9797/13433/9797 causal constraints (skipped 1717 transitions) in 1056 ms.
[2025-05-31 05:51:04] [INFO ] Added : 55 causal constraints over 11 iterations in 20692 ms.(timeout) Result :sat
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[34, 101, 33, 20, 23] Max Struct:[101, 101, 101, 101, 202]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-05 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[36, 33, 23, 24] Max Struct:[101, 101, 101, 202]
Support contains 1414 out of 12450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12450/12450 places, 11615/11615 transitions.
Graph (complete) has 22840 edges and 12450 vertex of which 11526 are kept as prefixes of interest. Removing 924 places using SCC suffix rule.7 ms
Discarding 924 places :
Also discarding 707 output transitions
Drop transitions (Output transitions of discarded places.) removed 707 transitions
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3333 transitions
Trivial Post-agglo rules discarded 3333 transitions
Performed 3333 trivial Post agglomeration. Transition count delta: 3333
Iterating post reduction 0 with 5555 rules applied. Total rules applied 5556 place count 9304 transition count 7575
Reduce places removed 3333 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 4444 rules applied. Total rules applied 10000 place count 5971 transition count 6464
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 11111 place count 4860 transition count 6464
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 11111 place count 4860 transition count 6262
Deduced a syphon composed of 202 places in 5 ms
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 3 with 505 rules applied. Total rules applied 11616 place count 4557 transition count 6262
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 11717 place count 4456 transition count 6262
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 11727 place count 4446 transition count 5252
Iterating global reduction 4 with 10 rules applied. Total rules applied 11737 place count 4446 transition count 5252
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 11939 place count 4345 transition count 5151
Free-agglomeration rule (complex) applied 1212 times.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 13151 place count 4345 transition count 3939
Ensure Unique test removed 101 places
Reduce places removed 1313 places and 0 transitions.
Iterating post reduction 4 with 1313 rules applied. Total rules applied 14464 place count 3032 transition count 3939
Applied a total of 14464 rules in 2884 ms. Remains 3032 /12450 variables (removed 9418) and now considering 3939/11615 (removed 7676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2885 ms. Remains : 3032/12450 places, 3939/11615 transitions.
// Phase 1: matrix 3939 rows 3032 cols
[2025-05-31 05:51:14] [INFO ] Computed 103 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[36, 33, 23, 24] Max Struct:[101, 101, 101, 202]
RANDOM walk for 655309 steps (720 resets) in 30001 ms. (21 steps per ms)
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-04 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-06 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1934360 steps (13 resets) in 15017 ms. (128 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 101] Max Struct:[101, 202]
[2025-05-31 05:51:59] [INFO ] Invariant cache hit.
[2025-05-31 05:51:59] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 67 ms returned sat
[2025-05-31 05:52:02] [INFO ] [Real]Absence check using state equation in 2053 ms returned sat
[2025-05-31 05:52:02] [INFO ] Computed and/alt/rep : 1414/1414/1414 causal constraints (skipped 1414 transitions) in 297 ms.
[2025-05-31 05:52:08] [INFO ] Added : 128 causal constraints over 26 iterations in 6617 ms. Result :sat
Minimization took 1477 ms.
[2025-05-31 05:52:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 05:52:11] [INFO ] [Nat]Absence check using 0 positive and 103 generalized place invariants in 76 ms returned sat
[2025-05-31 05:52:13] [INFO ] [Nat]Absence check using state equation in 2219 ms returned sat
[2025-05-31 05:52:14] [INFO ] Computed and/alt/rep : 1414/1414/1414 causal constraints (skipped 1414 transitions) in 376 ms.
[2025-05-31 05:52:21] [INFO ] Added : 128 causal constraints over 26 iterations in 7148 ms. Result :sat
Minimization took 1462 ms.
[2025-05-31 05:52:23] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 73 ms returned sat
[2025-05-31 05:52:25] [INFO ] [Real]Absence check using state equation in 2568 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[33, 101] Max Struct:[101, 101]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-14 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[101]
Support contains 101 out of 3032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3032/3032 places, 3939/3939 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1212 transitions
Trivial Post-agglo rules discarded 1212 transitions
Performed 1212 trivial Post agglomeration. Transition count delta: 1212
Iterating post reduction 0 with 1212 rules applied. Total rules applied 1212 place count 3032 transition count 2727
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 1 with 1212 rules applied. Total rules applied 2424 place count 1820 transition count 2727
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 2424 place count 1820 transition count 2626
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 2626 place count 1719 transition count 2626
Discarding 1010 places :
Symmetric choice reduction at 2 with 1010 rule applications. Total rules 3636 place count 709 transition count 1616
Ensure Unique test removed 101 places
Iterating global reduction 2 with 1111 rules applied. Total rules applied 4747 place count 608 transition count 1616
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 2 with 1111 rules applied. Total rules applied 5858 place count 608 transition count 505
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 5959 place count 507 transition count 505
Free-agglomeration rule (complex) applied 101 times.
Iterating global reduction 4 with 101 rules applied. Total rules applied 6060 place count 507 transition count 404
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 6161 place count 406 transition count 404
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 5 with 101 rules applied. Total rules applied 6262 place count 305 transition count 303
Applied a total of 6262 rules in 170 ms. Remains 305 /3032 variables (removed 2727) and now considering 303/3939 (removed 3636) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 305/3032 places, 303/3939 transitions.
// Phase 1: matrix 303 rows 305 cols
[2025-05-31 05:52:28] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[101]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-10 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (3289 resets) in 10576 ms. (94 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 05:52:38] [INFO ] Flatten gal took : 77 ms
[2025-05-31 05:52:38] [INFO ] Flatten gal took : 38 ms
[2025-05-31 05:52:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11972259616890890497.gal : 19 ms
[2025-05-31 05:52:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17532208578878143384.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11972259616890890497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17532208578878143384.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 599746 ms.

BK_STOP 1748670759010

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-L00100M0010C005P005G002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, 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 r097-smll-174860111800016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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