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-162124171200150.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-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 8.7K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 3.1K May 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:47 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 48K 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-06-00
FORMULA_NAME HealthRecord-PT-06-01
FORMULA_NAME HealthRecord-PT-06-02
FORMULA_NAME HealthRecord-PT-06-03
FORMULA_NAME HealthRecord-PT-06-04
FORMULA_NAME HealthRecord-PT-06-05
FORMULA_NAME HealthRecord-PT-06-06
FORMULA_NAME HealthRecord-PT-06-07
FORMULA_NAME HealthRecord-PT-06-08
FORMULA_NAME HealthRecord-PT-06-09
FORMULA_NAME HealthRecord-PT-06-10
FORMULA_NAME HealthRecord-PT-06-11
FORMULA_NAME HealthRecord-PT-06-12
FORMULA_NAME HealthRecord-PT-06-13
FORMULA_NAME HealthRecord-PT-06-14
FORMULA_NAME HealthRecord-PT-06-15

=== Now, execution of the tool begins

BK_START 1621341224091

[2021-05-18 12:33:45] [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:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:33:47] [INFO ] Load time of PNML (sax parser for PT used): 2349 ms
[2021-05-18 12:33:47] [INFO ] Transformed 154 places.
[2021-05-18 12:33:47] [INFO ] Transformed 319 transitions.
[2021-05-18 12:33:47] [INFO ] Found NUPN structural information;
[2021-05-18 12:33:47] [INFO ] Parsed PT model containing 154 places and 319 transitions in 2391 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5022 resets, run finished after 333 ms. (steps per millisecond=300 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
[2021-05-18 12:33:48] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2021-05-18 12:33:48] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-18 12:33:48] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 12:33:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:48] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:33:48] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-18 12:33:48] [INFO ] Deduced a trap composed of 30 places in 62 ms
[2021-05-18 12:33:48] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2021-05-18 12:33:48] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2021-05-18 12:33:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2021-05-18 12:33:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2021-05-18 12:33:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:49] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:33:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-18 12:33:49] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 45 ms.
[2021-05-18 12:33:49] [INFO ] Added : 147 causal constraints over 30 iterations in 903 ms. Result :sat
[2021-05-18 12:33:50] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2021-05-18 12:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-18 12:33:50] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:50] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:33:50] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:50] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-18 12:33:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:33:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:50] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:33:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:33:50] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 17 ms.
[2021-05-18 12:33:51] [INFO ] Added : 148 causal constraints over 31 iterations in 1177 ms. Result :sat
[2021-05-18 12:33:51] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:33:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:51] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:33:51] [INFO ] [Real]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-18 12:33:51] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2021-05-18 12:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-18 12:33:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 28 ms returned sat
[2021-05-18 12:33:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:52] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:33:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:33:52] [INFO ] Deduced a trap composed of 39 places in 59 ms
[2021-05-18 12:33:52] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2021-05-18 12:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2021-05-18 12:33:52] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 21 ms.
[2021-05-18 12:33:53] [INFO ] Added : 141 causal constraints over 29 iterations in 838 ms. Result :sat
[2021-05-18 12:33:53] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:53] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:33:53] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:53] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2021-05-18 12:33:53] [INFO ] Deduced a trap composed of 29 places in 33 ms
[2021-05-18 12:33:53] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2021-05-18 12:33:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2021-05-18 12:33:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 34 ms returned sat
[2021-05-18 12:33:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:53] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:33:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:33:53] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 18 ms.
[2021-05-18 12:33:54] [INFO ] Added : 155 causal constraints over 32 iterations in 1005 ms. Result :sat
[2021-05-18 12:33:54] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:54] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:33:54] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:54] [INFO ] Deduced a trap composed of 38 places in 59 ms
[2021-05-18 12:33:55] [INFO ] Deduced a trap composed of 38 places in 117 ms
[2021-05-18 12:33:55] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2021-05-18 12:33:55] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:33:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 301 ms
[2021-05-18 12:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-18 12:33:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:55] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:33:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:55] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 21 ms.
[2021-05-18 12:33:56] [INFO ] Added : 151 causal constraints over 31 iterations in 1188 ms. Result :sat
[2021-05-18 12:33:56] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:56] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:33:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:56] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-18 12:33:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:33:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:56] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:33:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:33:56] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 18 ms.
[2021-05-18 12:33:57] [INFO ] Added : 147 causal constraints over 30 iterations in 925 ms. Result :sat
[2021-05-18 12:33:57] [INFO ] Deduced a trap composed of 29 places in 32 ms
[2021-05-18 12:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2021-05-18 12:33:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:58] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:33:58] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:58] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 14 ms.
[2021-05-18 12:33:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 42 ms returned sat
[2021-05-18 12:33:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-18 12:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:58] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:33:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:33:58] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 20 ms.
[2021-05-18 12:33:59] [INFO ] Added : 143 causal constraints over 30 iterations in 904 ms. Result :sat
[2021-05-18 12:33:59] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:33:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:59] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:33:59] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:33:59] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 16 ms.
[2021-05-18 12:33:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:33:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2021-05-18 12:33:59] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 12:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:33:59] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:33:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:33:59] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 29 ms.
[2021-05-18 12:34:00] [INFO ] Added : 143 causal constraints over 30 iterations in 858 ms. Result :sat
[2021-05-18 12:34:00] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:34:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:00] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:34:00] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:34:00] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 16 ms.
[2021-05-18 12:34:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:34:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 26 ms returned sat
[2021-05-18 12:34:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:00] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:34:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:34:00] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 17 ms.
[2021-05-18 12:34:01] [INFO ] Added : 144 causal constraints over 30 iterations in 880 ms. Result :sat
[2021-05-18 12:34:01] [INFO ] Deduced a trap composed of 29 places in 34 ms
[2021-05-18 12:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2021-05-18 12:34:01] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:34:01] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:02] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:34:02] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 45 places in 84 ms
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 30 places in 51 ms
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 40 places in 43 ms
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 42 places in 32 ms
[2021-05-18 12:34:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 364 ms
[2021-05-18 12:34:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:34:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-18 12:34:02] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:02] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:34:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:34:02] [INFO ] Deduced a trap composed of 40 places in 30 ms
[2021-05-18 12:34:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2021-05-18 12:34:02] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 18 ms.
[2021-05-18 12:34:03] [INFO ] Added : 156 causal constraints over 32 iterations in 1063 ms. Result :sat
[2021-05-18 12:34:03] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2021-05-18 12:34:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:03] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:34:03] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:34:04] [INFO ] Deduced a trap composed of 38 places in 48 ms
[2021-05-18 12:34:04] [INFO ] Deduced a trap composed of 39 places in 53 ms
[2021-05-18 12:34:04] [INFO ] Deduced a trap composed of 39 places in 53 ms
[2021-05-18 12:34:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
[2021-05-18 12:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:34:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-18 12:34:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:04] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:34:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:34:04] [INFO ] Deduced a trap composed of 38 places in 35 ms
[2021-05-18 12:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-18 12:34:04] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 15 ms.
[2021-05-18 12:34:05] [INFO ] Added : 148 causal constraints over 31 iterations in 961 ms. Result :sat
[2021-05-18 12:34:05] [INFO ] Deduced a trap composed of 40 places in 35 ms
[2021-05-18 12:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-18 12:34:05] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:34:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:05] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:34:05] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:34:05] [INFO ] Deduced a trap composed of 29 places in 22 ms
[2021-05-18 12:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-18 12:34:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:34:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 54 ms returned sat
[2021-05-18 12:34:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:34:05] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:34:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:34:05] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 17 ms.
[2021-05-18 12:34:06] [INFO ] Added : 144 causal constraints over 30 iterations in 731 ms. Result :sat
[2021-05-18 12:34:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 12:34:07] [INFO ] Flatten gal took : 56 ms
FORMULA HealthRecord-PT-06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:34:07] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:34:07] [INFO ] Applying decomposition
[2021-05-18 12:34:07] [INFO ] Flatten gal took : 33 ms
[2021-05-18 12:34:07] [INFO ] Input system was already deterministic with 294 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/graph16356175889287171231.txt, -o, /tmp/graph16356175889287171231.bin, -w, /tmp/graph16356175889287171231.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/graph16356175889287171231.bin, -l, -1, -v, -w, /tmp/graph16356175889287171231.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:34:07] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 282 out of 294 initially.
// Phase 1: matrix 282 rows 154 cols
[2021-05-18 12:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 12:34:07] [INFO ] Computed 18 place invariants in 4 ms
inv : 2*p0 + p72 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : -p0 + p63 + p64 + p65 + p66 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : 2*p0 + p20 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : 2*p0 + p67 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : 2*p0 + p57 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : -p0 + p38 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : -p0 + p68 + p69 + p70 + p71 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : -p0 + p73 + p74 + p75 + p76 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : p0 + p111 + p112 + p113 + p114 + p115 + 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 = 1
inv : 2*p0 + p39 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : -p0 + p58 + p59 + p60 + p61 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : p0 + 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 = 1
inv : 2*p0 + p1 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : -p0 + p78 + p79 + p80 + p81 + p82 + p83 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : 2*p0 + p77 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : 2*p0 + p62 + 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 + p112 + p113 + p114 + p115 + 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 = 2
inv : -p0 + p19 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 - 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 - p112 - p113 - p114 - p115 - 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 = -1
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 - 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 - p112 - p113 - p114 - p115 - 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 = -1
Total of 18 invariants.
[2021-05-18 12:34:07] [INFO ] Computed 18 place invariants in 7 ms
[2021-05-18 12:34:07] [INFO ] Removed a total of 41 redundant transitions.
[2021-05-18 12:34:07] [INFO ] Flatten gal took : 52 ms
[2021-05-18 12:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2021-05-18 12:34:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2021-05-18 12:34:07] [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 : !((!(X(((!(X(!(F("(i8.u12.p101==1)")))))&&("(u0.p7!=1)"))||(!((X(X("(i8.u12.p101==1)")))U("(u2.p45==1)")))))))
Formula 0 simplified : X(("(u0.p7!=1)" & !X!F"(i8.u12.p101==1)") | !(XX"(i8.u12.p101==1)" U "(u2.p45==1)"))
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:34:07] [INFO ] Proved 154 variables to be positive in 306 ms
[2021-05-18 12:34:07] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2021-05-18 12:34:07] [INFO ] Computation of disable matrix completed :0/294 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:34:07] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:34:07] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2021-05-18 12:34:07] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:34:09] [INFO ] Computing symmetric co enabling matrix : 294 transitions.
[2021-05-18 12:34:11] [INFO ] Computation of co-enabling matrix(2/294) took 1478 ms. Total solver calls (SAT/UNSAT): 874(351/523)
Reverse transition relation is NOT exact ! Due to transitions t10, t252, t257, t261, t265, t269, t274, t277, t280, u0.t207, u0.t208, u0.t209, u0.t210, u0.t211, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t223, u0.t224, u0.t226, u0.t227, u0.t229, u0.t230, u0.t232, u0.t233, u0.t235, u0.t236, u0.t237, u0.t239, u0.t240, u0.t242, u0.t243, u1.t168, u1.t169, u1.t170, u1.t171, u1.t172, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t183, u1.t184, u1.t186, u1.t187, u1.t189, u1.t190, u1.t192, u1.t193, u1.t195, u1.t196, u1.t197, u1.t199, u1.t200, u1.t202, u1.t203, u1.t206, u2.t129, u2.t130, u2.t131, u2.t132, u2.t133, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t144, u2.t145, u2.t147, u2.t148, u2.t150, u2.t151, u2.t153, u2.t154, u2.t156, u2.t157, u2.t158, u2.t160, u2.t161, u2.t163, u2.t164, u2.t167, u11.t104, u11.t105, u11.t106, u11.t107, u11.t108, u11.t110, u11.t111, u11.t112, u16.t1, u16.t2, u16.t3, u16.t4, u16.t5, u16.t6, u16.t7, u16.t8, u16.t9, u16.t14, u16.t15, u16.t16, u16.t17, u16.t18, u16.t19, u16.t20, u16.t21, u16.t22, u16.t23, u16.t24, u16.t25, u16.t26, u16.t27, u16.t28, u16.t29, u16.t30, u16.t31, u16.t32, u16.t33, u16.t34, u16.t35, u16.t36, u16.t37, u16.t38, u16.t39, u16.t40, u16.t41, u16.t42, u16.t43, u16.t44, u16.t45, u16.t46, u16.t47, u16.t48, u16.t49, u16.t50, u16.t51, u16.t52, u16.t53, u16.t54, u16.t55, u16.t56, u16.t57, u16.t58, u16.t59, i8.t68, i8.t62, i8.u12.t60, i8.u12.t61, i8.u12.t70, i8.u12.t71, i8.u12.t72, i8.u12.t73, i8.u12.t74, i8.u12.t75, i8.u12.t76, i8.u12.t77, i8.u12.t78, i8.u12.t79, i8.u12.t80, i8.u12.t81, i8.u12.t82, i8.u12.t83, i8.u12.t84, i8.u12.t85, i8.u12.t86, i8.u12.t87, i8.u12.t88, i8.u12.t89, i8.u12.t90, i8.u12.t91, i8.u12.t92, i8.u12.t93, i8.u12.t94, i8.u12.t95, i8.u12.t96, i8.u12.t97, i8.u12.t98, i8.u12.t99, i8.u12.t100, i8.u12.t101, i8.u12.t102, i8.u12.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/89/200/289
Computing Next relation with stutter on 17 deadlock states
21 unique states visited
21 strongly connected components in search stack
22 transitions explored
21 items max in DFS search stack
662 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,6.66767,178988,1,0,200078,102917,2726,402650,2268,868626,426733
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((F(G("((i8.u12.p108==1)&&(u16.p133==1))")))&&(F("((i8.u12.p108==1)&&(u16.p135==1))"))))))
Formula 1 simplified : !FG(FG"((i8.u12.p108==1)&&(u16.p133==1))" & F"((i8.u12.p108==1)&&(u16.p135==1))")
[2021-05-18 12:34:14] [INFO ] Computation of co-enabling matrix(7/294) took 5029 ms. Total solver calls (SAT/UNSAT): 2309(1230/1079)
[2021-05-18 12:34:18] [INFO ] Computation of co-enabling matrix(12/294) took 8540 ms. Total solver calls (SAT/UNSAT): 3719(2110/1609)
Computing Next relation with stutter on 17 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
75 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,7.41554,191712,1,0,214401,104347,2767,440061,2271,910339,451892
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X(X(!(("((((u0.p16!=1)||(u1.p35!=1))||(u2.p54!=1))||(u16.p151!=1))")U(F(G("((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u16.p151==1))")))))))||("(i8.u12.p90==1)"))))
Formula 2 simplified : !G("(i8.u12.p90==1)" | XX!("((((u0.p16!=1)||(u1.p35!=1))||(u2.p54!=1))||(u16.p151!=1))" U FG"((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u16.p151==1))"))
Computing Next relation with stutter on 17 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.42765,192328,1,0,214667,104370,2836,440343,2273,910534,453877
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(!(X((G(X("(u16.p146==1)")))||(G("(u16.p146==1)"))))))||(X(G("((i8.u12.p108==1)&&(u16.p150==1))")))))
Formula 3 simplified : !(F!X(GX"(u16.p146==1)" | G"(u16.p146==1)") | XG"((i8.u12.p108==1)&&(u16.p150==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,7.42931,192728,1,0,214667,104370,2864,440343,2276,910534,453900
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HealthRecord-PT-06-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(G((!((F(("(u1.p32==1)")U("(i5.u8.p71==1)")))U("(u0.p10==1)")))U((F("(i5.u8.p71==1)"))&&("(u1.p32==1)")))))))
Formula 4 simplified : !G!G(!(F("(u1.p32==1)" U "(i5.u8.p71==1)") U "(u0.p10==1)") U ("(u1.p32==1)" & F"(i5.u8.p71==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
55 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,7.97912,209356,1,0,240139,105832,2982,484164,2280,946558,527734
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(!((X("(i3.u4.p77==1)"))U(X("(u11.p78==1)")))))))
Formula 5 simplified : !XX!(X"(i3.u4.p77==1)" U X"(u11.p78==1)")
Computing Next relation with stutter on 17 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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,7.98108,209612,1,0,240191,105832,3011,484187,2284,946558,527991
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA HealthRecord-PT-06-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(!(X(("((u1.p35==1)&&(u16.p151==1))")U(F("((u1.p19==1)&&(u16.p151==1))"))))))))
Formula 6 simplified : !GF!X("((u1.p35==1)&&(u16.p151==1))" U F"((u1.p19==1)&&(u16.p151==1))")
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:34:21] [INFO ] Computation of co-enabling matrix(17/294) took 12060 ms. Total solver calls (SAT/UNSAT): 5104(2988/2116)
[2021-05-18 12:34:25] [INFO ] Computation of co-enabling matrix(22/294) took 15671 ms. Total solver calls (SAT/UNSAT): 6464(3867/2597)
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
536 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,13.3492,377780,1,0,515823,121858,3046,1.07183e+06,2284,1.52207e+06,778758
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X((G("(u0.p12==1)"))&&("(u1.p30!=1)")))))
Formula 7 simplified : !GX("(u1.p30!=1)" & G"(u0.p12==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
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,13.3549,378040,1,0,515900,121858,3074,1.07212e+06,2286,1.52207e+06,779081
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F(X((F(G(F(G("(u0.p12==1)")))))U("(u1.p32!=1)"))))))
Formula 8 simplified : !XFX(FGFG"(u0.p12==1)" U "(u1.p32!=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,13.3559,378304,1,0,515900,121858,3091,1.07212e+06,2286,1.52207e+06,779103
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA HealthRecord-PT-06-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(X("(u0.p3!=1)")))U(X("(u0.p3==1)"))))
Formula 9 simplified : !(FX"(u0.p3!=1)" U X"(u0.p3==1)")
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:34:28] [INFO ] Computation of co-enabling matrix(27/294) took 19223 ms. Total solver calls (SAT/UNSAT): 7799(4747/3052)
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
304 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,16.3885,456280,1,0,641803,130830,3169,1.33474e+06,2288,1.70892e+06,951138
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((X("(u0.p4==1)"))||(G(X("(u16.p121==1)"))))||(G("(u0.p4==1)"))))
Formula 10 simplified : !(X"(u0.p4==1)" | GX"(u16.p121==1)" | G"(u0.p4==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
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,16.3899,456544,1,0,641803,130830,3183,1.33474e+06,2290,1.70892e+06,951161
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G(X((F("(i8.u12.p87==1)"))&&(("((u0.p14==1)&&(i8.u12.p87==1))")U(G(F("(u2.p51==1)")))))))))
Formula 11 simplified : GX(F"(i8.u12.p87==1)" & ("((u0.p14==1)&&(i8.u12.p87==1))" U GF"(u2.p51==1)"))
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:34:32] [INFO ] Computation of co-enabling matrix(32/294) took 22574 ms. Total solver calls (SAT/UNSAT): 9109(5627/3482)
[2021-05-18 12:34:35] [INFO ] Computation of co-enabling matrix(37/294) took 25978 ms. Total solver calls (SAT/UNSAT): 10394(6507/3887)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
873 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,25.1216,709600,1,0,1.0792e+06,149402,3288,2.16234e+06,2290,2.3235e+06,1475561
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("(u0.p16==1)")U(G(F(G(F("(u1.p34!=1)")))))))
Formula 12 simplified : !("(u0.p16==1)" U GFGF"(u1.p34!=1)")
Computing Next relation with stutter on 17 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
19 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,25.3197,715668,1,0,1.08944e+06,149680,3310,2.17932e+06,2292,2.33076e+06,1504180
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-06-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:34:38] [INFO ] Computation of co-enabling matrix(42/294) took 29404 ms. Total solver calls (SAT/UNSAT): 11654(7386/4268)
[2021-05-18 12:34:42] [INFO ] Computation of co-enabling matrix(47/294) took 32863 ms. Total solver calls (SAT/UNSAT): 12889(8266/4623)
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:34:43] [INFO ] Built C files in 36521ms 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 1621341291339

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

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