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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2636.655 137229.00 252284.00 568.70 FFFFFFFFFTFFFFTF 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-162124171300170.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-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 27K 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 16K 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.7K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 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 51K 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-11-00
FORMULA_NAME HealthRecord-PT-11-01
FORMULA_NAME HealthRecord-PT-11-02
FORMULA_NAME HealthRecord-PT-11-03
FORMULA_NAME HealthRecord-PT-11-04
FORMULA_NAME HealthRecord-PT-11-05
FORMULA_NAME HealthRecord-PT-11-06
FORMULA_NAME HealthRecord-PT-11-07
FORMULA_NAME HealthRecord-PT-11-08
FORMULA_NAME HealthRecord-PT-11-09
FORMULA_NAME HealthRecord-PT-11-10
FORMULA_NAME HealthRecord-PT-11-11
FORMULA_NAME HealthRecord-PT-11-12
FORMULA_NAME HealthRecord-PT-11-13
FORMULA_NAME HealthRecord-PT-11-14
FORMULA_NAME HealthRecord-PT-11-15

=== Now, execution of the tool begins

BK_START 1621341842019

[2021-05-18 12:44:03] [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:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:44:03] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-18 12:44:03] [INFO ] Transformed 159 places.
[2021-05-18 12:44:03] [INFO ] Transformed 334 transitions.
[2021-05-18 12:44:03] [INFO ] Found NUPN structural information;
[2021-05-18 12:44:03] [INFO ] Parsed PT model containing 159 places and 334 transitions in 110 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 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 6785 resets, run finished after 371 ms. (steps per millisecond=269 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1]
[2021-05-18 12:44:04] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2021-05-18 12:44:04] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:44:04] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:44:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned unsat
[2021-05-18 12:44:04] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:04] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-18 12:44:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:44:04] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:04] [INFO ] Deduced a trap composed of 30 places in 122 ms
[2021-05-18 12:44:05] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2021-05-18 12:44:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2021-05-18 12:44:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 79 ms returned sat
[2021-05-18 12:44:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2021-05-18 12:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:05] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-18 12:44:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:05] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 21 ms.
[2021-05-18 12:44:07] [INFO ] Added : 171 causal constraints over 36 iterations in 1908 ms. Result :sat
[2021-05-18 12:44:07] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2021-05-18 12:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2021-05-18 12:44:07] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:07] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-18 12:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:07] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:44:07] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:07] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 22 ms.
[2021-05-18 12:44:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:44:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:07] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:44:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:07] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 25 ms.
[2021-05-18 12:44:09] [INFO ] Added : 191 causal constraints over 39 iterations in 1778 ms. Result :sat
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:09] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 29 ms.
[2021-05-18 12:44:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 82 ms returned sat
[2021-05-18 12:44:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:10] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:44:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:10] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 16 ms.
[2021-05-18 12:44:11] [INFO ] Added : 165 causal constraints over 34 iterations in 1271 ms. Result :sat
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:11] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 19 ms.
[2021-05-18 12:44:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 118 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:11] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-18 12:44:12] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 18 ms.
[2021-05-18 12:44:14] [INFO ] Added : 163 causal constraints over 33 iterations in 2504 ms. Result :sat
[2021-05-18 12:44:14] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:44:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:14] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:44:14] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:14] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2021-05-18 12:44:14] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2021-05-18 12:44:14] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:44:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 118 ms
[2021-05-18 12:44:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 72 ms returned sat
[2021-05-18 12:44:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:15] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:15] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-18 12:44:15] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 22 ms.
[2021-05-18 12:44:16] [INFO ] Added : 163 causal constraints over 33 iterations in 1687 ms. Result :sat
[2021-05-18 12:44:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:16] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:44:16] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:16] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2021-05-18 12:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-18 12:44:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:17] [INFO ] Deduced a trap composed of 39 places in 45 ms
[2021-05-18 12:44:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-18 12:44:17] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:19] [INFO ] Added : 159 causal constraints over 34 iterations in 2542 ms. Result :sat
[2021-05-18 12:44:19] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:19] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:19] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:44:19] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:19] [INFO ] Deduced a trap composed of 47 places in 47 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 31 places in 43 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 41 places in 33 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:44:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 345 ms
[2021-05-18 12:44:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 44 places in 47 ms
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:44:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2021-05-18 12:44:20] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:22] [INFO ] Added : 158 causal constraints over 32 iterations in 1591 ms. Result :sat
[2021-05-18 12:44:22] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:22] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:22] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2021-05-18 12:44:22] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:44:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2021-05-18 12:44:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:22] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:22] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:23] [INFO ] Added : 147 causal constraints over 31 iterations in 991 ms. Result :sat
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using state equation in 81 ms returned unsat
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:23] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:44:23] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:23] [INFO ] Deduced a trap composed of 31 places in 30 ms
[2021-05-18 12:44:23] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2021-05-18 12:44:24] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-18 12:44:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2021-05-18 12:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 73 ms returned sat
[2021-05-18 12:44:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:24] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:44:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:24] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-18 12:44:24] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 16 ms.
[2021-05-18 12:44:25] [INFO ] Added : 158 causal constraints over 32 iterations in 975 ms. Result :sat
[2021-05-18 12:44:25] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:25] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:44:25] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:25] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 79 ms returned sat
[2021-05-18 12:44:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:25] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:44:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:25] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:26] [INFO ] Added : 160 causal constraints over 32 iterations in 1137 ms. Result :sat
[2021-05-18 12:44:26] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:44:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:27] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:44:27] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:27] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 72 ms returned sat
[2021-05-18 12:44:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:27] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:44:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:27] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 21 ms.
[2021-05-18 12:44:28] [INFO ] Added : 160 causal constraints over 32 iterations in 1146 ms. Result :sat
[2021-05-18 12:44:28] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:44:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:28] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:44:28] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:28] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:44:28] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2021-05-18 12:44:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2021-05-18 12:44:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 74 ms returned sat
[2021-05-18 12:44:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:28] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:44:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:28] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 16 ms.
[2021-05-18 12:44:30] [INFO ] Added : 168 causal constraints over 34 iterations in 1327 ms. Result :sat
[2021-05-18 12:44:30] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:30] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:44:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:30] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2021-05-18 12:44:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-18 12:44:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-18 12:44:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:30] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:44:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-18 12:44:30] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2021-05-18 12:44:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-18 12:44:30] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:31] [INFO ] Added : 154 causal constraints over 31 iterations in 999 ms. Result :sat
[2021-05-18 12:44:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:31] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:44:31] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:31] [INFO ] Deduced a trap composed of 45 places in 46 ms
[2021-05-18 12:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-18 12:44:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-18 12:44:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:32] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:44:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:44:32] [INFO ] Deduced a trap composed of 45 places in 50 ms
[2021-05-18 12:44:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-18 12:44:32] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 15 ms.
[2021-05-18 12:44:33] [INFO ] Added : 154 causal constraints over 31 iterations in 1000 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-18 12:44:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 12:44:33] [INFO ] Flatten gal took : 102 ms
FORMULA HealthRecord-PT-11-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:44:33] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:44:33] [INFO ] Applying decomposition
[2021-05-18 12:44:33] [INFO ] Flatten gal took : 28 ms
[2021-05-18 12:44:33] [INFO ] Input system was already deterministic with 307 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/graph5383083347509546307.txt, -o, /tmp/graph5383083347509546307.bin, -w, /tmp/graph5383083347509546307.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/graph5383083347509546307.bin, -l, -1, -v, -w, /tmp/graph5383083347509546307.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:44:33] [INFO ] Decomposing Gal with order
[2021-05-18 12:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 295 out of 307 initially.
// Phase 1: matrix 295 rows 159 cols
[2021-05-18 12:44:33] [INFO ] Computed 18 place invariants in 3 ms
inv : -p0 + p39 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : 2*p0 + p40 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : 2*p0 + p58 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : p0 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 1
inv : p0 + 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 = 1
inv : 2*p0 + p21 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : 2*p0 + p68 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : -p0 + p1 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : -p0 + p76 + p77 + p78 + p79 + p80 + p81 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : 2*p0 + p82 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : -p0 + p20 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : 2*p0 + p2 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : -p0 + p64 + p65 + p66 + p67 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : -p0 + p69 + p70 + p71 + p72 + p73 + p74 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : -p0 + p83 + p84 + p85 + p86 + p87 + p88 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
inv : 2*p0 + p75 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : 2*p0 + p63 + 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 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 2
inv : -p0 + p59 + p60 + p61 + p62 - 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 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 = -1
Total of 18 invariants.
[2021-05-18 12:44:33] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-18 12:44:34] [INFO ] Removed a total of 93 redundant transitions.
[2021-05-18 12:44:34] [INFO ] Flatten gal took : 85 ms
[2021-05-18 12:44:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 12 ms.
[2021-05-18 12:44:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
[2021-05-18 12:44:34] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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 : !((("(u0.p14==1)")U(G(!(X("(u0.p14==1)"))))))
Formula 0 simplified : !("(u0.p14==1)" U G!X"(u0.p14==1)")
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 46 ordering constraints for composite.
[2021-05-18 12:44:34] [INFO ] Proved 159 variables to be positive in 234 ms
[2021-05-18 12:44:34] [INFO ] Computing symmetric may disable matrix : 307 transitions.
[2021-05-18 12:44:34] [INFO ] Computation of disable matrix completed :0/307 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:44:34] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:44:34] [INFO ] Computing symmetric may enable matrix : 307 transitions.
[2021-05-18 12:44:34] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:44:35] [INFO ] Computing symmetric co enabling matrix : 307 transitions.
[2021-05-18 12:44:37] [INFO ] Computation of co-enabling matrix(2/307) took 1592 ms. Total solver calls (SAT/UNSAT): 913(363/550)
[2021-05-18 12:44:40] [INFO ] Computation of co-enabling matrix(7/307) took 5204 ms. Total solver calls (SAT/UNSAT): 2413(1272/1141)
Reverse transition relation is NOT exact ! Due to transitions t12, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t222, u0.t223, u0.t224, u0.t225, u0.t226, u0.t227, u0.t228, u0.t229, u0.t230, u0.t232, u0.t233, u0.t235, u0.t236, u0.t238, u0.t239, u0.t241, u0.t242, u0.t244, u0.t245, u0.t246, u0.t248, u0.t249, u0.t251, u0.t252, u0.t255, u1.t178, u1.t179, u1.t180, u1.t181, u1.t182, u1.t183, u1.t184, u1.t185, u1.t186, u1.t187, u1.t188, u1.t189, u1.t190, u1.t191, u1.t193, u1.t194, u1.t196, u1.t197, u1.t199, u1.t200, u1.t202, u1.t203, u1.t205, u1.t206, u1.t207, u1.t209, u1.t210, u1.t212, u1.t213, u1.t216, u2.t139, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t154, u2.t155, u2.t157, u2.t158, u2.t160, u2.t161, u2.t163, u2.t164, u2.t166, u2.t167, u2.t168, u2.t170, u2.t171, u2.t173, u2.t174, u2.t177, u7.t122, u7.t123, u7.t124, u7.t125, u7.t126, u7.t128, u7.t129, u7.t130, u8.t113, u8.t114, u8.t115, u8.t116, u8.t117, u8.t119, u8.t120, u8.t121, u9.t104, u9.t105, u9.t106, u9.t107, u9.t108, u9.t110, u9.t111, u9.t112, i7.t66, i7.t64, i7.u12.t60, i7.u12.t61, i7.u12.t70, i7.u12.t71, i7.u12.t72, i7.u12.t73, i7.u12.t74, i7.u12.t75, i7.u12.t76, i7.u12.t77, i7.u12.t78, i7.u12.t79, i7.u12.t80, i7.u12.t81, i7.u12.t82, i7.u12.t83, i7.u12.t84, i7.u12.t85, i7.u12.t86, i7.u12.t87, i7.u12.t88, i7.u12.t89, i7.u12.t90, i7.u12.t91, i7.u12.t92, i7.u12.t93, i7.u12.t94, i7.u12.t95, i7.u12.t96, i7.u12.t97, i7.u12.t98, i7.u12.t99, i7.u12.t100, i7.u12.t101, i7.u12.t102, i7.u12.t103, i9.t50, i9.t43, i9.t37, i9.t8, i9.t1, i9.u14.t6, i9.u14.t7, i9.u14.t14, i9.u14.t15, i9.u14.t18, i9.u14.t19, i9.u14.t21, i9.u14.t22, i9.u14.t24, i9.u14.t25, i9.u14.t26, i9.u14.t27, i9.u14.t30, i9.u14.t31, i9.u14.t32, i9.u14.t33, i9.u14.t38, i9.u14.t39, i9.u14.t44, i9.u14.t45, i9.u14.t48, i9.u14.t49, i9.u14.t57, i9.u14.t58, i9.u15.t2, i9.u15.t5, i9.u15.t9, i9.u15.t17, i9.u15.t41, i9.u15.t47, i9.u15.t53, i9.u15.t56, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/95/190/285
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:44:44] [INFO ] Computation of co-enabling matrix(12/307) took 8790 ms. Total solver calls (SAT/UNSAT): 3888(2182/1706)
[2021-05-18 12:44:48] [INFO ] Computation of co-enabling matrix(17/307) took 12489 ms. Total solver calls (SAT/UNSAT): 5338(3090/2248)
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
1486 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,14.887,326728,1,0,414505,72282,2910,935080,1608,1.05784e+06,536593
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(F(((!(F(G(!(G("(u0.p7==1)"))))))&&(F("(u13.p148==1)")))&&("(u0.p14==1)"))))))
Formula 1 simplified : !FGF("(u0.p14==1)" & !FG!G"(u0.p7==1)" & F"(u13.p148==1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:44:51] [INFO ] Computation of co-enabling matrix(22/307) took 16087 ms. Total solver calls (SAT/UNSAT): 6763(3999/2764)
[2021-05-18 12:44:55] [INFO ] Computation of co-enabling matrix(27/307) took 19691 ms. Total solver calls (SAT/UNSAT): 8163(4909/3254)
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
971 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,24.5985,605868,1,0,797576,95998,2942,1.81832e+06,1614,1.83557e+06,834846
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G(X("(i7.u12.p94==1)")))U((F("((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p113==1))&&(i9.u14.p157==1))"))U("(u2.p55!=1)")))&&(X("(u0.p4==1)"))))
Formula 2 simplified : !((GX"(i7.u12.p94==1)" U (F"((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p113==1))&&(i9.u14.p157==1))" U "(u2.p55!=1)")) & X"(u0.p4==1)")
Computing Next relation with stutter on 129 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,24.6348,607476,1,0,798943,95998,2996,1.82012e+06,1621,1.83565e+06,836011
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((!(G(X(!(X("(i7.u12.p93==1)"))))))||(!((G(F(G("(u0.p4==1)"))))U("(u1.p26==1)"))))))
Formula 3 simplified : !G(!GX!X"(i7.u12.p93==1)" | !(GFG"(u0.p4==1)" U "(u1.p26==1)"))
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:44:58] [INFO ] Computation of co-enabling matrix(32/307) took 23263 ms. Total solver calls (SAT/UNSAT): 9538(5819/3719)
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
151 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,26.1593,643844,1,0,851203,98593,3030,1.93211e+06,1623,1.93085e+06,883648
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(((!(F("((u2.p55==1)&&(i9.u15.p156==1))")))U("(u0.p17==1)"))||(F(X((X("(u0.p17==1)"))&&("((u2.p55!=1)||(i9.u15.p156!=1))"))))))))
Formula 4 simplified : !XX((!F"((u2.p55==1)&&(i9.u15.p156==1))" U "(u0.p17==1)") | FX("((u2.p55!=1)||(i9.u15.p156!=1))" & X"(u0.p17==1)"))
Computing Next relation with stutter on 129 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
105 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,27.2056,693992,1,0,956829,100847,3145,2.07792e+06,1623,1.98665e+06,983553
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G((F("((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i9.u14.p135==1))"))||(G(F(("((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i9.u14.p135==1))")U(G("((i7.u12.p113==1)&&(i9.u14.p126==1))")))))))))
Formula 5 simplified : !FG(F"((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i9.u14.p135==1))" | GF("((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i9.u14.p135==1))" U G"((i7.u12.p113==1)&&(i9.u14.p126==1))"))
Computing Next relation with stutter on 129 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
25 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,27.4553,700856,1,0,966251,101045,3201,2.09352e+06,1623,1.98901e+06,998656
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(X(X(X(F((((X("((u2.p55==1)&&(i9.u15.p156==1))"))&&("(i7.u12.p113==1)"))&&("(i9.u14.p138==1)"))U("((u2.p55==1)&&(i9.u15.p156==1))")))))))))
Formula 6 simplified : XXXXF(("(i7.u12.p113==1)" & "(i9.u14.p138==1)" & X"((u2.p55==1)&&(i9.u15.p156==1))") U "((u2.p55==1)&&(i9.u15.p156==1))")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:02] [INFO ] Computation of co-enabling matrix(37/307) took 26959 ms. Total solver calls (SAT/UNSAT): 10888(6729/4159)
[2021-05-18 12:45:06] [INFO ] Computation of co-enabling matrix(42/307) took 30517 ms. Total solver calls (SAT/UNSAT): 12213(7638/4575)
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
618 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,33.6467,922352,1,0,1.31719e+06,106467,3210,2.82188e+06,1623,2.43301e+06,1195249
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((((!(("(u9.p84==1)")U(G(F(X("(u9.p84==1)"))))))&&("(u1.p35==1)"))&&("(i7.u11.p110==1)"))&&("(u9.p84==1)")))))
Formula 7 simplified : !FX("(i7.u11.p110==1)" & "(u1.p35==1)" & "(u9.p84==1)" & !("(u9.p84==1)" U GFX"(u9.p84==1)"))
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:09] [INFO ] Computation of co-enabling matrix(47/307) took 34223 ms. Total solver calls (SAT/UNSAT): 13513(8548/4965)
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
364 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,37.2806,1027156,1,0,1.48397e+06,110925,3313,3.14965e+06,1627,2.58162e+06,1338042
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((G("(u2.p48==1)"))||(G("(u1.p36==1)")))))
Formula 8 simplified : !F(G"(u2.p48==1)" | G"(u1.p36==1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:13] [INFO ] Computation of co-enabling matrix(52/307) took 37828 ms. Total solver calls (SAT/UNSAT): 14788(9457/5331)
[2021-05-18 12:45:17] [INFO ] Computation of co-enabling matrix(57/307) took 41495 ms. Total solver calls (SAT/UNSAT): 16038(10365/5673)
[2021-05-18 12:45:20] [INFO ] Computation of co-enabling matrix(62/307) took 45134 ms. Total solver calls (SAT/UNSAT): 17263(11267/5996)
[2021-05-18 12:45:24] [INFO ] Computation of co-enabling matrix(67/307) took 48680 ms. Total solver calls (SAT/UNSAT): 18463(12164/6299)
[2021-05-18 12:45:28] [INFO ] Computation of co-enabling matrix(72/307) took 52309 ms. Total solver calls (SAT/UNSAT): 19638(13062/6576)
[2021-05-18 12:45:31] [INFO ] Computation of co-enabling matrix(77/307) took 55822 ms. Total solver calls (SAT/UNSAT): 20788(13959/6829)
[2021-05-18 12:45:35] [INFO ] Computation of co-enabling matrix(82/307) took 59399 ms. Total solver calls (SAT/UNSAT): 21913(14857/7056)
[2021-05-18 12:45:38] [INFO ] Computation of co-enabling matrix(87/307) took 62864 ms. Total solver calls (SAT/UNSAT): 23013(15754/7259)
[2021-05-18 12:45:42] [INFO ] Computation of co-enabling matrix(92/307) took 66384 ms. Total solver calls (SAT/UNSAT): 24088(16652/7436)
[2021-05-18 12:45:45] [INFO ] Computation of co-enabling matrix(97/307) took 69855 ms. Total solver calls (SAT/UNSAT): 25138(17549/7589)
[2021-05-18 12:45:49] [INFO ] Computation of co-enabling matrix(102/307) took 73348 ms. Total solver calls (SAT/UNSAT): 26163(18447/7716)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3877 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,76.0547,2140496,1,0,3.2065e+06,137999,3354,6.61308e+06,1629,3.95682e+06,2123059
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F((X(F(X("(u0.p12!=1)"))))&&((G("(u0.p12==1)"))||("(i3.i0.u4.p2==1)"))))))
Formula 9 simplified : !XF(XFX"(u0.p12!=1)" & ("(i3.i0.u4.p2==1)" | G"(u0.p12==1)"))
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:52] [INFO ] Computation of co-enabling matrix(131/307) took 76386 ms. Total solver calls (SAT/UNSAT): 28307(20568/7739)
[2021-05-18 12:45:55] [INFO ] Computation of co-enabling matrix(163/307) took 79464 ms. Total solver calls (SAT/UNSAT): 30891(23152/7739)
[2021-05-18 12:45:58] [INFO ] Computation of co-enabling matrix(195/307) took 82514 ms. Total solver calls (SAT/UNSAT): 33470(25731/7739)
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
911 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,85.1604,2268928,1,0,3.39069e+06,139848,3399,7.02364e+06,1630,4.05053e+06,2272622
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(u0.p16==1)")U((!(X("(u0.p16!=1)")))&&(!(G("(u0.p16==1)"))))))
Formula 10 simplified : !("(u0.p16==1)" U (!X"(u0.p16!=1)" & !G"(u0.p16==1)"))
Computing Next relation with stutter on 129 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,85.1621,2269192,1,0,3.39069e+06,139848,3403,7.02364e+06,1630,4.05053e+06,2272657
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(!(F("(u0.p9!=1)")))))
Formula 11 simplified : !X!F"(u0.p9!=1)"
Computing Next relation with stutter on 129 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,85.1631,2269192,1,0,3.39069e+06,139848,3416,7.02364e+06,1632,4.05053e+06,2272685
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F(G(F("(u0.p17!=1)"))))))
Formula 12 simplified : !XFGF"(u0.p17!=1)"
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:46:01] [INFO ] Computation of co-enabling matrix(227/307) took 85538 ms. Total solver calls (SAT/UNSAT): 36048(28309/7739)
[2021-05-18 12:46:04] [INFO ] Computation of co-enabling matrix(251/307) took 88600 ms. Total solver calls (SAT/UNSAT): 37609(28970/8639)
[2021-05-18 12:46:06] [INFO ] Computation of Finished co-enabling matrix. took 91179 ms. Total solver calls (SAT/UNSAT): 39005(29253/9752)
[2021-05-18 12:46:06] [INFO ] Computing Do-Not-Accords matrix : 307 transitions.
[2021-05-18 12:46:08] [INFO ] Computation of Completed DNA matrix. took 1507 ms. Total solver calls (SAT/UNSAT): 1675(0/1675)
[2021-05-18 12:46:08] [INFO ] Built C files in 94785ms 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]
Compilation finished in 3479 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 147 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>([](<>((LTLAP27==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>([](<>((LTLAP27==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>([](<>((LTLAP27==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
1876 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,103.919,2273152,1,0,3.39899e+06,139910,1275,7.03854e+06,734,4.05331e+06,17873
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-11-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621341979248

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

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