About the Execution of LTSMin+red for FamilyReunion-COL-L08000M0800C400P400G200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16190.911 | 45316.00 | 106776.00 | 666.20 | ? ? ? ? ? ? ? ? 2 401 ? ? ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r492-smll-171636267000469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FamilyReunion-COL-L08000M0800C400P400G200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636267000469
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Apr 11 20:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 11 20:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 20:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 20:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 20:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 20:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 661K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717274807916
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-L08000M0800C400P400G200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:46:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 20:46:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:46:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 20:46:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 20:46:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1931 ms
[2024-06-01 20:46:54] [INFO ] Detected 5 constant HL places corresponding to 2006 PT places.
[2024-06-01 20:46:54] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 200760109 PT places and 1.9257647E8 transition bindings in 1788 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2024-06-01 20:46:54] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 148 ms.
[2024-06-01 20:46:54] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2024-06-01 20:46:54] [INFO ] Computed 33 invariants in 28 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 401, 0, 0, 0, 0, 0, 0] Max Struct:[8001, 8001, 8001, 8001, 8001, 32004, 8001, 8001, 2, 401, 16002, 8001, 192024, 8001, 603, 8001]
FORMULA FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-09 401 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 20:46:54] [INFO ] Invariant cache hit.
[2024-06-01 20:46:54] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-06-01 20:46:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 25 ms returned sat
[2024-06-01 20:46:54] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 20:46:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 20:46:55] [INFO ] Added : 19 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 20:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:46:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-06-01 20:46:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 20:46:55] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 20:46:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 20:46:55] [INFO ] Added : 19 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 20:46:55] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2024-06-01 20:46:55] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 20:46:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 20:46:55] [INFO ] Added : 11 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 20:46:55] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 20:46:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 20:46:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 20:46:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 20:46:56] [INFO ] Added : 32 causal constraints over 7 iterations in 115 ms. Result :sat
Minimization took 40 ms.
[2024-06-01 20:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:46:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2024-06-01 20:46:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 20:46:56] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 20:46:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 20:46:56] [INFO ] Added : 32 causal constraints over 7 iterations in 96 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 20:46:56] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 20:46:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2024-06-01 20:46:56] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 20:46:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:46:56] [INFO ] Added : 25 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 20:46:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2024-06-01 20:46:56] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 20:46:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 20:46:57] [INFO ] Added : 64 causal constraints over 13 iterations in 224 ms. Result :sat
Minimization took 42 ms.
[2024-06-01 20:46:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:46:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:57] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 20:46:57] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 20:46:57] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:46:57] [INFO ] Added : 64 causal constraints over 13 iterations in 159 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 20:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:57] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 20:46:57] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 20:46:57] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:46:57] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 20:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:57] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 20:46:57] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 20:46:57] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 39 ms.
[2024-06-01 20:46:57] [INFO ] Added : 18 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 20:46:58] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:46:58] [INFO ] Added : 30 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-01 20:46:58] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 20:46:58] [INFO ] Added : 44 causal constraints over 9 iterations in 134 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 20:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 20:46:58] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 20:46:58] [INFO ] Added : 44 causal constraints over 9 iterations in 127 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 20:46:58] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 20:46:59] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:46:59] [INFO ] Added : 36 causal constraints over 8 iterations in 124 ms. Result :sat
Minimization took 41 ms.
[2024-06-01 20:46:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:59] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 20:46:59] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 20:46:59] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:46:59] [INFO ] Added : 36 causal constraints over 8 iterations in 113 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 20:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:59] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 20:46:59] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 20:46:59] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 20:46:59] [INFO ] Added : 4 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 20:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:46:59] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2024-06-01 20:46:59] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 20:46:59] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 20:46:59] [INFO ] Added : 42 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 20:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:47:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 20:47:00] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 20:47:00] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 20:47:00] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 20:47:00] [INFO ] Added : 42 causal constraints over 9 iterations in 109 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 20:47:00] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 20:47:00] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 20:47:00] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 20:47:00] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:47:00] [INFO ] Added : 60 causal constraints over 12 iterations in 183 ms. Result :sat
Minimization took 39 ms.
[2024-06-01 20:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:47:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:47:00] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2024-06-01 20:47:00] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 20:47:00] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 20:47:00] [INFO ] Added : 60 causal constraints over 12 iterations in 166 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 20:47:01] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 20:47:01] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-06-01 20:47:01] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 20:47:01] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 20:47:01] [INFO ] Added : 2 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8001, 8001, 8001, 8001, 8001, 32004, 8001, 8001, 16002, 8001, 192024, 8001, 603, 8001]
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 401
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 201
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
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-00
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-01
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-02
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-03
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-04
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-05
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-06
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-07
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-08
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-09
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-10
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-11
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-12
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-13
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-14
Could not compute solution for formula : FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-15
BK_STOP 1717274853232
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-00
ub formula formula --maxsum=/tmp/562/ub_0_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-01
ub formula formula --maxsum=/tmp/562/ub_1_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-02
ub formula formula --maxsum=/tmp/562/ub_2_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-03
ub formula formula --maxsum=/tmp/562/ub_3_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-04
ub formula formula --maxsum=/tmp/562/ub_4_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-05
ub formula formula --maxsum=/tmp/562/ub_5_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-06
ub formula formula --maxsum=/tmp/562/ub_6_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-07
ub formula formula --maxsum=/tmp/562/ub_7_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-08
ub formula formula --maxsum=/tmp/562/ub_8_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-09
ub formula formula --maxsum=/tmp/562/ub_9_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-10
ub formula formula --maxsum=/tmp/562/ub_10_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-11
ub formula formula --maxsum=/tmp/562/ub_11_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-12
ub formula formula --maxsum=/tmp/562/ub_12_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-13
ub formula formula --maxsum=/tmp/562/ub_13_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-14
ub formula formula --maxsum=/tmp/562/ub_14_
ub formula name FamilyReunion-COL-L08000M0800C400P400G200-UpperBounds-15
ub formula formula --maxsum=/tmp/562/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-L08000M0800C400P400G200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-L08000M0800C400P400G200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636267000469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L08000M0800C400P400G200.tgz
mv FamilyReunion-COL-L08000M0800C400P400G200 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;