About the Execution of LTSMin+red for FamilyReunion-COL-L00020M0002C001P001G001
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266800397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266800397
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.6K Apr 11 20:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 20:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 20:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 135K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717243241704
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:00:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 12:00:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:00:44] [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.
[2024-06-01 12:00:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 12:00:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1512 ms
[2024-06-01 12:00:46] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2024-06-01 12:00:46] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 63 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2024-06-01 12:00:46] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 10 ms.
[2024-06-01 12:00:46] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2024-06-01 12:00:46] [INFO ] Computed 33 invariants in 33 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 8, 21, 21]
[2024-06-01 12:00:46] [INFO ] Invariant cache hit.
[2024-06-01 12:00:46] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-06-01 12:00:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 27 ms returned sat
[2024-06-01 12:00:46] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-01 12:00:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 12:00:47] [INFO ] Added : 14 causal constraints over 3 iterations in 112 ms. Result :sat
Minimization took 46 ms.
[2024-06-01 12:00:47] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-06-01 12:00:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 12:00:47] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-01 12:00:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 12:00:47] [INFO ] Added : 55 causal constraints over 11 iterations in 219 ms. Result :sat
Minimization took 40 ms.
[2024-06-01 12:00:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 12:00:47] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-01 12:00:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 12:00:47] [INFO ] Added : 55 causal constraints over 11 iterations in 186 ms. Result :sat
Minimization took 40 ms.
[2024-06-01 12:00:48] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2024-06-01 12:00:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 153 ms returned sat
[2024-06-01 12:00:48] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 12:00:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 12:00:48] [INFO ] Added : 16 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 12:00:48] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2024-06-01 12:00:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 12:00:48] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-01 12:00:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 12:00:48] [INFO ] Added : 39 causal constraints over 8 iterations in 134 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 12:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 12:00:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 12:00:49] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 12:00:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:00:49] [INFO ] Added : 39 causal constraints over 8 iterations in 118 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 12:00:49] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-06-01 12:00:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 12:00:49] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 12:00:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:00:49] [INFO ] Added : 24 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 12:00:49] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 21 ms returned sat
[2024-06-01 12:00:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 12:00:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 12:00:49] [INFO ] Added : 46 causal constraints over 10 iterations in 172 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 12:00:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 12:00:50] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 12:00:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 12:00:50] [INFO ] Added : 46 causal constraints over 10 iterations in 134 ms. Result :sat
Minimization took 39 ms.
[2024-06-01 12:00:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 19 ms returned sat
[2024-06-01 12:00:50] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 12:00:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 12:00:50] [INFO ] Added : 60 causal constraints over 12 iterations in 205 ms. Result :sat
Minimization took 39 ms.
[2024-06-01 12:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2024-06-01 12:00:50] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 12:00:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 12:00:50] [INFO ] Added : 60 causal constraints over 12 iterations in 162 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:00:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 12:00:51] [INFO ] Added : 14 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 12:00:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 12:00:51] [INFO ] Added : 57 causal constraints over 12 iterations in 205 ms. Result :sat
Minimization took 46 ms.
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 12:00:51] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:00:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 12:00:51] [INFO ] Added : 43 causal constraints over 9 iterations in 138 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 12:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 12:00:52] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 12:00:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 12:00:52] [INFO ] Added : 43 causal constraints over 9 iterations in 129 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 12:00:52] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 12:00:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 25 ms returned sat
[2024-06-01 12:00:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 12:00:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:00:52] [INFO ] Added : 43 causal constraints over 9 iterations in 141 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 12:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 12:00:52] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 12:00:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 12:00:53] [INFO ] Added : 43 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 12:00:53] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 12:00:53] [INFO ] Added : 48 causal constraints over 10 iterations in 168 ms. Result :sat
Minimization took 41 ms.
[2024-06-01 12:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 12:00:53] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 12:00:53] [INFO ] Added : 48 causal constraints over 10 iterations in 145 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 12:00:53] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 12:00:54] [INFO ] Added : 28 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 12:00:54] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 12:00:54] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 12:00:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:00:54] [INFO ] Added : 64 causal constraints over 13 iterations in 219 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 12:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2024-06-01 12:00:54] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:00:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:00:54] [INFO ] Added : 64 causal constraints over 13 iterations in 144 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 12:00:54] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 12:00:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 12:00:54] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 12:00:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 12:00:55] [INFO ] Added : 64 causal constraints over 13 iterations in 196 ms. Result :sat
Minimization took 40 ms.
[2024-06-01 12:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 12:00:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2024-06-01 12:00:55] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 12:00:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 12:00:55] [INFO ] Added : 64 causal constraints over 13 iterations in 146 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 12:00:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 12:00:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2024-06-01 12:00:55] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 12:00:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 12:00:55] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 18 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, 0] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 8, 21, 21]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2024-06-01 12:00:55] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 130 ms.
[2024-06-01 12:00:55] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 21 places in 50 ms
Reduce places removed 30 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, 0] Max Struct:[+inf, +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, 0] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 8, 21, 21]
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, 0] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 8, 21, 21]
// Phase 1: matrix 2438 rows 3065 cols
[2024-06-01 12:00:56] [INFO ] Computed 747 invariants in 297 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, 0] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 8, 21, 21]
RANDOM walk for 10000 steps (8 resets) in 318 ms. (31 steps per ms)
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-14 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150013 steps (30 resets) in 384 ms. (389 steps per ms)
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 6, 4, 7, 6, 1, 12, 1, 6, 5, 4, 7, 2] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 8]
[2024-06-01 12:00:56] [INFO ] Invariant cache hit.
[2024-06-01 12:00:57] [INFO ] [Real]Absence check using 26 positive place invariants in 94 ms returned sat
[2024-06-01 12:00:58] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 510 ms returned sat
[2024-06-01 12:01:00] [INFO ] [Real]Absence check using state equation in 2473 ms returned sat
[2024-06-01 12:01:01] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 327 ms.
[2024-06-01 12:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:01:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 90 ms returned sat
[2024-06-01 12:01:03] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 497 ms returned sat
[2024-06-01 12:01:05] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2024-06-01 12:01:05] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 226 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-01 12:01:07] [INFO ] [Real]Absence check using 26 positive place invariants in 87 ms returned sat
[2024-06-01 12:01:08] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 509 ms returned sat
[2024-06-01 12:01:10] [INFO ] [Real]Absence check using state equation in 2462 ms returned sat
[2024-06-01 12:01:11] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 316 ms.
[2024-06-01 12:01: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
[2024-06-01 12:01:12] [INFO ] [Real]Absence check using 26 positive place invariants in 56 ms returned sat
[2024-06-01 12:01:13] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 320 ms returned sat
[2024-06-01 12:01:15] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2024-06-01 12:01:15] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 200 ms.
[2024-06-01 12:01:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
[2024-06-01 12:01:17] [INFO ] [Real]Absence check using 26 positive place invariants in 55 ms returned sat
[2024-06-01 12:01:18] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 312 ms returned sat
[2024-06-01 12:01:20] [INFO ] [Real]Absence check using state equation in 1879 ms returned sat
[2024-06-01 12:01:20] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 307 ms.
[2024-06-01 12:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:01:23] [INFO ] [Nat]Absence check using 26 positive place invariants in 53 ms returned sat
[2024-06-01 12:01:23] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 346 ms returned sat
[2024-06-01 12:01:25] [INFO ] [Nat]Absence check using state equation in 2297 ms returned sat
[2024-06-01 12:01:26] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 297 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 12:01:28] [INFO ] [Real]Absence check using 26 positive place invariants in 57 ms returned sat
[2024-06-01 12:01:28] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 408 ms returned sat
[2024-06-01 12:01:30] [INFO ] [Real]Absence check using state equation in 2201 ms returned sat
[2024-06-01 12:01:31] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 263 ms.
[2024-06-01 12:01:32] [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.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: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)
[2024-06-01 12:01:33] [INFO ] [Real]Absence check using 26 positive place invariants in 79 ms returned sat
[2024-06-01 12:01:33] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 442 ms returned sat
[2024-06-01 12:01:35] [INFO ] [Real]Absence check using state equation in 1968 ms returned sat
[2024-06-01 12:01:36] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 283 ms.
[2024-06-01 12:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:01:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 58 ms returned sat
[2024-06-01 12:01:38] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 403 ms returned sat
[2024-06-01 12:01:40] [INFO ] [Nat]Absence check using state equation in 2052 ms returned sat
[2024-06-01 12:01:40] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 260 ms.
[2024-06-01 12:01:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2024-06-01 12:01:43] [INFO ] [Real]Absence check using 26 positive place invariants in 86 ms returned sat
[2024-06-01 12:01:43] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 395 ms returned sat
[2024-06-01 12:01:45] [INFO ] [Real]Absence check using state equation in 1716 ms returned sat
[2024-06-01 12:01:45] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 179 ms.
[2024-06-01 12:01:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:01:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 95 ms returned sat
[2024-06-01 12:01:48] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 457 ms returned sat
[2024-06-01 12:01:50] [INFO ] [Nat]Absence check using state equation in 2019 ms returned sat
[2024-06-01 12:01:51] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 284 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 12:01:53] [INFO ] [Real]Absence check using 26 positive place invariants in 58 ms returned sat
[2024-06-01 12:01:53] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 383 ms returned sat
[2024-06-01 12:01:55] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2024-06-01 12:01:56] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 226 ms.
[2024-06-01 12:01:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
[2024-06-01 12:01:58] [INFO ] [Real]Absence check using 26 positive place invariants in 59 ms returned sat
[2024-06-01 12:01:58] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 340 ms returned sat
[2024-06-01 12:02:01] [INFO ] [Real]Absence check using state equation in 2296 ms returned sat
[2024-06-01 12:02:01] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 307 ms.
[2024-06-01 12:02:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:02:03] [INFO ] [Nat]Absence check using 26 positive place invariants in 83 ms returned sat
[2024-06-01 12:02:03] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 350 ms returned sat
[2024-06-01 12:02:05] [INFO ] [Nat]Absence check using state equation in 1959 ms returned sat
[2024-06-01 12:02:06] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 207 ms.
[2024-06-01 12:02:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2024-06-01 12:02:08] [INFO ] [Real]Absence check using 26 positive place invariants in 56 ms returned sat
[2024-06-01 12:02:08] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 343 ms returned sat
[2024-06-01 12:02:10] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2024-06-01 12:02:11] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 258 ms.
[2024-06-01 12:02: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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
[2024-06-01 12:02:13] [INFO ] [Real]Absence check using 26 positive place invariants in 53 ms returned sat
[2024-06-01 12:02:13] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 341 ms returned sat
[2024-06-01 12:02:16] [INFO ] [Real]Absence check using state equation in 2198 ms returned sat
[2024-06-01 12:02:16] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 298 ms.
[2024-06-01 12:02:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
[2024-06-01 12:02:18] [INFO ] [Real]Absence check using 26 positive place invariants in 80 ms returned sat
[2024-06-01 12:02:19] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 491 ms returned sat
[2024-06-01 12:02:21] [INFO ] [Real]Absence check using state equation in 2032 ms returned sat
[2024-06-01 12:02:21] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 279 ms.
[2024-06-01 12:02:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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)
[2024-06-01 12:02:23] [INFO ] [Real]Absence check using 26 positive place invariants in 83 ms returned sat
[2024-06-01 12:02:24] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 296 ms returned sat
[2024-06-01 12:02:26] [INFO ] [Real]Absence check using state equation in 2217 ms returned sat
[2024-06-01 12:02:26] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 175 ms.
[2024-06-01 12:02:28] [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 12
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: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)
[2024-06-01 12:02:28] [INFO ] [Real]Absence check using 26 positive place invariants in 85 ms returned sat
[2024-06-01 12:02:29] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 272 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 6, 4, 7, 6, 1, 12, 1, 6, 5, 4, 7, 2] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21, 2]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 6, 4, 7, 6, 1, 12, 1, 6, 5, 4, 7] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21]
Support contains 297 out of 3065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Graph (complete) has 4456 edges and 3065 vertex of which 2843 are kept as prefixes of interest. Removing 222 places using SCC suffix rule.15 ms
Discarding 222 places :
Also discarding 149 output transitions
Drop transitions (Output transitions of discarded places.) removed 149 transitions
Discarding 462 places :
Implicit places reduction removed 462 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 945 transitions
Trivial Post-agglo rules discarded 945 transitions
Performed 945 trivial Post agglomeration. Transition count delta: 945
Iterating post reduction 0 with 1407 rules applied. Total rules applied 1408 place count 2381 transition count 1344
Reduce places removed 945 places and 0 transitions.
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Iterating post reduction 1 with 1050 rules applied. Total rules applied 2458 place count 1436 transition count 1239
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 2 with 105 rules applied. Total rules applied 2563 place count 1331 transition count 1239
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 2563 place count 1331 transition count 1092
Deduced a syphon composed of 147 places in 2 ms
Ensure Unique test removed 42 places
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 2899 place count 1142 transition count 1092
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 63 rules applied. Total rules applied 2962 place count 1121 transition count 1050
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3004 place count 1079 transition count 1050
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3004 place count 1079 transition count 1029
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3046 place count 1058 transition count 1029
Discarding 84 places :
Symmetric choice reduction at 5 with 84 rule applications. Total rules 3130 place count 974 transition count 945
Iterating global reduction 5 with 84 rules applied. Total rules applied 3214 place count 974 transition count 945
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 63 Pre rules applied. Total rules applied 3214 place count 974 transition count 882
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 3340 place count 911 transition count 882
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3341 place count 910 transition count 861
Iterating global reduction 5 with 1 rules applied. Total rules applied 3342 place count 910 transition count 861
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 5 with 84 rules applied. Total rules applied 3426 place count 868 transition count 819
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3447 place count 847 transition count 819
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3489 place count 826 transition count 798
Free-agglomeration rule (complex) applied 105 times.
Iterating global reduction 7 with 105 rules applied. Total rules applied 3594 place count 826 transition count 693
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 7 with 105 rules applied. Total rules applied 3699 place count 721 transition count 693
Applied a total of 3699 rules in 834 ms. Remains 721 /3065 variables (removed 2344) and now considering 693/2438 (removed 1745) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 721/3065 places, 693/2438 transitions.
// Phase 1: matrix 693 rows 721 cols
[2024-06-01 12:02:29] [INFO ] Computed 110 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 6, 4, 7, 6, 1, 12, 1, 6, 5, 4, 7] Max Struct:[84, 21, 21, 42, 21, 42, 6, 21, 6, 42, 42, 21, 21]
RANDOM walk for 1000000 steps (2222 resets) in 8729 ms. (114 steps per ms)
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-02 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-11 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000009 steps (1016 resets) in 14538 ms. (619 steps per ms)
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-12 21 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[21, 10, 21, 2, 2, 21, 21] Max Struct:[84, 42, 42, 6, 6, 42, 42]
[2024-06-01 12:02:53] [INFO ] Invariant cache hit.
[2024-06-01 12:02:53] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 65 ms returned sat
[2024-06-01 12:02:53] [INFO ] [Real]Absence check using state equation in 271 ms returned unsat
[2024-06-01 12:02:53] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 69 ms returned sat
[2024-06-01 12:02:54] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2024-06-01 12:02:54] [INFO ] Computed and/alt/rep : 504/861/504 causal constraints (skipped 126 transitions) in 79 ms.
[2024-06-01 12:02:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:02:55] [INFO ] [Nat]Absence check using 0 positive and 110 generalized place invariants in 68 ms returned sat
[2024-06-01 12:02:55] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2024-06-01 12:02:56] [INFO ] Computed and/alt/rep : 504/861/504 causal constraints (skipped 126 transitions) in 73 ms.
[2024-06-01 12:02:59] [INFO ] Added : 225 causal constraints over 45 iterations in 3079 ms. Result :sat
Minimization took 1216 ms.
[2024-06-01 12:03:00] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 64 ms returned sat
[2024-06-01 12:03:00] [INFO ] [Real]Absence check using state equation in 244 ms returned unsat
[2024-06-01 12:03:01] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 53 ms returned sat
[2024-06-01 12:03:01] [INFO ] [Real]Absence check using state equation in 231 ms returned unsat
[2024-06-01 12:03:01] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 41 ms returned sat
[2024-06-01 12:03:01] [INFO ] [Real]Absence check using state equation in 218 ms returned unsat
[2024-06-01 12:03:01] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 55 ms returned sat
[2024-06-01 12:03:02] [INFO ] [Real]Absence check using state equation in 269 ms returned unsat
[2024-06-01 12:03:02] [INFO ] [Real]Absence check using 0 positive and 110 generalized place invariants in 68 ms returned sat
[2024-06-01 12:03:02] [INFO ] [Real]Absence check using state equation in 277 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21, 10, 21, 2, 2, 21, 21] Max Struct:[21, 42, 21, 2, 2, 21, 21]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-10 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[42]
Support contains 21 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 693/693 transitions.
Graph (complete) has 1198 edges and 721 vertex of which 382 are kept as prefixes of interest. Removing 339 places using SCC suffix rule.1 ms
Discarding 339 places :
Also discarding 273 output transitions
Drop transitions (Output transitions of discarded places.) removed 273 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 382 transition count 336
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 298 transition count 336
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 169 place count 298 transition count 315
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 211 place count 277 transition count 315
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 255 place count 233 transition count 231
Iterating global reduction 2 with 44 rules applied. Total rules applied 299 place count 233 transition count 231
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 42 rules applied. Total rules applied 341 place count 212 transition count 210
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 362 place count 191 transition count 210
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 362 place count 191 transition count 189
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 404 place count 170 transition count 189
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 446 place count 128 transition count 147
Ensure Unique test removed 21 places
Iterating global reduction 4 with 63 rules applied. Total rules applied 509 place count 107 transition count 147
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 63 rules applied. Total rules applied 572 place count 107 transition count 84
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 593 place count 86 transition count 84
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 614 place count 65 transition count 63
Applied a total of 614 rules in 34 ms. Remains 65 /721 variables (removed 656) and now considering 63/693 (removed 630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 65/721 places, 63/693 transitions.
// Phase 1: matrix 63 rows 65 cols
[2024-06-01 12:03:02] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21] Max Struct:[42]
RANDOM walk for 1000000 steps (15625 resets) in 2347 ms. (425 steps per ms)
BEST_FIRST walk for 1000001 steps (850 resets) in 970 ms. (1029 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21] Max Struct:[42]
[2024-06-01 12:03:06] [INFO ] Invariant cache hit.
[2024-06-01 12:03:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:03:06] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[21]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 142018 ms.
ITS solved all properties within timeout
BK_STOP 1717243386392
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266800397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;