fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for FamilyReunion-COL-L00010M0001C001P001G001

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
365.115 41645.00 53820.00 245.50 11 11 2 11 11 11 2 11 2 11 11 11 2 11 11 11 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679435599939

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 21:53:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 21:53:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:53:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-21 21:53:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 21:53:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2023-03-21 21:53:22] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2023-03-21 21:53:22] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-21 21:53:22] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 4 ms.
[2023-03-21 21:53:22] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2023-03-21 21:53:22] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-21 21:53:22] [INFO ] Invariant cache hit.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-21 21:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-21 21:53:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-21 21:53:22] [INFO ] Added : 10 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 21:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 21:53:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 21:53:22] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 7 ms.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 21:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-21 21:53:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:22] [INFO ] Added : 64 causal constraints over 13 iterations in 86 ms. Result :sat
Minimization took 15 ms.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-21 21:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 21:53:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 21:53:23] [INFO ] Added : 55 causal constraints over 11 iterations in 76 ms. Result :sat
Minimization took 14 ms.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 21:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-21 21:53:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 21:53:23] [INFO ] Added : 22 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 21:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-21 21:53:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:23] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 8 ms.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 21:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 21:53:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 21:53:23] [INFO ] Added : 65 causal constraints over 13 iterations in 80 ms. Result :sat
Minimization took 16 ms.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 21:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-21 21:53:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 21:53:23] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 21:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 21:53:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:24] [INFO ] Added : 58 causal constraints over 12 iterations in 72 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:24] [INFO ] Added : 55 causal constraints over 11 iterations in 66 ms. Result :sat
Minimization took 12 ms.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:24] [INFO ] Added : 32 causal constraints over 7 iterations in 39 ms. Result :sat
Minimization took 12 ms.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 21:53:24] [INFO ] Added : 25 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 21:53:24] [INFO ] Added : 61 causal constraints over 13 iterations in 75 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:24] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 21:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 21:53:24] [INFO ] Added : 38 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 21:53:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 21:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 21:53:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:53:25] [INFO ] Added : 28 causal constraints over 6 iterations in 33 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [66, 11, 2, 33, 11, 11, 2, 242, 2, 11, 11, 11, 2, 11, 22, 11]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
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
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2023-03-21 21:53:25] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 48 ms.
[2023-03-21 21:53:25] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 12 ms
Reduce places removed 19 places and 0 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :83
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 11 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :44
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :28
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :26
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :23
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :12
// Phase 1: matrix 1069 rows 1360 cols
[2023-03-21 21:53:25] [INFO ] Computed 331 place invariants in 81 ms
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 63 ms returned unsat
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-21 21:53:25] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 43 ms returned unsat
[2023-03-21 21:53:26] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-21 21:53:26] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 67 ms returned sat
[2023-03-21 21:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:26] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-21 21:53:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-21 21:53:26] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 67 ms returned sat
[2023-03-21 21:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:27] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-21 21:53:27] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 52 ms.
[2023-03-21 21:53:30] [INFO ] Added : 270 causal constraints over 54 iterations in 3283 ms. Result :sat
Minimization took 288 ms.
[2023-03-21 21:53:31] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-21 21:53:31] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 60 ms returned sat
[2023-03-21 21:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:31] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-21 21:53:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-21 21:53:31] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 63 ms returned sat
[2023-03-21 21:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:32] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2023-03-21 21:53:32] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 54 ms.
[2023-03-21 21:53:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:53:36] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-21 21:53:36] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 58 ms returned sat
[2023-03-21 21:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:37] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-21 21:53:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-21 21:53:37] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 60 ms returned sat
[2023-03-21 21:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:37] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-21 21:53:37] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 55 ms.
[2023-03-21 21:53:42] [INFO ] Deduced a trap composed of 27 places in 515 ms of which 6 ms to minimize.
[2023-03-21 21:53: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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:53:42] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-21 21:53:42] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 66 ms returned sat
[2023-03-21 21:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:43] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-21 21:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-21 21:53:43] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 55 ms returned sat
[2023-03-21 21:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:44] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2023-03-21 21:53:44] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 60 ms.
[2023-03-21 21:53:48] [INFO ] Deduced a trap composed of 27 places in 468 ms of which 1 ms to minimize.
[2023-03-21 21:53:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:53:49] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-21 21:53:49] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 58 ms returned sat
[2023-03-21 21:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:49] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-21 21:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-21 21:53:49] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 58 ms returned sat
[2023-03-21 21:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:50] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-21 21:53:50] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 46 ms.
[2023-03-21 21:53:55] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 2 ms to minimize.
[2023-03-21 21:53:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [11, 11, 242, 11, 11, 22, 11] Max seen :[11, 11, 5, 9, 5, 4, 4]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 77 out of 1360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Graph (complete) has 1951 edges and 1360 vertex of which 1183 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.5 ms
Discarding 177 places :
Also discarding 123 output transitions
Drop transitions removed 123 transitions
Discarding 165 places :
Implicit places reduction removed 165 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 561 rules applied. Total rules applied 562 place count 1018 transition count 550
Reduce places removed 396 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 440 rules applied. Total rules applied 1002 place count 622 transition count 506
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 1046 place count 578 transition count 506
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 1046 place count 578 transition count 396
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 1299 place count 435 transition count 396
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 44 rules applied. Total rules applied 1343 place count 402 transition count 385
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1354 place count 391 transition count 385
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1354 place count 391 transition count 374
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1376 place count 380 transition count 374
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1420 place count 336 transition count 330
Iterating global reduction 5 with 44 rules applied. Total rules applied 1464 place count 336 transition count 330
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 11 rules applied. Total rules applied 1475 place count 336 transition count 319
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1486 place count 325 transition count 319
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1486 place count 325 transition count 308
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1508 place count 314 transition count 308
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1510 place count 312 transition count 286
Iterating global reduction 7 with 2 rules applied. Total rules applied 1512 place count 312 transition count 286
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 33 rules applied. Total rules applied 1545 place count 290 transition count 275
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1556 place count 279 transition count 275
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1556 place count 279 transition count 264
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1578 place count 268 transition count 264
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1622 place count 246 transition count 242
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1666 place count 246 transition count 198
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 9 with 44 rules applied. Total rules applied 1710 place count 202 transition count 198
Applied a total of 1710 rules in 146 ms. Remains 202 /1360 variables (removed 1158) and now considering 198/1069 (removed 871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 202/1360 places, 198/1069 transitions.
// Phase 1: matrix 198 rows 202 cols
[2023-03-21 21:53:55] [INFO ] Computed 26 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 8064 resets, run finished after 2547 ms. (steps per millisecond=392 ) properties (out of 5) seen :44
Incomplete Best-First random walk after 1000001 steps, including 904 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 5) seen :23
Incomplete Best-First random walk after 1000001 steps, including 609 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 5) seen :44
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 681 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 4) seen :34
Incomplete Best-First random walk after 1000001 steps, including 573 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 4) seen :23
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-21 21:54:00] [INFO ] Invariant cache hit.
[2023-03-21 21:54:00] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-21 21:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:54:00] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2023-03-21 21:54:00] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-21 21:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:54:00] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-21 21:54:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:54:00] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-21 21:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:54:00] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-21 21:54:00] [INFO ] Computed and/alt/rep : 143/220/143 causal constraints (skipped 33 transitions) in 9 ms.
[2023-03-21 21:54:00] [INFO ] Added : 61 causal constraints over 13 iterations in 167 ms. Result :sat
Minimization took 38 ms.
[2023-03-21 21:54:00] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-21 21:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:54:00] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [11, 11, 11] Max seen :[11, 9, 11]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 39446 ms.
ITS solved all properties within timeout

BK_STOP 1679435641584

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, 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 r171-tall-167838858400301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-L00010M0001C001P001G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;