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

About the Execution of LTSMin+red for FamilyReunion-COL-L03000M0300G150P150G075

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16178.188 161144.00 106141.00 49103.20 ? ? ? ? ? ? 3001 ? ? ? ? ? ? ? ? ? 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.r169-tall-167838855800365.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 ltsminxred
Input is FamilyReunion-COL-L03000M0300G150P150G075, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.2K Feb 26 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 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 330K 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-L03000M0300G150P150G075-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678524248833

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L03000M0300G150P150G075
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 08:44:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 08:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:44:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 08:44:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 08:44:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 895 ms
[2023-03-11 08:44:11] [INFO ] Detected 5 constant HL places corresponding to 756 PT places.
[2023-03-11 08:44:11] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 28410109 PT places and 2.721622E7 transition bindings in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-11 08:44:11] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 21 ms.
[2023-03-11 08:44:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 08:44:11] [INFO ] Computed 33 place invariants in 15 ms
FORMULA FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-06 3001 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-11 08:44:11] [INFO ] Invariant cache hit.
[2023-03-11 08:44:11] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 08:44:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-11 08:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:11] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-11 08:44:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-11 08:44:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:11] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 08:44:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 08:44:12] [INFO ] Added : 38 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 53 ms.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 08:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-11 08:44:12] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 08:44:12] [INFO ] Added : 8 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 32 ms.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-11 08:44:12] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 08:44:12] [INFO ] Added : 4 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 08:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-11 08:44:12] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-11 08:44:12] [INFO ] Added : 47 causal constraints over 10 iterations in 91 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 08:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:12] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-11 08:44:12] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:44:13] [INFO ] Added : 55 causal constraints over 11 iterations in 79 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-11 08:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:13] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:44:13] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-11 08:44:13] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 08:44:13] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-11 08:44:13] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:44:13] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-11 08:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 08:44:13] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:44:13] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:44:13] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:44:13] [INFO ] Added : 45 causal constraints over 9 iterations in 54 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:13] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:13] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:44:13] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 08:44:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:14] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:44:14] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:44:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:44:14] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 08:44:14] [INFO ] Added : 64 causal constraints over 13 iterations in 96 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:44:14] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:44:14] [INFO ] Added : 43 causal constraints over 9 iterations in 47 ms. Result :sat
Minimization took 17 ms.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:44:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:44:14] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:44:14] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 08:44:14] [INFO ] Added : 31 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [6002, 66022, 72024, 3001, 3001, 3001, 51017, 3001, 3001, 6002, 3001, 3001, 304, 6002, 33011]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 151
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 76
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
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/553/ub_0_ --maxsum=/tmp/553/ub_1_ --maxsum=/tmp/553/ub_2_ --maxsum=/tmp/553/ub_3_ --maxsum=/tmp/553/ub_4_ --maxsum=/tmp/553/ub_5_ --maxsum=/tmp/553/ub_6_ --maxsum=/tmp/553/ub_7_ --maxsum=/tmp/553/ub_8_ --maxsum=/tmp/553/ub_9_ --maxsum=/tmp/553/ub_10_ --maxsum=/tmp/553/ub_11_ --maxsum=/tmp/553/ub_12_ --maxsum=/tmp/553/ub_13_ --maxsum=/tmp/553/ub_14_ --maxsum=/tmp/553/ub_15_
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-00
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-01
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-02
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-03
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-04
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-05
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-06
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-07
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-08
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-09
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-10
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-11
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-12
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-13
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-14
Could not compute solution for formula : FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-15

BK_STOP 1678524409977

--------------------
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.202303021504.jar
+ 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
mcc2023
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-00
ub formula formula --maxsum=/tmp/553/ub_0_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-01
ub formula formula --maxsum=/tmp/553/ub_1_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-02
ub formula formula --maxsum=/tmp/553/ub_2_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-03
ub formula formula --maxsum=/tmp/553/ub_3_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-04
ub formula formula --maxsum=/tmp/553/ub_4_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-05
ub formula formula --maxsum=/tmp/553/ub_5_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-06
ub formula formula --maxsum=/tmp/553/ub_6_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-07
ub formula formula --maxsum=/tmp/553/ub_7_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-08
ub formula formula --maxsum=/tmp/553/ub_8_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-09
ub formula formula --maxsum=/tmp/553/ub_9_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-10
ub formula formula --maxsum=/tmp/553/ub_10_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-11
ub formula formula --maxsum=/tmp/553/ub_11_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-12
ub formula formula --maxsum=/tmp/553/ub_12_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-13
ub formula formula --maxsum=/tmp/553/ub_13_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-14
ub formula formula --maxsum=/tmp/553/ub_14_
ub formula name FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-15
ub formula formula --maxsum=/tmp/553/ub_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym, ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported

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-L03000M0300G150P150G075"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-L03000M0300G150P150G075, 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 r169-tall-167838855800365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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