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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K 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 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.9K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 50K 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-10-00
FORMULA_NAME HealthRecord-PT-10-01
FORMULA_NAME HealthRecord-PT-10-02
FORMULA_NAME HealthRecord-PT-10-03
FORMULA_NAME HealthRecord-PT-10-04
FORMULA_NAME HealthRecord-PT-10-05
FORMULA_NAME HealthRecord-PT-10-06
FORMULA_NAME HealthRecord-PT-10-07
FORMULA_NAME HealthRecord-PT-10-08
FORMULA_NAME HealthRecord-PT-10-09
FORMULA_NAME HealthRecord-PT-10-10
FORMULA_NAME HealthRecord-PT-10-11
FORMULA_NAME HealthRecord-PT-10-12
FORMULA_NAME HealthRecord-PT-10-13
FORMULA_NAME HealthRecord-PT-10-14
FORMULA_NAME HealthRecord-PT-10-15

=== Now, execution of the tool begins

BK_START 1621341765146

[2021-05-18 12:42:46] [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:42:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:42:46] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-18 12:42:46] [INFO ] Transformed 158 places.
[2021-05-18 12:42:46] [INFO ] Transformed 333 transitions.
[2021-05-18 12:42:46] [INFO ] Found NUPN structural information;
[2021-05-18 12:42:46] [INFO ] Parsed PT model containing 158 places and 333 transitions in 93 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6290 resets, run finished after 336 ms. (steps per millisecond=297 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2021-05-18 12:42:47] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2021-05-18 12:42:47] [INFO ] Computed 18 place invariants in 11 ms
[2021-05-18 12:42:47] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:42:47] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:47] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-18 12:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:42:47] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:42:47] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 25 ms.
[2021-05-18 12:42:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2021-05-18 12:42:47] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:47] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:42:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-18 12:42:48] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 33 ms.
[2021-05-18 12:42:48] [INFO ] Added : 150 causal constraints over 30 iterations in 955 ms. Result :sat
[2021-05-18 12:42:49] [INFO ] Deduced a trap composed of 29 places in 86 ms
[2021-05-18 12:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2021-05-18 12:42:49] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:42:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:49] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-18 12:42:49] [INFO ] [Real]Added 1 Read/Feed constraints in 17 ms returned sat
[2021-05-18 12:42:49] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 26 ms.
[2021-05-18 12:42:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:42:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:49] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:42:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:42:49] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2021-05-18 12:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-18 12:42:49] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 23 ms.
[2021-05-18 12:42:51] [INFO ] Added : 155 causal constraints over 31 iterations in 1846 ms. Result :sat
[2021-05-18 12:42:51] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:42:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:51] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:42:51] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:42:51] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2021-05-18 12:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-18 12:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:42:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:51] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:42:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:42:52] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 28 ms.
[2021-05-18 12:42:53] [INFO ] Added : 161 causal constraints over 33 iterations in 1351 ms. Result :sat
[2021-05-18 12:42:53] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:42:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:42:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:53] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:42:53] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:42:53] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2021-05-18 12:42:53] [INFO ] Deduced a trap composed of 29 places in 22 ms
[2021-05-18 12:42:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2021-05-18 12:42:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:42:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:42:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:53] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:42:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:42:53] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 22 ms.
[2021-05-18 12:42:55] [INFO ] Added : 170 causal constraints over 35 iterations in 2165 ms. Result :sat
[2021-05-18 12:42:56] [INFO ] Deduced a trap composed of 29 places in 39 ms
[2021-05-18 12:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2021-05-18 12:42:56] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:42:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:56] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:42:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:42:56] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2021-05-18 12:42:56] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2021-05-18 12:42:56] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2021-05-18 12:42:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2021-05-18 12:42:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:42:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:56] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:42:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:42:56] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 21 ms.
[2021-05-18 12:42:57] [INFO ] Added : 158 causal constraints over 33 iterations in 888 ms. Result :sat
[2021-05-18 12:42:57] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:42:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 12:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:57] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:42:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:42:57] [INFO ] Deduced a trap composed of 30 places in 38 ms
[2021-05-18 12:42:57] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2021-05-18 12:42:57] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2021-05-18 12:42:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2021-05-18 12:42:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2021-05-18 12:42:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:58] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:42:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:42:58] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 21 ms.
[2021-05-18 12:42:58] [INFO ] Added : 158 causal constraints over 33 iterations in 896 ms. Result :sat
[2021-05-18 12:42:59] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:42:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:59] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:42:59] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:42:59] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2021-05-18 12:42:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-18 12:42:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:42:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:42:59] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:42:59] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-18 12:42:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2021-05-18 12:42:59] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 17 ms.
[2021-05-18 12:43:01] [INFO ] Added : 164 causal constraints over 33 iterations in 1683 ms. Result :sat
[2021-05-18 12:43:01] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:43:01] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:01] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:43:01] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:43:01] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2021-05-18 12:43:01] [INFO ] Deduced a trap composed of 29 places in 33 ms
[2021-05-18 12:43:01] [INFO ] Deduced a trap composed of 29 places in 26 ms
[2021-05-18 12:43:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 123 ms
[2021-05-18 12:43:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:43:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:43:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:01] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:43:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:43:01] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 18 ms.
[2021-05-18 12:43:02] [INFO ] Added : 158 causal constraints over 33 iterations in 882 ms. Result :sat
[2021-05-18 12:43:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:43:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:02] [INFO ] [Real]Absence check using state equation in 86 ms returned unsat
[2021-05-18 12:43:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:43:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:02] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:43:02] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:43:02] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 15 ms.
[2021-05-18 12:43:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:43:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:43:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:03] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:43:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:43:03] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 23 ms.
[2021-05-18 12:43:05] [INFO ] Added : 165 causal constraints over 34 iterations in 1946 ms. Result :sat
[2021-05-18 12:43:05] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:43:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:05] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:43:05] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:43:05] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2021-05-18 12:43:05] [INFO ] Deduced a trap composed of 47 places in 49 ms
[2021-05-18 12:43:05] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2021-05-18 12:43:05] [INFO ] Deduced a trap composed of 38 places in 49 ms
[2021-05-18 12:43:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 255 ms
[2021-05-18 12:43:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:43:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2021-05-18 12:43:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:05] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:43:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:43:05] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 19 ms.
[2021-05-18 12:43:07] [INFO ] Added : 162 causal constraints over 33 iterations in 1516 ms. Result :sat
[2021-05-18 12:43:07] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:43:07] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:07] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:43:07] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:43:07] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2021-05-18 12:43:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-18 12:43:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:43:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:43:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:07] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:43:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:43:07] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 16 ms.
[2021-05-18 12:43:09] [INFO ] Added : 163 causal constraints over 33 iterations in 1594 ms. Result :sat
[2021-05-18 12:43:09] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:43:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:09] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-18 12:43:09] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:43:09] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 20 ms.
[2021-05-18 12:43:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:43:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:43:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:43:09] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:43:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:43:09] [INFO ] Computed and/alt/rep : 305/2369/293 causal constraints in 19 ms.
[2021-05-18 12:43:11] [INFO ] Added : 158 causal constraints over 32 iterations in 1641 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-18 12:43:11] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-18 12:43:11] [INFO ] Flatten gal took : 69 ms
FORMULA HealthRecord-PT-10-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:43:11] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:43:11] [INFO ] Applying decomposition
[2021-05-18 12:43:11] [INFO ] Flatten gal took : 18 ms
[2021-05-18 12:43:11] [INFO ] Input system was already deterministic with 306 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/graph13984552258813114243.txt, -o, /tmp/graph13984552258813114243.bin, -w, /tmp/graph13984552258813114243.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/graph13984552258813114243.bin, -l, -1, -v, -w, /tmp/graph13984552258813114243.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:43:11] [INFO ] Decomposing Gal with order
[2021-05-18 12:43:11] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 294 out of 306 initially.
// Phase 1: matrix 294 rows 158 cols
[2021-05-18 12:43:12] [INFO ] Computed 18 place invariants in 3 ms
inv : 2*p0 + p57 + 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 + 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 = 2
inv : p0 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 = 1
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 - 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 - 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 = -1
inv : 2*p0 + p62 + 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 + 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 = 2
inv : -p0 + p38 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 - 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 - 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 = -1
inv : 2*p0 + p74 + 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 + 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 = 2
inv : 2*p0 + p67 + 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 + 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 = 2
inv : 2*p0 + p81 + 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 + 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 = 2
inv : p0 + 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 + p154 + p155 + p156 + p157 = 1
inv : -p0 + p63 + p64 + p65 + p66 - 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 - 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 = -1
inv : -p0 + p75 + p76 + p77 + p78 + p79 + p80 - 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 - 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 = -1
inv : -p0 + p68 + p69 + p70 + p71 + p72 + p73 - 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 - 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 = -1
inv : -p0 + p19 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 - 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 - 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 = -1
inv : -p0 + p58 + p59 + p60 + p61 - 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 - 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 = -1
inv : 2*p0 + p39 + 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 + 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 = 2
inv : -p0 + p82 + p83 + p84 + p85 + p86 + p87 - 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 - 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 = -1
inv : 2*p0 + p20 + 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 + 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 = 2
inv : 2*p0 + p1 + 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 + 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 = 2
Total of 18 invariants.
[2021-05-18 12:43:12] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-18 12:43:12] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-18 12:43:12] [INFO ] Flatten gal took : 93 ms
[2021-05-18 12:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2021-05-18 12:43:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2021-05-18 12:43:12] [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 12 LTL properties
Checking formula 0 : !(((G(X("(u0.p16==1)")))||((!((!(F(X("((u0.p16==1)&&(u14.p155==1))"))))U(("(i3.i1.u6.p66==1)")U("(i7.u10.p94==1)"))))U("(i3.i1.u6.p66==1)"))))
Formula 0 simplified : !(GX"(u0.p16==1)" | (!(!FX"((u0.p16==1)&&(u14.p155==1))" U ("(i3.i1.u6.p66==1)" U "(i7.u10.p94==1)")) U "(i3.i1.u6.p66==1)"))
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:43:12] [INFO ] Proved 158 variables to be positive in 338 ms
[2021-05-18 12:43:12] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2021-05-18 12:43:12] [INFO ] Computation of disable matrix completed :0/306 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:43:12] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:43:12] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2021-05-18 12:43:12] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:43:13] [INFO ] Computing symmetric co enabling matrix : 306 transitions.
[2021-05-18 12:43:16] [INFO ] Computation of co-enabling matrix(3/306) took 2281 ms. Total solver calls (SAT/UNSAT): 1211(545/666)
Reverse transition relation is NOT exact ! Due to transitions t12, t268, t273, t277, t281, t285, t290, t293, t296, 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.t231, u0.t233, u0.t234, u0.t236, u0.t237, u0.t239, u0.t240, u0.t242, u0.t243, u0.t245, u0.t246, u0.t247, u0.t249, u0.t250, u0.t252, u0.t253, 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, u14.t1, u14.t2, u14.t3, u14.t4, u14.t5, u14.t6, u14.t7, u14.t8, u14.t9, u14.t14, u14.t15, u14.t16, u14.t17, u14.t18, u14.t19, u14.t20, u14.t21, u14.t22, u14.t23, u14.t24, u14.t25, u14.t26, u14.t27, u14.t28, u14.t29, u14.t30, u14.t31, u14.t32, u14.t33, u14.t34, u14.t35, u14.t36, u14.t37, u14.t38, u14.t39, u14.t40, u14.t41, u14.t42, u14.t43, u14.t44, u14.t45, u14.t46, u14.t47, u14.t48, u14.t49, u14.t50, u14.t51, u14.t52, u14.t53, u14.t54, u14.t55, u14.t56, u14.t57, u14.t58, u14.t59, i7.t68, i7.t62, i7.u10.t60, i7.u10.t61, i7.u10.t70, i7.u10.t71, i7.u10.t72, i7.u10.t73, i7.u10.t74, i7.u10.t75, i7.u10.t76, i7.u10.t77, i7.u10.t78, i7.u10.t79, i7.u10.t80, i7.u10.t81, i7.u10.t82, i7.u10.t83, i7.u10.t84, i7.u10.t85, i7.u10.t86, i7.u10.t87, i7.u10.t88, i7.u10.t89, i7.u10.t90, i7.u10.t91, i7.u10.t92, i7.u10.t93, i7.u10.t94, i7.u10.t95, i7.u10.t96, i7.u10.t97, i7.u10.t98, i7.u10.t99, i7.u10.t100, i7.u10.t101, i7.u10.t102, i7.u10.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/85/216/301
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:19] [INFO ] Computation of co-enabling matrix(8/306) took 5976 ms. Total solver calls (SAT/UNSAT): 2701(1455/1246)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
967 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,9.71477,257640,1,0,412593,56294,2705,603414,2232,682798,562837
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(F(!(X(F(X((G("(u2.p54==1)"))&&("(u0.p2==1)"))))))))||(X("(u0.p2==1)"))))
Formula 1 simplified : !(XF!XFX("(u0.p2==1)" & G"(u2.p54==1)") | X"(u0.p2==1)")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:23] [INFO ] Computation of co-enabling matrix(13/306) took 9574 ms. Total solver calls (SAT/UNSAT): 4166(2363/1803)
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
460 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.3219,388632,1,0,583150,90510,2980,1.01722e+06,2292,1.13159e+06,702378
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F("(u14.p119==1)"))))
Formula 2 simplified : !XF"(u14.p119==1)"
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:26] [INFO ] Computation of co-enabling matrix(18/306) took 13171 ms. Total solver calls (SAT/UNSAT): 5606(3272/2334)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,17.3644,490272,1,0,731680,98281,3000,1.34791e+06,2294,1.43841e+06,805029
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(((!((F("((u0.p16==1)&&(u14.p155==1))"))U(G((X("(u14.p116==1)"))||("((u0.p16==1)&&(u14.p155==1))")))))&&("(u0.p16==1)"))&&("(u14.p155==1)"))))
Formula 3 simplified : !F("(u0.p16==1)" & "(u14.p155==1)" & !(F"((u0.p16==1)&&(u14.p155==1))" U G("((u0.p16==1)&&(u14.p155==1))" | X"(u14.p116==1)")))
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:30] [INFO ] Computation of co-enabling matrix(23/306) took 16790 ms. Total solver calls (SAT/UNSAT): 7021(4180/2841)
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
338 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,20.7387,597440,1,0,925463,99830,3025,1.63882e+06,2295,1.53007e+06,959370
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(G(F((F("(i7.u10.p92==1)"))&&(G((G("(u1.p32==1)"))||("(u2.p46==1)")))))))))
Formula 4 simplified : !GFGF(F"(i7.u10.p92==1)" & G("(u2.p46==1)" | G"(u1.p32==1)"))
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:34] [INFO ] Computation of co-enabling matrix(28/306) took 20375 ms. Total solver calls (SAT/UNSAT): 8411(5090/3321)
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
359 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.326,685936,1,0,1.05654e+06,107091,3072,1.92053e+06,2299,1.72285e+06,1066812
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(!(F(X((F("(u0.p5==1)"))||("(u0.p7==1)"))))))&&(!(F("(u2.p54==1)")))))
Formula 5 simplified : !(G!FX("(u0.p7==1)" | F"(u0.p5==1)") & !F"(u2.p54==1)")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:37] [INFO ] Computation of co-enabling matrix(33/306) took 24046 ms. Total solver calls (SAT/UNSAT): 9776(6001/3775)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
187 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.1981,751408,1,0,1.15922e+06,113797,3100,2.13563e+06,2301,1.90764e+06,1149238
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G("(i7.u11.p106==1)"))))
Formula 6 simplified : !XG"(i7.u11.p106==1)"
Computing Next relation with stutter on 65 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,26.2003,751672,1,0,1.15922e+06,113797,3113,2.13563e+06,2301,1.90764e+06,1149265
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G(X((!(X(((G("(u2.p50!=1)"))||(F("(u2.p50==1)")))||("(u2.p50==1)"))))||("(u2.p44!=1)"))))))
Formula 7 simplified : GX("(u2.p44!=1)" | !X("(u2.p50==1)" | G"(u2.p50!=1)" | F"(u2.p50==1)"))
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:43:41] [INFO ] Computation of co-enabling matrix(38/306) took 27739 ms. Total solver calls (SAT/UNSAT): 11116(6911/4205)
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
316 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,29.3661,853840,1,0,1.32377e+06,120588,3188,2.4583e+06,2305,2.11019e+06,1299987
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(("((i7.u10.p112==1)&&(u14.p154==1))")U(F(!(X(X((X(X("((i7.u10.p112==1)&&(u14.p154==1))")))||(("(u14.p136==1)")U("(u14.p126==1)")))))))))))
Formula 8 simplified : !FX("((i7.u10.p112==1)&&(u14.p154==1))" U F!XX(XX"((i7.u10.p112==1)&&(u14.p154==1))" | ("(u14.p136==1)" U "(u14.p126==1)")))
Computing Next relation with stutter on 65 deadlock states
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.3798,854368,1,0,1.32478e+06,120615,3242,2.45905e+06,2316,2.11029e+06,1302364
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(G(X("(u14.p140==1)"))))||((F("(i7.u10.p103==1)"))&&(X("(i3.i0.u3.p59==1)")))))
Formula 9 simplified : !(!GX"(u14.p140==1)" | (F"(i7.u10.p103==1)" & X"(i3.i0.u3.p59==1)"))
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.3817,854368,1,0,1.32478e+06,120615,3276,2.45905e+06,2320,2.11029e+06,1302388
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA HealthRecord-PT-10-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G(F(G((F("(i7.u10.p96==1)"))U(G((X("(u2.p49==1)"))&&("(u1.p31!=1)")))))))U(G("(u1.p31==1)"))))
Formula 10 simplified : !(GFG(F"(i7.u10.p96==1)" U G("(u1.p31!=1)" & X"(u2.p49==1)")) U G"(u1.p31==1)")
Computing Next relation with stutter on 65 deadlock states
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
118 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,30.5613,884992,1,0,1.36625e+06,121533,3323,2.56302e+06,2320,2.16126e+06,1341151
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(X("(u14.p146==1)")))U(F(G(X("((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(u7.p72==1))&&(u8.p79==1))&&(u9.p86==1))&&(i7.u10.p112==1))&&(u14.p156==1))"))))))
Formula 11 simplified : !(GX"(u14.p146==1)" U FGX"((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(u7.p72==1))&&(u8.p79==1))&&(u9.p86==1))&&(i7.u10.p112==1))&&(u14.p156==1))")
Computing Next relation with stutter on 65 deadlock states
14 unique states visited
13 strongly connected components in search stack
15 transitions explored
14 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,30.5841,885256,1,0,1.36649e+06,121569,3376,2.5636e+06,2324,2.16143e+06,1342905
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-10-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:43:45] [INFO ] Computation of co-enabling matrix(43/306) took 31408 ms. Total solver calls (SAT/UNSAT): 12431(7821/4610)
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:43:48] [INFO ] Built C files in 36577ms 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 1621341829429

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

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