About the Execution of LTSMin+red for FamilyReunion-COL-L00200M0020C010P010G005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2629.739 | 3600000.00 | 3825777.00 | 8016.40 | ? ? 2 ? ? 6 ? ? ? ? ? ? ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855700333.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FamilyReunion-COL-L00200M0020C010P010G005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700333
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 26 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K 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-L00200M0020C010P010G005-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678514600644
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00200M0020C010P010G005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 06:03:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 06:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:03:22] [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 06:03:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 06:03:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2023-03-11 06:03:22] [INFO ] Detected 5 constant HL places corresponding to 56 PT places.
[2023-03-11 06:03:22] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 144109 PT places and 134480.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-11 06:03:22] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2023-03-11 06:03:22] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 06:03:22] [INFO ] Computed 33 place invariants in 14 ms
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-11 06:03:22] [INFO ] Invariant cache hit.
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-11 06:03:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-11 06:03:23] [INFO ] Added : 2 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 17 ms.
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-11 06:03:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-11 06:03:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 06:03:23] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:23] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-11 06:03:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 06:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-11 06:03:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-11 06:03:23] [INFO ] Added : 34 causal constraints over 7 iterations in 90 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-11 06:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 06:03:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:24] [INFO ] Added : 47 causal constraints over 10 iterations in 99 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 06:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 06:03:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-11 06:03:24] [INFO ] Added : 64 causal constraints over 13 iterations in 91 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 06:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 06:03:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:24] [INFO ] Added : 51 causal constraints over 11 iterations in 62 ms. Result :sat
Minimization took 16 ms.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 06:03:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:24] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 06:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-11 06:03:24] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:24] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 06:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 06:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-11 06:03:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 06:03:25] [INFO ] Added : 32 causal constraints over 7 iterations in 45 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 06:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 06:03:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:25] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 06:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 06:03:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 06:03:25] [INFO ] Added : 37 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 06:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-11 06:03:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 06:03:25] [INFO ] Added : 64 causal constraints over 13 iterations in 78 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 06:03:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:25] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 06:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-11 06:03:25] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 06:03:25] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 06:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-11 06:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:26] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 06:03:26] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 06:03:26] [INFO ] Added : 49 causal constraints over 10 iterations in 59 ms. Result :sat
Minimization took 18 ms.
[2023-03-11 06:03:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:03:26] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 06:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:26] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 06:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:03:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 06:03:26] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2023-03-11 06:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:03:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 06:03:26] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 06:03:26] [INFO ] Added : 60 causal constraints over 12 iterations in 87 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 6, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18]
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 11
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 6
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 06:03:26] [INFO ] Unfolded HLPN to a Petri net with 128969 places and 110159 transitions 316597 arcs in 574 ms.
[2023-03-11 06:03:26] [INFO ] Unfolded 15 HLPN properties in 3 ms.
Deduced a syphon composed of 201 places in 371 ms
Reduce places removed 237 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5615 ms. (steps per millisecond=1 ) properties (out of 15) seen :469
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 15) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 926 ms. (steps per millisecond=10 ) properties (out of 15) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=10 ) properties (out of 15) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 15) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=11 ) properties (out of 15) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 15) seen :12
// Phase 1: matrix 110159 rows 128732 cols
[2023-03-11 06:05:40] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 06:05:45] [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 0
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:05:48] [INFO ] Computed 30573 place invariants in 128430 ms
[2023-03-11 06:05:50] [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 1
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:05:55] [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 2
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:06:00] [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:06:05] [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 4
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:06:10] [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 5
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:06:15] [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 6
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:06:20] [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 7
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:06:25] [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:06:30] [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 9
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:06:35] [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 10
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:06:40] [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:06:45] [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 12
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:06:50] [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 13
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 06:06:55] [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: Stream closed... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
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) : [201, 201, 201, 201, 6, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 81, 0, 0, 0, 0, 121, 0, 36, 0, 0, 62, 34, 0, 0]
Support contains 29146 out of 128732 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128732/128732 places, 110159/110159 transitions.
Graph (complete) has 198208 edges and 128732 vertex of which 128274 are kept as prefixes of interest. Removing 458 places using SCC suffix rule.138 ms
Discarding 458 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Discarding 21909 places :
Implicit places reduction removed 21909 places
Drop transitions removed 23115 transitions
Trivial Post-agglo rules discarded 23115 transitions
Performed 23115 trivial Post agglomeration. Transition count delta: 23115
Iterating post reduction 0 with 45024 rules applied. Total rules applied 45025 place count 106365 transition count 87033
Reduce places removed 23115 places and 0 transitions.
Performed 12663 Post agglomeration using F-continuation condition.Transition count delta: 12663
Iterating post reduction 1 with 35778 rules applied. Total rules applied 80803 place count 83250 transition count 74370
Reduce places removed 12663 places and 0 transitions.
Iterating post reduction 2 with 12663 rules applied. Total rules applied 93466 place count 70587 transition count 74370
Performed 3819 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3819 Pre rules applied. Total rules applied 93466 place count 70587 transition count 70551
Deduced a syphon composed of 3819 places in 72 ms
Ensure Unique test removed 603 places
Reduce places removed 4422 places and 0 transitions.
Iterating global reduction 3 with 8241 rules applied. Total rules applied 101707 place count 66165 transition count 70551
Discarding 2211 places :
Implicit places reduction removed 2211 places
Iterating post reduction 3 with 2211 rules applied. Total rules applied 103918 place count 63954 transition count 70551
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 103918 place count 63954 transition count 70350
Deduced a syphon composed of 201 places in 122 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 104320 place count 63753 transition count 70350
Performed 4623 Post agglomeration using F-continuation condition.Transition count delta: 4623
Deduced a syphon composed of 4623 places in 236 ms
Reduce places removed 4623 places and 0 transitions.
Iterating global reduction 4 with 9246 rules applied. Total rules applied 113566 place count 59130 transition count 65727
Free-agglomeration rule applied 2211 times.
Iterating global reduction 4 with 2211 rules applied. Total rules applied 115777 place count 59130 transition count 63516
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 117988 place count 56919 transition count 63516
Free-agglomeration rule (complex) applied 7035 times.
Iterating global reduction 5 with 7035 rules applied. Total rules applied 125023 place count 56919 transition count 56481
Ensure Unique test removed 603 places
Reduce places removed 7638 places and 0 transitions.
Iterating post reduction 5 with 7638 rules applied. Total rules applied 132661 place count 49281 transition count 56481
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 132691 place count 49251 transition count 50451
Iterating global reduction 6 with 30 rules applied. Total rules applied 132721 place count 49251 transition count 50451
Applied a total of 132721 rules in 49721 ms. Remains 49251 /128732 variables (removed 79481) and now considering 50451/110159 (removed 59708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49728 ms. Remains : 49251/128732 places, 50451/110159 transitions.
// Phase 1: matrix 50451 rows 49251 cols
[2023-03-11 06:07:51] [INFO ] Computed 4830 place invariants in 5739 ms
Finished random walk after 59406 steps, including 13 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=1 )
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 59126 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=11 ) properties seen 142
Interrupted Best-First random walk after 60834 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=12 ) properties seen 286
Interrupted Best-First random walk after 88390 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=17 ) properties seen 231
Interrupted Best-First random walk after 485395 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=97 ) properties seen 478
Interrupted Best-First random walk after 503595 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 449
Interrupted Best-First random walk after 600636 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen 174
Interrupted Best-First random walk after 99316 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=19 ) properties seen 266
Interrupted Best-First random walk after 57014 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=11 ) properties seen 155
Interrupted Best-First random walk after 99934 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=19 ) properties seen 275
Interrupted Best-First random walk after 778250 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen 480
Interrupted Best-First random walk after 64408 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=12 ) properties seen 183
Interrupted Best-First random walk after 57442 steps, including 0 resets, run timeout after 5034 ms. (steps per millisecond=11 ) properties seen 158
Interrupted Best-First random walk after 494849 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=98 ) properties seen 470
Interrupted Best-First random walk after 483771 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=96 ) properties seen 440
[2023-03-11 06:09:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 143, 36, 34, 28, 174, 40, 51, 38, 6, 71, 46, 34, 5]
Support contains 28744 out of 49251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49251/49251 places, 50451/50451 transitions.
Graph (complete) has 72564 edges and 49251 vertex of which 48447 are kept as prefixes of interest. Removing 804 places using SCC suffix rule.22 ms
Discarding 804 places :
Also discarding 603 output transitions
Drop transitions removed 603 transitions
Applied a total of 1 rules in 475 ms. Remains 48447 /49251 variables (removed 804) and now considering 49848/50451 (removed 603) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 48447/49251 places, 49848/50451 transitions.
// Phase 1: matrix 49848 rows 48447 cols
[2023-03-11 06:11:34] [INFO ] Computed 4830 place invariants in 5219 ms
Finished random walk after 62973 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 61096 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=12 ) properties seen 158
Interrupted Best-First random walk after 59562 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=11 ) properties seen 280
Interrupted Best-First random walk after 99160 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=19 ) properties seen 266
Interrupted Best-First random walk after 512273 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 448
Interrupted Best-First random walk after 485149 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=96 ) properties seen 465
Interrupted Best-First random walk after 622508 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=124 ) properties seen 174
Interrupted Best-First random walk after 99170 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=19 ) properties seen 272
Interrupted Best-First random walk after 57686 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=11 ) properties seen 164
Interrupted Best-First random walk after 100252 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=20 ) properties seen 275
Interrupted Best-First random walk after 734070 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=146 ) properties seen 477
Interrupted Best-First random walk after 58828 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=11 ) properties seen 174
Interrupted Best-First random walk after 56312 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=11 ) properties seen 162
Interrupted Best-First random walk after 514971 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 460
Interrupted Best-First random walk after 485073 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=96 ) properties seen 435
[2023-03-11 06:13:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 143, 36, 34, 32, 174, 44, 51, 38, 6, 73, 46, 34, 5]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 352 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 330 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:15:07] [INFO ] Invariant cache hit.
[2023-03-11 06:15:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:15:11] [INFO ] Implicit Places using invariants in 3586 ms returned []
Implicit Place search using SMT only with invariants took 3588 ms to find 0 implicit places.
[2023-03-11 06:15:11] [INFO ] Invariant cache hit.
[2023-03-11 06:15:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:15:15] [INFO ] Dead Transitions using invariants and state equation in 3826 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7758 ms. Remains : 48447/48447 places, 49848/49848 transitions.
[2023-03-11 06:15:15] [INFO ] Invariant cache hit.
Finished random walk after 63213 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 64528 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=12 ) properties seen 152
Interrupted Best-First random walk after 61258 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=12 ) properties seen 288
Interrupted Best-First random walk after 99062 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=19 ) properties seen 267
Interrupted Best-First random walk after 513115 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 456
Interrupted Best-First random walk after 497119 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=99 ) properties seen 470
Interrupted Best-First random walk after 629713 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 174
Interrupted Best-First random walk after 98864 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=19 ) properties seen 264
Interrupted Best-First random walk after 57248 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=11 ) properties seen 147
Interrupted Best-First random walk after 99250 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=19 ) properties seen 265
Interrupted Best-First random walk after 793136 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 474
Interrupted Best-First random walk after 65058 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=12 ) properties seen 198
Interrupted Best-First random walk after 57052 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=11 ) properties seen 145
Interrupted Best-First random walk after 506781 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=101 ) properties seen 441
Interrupted Best-First random walk after 487209 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 477
[2023-03-11 06:16:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 144, 42, 34, 32, 174, 44, 51, 40, 6, 73, 46, 34, 6]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 357 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 339 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:18:51] [INFO ] Invariant cache hit.
[2023-03-11 06:18:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:18:55] [INFO ] Implicit Places using invariants in 3637 ms returned []
Implicit Place search using SMT only with invariants took 3639 ms to find 0 implicit places.
[2023-03-11 06:18:55] [INFO ] Invariant cache hit.
[2023-03-11 06:18:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:18:58] [INFO ] Dead Transitions using invariants and state equation in 3764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7753 ms. Remains : 48447/48447 places, 49848/49848 transitions.
[2023-03-11 06:18:58] [INFO ] Invariant cache hit.
Finished random walk after 64195 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 64486 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=12 ) properties seen 139
Interrupted Best-First random walk after 61904 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=12 ) properties seen 291
Interrupted Best-First random walk after 100642 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=20 ) properties seen 249
Interrupted Best-First random walk after 519757 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 470
Interrupted Best-First random walk after 496497 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=99 ) properties seen 448
Interrupted Best-First random walk after 643601 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=128 ) properties seen 174
Interrupted Best-First random walk after 99694 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=19 ) properties seen 253
Interrupted Best-First random walk after 58412 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=11 ) properties seen 163
Interrupted Best-First random walk after 100706 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=20 ) properties seen 246
Interrupted Best-First random walk after 804362 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 488
Interrupted Best-First random walk after 66120 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=13 ) properties seen 190
Interrupted Best-First random walk after 56712 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=11 ) properties seen 167
Interrupted Best-First random walk after 492203 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 463
Interrupted Best-First random walk after 480171 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 417
[2023-03-11 06:20:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 145, 42, 34, 34, 174, 44, 54, 40, 6, 73, 46, 39, 6]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 348 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 355 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:22:33] [INFO ] Invariant cache hit.
[2023-03-11 06:22:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:22:37] [INFO ] Implicit Places using invariants in 3763 ms returned []
Implicit Place search using SMT only with invariants took 3764 ms to find 0 implicit places.
[2023-03-11 06:22:37] [INFO ] Invariant cache hit.
[2023-03-11 06:22:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:22:41] [INFO ] Dead Transitions using invariants and state equation in 3685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7817 ms. Remains : 48447/48447 places, 49848/49848 transitions.
[2023-03-11 06:22:41] [INFO ] Invariant cache hit.
Finished random walk after 63982 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 64384 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=12 ) properties seen 165
Interrupted Best-First random walk after 61682 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=12 ) properties seen 290
Interrupted Best-First random walk after 102082 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=20 ) properties seen 249
Interrupted Best-First random walk after 520621 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 465
Interrupted Best-First random walk after 496683 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 464
Interrupted Best-First random walk after 645602 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=128 ) properties seen 174
Interrupted Best-First random walk after 101130 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=20 ) properties seen 252
Interrupted Best-First random walk after 57950 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=11 ) properties seen 154
Interrupted Best-First random walk after 99224 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=19 ) properties seen 256
Interrupted Best-First random walk after 799068 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 456
Interrupted Best-First random walk after 64800 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=12 ) properties seen 180
Interrupted Best-First random walk after 56828 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=11 ) properties seen 158
Interrupted Best-First random walk after 503193 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 466
Interrupted Best-First random walk after 483217 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=96 ) properties seen 485
[2023-03-11 06:24:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 145, 42, 34, 34, 174, 44, 54, 40, 6, 73, 47, 39, 6]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 350 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 341 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:26:16] [INFO ] Invariant cache hit.
[2023-03-11 06:26:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:26:19] [INFO ] Implicit Places using invariants in 3811 ms returned []
Implicit Place search using SMT only with invariants took 3823 ms to find 0 implicit places.
[2023-03-11 06:26:20] [INFO ] Invariant cache hit.
[2023-03-11 06:26:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:26:23] [INFO ] Dead Transitions using invariants and state equation in 3838 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8013 ms. Remains : 48447/48447 places, 49848/49848 transitions.
[2023-03-11 06:26:23] [INFO ] Invariant cache hit.
Finished random walk after 63711 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 65216 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=12 ) properties seen 162
Interrupted Best-First random walk after 61904 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=12 ) properties seen 291
Interrupted Best-First random walk after 99340 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=19 ) properties seen 282
Interrupted Best-First random walk after 515083 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 471
Interrupted Best-First random walk after 491899 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 466
Interrupted Best-First random walk after 637618 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=127 ) properties seen 174
Interrupted Best-First random walk after 100380 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=20 ) properties seen 280
Interrupted Best-First random walk after 57648 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=11 ) properties seen 161
Interrupted Best-First random walk after 100064 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=19 ) properties seen 255
Interrupted Best-First random walk after 799986 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=159 ) properties seen 479
Interrupted Best-First random walk after 66092 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=13 ) properties seen 196
Interrupted Best-First random walk after 57476 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=11 ) properties seen 154
Interrupted Best-First random walk after 512333 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 477
Interrupted Best-First random walk after 489659 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=97 ) properties seen 445
[2023-03-11 06:28:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 145, 42, 37, 34, 174, 44, 54, 40, 6, 76, 47, 39, 6]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 372 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 367 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:30:00] [INFO ] Invariant cache hit.
[2023-03-11 06:30:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:30:03] [INFO ] Implicit Places using invariants in 3642 ms returned []
Implicit Place search using SMT only with invariants took 3642 ms to find 0 implicit places.
[2023-03-11 06:30:03] [INFO ] Invariant cache hit.
[2023-03-11 06:30:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:30:07] [INFO ] Dead Transitions using invariants and state equation in 3690 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7712 ms. Remains : 48447/48447 places, 49848/49848 transitions.
[2023-03-11 06:30:07] [INFO ] Invariant cache hit.
Finished random walk after 64010 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 64736 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=12 ) properties seen 159
Interrupted Best-First random walk after 61480 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=12 ) properties seen 289
Interrupted Best-First random walk after 100420 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=20 ) properties seen 255
Interrupted Best-First random walk after 514841 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=102 ) properties seen 467
Interrupted Best-First random walk after 495489 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 429
Interrupted Best-First random walk after 632714 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=126 ) properties seen 174
Interrupted Best-First random walk after 99826 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=19 ) properties seen 255
Interrupted Best-First random walk after 57424 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=11 ) properties seen 164
Interrupted Best-First random walk after 101030 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=20 ) properties seen 254
Interrupted Best-First random walk after 804120 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 474
Interrupted Best-First random walk after 66384 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=13 ) properties seen 182
Interrupted Best-First random walk after 57158 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=11 ) properties seen 147
Interrupted Best-First random walk after 497221 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=99 ) properties seen 470
Interrupted Best-First random walk after 481333 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=96 ) properties seen 457
[2023-03-11 06:31:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 145, 45, 37, 34, 174, 44, 54, 40, 6, 76, 47, 39, 6]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 385 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 365 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:33:46] [INFO ] Invariant cache hit.
[2023-03-11 06:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:33:50] [INFO ] Implicit Places using invariants in 3993 ms returned []
Implicit Place search using SMT only with invariants took 3993 ms to find 0 implicit places.
[2023-03-11 06:33:50] [INFO ] Invariant cache hit.
[2023-03-11 06:33:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:33:54] [INFO ] Dead Transitions using invariants and state equation in 3909 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8280 ms. Remains : 48447/48447 places, 49848/49848 transitions.
[2023-03-11 06:33:54] [INFO ] Invariant cache hit.
Finished random walk after 63875 steps, including 14 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=2 )
Interrupted Best-First random walk after 63600 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=12 ) properties seen 165
Interrupted Best-First random walk after 61480 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=12 ) properties seen 289
Interrupted Best-First random walk after 99036 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=19 ) properties seen 271
Interrupted Best-First random walk after 507893 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 456
Interrupted Best-First random walk after 487465 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=97 ) properties seen 487
Interrupted Best-First random walk after 625890 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=124 ) properties seen 174
Interrupted Best-First random walk after 98888 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=19 ) properties seen 257
Interrupted Best-First random walk after 57600 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=11 ) properties seen 166
Interrupted Best-First random walk after 99356 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=19 ) properties seen 244
Interrupted Best-First random walk after 787942 steps, including 2 resets, run timeout after 5003 ms. (steps per millisecond=157 ) properties seen 486
Interrupted Best-First random walk after 64580 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=12 ) properties seen 200
Interrupted Best-First random walk after 56212 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=11 ) properties seen 159
Interrupted Best-First random walk after 500049 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=99 ) properties seen 481
Interrupted Best-First random walk after 481773 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=96 ) properties seen 491
[2023-03-11 06:35:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [201, 201, 201, 201, 201, 201, 402, 201, 402, 24, 201, 201, 201, 18] Max seen :[135, 145, 45, 37, 34, 174, 44, 54, 40, 6, 76, 47, 39, 6]
Support contains 28744 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 371 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Applied a total of 0 rules in 364 ms. Remains 48447 /48447 variables (removed 0) and now considering 49848/49848 (removed 0) transitions.
[2023-03-11 06:37:34] [INFO ] Invariant cache hit.
[2023-03-11 06:37:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:37:38] [INFO ] Implicit Places using invariants in 3955 ms returned []
Implicit Place search using SMT only with invariants took 3957 ms to find 0 implicit places.
[2023-03-11 06:37:38] [INFO ] Invariant cache hit.
[2023-03-11 06:37:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:37:42] [INFO ] Dead Transitions using invariants and state equation in 3835 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8165 ms. Remains : 48447/48447 places, 49848/49848 transitions.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-00
[2023-03-11 06:37:42] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1070 ms. (steps per millisecond=9 ) properties (out of 1) seen :105
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 1) seen :2
[2023-03-11 06:37:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[105]
Support contains 4221 out of 48447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48447/48447 places, 49848/49848 transitions.
Graph (complete) has 71358 edges and 48447 vertex of which 17487 are kept as prefixes of interest. Removing 30960 places using SCC suffix rule.16 ms
Discarding 30960 places :
Also discarding 32763 output transitions
Drop transitions removed 32763 transitions
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 0 with 402 rules applied. Total rules applied 403 place count 17286 transition count 16884
Free-agglomeration rule (complex) applied 4221 times.
Iterating global reduction 0 with 4221 rules applied. Total rules applied 4624 place count 17286 transition count 12663
Ensure Unique test removed 4221 places
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 0 with 8442 rules applied. Total rules applied 13066 place count 8844 transition count 12663
Applied a total of 13066 rules in 3458 ms. Remains 8844 /48447 variables (removed 39603) and now considering 12663/49848 (removed 37185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3459 ms. Remains : 8844/48447 places, 12663/49848 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2023-03-11 06:37:53] [INFO ] Computed 201 place invariants in 78 ms
Finished random walk after 284384 steps, including 470 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 62129 steps, including 0 resets, run visited all 1 properties in 5020 ms. (steps per millisecond=12 )
[2023-03-11 06:38:28] [INFO ] Invariant cache hit.
[2023-03-11 06:38:29] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 173 ms returned sat
[2023-03-11 06:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:38:38] [INFO ] [Real]Absence check using state equation in 9206 ms returned sat
[2023-03-11 06:38:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:38:39] [INFO ] [Nat]Absence check using 0 positive and 201 generalized place invariants in 179 ms returned sat
[2023-03-11 06:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:38:49] [INFO ] [Nat]Absence check using state equation in 9803 ms returned sat
[2023-03-11 06:38:50] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 643 ms.
[2023-03-11 06:39:10] [INFO ] Added : 175 causal constraints over 35 iterations in 20747 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[105]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 623 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 557 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
[2023-03-11 06:39:16] [INFO ] Invariant cache hit.
[2023-03-11 06:39:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:39:17] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 898 ms to find 0 implicit places.
[2023-03-11 06:39:17] [INFO ] Invariant cache hit.
[2023-03-11 06:39:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:39:18] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2348 ms. Remains : 8844/8844 places, 12663/12663 transitions.
[2023-03-11 06:39:18] [INFO ] Invariant cache hit.
Finished random walk after 284455 steps, including 470 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 62129 steps, including 0 resets, run visited all 1 properties in 5066 ms. (steps per millisecond=12 )
[2023-03-11 06:39:53] [INFO ] Invariant cache hit.
[2023-03-11 06:39:54] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 185 ms returned sat
[2023-03-11 06:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:04] [INFO ] [Real]Absence check using state equation in 9434 ms returned sat
[2023-03-11 06:40:05] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 621 ms.
[2023-03-11 06:40:25] [INFO ] Added : 155 causal constraints over 31 iterations in 20168 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[121]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 534 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 534 ms. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 534 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
[2023-03-11 06:40:31] [INFO ] Invariant cache hit.
[2023-03-11 06:40:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:40:32] [INFO ] Implicit Places using invariants in 868 ms returned []
Implicit Place search using SMT only with invariants took 870 ms to find 0 implicit places.
[2023-03-11 06:40:32] [INFO ] Invariant cache hit.
[2023-03-11 06:40:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:40:33] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2246 ms. Remains : 8844/8844 places, 12663/12663 transitions.
[2023-03-11 06:40:33] [INFO ] Invariant cache hit.
Finished random walk after 288167 steps, including 477 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 64211 steps, including 0 resets, run visited all 1 properties in 5061 ms. (steps per millisecond=12 )
[2023-03-11 06:41:08] [INFO ] Invariant cache hit.
[2023-03-11 06:41:09] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 178 ms returned sat
[2023-03-11 06:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:41:18] [INFO ] [Real]Absence check using state equation in 9181 ms returned sat
[2023-03-11 06:41:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:41:20] [INFO ] [Nat]Absence check using 0 positive and 201 generalized place invariants in 178 ms returned sat
[2023-03-11 06:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:41:30] [INFO ] [Nat]Absence check using state equation in 9661 ms returned sat
[2023-03-11 06:41:30] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 568 ms.
[2023-03-11 06:41:50] [INFO ] Added : 175 causal constraints over 35 iterations in 20487 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[131]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 514 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 527 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
[2023-03-11 06:41:57] [INFO ] Invariant cache hit.
[2023-03-11 06:41:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:41:58] [INFO ] Implicit Places using invariants in 867 ms returned []
Implicit Place search using SMT only with invariants took 868 ms to find 0 implicit places.
[2023-03-11 06:41:58] [INFO ] Invariant cache hit.
[2023-03-11 06:41:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:41:59] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2237 ms. Remains : 8844/8844 places, 12663/12663 transitions.
[2023-03-11 06:41:59] [INFO ] Invariant cache hit.
Finished random walk after 282821 steps, including 468 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 64211 steps, including 0 resets, run visited all 1 properties in 5013 ms. (steps per millisecond=12 )
[2023-03-11 06:42:34] [INFO ] Invariant cache hit.
[2023-03-11 06:42:35] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 174 ms returned sat
[2023-03-11 06:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:42:44] [INFO ] [Real]Absence check using state equation in 9162 ms returned sat
[2023-03-11 06:42:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:42:46] [INFO ] [Nat]Absence check using 0 positive and 201 generalized place invariants in 174 ms returned sat
[2023-03-11 06:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:42:55] [INFO ] [Nat]Absence check using state equation in 9579 ms returned sat
[2023-03-11 06:42:56] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 560 ms.
[2023-03-11 06:43:16] [INFO ] Added : 170 causal constraints over 34 iterations in 20681 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[140]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 578 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 577 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
[2023-03-11 06:43:23] [INFO ] Invariant cache hit.
[2023-03-11 06:43:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:43:25] [INFO ] Implicit Places using invariants in 1323 ms returned [4431, 4472, 4544, 4575, 4616]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1332 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8839/8844 places, 12663/12663 transitions.
Free-agglomeration rule applied 105 times.
Iterating global reduction 0 with 105 rules applied. Total rules applied 105 place count 8839 transition count 12558
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 210 place count 8734 transition count 12558
Applied a total of 210 rules in 1121 ms. Remains 8734 /8839 variables (removed 105) and now considering 12558/12663 (removed 105) transitions.
// Phase 1: matrix 12558 rows 8734 cols
[2023-03-11 06:43:26] [INFO ] Computed 196 place invariants in 75 ms
[2023-03-11 06:43:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:43:27] [INFO ] Implicit Places using invariants in 911 ms returned []
Implicit Place search using SMT only with invariants took 912 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8734/8844 places, 12558/12663 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3942 ms. Remains : 8734/8844 places, 12558/12663 transitions.
[2023-03-11 06:43:27] [INFO ] Invariant cache hit.
Finished random walk after 270263 steps, including 451 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 68653 steps, including 0 resets, run visited all 1 properties in 5040 ms. (steps per millisecond=13 )
[2023-03-11 06:44:02] [INFO ] Invariant cache hit.
[2023-03-11 06:44:03] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 168 ms returned sat
[2023-03-11 06:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:44:12] [INFO ] [Real]Absence check using state equation in 9378 ms returned sat
[2023-03-11 06:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:44:14] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 171 ms returned sat
[2023-03-11 06:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:44:24] [INFO ] [Nat]Absence check using state equation in 10115 ms returned sat
[2023-03-11 06:44:25] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 568 ms.
[2023-03-11 06:44:45] [INFO ] Added : 175 causal constraints over 35 iterations in 20355 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[153]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 502 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 492 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:44:51] [INFO ] Invariant cache hit.
[2023-03-11 06:44:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:44:52] [INFO ] Implicit Places using invariants in 868 ms returned []
Implicit Place search using SMT only with invariants took 877 ms to find 0 implicit places.
[2023-03-11 06:44:52] [INFO ] Invariant cache hit.
[2023-03-11 06:44:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:44:52] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2191 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:44:53] [INFO ] Invariant cache hit.
Finished random walk after 288683 steps, including 481 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 69653 steps, including 0 resets, run visited all 1 properties in 5062 ms. (steps per millisecond=13 )
[2023-03-11 06:45:28] [INFO ] Invariant cache hit.
[2023-03-11 06:45:29] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 171 ms returned sat
[2023-03-11 06:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:45:38] [INFO ] [Real]Absence check using state equation in 9476 ms returned sat
[2023-03-11 06:45:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:45:39] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 171 ms returned sat
[2023-03-11 06:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:45:49] [INFO ] [Nat]Absence check using state equation in 9730 ms returned sat
[2023-03-11 06:45:50] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 501 ms.
[2023-03-11 06:46:10] [INFO ] Added : 180 causal constraints over 36 iterations in 20680 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[157]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 509 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 497 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:46:16] [INFO ] Invariant cache hit.
[2023-03-11 06:46:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:46:17] [INFO ] Implicit Places using invariants in 860 ms returned []
Implicit Place search using SMT only with invariants took 862 ms to find 0 implicit places.
[2023-03-11 06:46:17] [INFO ] Invariant cache hit.
[2023-03-11 06:46:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:46:18] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2168 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:46:18] [INFO ] Invariant cache hit.
Finished random walk after 288738 steps, including 482 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 69653 steps, including 0 resets, run visited all 1 properties in 5069 ms. (steps per millisecond=13 )
[2023-03-11 06:46:53] [INFO ] Invariant cache hit.
[2023-03-11 06:46:54] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 170 ms returned sat
[2023-03-11 06:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:47:05] [INFO ] [Real]Absence check using state equation in 10838 ms returned sat
[2023-03-11 06:47:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:47:07] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 180 ms returned sat
[2023-03-11 06:47:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:47:16] [INFO ] [Nat]Absence check using state equation in 9530 ms returned sat
[2023-03-11 06:47:17] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 599 ms.
[2023-03-11 06:47:37] [INFO ] Added : 170 causal constraints over 34 iterations in 20119 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[161]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 523 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 528 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:47:43] [INFO ] Invariant cache hit.
[2023-03-11 06:47:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:47:44] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 924 ms to find 0 implicit places.
[2023-03-11 06:47:44] [INFO ] Invariant cache hit.
[2023-03-11 06:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:47:45] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2386 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:47:45] [INFO ] Invariant cache hit.
Finished random walk after 279192 steps, including 466 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 68653 steps, including 0 resets, run visited all 1 properties in 5012 ms. (steps per millisecond=13 )
[2023-03-11 06:48:20] [INFO ] Invariant cache hit.
[2023-03-11 06:48:21] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 171 ms returned sat
[2023-03-11 06:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:48:31] [INFO ] [Real]Absence check using state equation in 9624 ms returned sat
[2023-03-11 06:48:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:48:32] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 173 ms returned sat
[2023-03-11 06:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:48:42] [INFO ] [Nat]Absence check using state equation in 9967 ms returned sat
[2023-03-11 06:48:43] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 538 ms.
[2023-03-11 06:49:03] [INFO ] Added : 175 causal constraints over 35 iterations in 20025 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[165]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 487 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 493 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:49:09] [INFO ] Invariant cache hit.
[2023-03-11 06:49:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:49:10] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
[2023-03-11 06:49:10] [INFO ] Invariant cache hit.
[2023-03-11 06:49:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:49:10] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2217 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:49:11] [INFO ] Invariant cache hit.
Finished random walk after 288138 steps, including 481 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 67653 steps, including 0 resets, run visited all 1 properties in 5026 ms. (steps per millisecond=13 )
[2023-03-11 06:49:46] [INFO ] Invariant cache hit.
[2023-03-11 06:49:47] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 185 ms returned sat
[2023-03-11 06:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:49:56] [INFO ] [Real]Absence check using state equation in 9399 ms returned sat
[2023-03-11 06:49:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:49:57] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 179 ms returned sat
[2023-03-11 06:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:50:08] [INFO ] [Nat]Absence check using state equation in 10601 ms returned sat
[2023-03-11 06:50:09] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 528 ms.
[2023-03-11 06:50:29] [INFO ] Added : 175 causal constraints over 35 iterations in 20292 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[168]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 498 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 493 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:50:35] [INFO ] Invariant cache hit.
[2023-03-11 06:50:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:50:36] [INFO ] Implicit Places using invariants in 868 ms returned []
Implicit Place search using SMT only with invariants took 870 ms to find 0 implicit places.
[2023-03-11 06:50:36] [INFO ] Invariant cache hit.
[2023-03-11 06:50:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:50:37] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2247 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:50:37] [INFO ] Invariant cache hit.
Finished random walk after 289227 steps, including 482 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 69653 steps, including 0 resets, run visited all 1 properties in 5064 ms. (steps per millisecond=13 )
[2023-03-11 06:51:12] [INFO ] Invariant cache hit.
[2023-03-11 06:51:13] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 167 ms returned sat
[2023-03-11 06:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:51:23] [INFO ] [Real]Absence check using state equation in 10285 ms returned sat
[2023-03-11 06:51:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:51:24] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 183 ms returned sat
[2023-03-11 06:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:51:35] [INFO ] [Nat]Absence check using state equation in 10689 ms returned sat
[2023-03-11 06:51:36] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 524 ms.
[2023-03-11 06:51:56] [INFO ] Added : 180 causal constraints over 36 iterations in 20628 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[172]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 493 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 516 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:52:02] [INFO ] Invariant cache hit.
[2023-03-11 06:52:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:52:03] [INFO ] Implicit Places using invariants in 848 ms returned []
Implicit Place search using SMT only with invariants took 858 ms to find 0 implicit places.
[2023-03-11 06:52:03] [INFO ] Invariant cache hit.
[2023-03-11 06:52:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:52:04] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2229 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:52:04] [INFO ] Invariant cache hit.
Finished random walk after 288902 steps, including 482 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 69653 steps, including 0 resets, run visited all 1 properties in 5020 ms. (steps per millisecond=13 )
[2023-03-11 06:52:39] [INFO ] Invariant cache hit.
[2023-03-11 06:52:40] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 171 ms returned sat
[2023-03-11 06:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:52:50] [INFO ] [Real]Absence check using state equation in 9912 ms returned sat
[2023-03-11 06:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:52:51] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 170 ms returned sat
[2023-03-11 06:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:53:02] [INFO ] [Nat]Absence check using state equation in 10953 ms returned sat
[2023-03-11 06:53:03] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 527 ms.
[2023-03-11 06:53:23] [INFO ] Added : 180 causal constraints over 36 iterations in 20632 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[176]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 496 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 500 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:53:29] [INFO ] Invariant cache hit.
[2023-03-11 06:53:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:53:30] [INFO ] Implicit Places using invariants in 833 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2023-03-11 06:53:30] [INFO ] Invariant cache hit.
[2023-03-11 06:53:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:53:31] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2165 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:53:31] [INFO ] Invariant cache hit.
Finished random walk after 289064 steps, including 482 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 69653 steps, including 0 resets, run visited all 1 properties in 5053 ms. (steps per millisecond=13 )
[2023-03-11 06:54:06] [INFO ] Invariant cache hit.
[2023-03-11 06:54:07] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 176 ms returned sat
[2023-03-11 06:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:54:18] [INFO ] [Real]Absence check using state equation in 10730 ms returned sat
[2023-03-11 06:54:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:54:19] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 170 ms returned sat
[2023-03-11 06:54:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:54:30] [INFO ] [Nat]Absence check using state equation in 10190 ms returned sat
[2023-03-11 06:54:30] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 554 ms.
[2023-03-11 06:54:50] [INFO ] Added : 175 causal constraints over 35 iterations in 20175 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[178]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 513 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 500 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:54:56] [INFO ] Invariant cache hit.
[2023-03-11 06:54:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:54:57] [INFO ] Implicit Places using invariants in 809 ms returned []
Implicit Place search using SMT only with invariants took 810 ms to find 0 implicit places.
[2023-03-11 06:54:57] [INFO ] Invariant cache hit.
[2023-03-11 06:54:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:54:58] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2194 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:54:58] [INFO ] Invariant cache hit.
Finished random walk after 286604 steps, including 478 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 68653 steps, including 0 resets, run visited all 1 properties in 5032 ms. (steps per millisecond=13 )
[2023-03-11 06:55:33] [INFO ] Invariant cache hit.
[2023-03-11 06:55:34] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 177 ms returned sat
[2023-03-11 06:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:55:46] [INFO ] [Real]Absence check using state equation in 11636 ms returned sat
[2023-03-11 06:55:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:55:47] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 184 ms returned sat
[2023-03-11 06:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:55:59] [INFO ] [Nat]Absence check using state equation in 11339 ms returned sat
[2023-03-11 06:56:00] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 559 ms.
[2023-03-11 06:56:19] [INFO ] Added : 170 causal constraints over 34 iterations in 20162 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[180]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 533 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 507 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:56:25] [INFO ] Invariant cache hit.
[2023-03-11 06:56:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:56:26] [INFO ] Implicit Places using invariants in 823 ms returned []
Implicit Place search using SMT only with invariants took 824 ms to find 0 implicit places.
[2023-03-11 06:56:26] [INFO ] Invariant cache hit.
[2023-03-11 06:56:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:56:27] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2188 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:56:27] [INFO ] Invariant cache hit.
Finished random walk after 284555 steps, including 475 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 65631 steps, including 0 resets, run visited all 1 properties in 5056 ms. (steps per millisecond=12 )
[2023-03-11 06:57:02] [INFO ] Invariant cache hit.
[2023-03-11 06:57:03] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 181 ms returned sat
[2023-03-11 06:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:57:17] [INFO ] [Real]Absence check using state equation in 13849 ms returned sat
[2023-03-11 06:57:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:57:19] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 201 ms returned sat
[2023-03-11 06:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:57:34] [INFO ] [Nat]Absence check using state equation in 15065 ms returned sat
[2023-03-11 06:57:35] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 596 ms.
[2023-03-11 06:57:55] [INFO ] Added : 165 causal constraints over 33 iterations in 20832 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[183]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 504 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 521 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:58:01] [INFO ] Invariant cache hit.
[2023-03-11 06:58:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:58:02] [INFO ] Implicit Places using invariants in 820 ms returned []
Implicit Place search using SMT only with invariants took 822 ms to find 0 implicit places.
[2023-03-11 06:58:02] [INFO ] Invariant cache hit.
[2023-03-11 06:58:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:58:03] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2229 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:58:03] [INFO ] Invariant cache hit.
Finished random walk after 288318 steps, including 481 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 69653 steps, including 0 resets, run visited all 1 properties in 5057 ms. (steps per millisecond=13 )
[2023-03-11 06:58:38] [INFO ] Invariant cache hit.
[2023-03-11 06:58:39] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 179 ms returned sat
[2023-03-11 06:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:58:53] [INFO ] [Real]Absence check using state equation in 13376 ms returned sat
[2023-03-11 06:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:58:54] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 195 ms returned sat
[2023-03-11 06:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:59:07] [INFO ] [Nat]Absence check using state equation in 13338 ms returned sat
[2023-03-11 06:59:08] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 539 ms.
[2023-03-11 06:59:29] [INFO ] Added : 170 causal constraints over 34 iterations in 20763 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[184]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 520 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 521 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 06:59:35] [INFO ] Invariant cache hit.
[2023-03-11 06:59:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:59:36] [INFO ] Implicit Places using invariants in 873 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
[2023-03-11 06:59:36] [INFO ] Invariant cache hit.
[2023-03-11 06:59:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:59:37] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2281 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 06:59:37] [INFO ] Invariant cache hit.
Finished random walk after 287531 steps, including 480 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 68653 steps, including 0 resets, run visited all 1 properties in 5060 ms. (steps per millisecond=13 )
[2023-03-11 07:00:12] [INFO ] Invariant cache hit.
[2023-03-11 07:00:13] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 197 ms returned sat
[2023-03-11 07:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:00:25] [INFO ] [Real]Absence check using state equation in 12432 ms returned sat
[2023-03-11 07:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:00:27] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 183 ms returned sat
[2023-03-11 07:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:00:39] [INFO ] [Nat]Absence check using state equation in 11892 ms returned sat
[2023-03-11 07:00:40] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 577 ms.
[2023-03-11 07:00:59] [INFO ] Added : 165 causal constraints over 33 iterations in 20059 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[186]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 498 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 514 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 07:01:05] [INFO ] Invariant cache hit.
[2023-03-11 07:01:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 07:01:06] [INFO ] Implicit Places using invariants in 870 ms returned []
Implicit Place search using SMT only with invariants took 879 ms to find 0 implicit places.
[2023-03-11 07:01:06] [INFO ] Invariant cache hit.
[2023-03-11 07:01:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 07:01:07] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2257 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 07:01:07] [INFO ] Invariant cache hit.
Finished random walk after 287657 steps, including 480 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 68653 steps, including 0 resets, run visited all 1 properties in 5036 ms. (steps per millisecond=13 )
[2023-03-11 07:01:42] [INFO ] Invariant cache hit.
[2023-03-11 07:01:43] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 177 ms returned sat
[2023-03-11 07:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:01:53] [INFO ] [Real]Absence check using state equation in 10089 ms returned sat
[2023-03-11 07:01:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:01:55] [INFO ] [Nat]Absence check using 0 positive and 196 generalized place invariants in 181 ms returned sat
[2023-03-11 07:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:02:07] [INFO ] [Nat]Absence check using state equation in 11906 ms returned sat
[2023-03-11 07:02:07] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4116 transitions) in 579 ms.
[2023-03-11 07:02:28] [INFO ] Added : 175 causal constraints over 35 iterations in 20835 ms.(timeout) Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[188]
Support contains 4221 out of 8734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 489 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 8734/8734 places, 12558/12558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8734/8734 places, 12558/12558 transitions.
Applied a total of 0 rules in 506 ms. Remains 8734 /8734 variables (removed 0) and now considering 12558/12558 (removed 0) transitions.
[2023-03-11 07:02:34] [INFO ] Invariant cache hit.
[2023-03-11 07:02:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 07:02:35] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
[2023-03-11 07:02:35] [INFO ] Invariant cache hit.
[2023-03-11 07:02:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 07:02:36] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2216 ms. Remains : 8734/8734 places, 12558/12558 transitions.
[2023-03-11 07:02:36] [INFO ] Invariant cache hit.
Finished random walk after 285739 steps, including 477 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 68653 steps, including 0 resets, run visited all 1 properties in 5076 ms. (steps per millisecond=13 )
[2023-03-11 07:03:11] [INFO ] Invariant cache hit.
[2023-03-11 07:03:12] [INFO ] [Real]Absence check using 0 positive and 196 generalized place invariants in 173 ms returned sat
[2023-03-11 07:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13914264 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16106824 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-L00200M0020C010P010G005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-L00200M0020C010P010G005, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855700333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00200M0020C010P010G005.tgz
mv FamilyReunion-COL-L00200M0020C010P010G005 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;