fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875900867
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FamilyReunion-COL-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2536.376 517184.00 438352.00 41589.30 101 101 101 101 101 3 101 101 101 101 101 3 101 101 101 101 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875900867.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900867
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 18:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 140K May 5 16:51 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-L00100M0010C005P005G002-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620680331105

Running Version 0
[2021-05-10 20:58:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 20:58:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 20:58:53] [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.
[2021-05-10 20:58:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-10 20:58:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 678 ms
[2021-05-10 20:58:54] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2021-05-10 20:58:54] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2021-05-10 20:58:54] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 9 ms.
[2021-05-10 20:58:54] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_302092608411480256.dot
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2021-05-10 20:58:54] [INFO ] Computed 33 place invariants in 16 ms
[2021-05-10 20:58:54] [INFO ] Unfolded HLPN to a Petri net with 40706 places and 36871 transitions in 197 ms.
[2021-05-10 20:58:54] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 66 rows 99 cols
[2021-05-10 20:58:54] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-10 20:58:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:58:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-10 20:58:54] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 13 ms.
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-10 20:58:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:58:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-10 20:58:54] [INFO ] Added : 32 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 11 ms.
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-10 20:58:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-10 20:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-10 20:58:54] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:58:54] [INFO ] Added : 26 causal constraints over 6 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:58:55] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:58:55] [INFO ] Added : 40 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 11 ms.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-10 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:58:55] [INFO ] Added : 58 causal constraints over 12 iterations in 69 ms. Result :sat
Minimization took 13 ms.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:58:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-10 20:58:55] [INFO ] Added : 55 causal constraints over 11 iterations in 63 ms. Result :sat
Minimization took 13 ms.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-10 20:58:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:58:55] [INFO ] Added : 47 causal constraints over 10 iterations in 68 ms. Result :sat
Minimization took 13 ms.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:55] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-10 20:58:55] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:58:55] [INFO ] Added : 47 causal constraints over 10 iterations in 54 ms. Result :sat
Minimization took 11 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:58:56] [INFO ] Added : 22 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:58:56] [INFO ] Added : 35 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 11 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:58:56] [INFO ] Added : 60 causal constraints over 12 iterations in 64 ms. Result :sat
Minimization took 12 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 21 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:58:56] [INFO ] Added : 22 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-10 20:58:56] [INFO ] Added : 29 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 10 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-10 20:58:56] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-10 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:58:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:58:56] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:58:57] [INFO ] Added : 65 causal constraints over 13 iterations in 69 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [101, 101, 101, 101, 202, 9, 101, 101, 101, 101, 303, 9, 101, 101, 606, 101]
[2021-05-10 20:58:57] [INFO ] Unfolded HLPN to a Petri net with 40706 places and 36871 transitions in 100 ms.
[2021-05-10 20:58:57] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_11882298295476110086.dot
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 132 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1520 ms. (steps per millisecond=6 ) properties (out of 16) seen :280
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :10
// Phase 1: matrix 36871 rows 40574 cols
[2021-05-10 20:59:12] [INFO ] Computed 8805 place invariants in 11396 ms
Current structural bounds on expressions (after SMT) : [101, 101, 101, 101, 202, 9, 101, 101, 101, 101, 303, 9, 101, 101, 606, 101] Max seen :[18, 14, 18, 51, 9, 0, 0, 3, 3, 14, 14, 0, 14, 6, 22, 100]
Support contains 4966 out of 40574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 39335 are kept as prefixes of interest. Removing 1239 places using SCC suffix rule.10529 ms
Discarding 1239 places :
Also discarding 1111 output transitions
Drop transitions removed 1111 transitions
Discarding 5555 places :
Implicit places reduction removed 5555 places
Drop transitions removed 7373 transitions
Trivial Post-agglo rules discarded 7373 transitions
Performed 7373 trivial Post agglomeration. Transition count delta: 7373
Iterating post reduction 0 with 12928 rules applied. Total rules applied 12929 place count 33780 transition count 28387
Reduce places removed 7373 places and 0 transitions.
Performed 2222 Post agglomeration using F-continuation condition.Transition count delta: 2222
Iterating post reduction 1 with 9595 rules applied. Total rules applied 22524 place count 26407 transition count 26165
Reduce places removed 2222 places and 0 transitions.
Iterating post reduction 2 with 2222 rules applied. Total rules applied 24746 place count 24185 transition count 26165
Performed 2929 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2929 Pre rules applied. Total rules applied 24746 place count 24185 transition count 23236
Deduced a syphon composed of 2929 places in 23 ms
Ensure Unique test removed 1414 places
Reduce places removed 4343 places and 0 transitions.
Iterating global reduction 3 with 7272 rules applied. Total rules applied 32018 place count 19842 transition count 23236
Discarding 606 places :
Implicit places reduction removed 606 places
Iterating post reduction 3 with 606 rules applied. Total rules applied 32624 place count 19236 transition count 23236
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 32624 place count 19236 transition count 23135
Deduced a syphon composed of 101 places in 53 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 32826 place count 19135 transition count 23135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 32828 place count 19133 transition count 22933
Iterating global reduction 4 with 2 rules applied. Total rules applied 32830 place count 19133 transition count 22933
Performed 2222 Post agglomeration using F-continuation condition.Transition count delta: 2222
Deduced a syphon composed of 2222 places in 13 ms
Reduce places removed 2222 places and 0 transitions.
Iterating global reduction 4 with 4444 rules applied. Total rules applied 37274 place count 16911 transition count 20711
Free-agglomeration rule (complex) applied 3939 times.
Iterating global reduction 4 with 3939 rules applied. Total rules applied 41213 place count 16911 transition count 16772
Ensure Unique test removed 202 places
Reduce places removed 4141 places and 0 transitions.
Iterating post reduction 4 with 4141 rules applied. Total rules applied 45354 place count 12770 transition count 16772
Discarding 2025 places :
Symmetric choice reduction at 5 with 2025 rule applications. Total rules 47379 place count 10745 transition count 14247
Ensure Unique test removed 101 places
Iterating global reduction 5 with 2126 rules applied. Total rules applied 49505 place count 10644 transition count 14247
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 49707 place count 10543 transition count 14146
Applied a total of 49707 rules in 23028 ms. Remains 10543 /40574 variables (removed 30031) and now considering 14146/36871 (removed 22725) transitions.
Finished structural reductions, in 1 iterations. Remains : 10543/40574 places, 14146/36871 transitions.
// Phase 1: matrix 14146 rows 10543 cols
[2021-05-10 21:00:55] [INFO ] Computed 612 place invariants in 295 ms
Interrupted random walk after 231361 steps, including 98 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen :{0=19, 1=24, 2=25, 3=42, 4=23, 5=3, 6=22, 7=9, 8=9, 9=10, 10=31, 11=3, 12=10, 13=10, 14=33, 15=101}
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-15 101 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4868 ms. (steps per millisecond=205 ) properties (out of 15) seen :115
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-00 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 273541 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=54 ) properties seen :{0=1, 1=101, 2=35, 3=1, 4=1, 5=1, 6=1, 7=1, 8=7, 9=1, 10=1, 11=7, 12=1, 13=26}
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-02 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 891109 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen :{0=23, 1=35, 2=101, 3=1, 4=1, 5=1, 6=1, 7=10, 8=41, 9=1, 10=10, 11=6, 12=28}
Interrupted Best-First random walk after 505017 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :{0=16, 1=41, 2=17, 3=3, 4=16, 5=5, 6=5, 7=7, 8=38, 9=1, 10=7, 11=7, 12=22}
Interrupted Best-First random walk after 296380 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen :{0=17, 1=36, 2=15, 3=1, 4=101, 5=6, 6=6, 7=8, 8=45, 9=1, 10=8, 11=7, 12=33}
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-06 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 900645 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen :{0=21, 1=33, 2=15, 4=66, 5=66, 6=8, 7=39, 9=8, 10=7, 11=28}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4477 ms. (steps per millisecond=223 ) properties (out of 12) seen :270
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-12 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-09 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 896967 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen :{0=20, 1=38, 2=19, 3=3, 4=7, 5=7, 6=45, 7=3, 8=8, 9=26}
Interrupted Best-First random walk after 938376 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=187 ) properties seen :{0=1, 1=35, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=101, 9=24}
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-13 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 14146 rows 10543 cols
[2021-05-10 21:02:10] [INFO ] Computed 612 place invariants in 319 ms
[2021-05-10 21:02:11] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 476 ms returned sat
[2021-05-10 21:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:02:23] [INFO ] [Real]Absence check using state equation in 11527 ms returned sat
[2021-05-10 21:02:24] [INFO ] Computed and/alt/rep : 11918/20806/11918 causal constraints (skipped 2127 transitions) in 791 ms.
[2021-05-10 21:02:26] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 472 ms returned sat
[2021-05-10 21:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:02:36] [INFO ] [Real]Absence check using state equation in 10404 ms returned sat
[2021-05-10 21:02:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:02:38] [INFO ] [Nat]Absence check using 0 positive and 612 generalized place invariants in 472 ms returned sat
[2021-05-10 21:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:02:49] [INFO ] [Nat]Absence check using state equation in 11060 ms returned sat
[2021-05-10 21:02:50] [INFO ] Computed and/alt/rep : 11918/20806/11918 causal constraints (skipped 2127 transitions) in 885 ms.
[2021-05-10 21:02:52] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 491 ms returned sat
[2021-05-10 21:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:02:57] [INFO ] [Real]Absence check using state equation in 4978 ms returned unsat
[2021-05-10 21:02:59] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 474 ms returned sat
[2021-05-10 21:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:03:03] [INFO ] [Real]Absence check using state equation in 4830 ms returned unsat
[2021-05-10 21:03:05] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 487 ms returned sat
[2021-05-10 21:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:03:18] [INFO ] [Real]Absence check using state equation in 12636 ms returned sat
[2021-05-10 21:03:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:03:19] [INFO ] [Nat]Absence check using 0 positive and 612 generalized place invariants in 480 ms returned sat
[2021-05-10 21:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:03:32] [INFO ] [Nat]Absence check using state equation in 12181 ms returned sat
[2021-05-10 21:03:33] [INFO ] Computed and/alt/rep : 11918/20806/11918 causal constraints (skipped 2127 transitions) in 780 ms.
[2021-05-10 21:03:34] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 479 ms returned sat
[2021-05-10 21:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:03:46] [INFO ] [Real]Absence check using state equation in 11968 ms returned sat
[2021-05-10 21:03:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:03:48] [INFO ] [Nat]Absence check using 0 positive and 612 generalized place invariants in 476 ms returned sat
[2021-05-10 21:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:04:01] [INFO ] [Nat]Absence check using state equation in 12486 ms returned sat
[2021-05-10 21:04:02] [INFO ] Computed and/alt/rep : 11918/20806/11918 causal constraints (skipped 2127 transitions) in 820 ms.
[2021-05-10 21:04:04] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 472 ms returned sat
[2021-05-10 21:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:04:16] [INFO ] [Real]Absence check using state equation in 12100 ms returned sat
[2021-05-10 21:04:17] [INFO ] Computed and/alt/rep : 11918/20806/11918 causal constraints (skipped 2127 transitions) in 759 ms.
[2021-05-10 21:04:19] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 492 ms returned sat
[2021-05-10 21:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:04:25] [INFO ] [Real]Absence check using state equation in 6233 ms returned unsat
[2021-05-10 21:04:27] [INFO ] [Real]Absence check using 0 positive and 612 generalized place invariants in 483 ms returned sat
[2021-05-10 21:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:04:38] [INFO ] [Real]Absence check using state equation in 11121 ms returned sat
[2021-05-10 21:04:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:04:40] [INFO ] [Nat]Absence check using 0 positive and 612 generalized place invariants in 497 ms returned sat
[2021-05-10 21:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:04:51] [INFO ] [Nat]Absence check using state equation in 11111 ms returned sat
[2021-05-10 21:04:52] [INFO ] Computed and/alt/rep : 11918/20806/11918 causal constraints (skipped 2127 transitions) in 753 ms.
Current structural bounds on expressions (after SMT) : [101, 101, 101, 3, 101, 101, 303, 3, 606] Max seen :[24, 51, 101, 3, 66, 66, 45, 3, 33]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-04 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2935 out of 10543 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10543/10543 places, 14146/14146 transitions.
Graph (complete) has 22133 edges and 10543 vertex of which 9108 are kept as prefixes of interest. Removing 1435 places using SCC suffix rule.11 ms
Discarding 1435 places :
Also discarding 2020 output transitions
Drop transitions removed 2020 transitions
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Iterating post reduction 0 with 505 rules applied. Total rules applied 506 place count 9108 transition count 11621
Performed 808 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 808 Pre rules applied. Total rules applied 506 place count 9108 transition count 10813
Deduced a syphon composed of 808 places in 4 ms
Reduce places removed 808 places and 0 transitions.
Iterating global reduction 1 with 1616 rules applied. Total rules applied 2122 place count 8300 transition count 10813
Discarding 515 places :
Symmetric choice reduction at 1 with 515 rule applications. Total rules 2637 place count 7785 transition count 9298
Ensure Unique test removed 101 places
Iterating global reduction 1 with 616 rules applied. Total rules applied 3253 place count 7684 transition count 9298
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 1 with 808 rules applied. Total rules applied 4061 place count 7583 transition count 8591
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 4263 place count 7381 transition count 8591
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 4667 place count 7179 transition count 8389
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4869 place count 7179 transition count 8187
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 3 with 303 rules applied. Total rules applied 5172 place count 6876 transition count 8187
Applied a total of 5172 rules in 2377 ms. Remains 6876 /10543 variables (removed 3667) and now considering 8187/14146 (removed 5959) transitions.
Finished structural reductions, in 1 iterations. Remains : 6876/10543 places, 8187/14146 transitions.
// Phase 1: matrix 8187 rows 6876 cols
[2021-05-10 21:04:55] [INFO ] Computed 204 place invariants in 168 ms
Interrupted random walk after 384907 steps, including 311 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen :{0=29, 1=56, 2=29, 3=29, 4=52, 5=36}
Interrupted Best-First random walk after 310110 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=61 ) properties seen :{0=101, 1=48, 2=1, 3=1, 4=1, 5=33}
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-01 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 4780 ms. (steps per millisecond=209 ) properties (out of 5) seen :347
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-08 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-07 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 197563 steps, including 1 resets, run timeout after 5010 ms. (steps per millisecond=39 ) properties seen :{0=34, 1=1, 2=101}
// Phase 1: matrix 8187 rows 6876 cols
[2021-05-10 21:05:40] [INFO ] Computed 204 place invariants in 184 ms
[2021-05-10 21:05:40] [INFO ] [Real]Absence check using 0 positive and 204 generalized place invariants in 134 ms returned sat
[2021-05-10 21:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:05:45] [INFO ] [Real]Absence check using state equation in 4617 ms returned sat
[2021-05-10 21:05:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:05:46] [INFO ] [Nat]Absence check using 0 positive and 204 generalized place invariants in 132 ms returned sat
[2021-05-10 21:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:05:50] [INFO ] [Nat]Absence check using state equation in 4428 ms returned sat
[2021-05-10 21:05:51] [INFO ] Computed and/alt/rep : 5252/5252/5252 causal constraints (skipped 1824 transitions) in 676 ms.
[2021-05-10 21:05:57] [INFO ] Added : 74 causal constraints over 15 iterations in 6566 ms. Result :sat
[2021-05-10 21:05:58] [INFO ] [Real]Absence check using 0 positive and 204 generalized place invariants in 127 ms returned sat
[2021-05-10 21:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:06:06] [INFO ] [Real]Absence check using state equation in 7270 ms returned sat
[2021-05-10 21:06:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:06:07] [INFO ] [Nat]Absence check using 0 positive and 204 generalized place invariants in 131 ms returned sat
[2021-05-10 21:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:06:14] [INFO ] [Nat]Absence check using state equation in 7299 ms returned sat
[2021-05-10 21:06:15] [INFO ] Computed and/alt/rep : 5252/5252/5252 causal constraints (skipped 1824 transitions) in 647 ms.
[2021-05-10 21:06:34] [INFO ] Added : 260 causal constraints over 52 iterations in 20097 ms.(timeout) Result :sat
[2021-05-10 21:06:35] [INFO ] [Real]Absence check using 0 positive and 204 generalized place invariants in 128 ms returned sat
[2021-05-10 21:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:06:43] [INFO ] [Real]Absence check using state equation in 7416 ms returned unsat
Current structural bounds on expressions (after SMT) : [101, 303, 101] Max seen :[56, 66, 101]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-14 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 78500 steps, including 99 resets, run finished after 3097 ms. (steps per millisecond=25 ) properties (out of 2) seen :110 could not realise parikh vector
Incomplete Parikh walk after 25700 steps, including 99 resets, run finished after 918 ms. (steps per millisecond=27 ) properties (out of 2) seen :72 could not realise parikh vector
Support contains 1117 out of 6876 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6876/6876 places, 8187/8187 transitions.
Graph (complete) has 12625 edges and 6876 vertex of which 6572 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.3 ms
Discarding 304 places :
Also discarding 202 output transitions
Drop transitions removed 202 transitions
Drop transitions removed 2323 transitions
Trivial Post-agglo rules discarded 2323 transitions
Performed 2323 trivial Post agglomeration. Transition count delta: 2323
Iterating post reduction 0 with 2323 rules applied. Total rules applied 2324 place count 6572 transition count 5662
Reduce places removed 2323 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 3434 rules applied. Total rules applied 5758 place count 4249 transition count 4551
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 6869 place count 3138 transition count 4551
Discarding 600 places :
Symmetric choice reduction at 3 with 600 rule applications. Total rules 7469 place count 2538 transition count 3951
Iterating global reduction 3 with 600 rules applied. Total rules applied 8069 place count 2538 transition count 3951
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8169 place count 2438 transition count 3351
Ensure Unique test removed 1 places
Iterating global reduction 3 with 101 rules applied. Total rules applied 8270 place count 2437 transition count 3351
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 8276 place count 2437 transition count 3345
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 8282 place count 2431 transition count 3345
Applied a total of 8282 rules in 644 ms. Remains 2431 /6876 variables (removed 4445) and now considering 3345/8187 (removed 4842) transitions.
Finished structural reductions, in 1 iterations. Remains : 2431/6876 places, 3345/8187 transitions.
// Phase 1: matrix 3345 rows 2431 cols
[2021-05-10 21:06:48] [INFO ] Computed 101 place invariants in 46 ms
Incomplete random walk after 1000000 steps, including 1874 resets, run finished after 27283 ms. (steps per millisecond=36 ) properties (out of 2) seen :143
Interrupted Best-First random walk after 208946 steps, including 1 resets, run timeout after 5018 ms. (steps per millisecond=41 ) properties seen :{0=101, 1=1}
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 3345 rows 2431 cols
[2021-05-10 21:07:20] [INFO ] Computed 101 place invariants in 42 ms
[2021-05-10 21:07:20] [INFO ] [Real]Absence check using 0 positive and 101 generalized place invariants in 35 ms returned sat
[2021-05-10 21:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:07:21] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2021-05-10 21:07:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 21:07:22] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 37 ms returned sat
[2021-05-10 21:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 21:07:23] [INFO ] [Nat]Absence check using state equation in 1472 ms returned sat
[2021-05-10 21:07:24] [INFO ] Computed and/alt/rep : 1117/1117/1117 causal constraints (skipped 1117 transitions) in 162 ms.
[2021-05-10 21:07:26] [INFO ] Added : 88 causal constraints over 18 iterations in 2545 ms. Result :sat
Current structural bounds on expressions (after SMT) : [303] Max seen :[87]
Incomplete Parikh walk after 36600 steps, including 98 resets, run finished after 368 ms. (steps per millisecond=99 ) properties (out of 1) seen :88 could not realise parikh vector
Support contains 6 out of 2431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2431/2431 places, 3345/3345 transitions.
Drop transitions removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 2431 transition count 2234
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 2222 place count 1320 transition count 2234
Discarding 1010 places :
Symmetric choice reduction at 2 with 1010 rule applications. Total rules 3232 place count 310 transition count 1224
Ensure Unique test removed 101 places
Iterating global reduction 2 with 1111 rules applied. Total rules applied 4343 place count 209 transition count 1224
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 2 with 1111 rules applied. Total rules applied 5454 place count 209 transition count 113
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 5555 place count 108 transition count 113
Discarding 100 places :
Symmetric choice reduction at 4 with 100 rule applications. Total rules 5655 place count 8 transition count 13
Iterating global reduction 4 with 100 rules applied. Total rules applied 5755 place count 8 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 5755 place count 8 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5757 place count 7 transition count 12
Applied a total of 5757 rules in 47 ms. Remains 7 /2431 variables (removed 2424) and now considering 12/3345 (removed 3333) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/2431 places, 12/3345 transitions.
// Phase 1: matrix 12 rows 7 cols
[2021-05-10 21:07:26] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000092 steps, including 4878 resets, run finished after 88 ms. (steps per millisecond=11364 ) properties (out of 1) seen :101
Incomplete Best-First random walk after 1000001 steps, including 530 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 1) seen :101
// Phase 1: matrix 12 rows 7 cols
[2021-05-10 21:07:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 21:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 21:07:27] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [101] Max seen :[101]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-10 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620680848289

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-L00100M0010C005P005G002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, 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 r083-tall-162048875900867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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