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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.052 18954.00 35866.00 312.50 FFTFTFFFFFFFFFFF 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-162124171200134.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.9K May 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 34K 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-02-00
FORMULA_NAME HealthRecord-PT-02-01
FORMULA_NAME HealthRecord-PT-02-02
FORMULA_NAME HealthRecord-PT-02-03
FORMULA_NAME HealthRecord-PT-02-04
FORMULA_NAME HealthRecord-PT-02-05
FORMULA_NAME HealthRecord-PT-02-06
FORMULA_NAME HealthRecord-PT-02-07
FORMULA_NAME HealthRecord-PT-02-08
FORMULA_NAME HealthRecord-PT-02-09
FORMULA_NAME HealthRecord-PT-02-10
FORMULA_NAME HealthRecord-PT-02-11
FORMULA_NAME HealthRecord-PT-02-12
FORMULA_NAME HealthRecord-PT-02-13
FORMULA_NAME HealthRecord-PT-02-14
FORMULA_NAME HealthRecord-PT-02-15

=== Now, execution of the tool begins

BK_START 1621340985935

[2021-05-18 12:29:47] [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:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:29:47] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-18 12:29:47] [INFO ] Transformed 119 places.
[2021-05-18 12:29:47] [INFO ] Transformed 225 transitions.
[2021-05-18 12:29:47] [INFO ] Found NUPN structural information;
[2021-05-18 12:29:47] [INFO ] Parsed PT model containing 119 places and 225 transitions in 90 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5930 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1]
[2021-05-18 12:29:47] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2021-05-18 12:29:47] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 12:29:48] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-18 12:29:48] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-18 12:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:48] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-18 12:29:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:29:48] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:48] [INFO ] Deduced a trap composed of 40 places in 84 ms
[2021-05-18 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2021-05-18 12:29:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2021-05-18 12:29:48] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:48] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-18 12:29:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:48] [INFO ] Deduced a trap composed of 40 places in 58 ms
[2021-05-18 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-18 12:29:48] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 22 ms.
[2021-05-18 12:29:49] [INFO ] Added : 107 causal constraints over 22 iterations in 512 ms. Result :sat
[2021-05-18 12:29:49] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:49] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:49] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 18 ms.
[2021-05-18 12:29:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 46 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:49] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:49] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 16 ms.
[2021-05-18 12:29:49] [INFO ] Added : 98 causal constraints over 20 iterations in 330 ms. Result :sat
[2021-05-18 12:29:49] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2021-05-18 12:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-18 12:29:49] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:49] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:50] [INFO ] Deduced a trap composed of 37 places in 39 ms
[2021-05-18 12:29:50] [INFO ] Deduced a trap composed of 32 places in 38 ms
[2021-05-18 12:29:50] [INFO ] Deduced a trap composed of 45 places in 29 ms
[2021-05-18 12:29:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 133 ms
[2021-05-18 12:29:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:50] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:50] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-18 12:29:50] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 14 ms.
[2021-05-18 12:29:50] [INFO ] Added : 102 causal constraints over 21 iterations in 327 ms. Result :sat
[2021-05-18 12:29:50] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-18 12:29:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-18 12:29:50] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned unsat
[2021-05-18 12:29:50] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:50] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-18 12:29:50] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:50] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 37 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 35 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 35 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 36 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 31 places in 52 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 39 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 47 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2021-05-18 12:29:51] [INFO ] Deduced a trap composed of 44 places in 34 ms
[2021-05-18 12:29:51] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1043 ms
[2021-05-18 12:29:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 46 ms returned sat
[2021-05-18 12:29:52] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:52] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:29:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 44 places in 32 ms
[2021-05-18 12:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-18 12:29:52] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 11 ms.
[2021-05-18 12:29:52] [INFO ] Added : 102 causal constraints over 21 iterations in 343 ms. Result :sat
[2021-05-18 12:29:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:52] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:52] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-18 12:29:52] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 37 places in 38 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 32 places in 36 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 36 places in 36 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 36 places in 33 ms
[2021-05-18 12:29:52] [INFO ] Deduced a trap composed of 33 places in 35 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 33 places in 40 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 33 places in 31 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 34 places in 32 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 33 places in 34 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 34 places in 34 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 37 places in 35 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 37 places in 31 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 35 places in 34 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 39 places in 33 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 35 places in 47 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 36 places in 33 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 33 places in 35 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 36 places in 32 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:29:53] [INFO ] Deduced a trap composed of 36 places in 31 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 42 places in 34 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 41 places in 33 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 43 places in 35 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 36 places in 32 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 37 places in 46 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 33 places in 44 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 39 places in 30 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 35 places in 42 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 34 places in 30 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 37 places in 42 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 43 places in 29 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 38 places in 37 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 36 places in 34 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 35 places in 46 ms
[2021-05-18 12:29:54] [INFO ] Deduced a trap composed of 36 places in 38 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 38 places in 51 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 36 places in 36 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 37 places in 36 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 43 places in 44 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 38 places in 33 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 37 places in 30 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 43 places in 33 ms
[2021-05-18 12:29:55] [INFO ] Deduced a trap composed of 40 places in 27 ms
[2021-05-18 12:29:55] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 2856 ms
[2021-05-18 12:29:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 42 ms returned sat
[2021-05-18 12:29:55] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:55] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:29:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:55] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 15 ms.
[2021-05-18 12:29:55] [INFO ] Added : 103 causal constraints over 22 iterations in 352 ms. Result :sat
[2021-05-18 12:29:56] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2021-05-18 12:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-18 12:29:56] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:56] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:56] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 14 ms.
[2021-05-18 12:29:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 52 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:56] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:56] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 12 ms.
[2021-05-18 12:29:56] [INFO ] Added : 117 causal constraints over 24 iterations in 403 ms. Result :sat
[2021-05-18 12:29:56] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:56] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:29:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:56] [INFO ] Deduced a trap composed of 32 places in 44 ms
[2021-05-18 12:29:57] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2021-05-18 12:29:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 93 ms
[2021-05-18 12:29:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:57] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:57] [INFO ] Deduced a trap composed of 36 places in 37 ms
[2021-05-18 12:29:57] [INFO ] Deduced a trap composed of 34 places in 47 ms
[2021-05-18 12:29:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2021-05-18 12:29:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 53 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:57] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:57] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 15 ms.
[2021-05-18 12:29:57] [INFO ] Added : 102 causal constraints over 21 iterations in 498 ms. Result :sat
[2021-05-18 12:29:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:58] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-18 12:29:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:58] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 13 ms.
[2021-05-18 12:29:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-18 12:29:58] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:58] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:29:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:58] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 15 ms.
[2021-05-18 12:29:58] [INFO ] Added : 126 causal constraints over 26 iterations in 453 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-18 12:29:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 12:29:58] [INFO ] Flatten gal took : 50 ms
FORMULA HealthRecord-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:29:58] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:29:58] [INFO ] Applying decomposition
[2021-05-18 12:29:59] [INFO ] Flatten gal took : 24 ms
[2021-05-18 12:29:59] [INFO ] Input system was already deterministic with 219 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/graph16086649549715234225.txt, -o, /tmp/graph16086649549715234225.bin, -w, /tmp/graph16086649549715234225.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 211 out of 219 initially.
// Phase 1: matrix 211 rows 119 cols
[2021-05-18 12:29:59] [INFO ] Computed 14 place invariants in 2 ms
inv : -p0 + p26 + p27 + p28 + p29 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - 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 - p117 - p118 = -1
inv : -p0 + p31 + p32 + p33 + p34 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - 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 - p117 - p118 = -1
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - 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 - p117 - p118 = -1
inv : p0 + 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 + p74 + p75 = 1
inv : 2*p0 + p20 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + 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 + p117 + p118 = 2
inv : 2*p0 + p1 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + 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 + p117 + p118 = 2
inv : 2*p0 + p35 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + 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 + p117 + p118 = 2
inv : 2*p0 + p25 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + 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 + p117 + p118 = 2
inv : -p0 + p36 + p37 + p38 + p39 + p40 + p41 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - 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 - p117 - p118 = -1
inv : 2*p0 + p30 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + 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 + p117 + p118 = 2
inv : -p0 + p43 + p44 + p45 + p46 + p47 + p48 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - 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 - p117 - p118 = -1
inv : 2*p0 + p42 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + 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 + p117 + p118 = 2
inv : p0 + 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 + p117 + p118 = 1
inv : -p0 + p21 + p22 + p23 + p24 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - 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 - p117 - p118 = -1
Total of 14 invariants.
[2021-05-18 12:29:59] [INFO ] Computed 14 place invariants in 4 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16086649549715234225.bin, -l, -1, -v, -w, /tmp/graph16086649549715234225.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:29:59] [INFO ] Decomposing Gal with order
[2021-05-18 12:29:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 12:29:59] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-18 12:29:59] [INFO ] Flatten gal took : 79 ms
[2021-05-18 12:29:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 12 ms.
[2021-05-18 12:29:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2021-05-18 12:29:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 13 LTL properties
Checking formula 0 : !(((G(X("((u0.p16==1)&&(i7.u14.p112==1))")))U("(u0.p7==1)")))
Formula 0 simplified : !(GX"((u0.p16==1)&&(i7.u14.p112==1))" U "(u0.p7==1)")
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 54 ordering constraints for composite.
[2021-05-18 12:29:59] [INFO ] Proved 119 variables to be positive in 331 ms
[2021-05-18 12:29:59] [INFO ] Computing symmetric may disable matrix : 219 transitions.
[2021-05-18 12:29:59] [INFO ] Computation of disable matrix completed :0/219 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:29:59] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:29:59] [INFO ] Computing symmetric may enable matrix : 219 transitions.
[2021-05-18 12:29:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions 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.t151, u0.t152, u0.t153, u0.t154, u0.t155, u0.t157, u0.t158, u0.t159, u0.t161, u0.t162, u0.t164, u0.t165, u0.t168, u7.t113, u7.t114, u7.t115, u7.t116, u7.t117, u7.t119, u7.t120, u7.t121, u8.t104, u8.t105, u8.t106, u8.t107, u8.t108, u8.t110, u8.t111, u8.t112, i6.t66, i6.t62, i6.u11.t60, i6.u11.t61, i6.u11.t70, i6.u11.t71, i6.u11.t72, i6.u11.t73, i6.u11.t74, i6.u11.t75, i6.u11.t76, i6.u11.t77, i6.u11.t78, i6.u11.t79, i6.u11.t80, i6.u11.t81, i6.u11.t82, i6.u11.t83, i6.u11.t84, i6.u11.t85, i6.u11.t86, i6.u11.t87, i6.u11.t88, i6.u11.t89, i6.u11.t90, i6.u11.t91, i6.u11.t92, i6.u11.t93, i6.u11.t94, i6.u11.t95, i6.u11.t96, i6.u11.t97, i6.u11.t98, i6.u11.t99, i6.u11.t100, i6.u11.t101, i6.u11.t102, i6.u11.t103, i7.t52, i7.t41, i7.t12, i7.t8, i7.u13.t2, i7.u13.t5, i7.u13.t9, i7.u13.t17, i7.u13.t20, i7.u13.t23, i7.u13.t28, i7.u13.t34, i7.u13.t50, i7.u13.t53, i7.u13.t56, i7.u13.t59, i7.u14.t3, i7.u14.t6, i7.u14.t7, i7.u14.t14, i7.u14.t15, i7.u14.t18, i7.u14.t21, i7.u14.t24, i7.u14.t25, i7.u14.t26, i7.u14.t30, i7.u14.t31, i7.u14.t32, i7.u14.t36, i7.u14.t37, i7.u14.t38, i7.u14.t39, i7.u14.t42, i7.u14.t43, i7.u14.t44, i7.u14.t45, i7.u14.t48, i7.u14.t51, i7.u14.t54, i7.u14.t57, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/125/200
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:30:00] [INFO ] Computing symmetric co enabling matrix : 219 transitions.
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
165 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.68179,56664,1,0,44865,47035,2505,99810,1606,172883,120557
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(("(i6.u11.p62==1)")U((G("(u7.p38==1)"))U(F((G(F(X("(u0.p6==1)"))))&&(G("(u7.p38==1)")))))))))
Formula 1 simplified : !FG("(i6.u11.p62==1)" U (G"(u7.p38==1)" U F(G"(u7.p38==1)" & GFX"(u0.p6==1)")))
Computing Next relation with stutter on 17 deadlock states
23 unique states visited
23 strongly connected components in search stack
24 transitions explored
23 items max in DFS search stack
85 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.53126,79584,1,0,65355,63275,2627,156587,1627,266210,158506
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X((!(F((("(i6.u11.p61==1)")U("(i6.u9.p67==1)"))&&("(u0.p6==1)"))))||(!(G("(u0.p6==1)")))))))
Formula 2 simplified : !XX(!F("(u0.p6==1)" & ("(i6.u11.p61==1)" U "(i6.u9.p67==1)")) | !G"(u0.p6==1)")
Computing Next relation with stutter on 17 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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,2.53279,79836,1,0,65374,63275,2658,156595,1631,266210,158616
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA HealthRecord-PT-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F(X("(i2.u4.p29==1)")))U("(i2.u4.p29==1)"))))
Formula 3 simplified : !G(FX"(i2.u4.p29==1)" U "(i2.u4.p29==1)")
Computing Next relation with stutter on 17 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
14 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.67162,84820,1,0,72376,69632,2687,172514,1633,301882,164134
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((X(G(X("((((u0.p16==1)&&(i7.u14.p95==1))||(i7.u13.p105!=1))||(i7.u13.p81==1))"))))U("(i7.u14.p94!=1)"))))
Formula 4 simplified : !X(XGX"((((u0.p16==1)&&(i7.u14.p95==1))||(i7.u13.p105!=1))||(i7.u13.p81==1))" U "(i7.u14.p94!=1)")
Computing Next relation with stutter on 17 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,2.67252,84820,1,0,72376,69632,2694,172514,1635,301882,164140
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HealthRecord-PT-02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(!(F((G("(u0.p5==1)"))&&("(i1.u2.p24==1)")))))))
Formula 5 simplified : !GF!F("(i1.u2.p24==1)" & G"(u0.p5==1)")
Computing Next relation with stutter on 17 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
5 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.72353,86652,1,0,75542,69862,2739,176297,1635,303503,175747
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(("(i3.u5.p31==1)")U(X(!(F(X("((i6.u11.p73==1)&&(i7.u14.p102==1))")))))))))
Formula 6 simplified : !GF("(i3.u5.p31==1)" U X!FX"((i6.u11.p73==1)&&(i7.u14.p102==1))")
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:30:02] [INFO ] Computation of co-enabling matrix(5/219) took 1928 ms. Total solver calls (SAT/UNSAT): 1288(573/715)
22 unique states visited
21 strongly connected components in search stack
26 transitions explored
22 items max in DFS search stack
36 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.08239,93516,1,0,81377,70818,2766,191797,1637,309569,197603
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(X(G("(u8.p48==1)"))))))
Formula 7 simplified : !XGXG"(u8.p48==1)"
Computing Next relation with stutter on 17 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 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.09723,93780,1,0,81628,70823,2780,192364,1637,309617,198463
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((F(X(F(("((i2.u4.p0!=1)&&(i7.u13.p105!=1))")U("(i7.u13.p105==1)")))))&&("(i2.u4.p0!=1)"))))
Formula 8 simplified : !F("(i2.u4.p0!=1)" & FXF("((i2.u4.p0!=1)&&(i7.u13.p105!=1))" U "(i7.u13.p105==1)"))
Computing Next relation with stutter on 17 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
34 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.43918,102756,1,0,92522,73800,2818,212493,1639,337301,225757
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(G(!(("(i6.u11.p59==1)")U("((u8.p46==1)&&(i7.u13.p116==1))")))))||(!(G(X("(i7.u13.p93!=1)"))))))
Formula 9 simplified : !(!G!("(i6.u11.p59==1)" U "((u8.p46==1)&&(i7.u13.p116==1))") | !GX"(i7.u13.p93!=1)")
Computing Next relation with stutter on 17 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.65316,109620,1,0,100737,76885,2848,227487,1641,358265,249033
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X((!(G(X(!(F("(i6.u10.p70==1)"))))))&&(!(G("(i6.u11.p51==1)")))))))
Formula 10 simplified : !FX(!GX!F"(i6.u10.p70==1)" & !G"(i6.u11.p51==1)")
Computing Next relation with stutter on 17 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
27 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.92942,115692,1,0,107085,78285,2872,242318,1641,366895,266334
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(((X("((i6.u11.p73==1)&&(i7.u14.p115==1))"))||("(i3.u6.p30==1)"))U(G("(i3.u6.p30!=1)")))))
Formula 11 simplified : !G(("(i3.u6.p30==1)" | X"((i6.u11.p73==1)&&(i7.u14.p115==1))") U G"(i3.u6.p30!=1)")
Computing Next relation with stutter on 17 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.9596,116188,1,0,107306,78285,2909,242597,1646,366895,268730
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(X(X(!(X("(i3.u6.p30==1)"))))))))
Formula 12 simplified : !GFXX!X"(i3.u6.p30==1)"
Computing Next relation with stutter on 17 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 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,3.96085,116188,1,0,107306,78285,2920,242598,1646,366895,268795
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-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:30:03] [INFO ] Built C files in 4910ms 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 1621341004889

--------------------
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-02"
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-02, 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-162124171200134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-02.tgz
mv HealthRecord-PT-02 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 ;