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.r170-tall-167838857100341.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 marciexred
Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857100341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K Feb 27 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 27 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 22:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 22:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K 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 2.9K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 27 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 27 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 27 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 27 09:15 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 159K 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-L00400M0040C020P020G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678514210999

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00400M0040C020P020G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 05:56:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 05:56:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:56:52] [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 05:56:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 05:56:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 756 ms
[2023-03-11 05:56:53] [INFO ] Detected 5 constant HL places corresponding to 106 PT places.
[2023-03-11 05:56:53] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 538109 PT places and 508890.0 transition bindings in 234 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-11 05:56:53] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-11 05:56:53] [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 05:56:53] [INFO ] Computed 33 place invariants in 7 ms
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-UpperBounds-06 21 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-11 05:56:53] [INFO ] Invariant cache hit.
[2023-03-11 05:56:53] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 05:56:53] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 05:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:53] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-11 05:56:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-11 05:56:53] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 05:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-11 05:56:53] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 05:56:53] [INFO ] Added : 7 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 05:56:53] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 05:56:53] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 05:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-11 05:56:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-11 05:56:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-11 05:56:54] [INFO ] Added : 53 causal constraints over 11 iterations in 189 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-11 05:56:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 05:56:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 05:56:54] [INFO ] Added : 60 causal constraints over 12 iterations in 107 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 05:56:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 05:56:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-11 05:56:54] [INFO ] Added : 19 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 05:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-11 05:56:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 05:56:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-11 05:56:55] [INFO ] Added : 49 causal constraints over 10 iterations in 68 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-11 05:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 05:56:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 05:56:55] [INFO ] Added : 58 causal constraints over 12 iterations in 79 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 05:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 05:56:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 05:56:55] [INFO ] Added : 45 causal constraints over 9 iterations in 53 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 05:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 05:56:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 05:56:55] [INFO ] Added : 62 causal constraints over 13 iterations in 80 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-11 05:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 05:56:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 05:56:55] [INFO ] Added : 29 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 05:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 05:56:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 05:56:56] [INFO ] Added : 37 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 05:56:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 05:56:56] [INFO ] Added : 37 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 17 ms.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 05:56:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 05:56:56] [INFO ] Added : 17 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 05:56:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 05:56:56] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-11 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 05:56:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 05:56:56] [INFO ] Added : 56 causal constraints over 12 iterations in 66 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:56:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 05:56:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 05:56:56] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [401, 401, 33, 401, 401, 401, 401, 11, 401, 3208, 802, 401, 401, 11, 401]
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 21
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 11
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
[2023-03-11 05:56:58] [INFO ] Unfolded HLPN to a Petri net with 477829 places and 412249 transitions 1184997 arcs in 1277 ms.
[2023-03-11 05:56:58] [INFO ] Unfolded 15 HLPN properties in 8 ms.
Deduced a syphon composed of 401 places in 1311 ms
Reduce places removed 467 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20339 ms. (steps per millisecond=0 ) properties (out of 15) seen :322
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3190 ms. (steps per millisecond=3 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4247 ms. (steps per millisecond=2 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2240 ms. (steps per millisecond=4 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3683 ms. (steps per millisecond=2 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3679 ms. (steps per millisecond=2 ) properties (out of 15) seen :0
// Phase 1: matrix 412249 rows 477362 cols
[2023-03-11 05:59:42] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 05:59:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 05:59:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 05:59:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 06:00:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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) : [401, 401, 33, 401, 401, 401, 401, 11, 401, 3208, 802, 401, 401, 11, 401] Max seen :[187, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 74, 0, 59]
Support contains 78596 out of 477362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477362/477362 places, 412249/412249 transitions.
Graph (complete) has 740288 edges and 477362 vertex of which 474849 are kept as prefixes of interest. Removing 2513 places using SCC suffix rule.604 ms
Discarding 2513 places :
Also discarding 1224 output transitions
Drop transitions removed 1224 transitions
Discarding 83007 places :
Implicit places reduction removed 83007 places
Drop transitions removed 110275 transitions
Trivial Post-agglo rules discarded 110275 transitions
Performed 110275 trivial Post agglomeration. Transition count delta: 110275
Iterating post reduction 0 with 193282 rules applied. Total rules applied 193283 place count 391842 transition count 300750
Reduce places removed 110275 places and 0 transitions.
Performed 4184 Post agglomeration using F-continuation condition.
Performed 8120 Post agglomeration using F-continuation condition.
Performed 12397 Post agglomeration using F-continuation condition.
Performed 17086 Post agglomeration using F-continuation condition.
Performed 22114 Post agglomeration using F-continuation condition.
Performed 24862 Post agglomeration using F-continuation condition.Transition count delta: 24862
Iterating post reduction 1 with 135137 rules applied. Total rules applied 328420 place count 281567 transition count 275888
Reduce places removed 24862 places and 0 transitions.
Iterating post reduction 2 with 24862 rules applied. Total rules applied 353282 place count 256705 transition count 275888
Performed 28070 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28070 Pre rules applied. Total rules applied 353282 place count 256705 transition count 247818
Deduced a syphon composed of 28070 places in 381 ms
Ensure Unique test removed 9223 places
Reduce places removed 37293 places and 0 transitions.
Iterating global reduction 3 with 65363 rules applied. Total rules applied 418645 place count 219412 transition count 247818
Discarding 401 places :
Implicit places reduction removed 401 places
Iterating post reduction 3 with 401 rules applied. Total rules applied 419046 place count 219011 transition count 247818
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 401 Pre rules applied. Total rules applied 419046 place count 219011 transition count 247417
Deduced a syphon composed of 401 places in 353 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 4 with 802 rules applied. Total rules applied 419848 place count 218610 transition count 247417
Performed 1203 Post agglomeration using F-continuation condition.Transition count delta: 1203
Deduced a syphon composed of 1203 places in 229 ms
Ensure Unique test removed 401 places
Reduce places removed 1604 places and 0 transitions.
Iterating global reduction 4 with 2807 rules applied. Total rules applied 422655 place count 217006 transition count 246214
Free-agglomeration rule (complex) applied 42506 times.
Iterating global reduction 4 with 42506 rules applied. Total rules applied 465161 place count 217006 transition count 203708
Ensure Unique test removed 401 places
Reduce places removed 42907 places and 0 transitions.
Iterating post reduction 4 with 42907 rules applied. Total rules applied 508068 place count 174099 transition count 203708
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 508088 place count 174079 transition count 195688
Iterating global reduction 5 with 20 rules applied. Total rules applied 508108 place count 174079 transition count 195688
Applied a total of 508108 rules in 1036709 ms. Remains 174079 /477362 variables (removed 303283) and now considering 195688/412249 (removed 216561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036721 ms. Remains : 174079/477362 places, 195688/412249 transitions.
// Phase 1: matrix 195688 rows 174079 cols
[2023-03-11 06:20:15] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 06:20:36] [INFO ] Computed 18852 place invariants in 141355 ms
Finished random walk after 15917 steps, including 1 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 13001 steps, including 0 resets, run timeout after 5190 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 356326 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 361326 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 16001 steps, including 0 resets, run timeout after 5046 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 369326 steps, including 1 resets, run timeout after 5013 ms. (steps per millisecond=73 ) properties seen 0
Interrupted Best-First random walk after 366326 steps, including 1 resets, run timeout after 5010 ms. (steps per millisecond=73 ) properties seen 0
Interrupted Best-First random walk after 355046 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=70 ) properties seen 1
Interrupted Best-First random walk after 235549 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=46 ) properties seen 0
Interrupted Best-First random walk after 355326 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 364326 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 31443 steps, including 0 resets, run timeout after 5161 ms. (steps per millisecond=6 ) properties seen 0
Interrupted Best-First random walk after 354326 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 16001 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 355326 steps, including 1 resets, run timeout after 5012 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5127 ms. (steps per millisecond=3 ) properties seen 0
[2023-03-11 06:22:01] [INFO ] Invariant cache hit.
[2023-03-11 06:33:15] [INFO ] Computed 113113 place invariants in 2132179 ms
Current structural bounds on expressions (after SMT) : [401, 401, 33, 401, 401, 401, 401, 11, 401, 3208, 802, 401, 401, 11, 401] Max seen :[296, 54, 5, 78, 57, 390, 60, 4, 10, 115, 60, 135, 116, 7, 81]
Support contains 78596 out of 174079 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174079/174079 places, 195688/195688 transitions.
Applied a total of 0 rules in 1913 ms. Remains 174079 /174079 variables (removed 0) and now considering 195688/195688 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1913 ms. Remains : 174079/174079 places, 195688/195688 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174079/174079 places, 195688/195688 transitions.
Applied a total of 0 rules in 1749 ms. Remains 174079 /174079 variables (removed 0) and now considering 195688/195688 (removed 0) transitions.
// Phase 1: matrix 195688 rows 174079 cols
[2023-03-11 06:35:20] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 06:35:32] [INFO ] Implicit Places using invariants in 132243 ms returned []
Implicit Place search using SMT only with invariants took 132244 ms to find 0 implicit places.
// Phase 1: matrix 195688 rows 174079 cols
[2023-03-11 06:35:36] [INFO ] Computed 18852 place invariants in 136167 ms
[2023-03-11 06:37:32] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 06:37:44] [INFO ] Dead Transitions using invariants and state equation in 132537 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266578 ms. Remains : 174079/174079 places, 195688/195688 transitions.
[2023-03-11 06:37:45] [INFO ] Invariant cache hit.
[2023-03-11 06:37:45] [INFO ] Computed 18852 place invariants in 133373 ms
Finished random walk after 20611 steps, including 2 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5129 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 361326 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 364326 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 16001 steps, including 0 resets, run timeout after 5035 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 373728 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=74 ) properties seen 0
Interrupted Best-First random walk after 366326 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=73 ) properties seen 0
Interrupted Best-First random walk after 360326 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 235549 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=47 ) properties seen 0
Interrupted Best-First random walk after 358326 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 359326 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 31443 steps, including 0 resets, run timeout after 5161 ms. (steps per millisecond=6 ) properties seen 0
Interrupted Best-First random walk after 364326 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5130 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 359326 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5130 ms. (steps per millisecond=3 ) properties seen 0
[2023-03-11 06:39:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [401, 401, 33, 401, 401, 401, 401, 11, 401, 3208, 802, 401, 401, 11, 401] Max seen :[304, 54, 6, 80, 57, 390, 60, 5, 10, 120, 63, 135, 121, 7, 106]
Support contains 78596 out of 174079 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174079/174079 places, 195688/195688 transitions.
Applied a total of 0 rules in 1738 ms. Remains 174079 /174079 variables (removed 0) and now considering 195688/195688 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1739 ms. Remains : 174079/174079 places, 195688/195688 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174079/174079 places, 195688/195688 transitions.
Applied a total of 0 rules in 1741 ms. Remains 174079 /174079 variables (removed 0) and now considering 195688/195688 (removed 0) transitions.
[2023-03-11 06:50:50] [INFO ] Invariant cache hit.
[2023-03-11 06:51:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:51:02] [INFO ] Implicit Places using invariants in 12249 ms returned []
Implicit Place search using SMT only with invariants took 12250 ms to find 0 implicit places.
[2023-03-11 06:51:02] [INFO ] Invariant cache hit.
[2023-03-11 06:51:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:51:14] [INFO ] Dead Transitions using invariants and state equation in 12092 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26115 ms. Remains : 174079/174079 places, 195688/195688 transitions.
[2023-03-11 06:51:14] [INFO ] Invariant cache hit.
Finished random walk after 20692 steps, including 2 resets, run visited all 15 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5130 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 362326 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 360326 steps, including 1 resets, run timeout after 5010 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 16001 steps, including 0 resets, run timeout after 5034 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 378728 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=75 ) properties seen 0
Interrupted Best-First random walk after 362326 steps, including 1 resets, run timeout after 5013 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 364326 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 233549 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=46 ) properties seen 0
Interrupted Best-First random walk after 364326 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 360326 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 31443 steps, including 0 resets, run timeout after 5164 ms. (steps per millisecond=6 ) properties seen 0
Interrupted Best-First random walk after 360326 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5128 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 364326 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 16442 steps, including 0 resets, run timeout after 5127 ms. (steps per millisecond=3 ) properties seen 0
[2023-03-11 06:53:00] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4171112 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107916 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-L00400M0040C020P020G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is FamilyReunion-COL-L00400M0040C020P020G001, 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 r170-tall-167838857100341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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