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

About the Execution of 2020-gold for HealthRecord-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
440.867 27689.00 52114.00 269.80 FFFFTFFFFFFFFFFF 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.r303-tall-162124171200130.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 gold2020
Input is HealthRecord-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.8K May 11 18:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 33K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-01-00
FORMULA_NAME HealthRecord-PT-01-01
FORMULA_NAME HealthRecord-PT-01-02
FORMULA_NAME HealthRecord-PT-01-03
FORMULA_NAME HealthRecord-PT-01-04
FORMULA_NAME HealthRecord-PT-01-05
FORMULA_NAME HealthRecord-PT-01-06
FORMULA_NAME HealthRecord-PT-01-07
FORMULA_NAME HealthRecord-PT-01-08
FORMULA_NAME HealthRecord-PT-01-09
FORMULA_NAME HealthRecord-PT-01-10
FORMULA_NAME HealthRecord-PT-01-11
FORMULA_NAME HealthRecord-PT-01-12
FORMULA_NAME HealthRecord-PT-01-13
FORMULA_NAME HealthRecord-PT-01-14
FORMULA_NAME HealthRecord-PT-01-15

=== Now, execution of the tool begins

BK_START 1621340896097

[2021-05-18 12:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:28:19] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-18 12:28:19] [INFO ] Transformed 117 places.
[2021-05-18 12:28:19] [INFO ] Transformed 218 transitions.
[2021-05-18 12:28:19] [INFO ] Found NUPN structural information;
[2021-05-18 12:28:19] [INFO ] Parsed PT model containing 117 places and 218 transitions in 115 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5262 resets, run finished after 416 ms. (steps per millisecond=240 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1]
[2021-05-18 12:28:19] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2021-05-18 12:28:19] [INFO ] Computed 14 place invariants in 15 ms
[2021-05-18 12:28:19] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned sat
[2021-05-18 12:28:19] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:20] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-18 12:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:28:20] [INFO ] [Real]Added 1 Read/Feed constraints in 18 ms returned sat
[2021-05-18 12:28:20] [INFO ] Deduced a trap composed of 34 places in 150 ms
[2021-05-18 12:28:20] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2021-05-18 12:28:20] [INFO ] Deduced a trap composed of 35 places in 241 ms
[2021-05-18 12:28:20] [INFO ] Deduced a trap composed of 34 places in 98 ms
[2021-05-18 12:28:20] [INFO ] Deduced a trap composed of 32 places in 115 ms
[2021-05-18 12:28:20] [INFO ] Deduced a trap composed of 32 places in 64 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 33 places in 60 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 34 places in 47 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 33 places in 52 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 32 places in 45 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 33 places in 60 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 33 places in 122 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 36 places in 45 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 32 places in 55 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2021-05-18 12:28:21] [INFO ] Deduced a trap composed of 34 places in 53 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 32 places in 33 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 58 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 34 places in 45 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 35 places in 53 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 46 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 46 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 59 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 34 places in 64 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 57 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 33 places in 39 ms
[2021-05-18 12:28:22] [INFO ] Deduced a trap composed of 36 places in 30 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 31 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 35 places in 31 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 30 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 49 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 36 places in 48 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 34 places in 66 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 34 places in 52 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 35 places in 38 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 32 places in 39 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 35 places in 38 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 34 places in 43 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 35 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 36 places in 35 ms
[2021-05-18 12:28:23] [INFO ] Deduced a trap composed of 36 places in 28 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 35 places in 28 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 36 places in 31 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 35 places in 33 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 37 places in 35 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 37 places in 26 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 31 places in 31 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 32 places in 29 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 36 places in 31 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 32 places in 84 ms
[2021-05-18 12:28:24] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 35 places in 71 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 34 places in 43 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 36 places in 103 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 35 places in 47 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 33 places in 56 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 32 places in 95 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 35 places in 36 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 32 places in 35 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 33 places in 39 ms
[2021-05-18 12:28:25] [INFO ] Deduced a trap composed of 32 places in 90 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 35 places in 101 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 36 places in 70 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 36 places in 29 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 33 places in 31 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 35 places in 36 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 36 places in 37 ms
[2021-05-18 12:28:26] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 37 places in 55 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 35 places in 36 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 26 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 46 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 37 places in 53 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 35 places in 30 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 32 places in 30 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:27] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 34 places in 34 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 35 places in 28 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 37 places in 28 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 34 places in 96 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 35 places in 103 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 34 places in 61 ms
[2021-05-18 12:28:28] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 35 places in 146 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 37 places in 140 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 34 places in 195 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 36 places in 36 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 37 places in 48 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 37 places in 35 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2021-05-18 12:28:29] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 36 places in 35 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 35 places in 34 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 37 places in 26 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 37 places in 27 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 36 places in 49 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 38 places in 25 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 35 places in 36 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 36 places in 36 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 35 places in 82 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 36 places in 35 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 38 places in 28 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 38 places in 34 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 36 places in 28 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 38 places in 35 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 39 places in 27 ms
[2021-05-18 12:28:30] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:28:31] [INFO ] Deduced a trap composed of 38 places in 41 ms
[2021-05-18 12:28:31] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:28:31] [INFO ] Deduced a trap composed of 40 places in 25 ms
[2021-05-18 12:28:31] [INFO ] Trap strengthening (SAT) tested/added 191/190 trap constraints in 11059 ms
[2021-05-18 12:28:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:28:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 22 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:31] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:31] [INFO ] Deduced a trap composed of 39 places in 45 ms
[2021-05-18 12:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-18 12:28:31] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 21 ms.
[2021-05-18 12:28:31] [INFO ] Added : 90 causal constraints over 18 iterations in 342 ms. Result :sat
[2021-05-18 12:28:31] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:31] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:31] [INFO ] Deduced a trap composed of 33 places in 39 ms
[2021-05-18 12:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-18 12:28:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:28:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:31] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-18 12:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:31] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 14 ms.
[2021-05-18 12:28:32] [INFO ] Added : 96 causal constraints over 20 iterations in 571 ms. Result :sat
[2021-05-18 12:28:32] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:28:32] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:32] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:28:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-18 12:28:32] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 14 ms.
[2021-05-18 12:28:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:28:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 66 ms returned sat
[2021-05-18 12:28:32] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:32] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-18 12:28:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:32] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 15 ms.
[2021-05-18 12:28:33] [INFO ] Added : 105 causal constraints over 22 iterations in 321 ms. Result :sat
[2021-05-18 12:28:33] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:33] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:33] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2021-05-18 12:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-18 12:28:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:28:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:33] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:33] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 15 ms.
[2021-05-18 12:28:33] [INFO ] Added : 97 causal constraints over 21 iterations in 344 ms. Result :sat
[2021-05-18 12:28:33] [INFO ] Deduced a trap composed of 31 places in 34 ms
[2021-05-18 12:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-18 12:28:33] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:34] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2021-05-18 12:28:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:28:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:28:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:34] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:28:34] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 14 ms.
[2021-05-18 12:28:34] [INFO ] Added : 97 causal constraints over 21 iterations in 358 ms. Result :sat
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 31 places in 31 ms
[2021-05-18 12:28:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-18 12:28:34] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:34] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:28:34] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 32 places in 35 ms
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 33 places in 34 ms
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2021-05-18 12:28:34] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 33 places in 35 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 34 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 30 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 33 places in 30 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 32 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 36 places in 47 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 32 places in 38 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 42 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 28 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 41 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 35 places in 31 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 36 places in 25 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:28:35] [INFO ] Deduced a trap composed of 33 places in 26 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 33 places in 26 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 33 places in 40 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 34 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 36 places in 26 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 36 places in 33 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 36 places in 32 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 37 places in 33 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 33 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 36 places in 37 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 38 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 36 places in 28 ms
[2021-05-18 12:28:36] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2021-05-18 12:28:37] [INFO ] Deduced a trap composed of 36 places in 30 ms
[2021-05-18 12:28:37] [INFO ] Deduced a trap composed of 36 places in 31 ms
[2021-05-18 12:28:37] [INFO ] Deduced a trap composed of 38 places in 31 ms
[2021-05-18 12:28:37] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 2357 ms
[2021-05-18 12:28:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:28:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:28:37] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:28:37] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:28:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:28:37] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 13 ms.
[2021-05-18 12:28:37] [INFO ] Added : 97 causal constraints over 20 iterations in 318 ms. Result :sat
[2021-05-18 12:28:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 12:28:37] [INFO ] Flatten gal took : 82 ms
FORMULA HealthRecord-PT-01-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:28:37] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:28:37] [INFO ] Applying decomposition
[2021-05-18 12:28:37] [INFO ] Flatten gal took : 12 ms
[2021-05-18 12:28:38] [INFO ] Input system was already deterministic with 213 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12096109924137872907.txt, -o, /tmp/graph12096109924137872907.bin, -w, /tmp/graph12096109924137872907.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12096109924137872907.bin, -l, -1, -v, -w, /tmp/graph12096109924137872907.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:28:38] [INFO ] Decomposing Gal with order
[2021-05-18 12:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 205 out of 213 initially.
// Phase 1: matrix 205 rows 117 cols
[2021-05-18 12:28:38] [INFO ] Computed 14 place invariants in 3 ms
inv : 2*p0 + p20 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 2
inv : -p0 + p26 + p27 + p28 + p29 - p48 - p49 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 = -1
inv : -p0 + p36 + p37 + p38 + p39 - p48 - p49 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 = -1
inv : -p0 + p31 + p32 + p33 + p34 - p48 - p49 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 = -1
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p48 - p49 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 = -1
inv : 2*p0 + p30 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 2
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 1
inv : 2*p0 + p1 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 2
inv : p0 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 = 1
inv : 2*p0 + p35 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 2
inv : -p0 + p21 + p22 + p23 + p24 - p48 - p49 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 = -1
inv : 2*p0 + p40 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 2
inv : -p0 + p41 + p42 + p43 + p44 + p45 + p46 - p48 - p49 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 = -1
inv : 2*p0 + p25 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 2
Total of 14 invariants.
[2021-05-18 12:28:38] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-18 12:28:38] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-18 12:28:38] [INFO ] Flatten gal took : 81 ms
[2021-05-18 12:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2021-05-18 12:28:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2021-05-18 12:28:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !(((X(G(X(G("(u0.p16==1)")))))U("(((i6.u12.p71!=1)||(i9.u15.p76!=1))&&(i9.u14.p116==1))")))
Formula 0 simplified : !(XGXG"(u0.p16==1)" U "(((i6.u12.p71!=1)||(i9.u15.p76!=1))&&(i9.u14.p116==1))")
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 23 ordering constraints for composite.
built 53 ordering constraints for composite.
[2021-05-18 12:28:38] [INFO ] Proved 117 variables to be positive in 431 ms
[2021-05-18 12:28:38] [INFO ] Computing symmetric may disable matrix : 213 transitions.
[2021-05-18 12:28:38] [INFO ] Computation of disable matrix completed :0/213 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:28:38] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:28:38] [INFO ] Computing symmetric may enable matrix : 213 transitions.
[2021-05-18 12:28:38] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t12, t66, u0.t129, u0.t130, u0.t131, u0.t132, u0.t133, u0.t134, u0.t135, u0.t136, u0.t137, u0.t138, u0.t139, u0.t140, u0.t141, u0.t142, u0.t143, u0.t144, u0.t145, u0.t146, u0.t147, u0.t148, u0.t149, u0.t150, u0.t152, u0.t153, u0.t154, u0.t156, u0.t157, u0.t159, u0.t160, u0.t163, u9.t104, u9.t105, u9.t106, u9.t107, u9.t108, u9.t110, u9.t111, u9.t112, i6.t64, i6.u12.t60, i6.u12.t61, i6.u12.t70, i6.u12.t71, i6.u12.t72, i6.u12.t73, i6.u12.t74, i6.u12.t75, i6.u12.t76, i6.u12.t77, i6.u12.t78, i6.u12.t79, i6.u12.t80, i6.u12.t81, i6.u12.t82, i6.u12.t83, i6.u12.t84, i6.u12.t85, i6.u12.t86, i6.u12.t87, i6.u12.t88, i6.u12.t89, i6.u12.t90, i6.u12.t91, i6.u12.t92, i6.u12.t93, i6.u12.t94, i6.u12.t95, i6.u12.t96, i6.u12.t97, i6.u12.t98, i6.u12.t99, i6.u12.t100, i6.u12.t101, i6.u12.t102, i6.u12.t103, i9.t52, i9.t41, i9.t8, i9.u14.t2, i9.u14.t5, i9.u14.t9, i9.u14.t20, i9.u14.t23, i9.u14.t28, i9.u14.t34, i9.u14.t40, i9.u14.t46, i9.u14.t50, i9.u14.t53, i9.u14.t56, i9.u15.t3, i9.u15.t6, i9.u15.t7, i9.u15.t14, i9.u15.t15, i9.u15.t16, i9.u15.t18, i9.u15.t21, i9.u15.t24, i9.u15.t25, i9.u15.t26, i9.u15.t30, i9.u15.t31, i9.u15.t32, i9.u15.t36, i9.u15.t37, i9.u15.t38, i9.u15.t42, i9.u15.t43, i9.u15.t44, i9.u15.t48, i9.u15.t51, i9.u15.t54, i9.u15.t57, i9.u15.t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/117/195
Computing Next relation with stutter on 9 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
89 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.962402,42720,1,0,28328,37963,2545,60918,1604,124961,80020
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((F(((((((((F("(u0.p5==1)"))&&("(u0.p17==1)"))&&("(i1.u2.p23==1)"))&&("(i2.u4.p28==1)"))&&("(i3.u6.p33==1)"))&&("(i4.u8.p38==1)"))&&("(u9.p45==1)"))&&("(i6.u12.p72==1)"))&&("(i9.u14.p109==1)")))&&((F(G("(u0.p5==1)")))||("(u0.p5!=1)")))))
Formula 1 simplified : !G(F("(i1.u2.p23==1)" & "(i2.u4.p28==1)" & "(i3.u6.p33==1)" & "(i4.u8.p38==1)" & "(i6.u12.p72==1)" & "(i9.u14.p109==1)" & "(u0.p17==1)" & "(u9.p45==1)" & F"(u0.p5==1)") & ("(u0.p5!=1)" | FG"(u0.p5==1)"))
Computing Next relation with stutter on 9 deadlock states
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.09356,47204,1,0,31467,38598,2679,66680,1619,128338,89034
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(((G(X(G("(u9.p46!=1)"))))U("(i6.u12.p63==1)"))&&(F("(i6.u12.p63==1)")))))
Formula 2 simplified : !X((GXG"(u9.p46!=1)" U "(i6.u12.p63==1)") & F"(i6.u12.p63==1)")
Computing Next relation with stutter on 9 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.29457,53276,1,0,38892,43405,2724,83555,1623,152982,102405
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(X(G(X(!(G((G("(u0.p2==1)"))||("(i9.u15.p104!=1)"))))))))))
Formula 3 simplified : !XFXGX!G("(i9.u15.p104!=1)" | G"(u0.p2==1)")
Computing Next relation with stutter on 9 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.335,54332,1,0,39772,43526,2756,84820,1627,153561,105250
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((G("(u10.p65==1)"))||("((i9.u15.p103!=1)&&(i9.u14.p81==1))"))U(X("((u0.p16!=1)||(i9.u15.p97!=1))"))))
Formula 4 simplified : !(("((i9.u15.p103!=1)&&(i9.u14.p81==1))" | G"(u10.p65==1)") U X"((u0.p16!=1)||(i9.u15.p97!=1))")
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.33708,54596,1,0,39772,43526,2795,84820,1629,153561,105290
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HealthRecord-PT-01-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(G(F(X(X("(i9.u15.p100==1)"))))))U((G("((u0.p16==1)&&(i9.u14.p114==1))"))||("((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u15.p115==1))"))))
Formula 5 simplified : !(FGFXX"(i9.u15.p100==1)" U ("((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u15.p115==1))" | G"((u0.p16==1)&&(i9.u14.p114==1))"))
Computing Next relation with stutter on 9 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
108 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.41813,96044,1,0,114766,60226,2851,211817,1632,290468,150994
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(G(X(X(G((G(X(X("(i9.u14.p79==1)"))))||(!(F("((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u15.p115==1))")))))))))))
Formula 6 simplified : !GXGXXG(GXX"(i9.u14.p79==1)" | !F"((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u15.p115==1))")
Computing Next relation with stutter on 9 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.65771,105812,1,0,130395,61810,2899,238559,1632,302077,168188
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(((F((X("(i4.u8.p35==1)"))U("((i6.u12.p71==1)&&(i9.u15.p86==1))")))&&("(i4.u8.p35!=1)"))U(F(X(G("(i9.u14.p99==1)")))))))
Formula 7 simplified : !F(("(i4.u8.p35!=1)" & F(X"(i4.u8.p35==1)" U "((i6.u12.p71==1)&&(i9.u15.p86==1))")) U FXG"(i9.u14.p99==1)")
Computing Next relation with stutter on 9 deadlock states
[2021-05-18 12:28:41] [INFO ] Computing symmetric co enabling matrix : 213 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.81325,111356,1,0,139650,62430,2919,250644,1632,306994,181924
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G((!(G((G("((i6.u12.p71==1)&&(i9.u15.p90==1))"))U(G(F(X("(i4.u8.p25==1)")))))))&&("(i4.u8.p25!=1)")))||(X("((i6.u12.p71==1)&&(i9.u15.p90==1))"))))
Formula 8 simplified : !(G("(i4.u8.p25!=1)" & !G(G"((i6.u12.p71==1)&&(i9.u15.p90==1))" U GFX"(i4.u8.p25==1)")) | X"((i6.u12.p71==1)&&(i9.u15.p90==1))")
Computing Next relation with stutter on 9 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.96308,116612,1,0,146722,67369,2963,266175,1634,334128,189237
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(X(F(G((F("(i2.u4.p47==1)"))&&("(i1.u2.p74==1)"))))))U(F("(u9.p43==1)"))))
Formula 9 simplified : !(!XFG("(i1.u2.p74==1)" & F"(i2.u4.p47==1)") U F"(u9.p43==1)")
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.03267,118196,1,0,148937,68110,2977,270804,1634,338056,194624
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((((G("((u0.p16==1)&&(i9.u14.p114==1))"))&&("(i9.u15.p75!=1)"))U(F("(i9.u15.p75==1)")))U((X(G("((u0.p16==1)&&(i9.u14.p114==1))")))&&(G("(i9.u14.p99==1)")))))
Formula 10 simplified : !((("(i9.u15.p75!=1)" & G"((u0.p16==1)&&(i9.u14.p114==1))") U F"(i9.u15.p75==1)") U (XG"((u0.p16==1)&&(i9.u14.p114==1))" & G"(i9.u14.p99==1)"))
Computing Next relation with stutter on 9 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.04901,118988,1,0,149798,68122,2991,271857,1634,338150,199288
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("((u0.p16==1)&&(i9.u14.p114==1))")))
Formula 11 simplified : !F"((u0.p16==1)&&(i9.u14.p114==1))"
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.07829,120308,1,0,151847,68134,3013,274233,1634,338433,208910
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((F("(i6.u12.p73==1)"))U("(i3.u6.p34==1)"))U(!(G((!(("(i3.u6.p34==1)")U("(i9.u14.p83==1)")))||("(i9.u14.p83!=1)"))))))
Formula 12 simplified : !((F"(i6.u12.p73==1)" U "(i3.u6.p34==1)") U !G("(i9.u14.p83!=1)" | !("(i3.u6.p34==1)" U "(i9.u14.p83==1)")))
Computing Next relation with stutter on 9 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.30376,127172,1,0,161634,70944,3063,292343,1639,359042,228083
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(X(F(((F("(i9.u14.p87==1)"))&&("(i6.u12.p49==1)"))||("(i6.u12.p49==1)"))))))
Formula 13 simplified : XF("(i6.u12.p49==1)" | ("(i6.u12.p49==1)" & F"(i9.u14.p87==1)"))
Computing Next relation with stutter on 9 deadlock states
[2021-05-18 12:28:41] [INFO ] Computation of co-enabling matrix(2/213) took 791 ms. Total solver calls (SAT/UNSAT): 631(223/408)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.51242,133508,1,0,169135,75608,3074,310919,1639,388292,240290
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((("(i9.u15.p90==1)")U(G((F("(i9.u15.p90==1)"))U("(u0.p5!=1)")))))
Formula 14 simplified : !("(i9.u15.p90==1)" U G(F"(i9.u15.p90==1)" U "(u0.p5!=1)"))
Computing Next relation with stutter on 9 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.67962,139052,1,0,175908,79761,3091,326985,1639,416682,251776
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA HealthRecord-PT-01-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 12:28:42] [INFO ] Built C files in 4752ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621340923786

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="HealthRecord-PT-01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is HealthRecord-PT-01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;