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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.3K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 49K 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-09-00
FORMULA_NAME HealthRecord-PT-09-01
FORMULA_NAME HealthRecord-PT-09-02
FORMULA_NAME HealthRecord-PT-09-03
FORMULA_NAME HealthRecord-PT-09-04
FORMULA_NAME HealthRecord-PT-09-05
FORMULA_NAME HealthRecord-PT-09-06
FORMULA_NAME HealthRecord-PT-09-07
FORMULA_NAME HealthRecord-PT-09-08
FORMULA_NAME HealthRecord-PT-09-09
FORMULA_NAME HealthRecord-PT-09-10
FORMULA_NAME HealthRecord-PT-09-11
FORMULA_NAME HealthRecord-PT-09-12
FORMULA_NAME HealthRecord-PT-09-13
FORMULA_NAME HealthRecord-PT-09-14
FORMULA_NAME HealthRecord-PT-09-15

=== Now, execution of the tool begins

BK_START 1621341622109

[2021-05-18 12:40:35] [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:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:40:35] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-18 12:40:35] [INFO ] Transformed 157 places.
[2021-05-18 12:40:36] [INFO ] Transformed 327 transitions.
[2021-05-18 12:40:36] [INFO ] Found NUPN structural information;
[2021-05-18 12:40:36] [INFO ] Parsed PT model containing 157 places and 327 transitions in 101 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5878 resets, run finished after 337 ms. (steps per millisecond=296 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1]
[2021-05-18 12:40:36] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2021-05-18 12:40:36] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:40:36] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-18 12:40:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:36] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-18 12:40:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:40:36] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-18 12:40:36] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 25 ms.
[2021-05-18 12:40:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 51 ms returned sat
[2021-05-18 12:40:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:37] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:40:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:37] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 21 ms.
[2021-05-18 12:40:39] [INFO ] Added : 178 causal constraints over 39 iterations in 2033 ms. Result :sat
[2021-05-18 12:40:39] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-18 12:40:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:39] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:40:39] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:40:39] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2021-05-18 12:40:39] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2021-05-18 12:40:39] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2021-05-18 12:40:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2021-05-18 12:40:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:40:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:39] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:40:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:39] [INFO ] Deduced a trap composed of 30 places in 53 ms
[2021-05-18 12:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-18 12:40:39] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 19 ms.
[2021-05-18 12:40:40] [INFO ] Added : 147 causal constraints over 30 iterations in 880 ms. Result :sat
[2021-05-18 12:40:40] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2021-05-18 12:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-18 12:40:40] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:40] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:40:40] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:40:41] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2021-05-18 12:40:41] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2021-05-18 12:40:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2021-05-18 12:40:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 50 ms returned sat
[2021-05-18 12:40:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:41] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:40:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:41] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 20 ms.
[2021-05-18 12:40:42] [INFO ] Added : 158 causal constraints over 32 iterations in 1105 ms. Result :sat
[2021-05-18 12:40:42] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:42] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:40:42] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:42] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2021-05-18 12:40:42] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2021-05-18 12:40:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2021-05-18 12:40:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:40:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:42] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:40:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:42] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 22 ms.
[2021-05-18 12:40:44] [INFO ] Added : 156 causal constraints over 32 iterations in 1218 ms. Result :sat
[2021-05-18 12:40:44] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:44] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:44] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:40:44] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:44] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 18 ms.
[2021-05-18 12:40:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:40:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:44] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:40:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:44] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 19 ms.
[2021-05-18 12:40:52] [INFO ] Added : 153 causal constraints over 31 iterations in 7582 ms. Result :unknown
[2021-05-18 12:40:52] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:40:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:52] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:40:52] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:40:52] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 17 ms.
[2021-05-18 12:40:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:40:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:52] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:40:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:52] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 15 ms.
[2021-05-18 12:40:54] [INFO ] Added : 187 causal constraints over 40 iterations in 2208 ms. Result :sat
[2021-05-18 12:40:54] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:54] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:40:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:40:54] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 18 ms.
[2021-05-18 12:40:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:40:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:55] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:40:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:55] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 18 ms.
[2021-05-18 12:40:55] [INFO ] Added : 138 causal constraints over 28 iterations in 808 ms. Result :sat
[2021-05-18 12:40:55] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:56] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:40:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 51 places in 48 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 46 places in 46 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 38 places in 49 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 43 places in 41 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2021-05-18 12:40:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 486 ms
[2021-05-18 12:40:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:40:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:40:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:56] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:40:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 46 places in 38 ms
[2021-05-18 12:40:56] [INFO ] Deduced a trap composed of 40 places in 40 ms
[2021-05-18 12:40:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2021-05-18 12:40:56] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 17 ms.
[2021-05-18 12:40:57] [INFO ] Added : 147 causal constraints over 30 iterations in 949 ms. Result :sat
[2021-05-18 12:40:57] [INFO ] Deduced a trap composed of 44 places in 53 ms
[2021-05-18 12:40:57] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:40:57] [INFO ] Deduced a trap composed of 39 places in 47 ms
[2021-05-18 12:40:58] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:40:58] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:40:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 389 ms
[2021-05-18 12:40:58] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:40:58] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:58] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:40:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:40:58] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 16 ms.
[2021-05-18 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:40:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 34 ms returned sat
[2021-05-18 12:40:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:40:58] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:40:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:40:58] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 17 ms.
[2021-05-18 12:41:00] [INFO ] Added : 171 causal constraints over 35 iterations in 1525 ms. Result :sat
[2021-05-18 12:41:00] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:00] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:41:00] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:41:00] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 16 ms.
[2021-05-18 12:41:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:41:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:00] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:41:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:00] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 15 ms.
[2021-05-18 12:41:01] [INFO ] Added : 142 causal constraints over 30 iterations in 860 ms. Result :sat
[2021-05-18 12:41:01] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:01] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:01] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:41:01] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:41:01] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 15 ms.
[2021-05-18 12:41:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 54 ms returned sat
[2021-05-18 12:41:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:01] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:41:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:01] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 14 ms.
[2021-05-18 12:41:03] [INFO ] Added : 185 causal constraints over 38 iterations in 1593 ms. Result :sat
[2021-05-18 12:41:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:03] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:41:03] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:41:03] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2021-05-18 12:41:03] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2021-05-18 12:41:03] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-18 12:41:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2021-05-18 12:41:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:41:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:03] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:41:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:03] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2021-05-18 12:41:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-18 12:41:03] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 14 ms.
[2021-05-18 12:41:06] [INFO ] Added : 159 causal constraints over 32 iterations in 2223 ms. Result :sat
[2021-05-18 12:41:06] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:06] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:41:06] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:41:06] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2021-05-18 12:41:06] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:41:06] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-18 12:41:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 120 ms
[2021-05-18 12:41:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 44 ms returned sat
[2021-05-18 12:41:06] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:06] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:41:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:41:06] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2021-05-18 12:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-18 12:41:06] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 17 ms.
[2021-05-18 12:41:11] [INFO ] Added : 150 causal constraints over 30 iterations in 4452 ms. Result :sat
[2021-05-18 12:41:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 12:41:11] [INFO ] Flatten gal took : 58 ms
FORMULA HealthRecord-PT-09-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:41:11] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:41:11] [INFO ] Applying decomposition
[2021-05-18 12:41:11] [INFO ] Flatten gal took : 17 ms
[2021-05-18 12:41:11] [INFO ] Input system was already deterministic with 301 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/graph1547046072165770717.txt, -o, /tmp/graph1547046072165770717.bin, -w, /tmp/graph1547046072165770717.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/graph1547046072165770717.bin, -l, -1, -v, -w, /tmp/graph1547046072165770717.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:41:11] [INFO ] Decomposing Gal with order
[2021-05-18 12:41: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 289 out of 301 initially.
// Phase 1: matrix 289 rows 157 cols
[2021-05-18 12:41:11] [INFO ] Computed 18 place invariants in 4 ms
inv : 2*p0 + p80 + 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 + 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 = 2
inv : 2*p0 + p68 + 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 + 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 = 2
inv : -p0 + p1 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - 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 - 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 = -1
inv : -p0 + p64 + p65 + p66 + p67 - 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 - 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 = -1
inv : 2*p0 + p21 + 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 + 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 = 2
inv : p0 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 = 1
inv : -p0 + p39 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 - 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 - 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 = -1
inv : 2*p0 + p58 + 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 + 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 = 2
inv : 2*p0 + p73 + 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 + 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 = 2
inv : p0 + 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 + p154 + p155 + p156 = 1
inv : -p0 + p20 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 - 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 - 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 = -1
inv : 2*p0 + p2 + 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 + 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 = 2
inv : -p0 + p69 + p70 + p71 + p72 - 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 - 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 = -1
inv : 2*p0 + p40 + 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 + 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 = 2
inv : 2*p0 + p63 + 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 + 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 = 2
inv : -p0 + p74 + p75 + p76 + p77 + p78 + p79 - 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 - 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 = -1
inv : -p0 + p81 + p82 + p83 + p84 + p85 + p86 - 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 - 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 = -1
inv : -p0 + p59 + p60 + p61 + p62 - 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 - 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 = -1
Total of 18 invariants.
[2021-05-18 12:41:11] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-18 12:41:11] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-18 12:41:11] [INFO ] Flatten gal took : 76 ms
[2021-05-18 12:41:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2021-05-18 12:41:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2021-05-18 12:41:11] [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 15 LTL properties
Checking formula 0 : !((X(((!(F("(u0.p13!=1)")))U("((u2.p39==1)&&(u15.p154==1))"))&&(("(u14.p147==1)")U(F("(u1.p29==1)"))))))
Formula 0 simplified : !X((!F"(u0.p13!=1)" U "((u2.p39==1)&&(u15.p154==1))") & ("(u14.p147==1)" U F"(u1.p29==1)"))
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:41:11] [INFO ] Proved 157 variables to be positive in 267 ms
[2021-05-18 12:41:11] [INFO ] Computing symmetric may disable matrix : 301 transitions.
[2021-05-18 12:41:11] [INFO ] Computation of disable matrix completed :0/301 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:41:12] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:41:12] [INFO ] Computing symmetric may enable matrix : 301 transitions.
[2021-05-18 12:41:12] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:41:13] [INFO ] Computing symmetric co enabling matrix : 301 transitions.
[2021-05-18 12:41:15] [INFO ] Computation of co-enabling matrix(2/301) took 1629 ms. Total solver calls (SAT/UNSAT): 895(357/538)
[2021-05-18 12:41:18] [INFO ] Computation of co-enabling matrix(6/301) took 4649 ms. Total solver calls (SAT/UNSAT): 2073(1072/1001)
Reverse transition relation is NOT exact ! Due to transitions t10, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t222, u0.t223, u0.t224, u0.t225, u0.t227, u0.t228, u0.t230, u0.t231, u0.t233, u0.t234, u0.t236, u0.t237, u0.t239, u0.t240, u0.t241, u0.t243, u0.t244, u0.t246, u0.t247, u0.t250, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t182, u1.t183, u1.t184, u1.t185, u1.t186, u1.t188, u1.t189, u1.t191, u1.t192, u1.t194, u1.t195, u1.t197, u1.t198, u1.t200, u1.t201, u1.t202, u1.t204, u1.t205, u1.t207, u1.t208, u1.t211, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t149, u2.t150, u2.t152, u2.t153, u2.t155, u2.t156, u2.t158, u2.t159, u2.t161, u2.t162, u2.t163, u2.t165, u2.t166, u2.t168, u2.t169, u2.t172, u9.t113, u9.t114, u9.t115, u9.t116, u9.t117, u9.t119, u9.t120, u9.t121, u10.t104, u10.t105, u10.t106, u10.t107, u10.t108, u10.t110, u10.t111, u10.t112, u15.t1, u15.t2, u15.t3, u15.t4, u15.t5, u15.t6, u15.t7, u15.t8, u15.t9, u15.t14, u15.t15, u15.t16, u15.t17, u15.t18, u15.t19, u15.t20, u15.t21, u15.t22, u15.t23, u15.t24, u15.t25, u15.t26, u15.t27, u15.t28, u15.t29, u15.t30, u15.t31, u15.t32, u15.t33, u15.t34, u15.t35, u15.t36, u15.t37, u15.t38, u15.t39, u15.t40, u15.t41, u15.t42, u15.t43, u15.t44, u15.t45, u15.t46, u15.t47, u15.t48, u15.t49, u15.t50, u15.t51, u15.t52, u15.t53, u15.t54, u15.t55, u15.t56, u15.t57, u15.t58, u15.t59, i6.t68, i6.t62, i6.u13.t60, i6.u13.t61, i6.u13.t70, i6.u13.t71, i6.u13.t72, i6.u13.t73, i6.u13.t74, i6.u13.t75, i6.u13.t76, i6.u13.t77, i6.u13.t78, i6.u13.t79, i6.u13.t80, i6.u13.t81, i6.u13.t82, i6.u13.t83, i6.u13.t84, i6.u13.t85, i6.u13.t86, i6.u13.t87, i6.u13.t88, i6.u13.t89, i6.u13.t90, i6.u13.t91, i6.u13.t92, i6.u13.t93, i6.u13.t94, i6.u13.t95, i6.u13.t96, i6.u13.t97, i6.u13.t98, i6.u13.t99, i6.u13.t100, i6.u13.t101, i6.u13.t102, i6.u13.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/200/296
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:41:21] [INFO ] Computation of co-enabling matrix(10/301) took 7835 ms. Total solver calls (SAT/UNSAT): 3235(1789/1446)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
974 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.77276,193448,1,0,189750,72376,2780,580516,2060,1.03315e+06,341075
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F(G((F("(u0.p7!=1)"))&&("(u0.p9==1)"))))))
Formula 1 simplified : FG("(u0.p9==1)" & F"(u0.p7!=1)")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:41:24] [INFO ] Computation of co-enabling matrix(14/301) took 10935 ms. Total solver calls (SAT/UNSAT): 4381(2503/1878)
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0117,193716,1,0,200066,73441,2817,580516,2068,1.03315e+06,352191
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X((G("((i6.u13.p113==1)&&(u1.p27==1))"))||(("(i6.u11.p107==1)")U(X("(u10.p86==1)")))))))
Formula 2 simplified : !XX(G"((i6.u13.p113==1)&&(u1.p27==1))" | ("(i6.u11.p107==1)" U X"(u10.p86==1)"))
Computing Next relation with stutter on 65 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,10.5752,198384,1,0,221889,75938,2856,580516,2072,1.03315e+06,357892
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(!(X((F("(i6.u13.p96==1)"))U(G(F(!(G(F("(u15.p144!=1)"))))))))))))
Formula 3 simplified : !GX!X(F"(i6.u13.p96==1)" U GF!GF"(u15.p144!=1)")
Computing Next relation with stutter on 65 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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,10.586,198820,1,0,222410,75968,2876,580516,2074,1.03315e+06,359539
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X((G("((u2.p55==1)&&(u15.p154==1))"))U("(i6.u13.p98==1)")))||(X("((i6.u13.p98==1)&&(u0.p7==1))"))))
Formula 4 simplified : !(X(G"((u2.p55==1)&&(u15.p154==1))" U "(i6.u13.p98==1)") | X"((i6.u13.p98==1)&&(u0.p7==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,10.5877,199052,1,0,222410,75968,2906,580516,2077,1.03315e+06,359559
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G((X(G(X("(u15.p127==1)"))))||(F("(i3.i1.i0.u4.p62==1)"))))))
Formula 5 simplified : !FG(XGX"(u15.p127==1)" | F"(i3.i1.i0.u4.p62==1)")
Computing Next relation with stutter on 65 deadlock states
19 unique states visited
18 strongly connected components in search stack
21 transitions explored
19 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.7511,204808,1,0,231449,76681,2958,580516,2081,1.03315e+06,370012
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F("((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i1.i0.u4.p61==1))&&(i3.i1.i1.u6.p66==1))&&(i3.i0.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1))"))))
Formula 6 simplified : F"((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i1.i0.u4.p61==1))&&(i3.i1.i1.u6.p66==1))&&(i3.i0.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1))"
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:41:27] [INFO ] Computation of co-enabling matrix(18/301) took 13954 ms. Total solver calls (SAT/UNSAT): 5511(3218/2293)
[2021-05-18 12:41:30] [INFO ] Computation of co-enabling matrix(22/301) took 16963 ms. Total solver calls (SAT/UNSAT): 6625(3933/2692)
[2021-05-18 12:41:33] [INFO ] Computation of co-enabling matrix(26/301) took 19967 ms. Total solver calls (SAT/UNSAT): 7723(4649/3074)
[2021-05-18 12:41:36] [INFO ] Computation of co-enabling matrix(30/301) took 23009 ms. Total solver calls (SAT/UNSAT): 8805(5364/3441)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1315 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,23.8966,610944,1,0,829574,94782,3036,1.87878e+06,2084,1.92114e+06,626634
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((F("(i6.u13.p95==1)"))U(F(G(!(F((!(X("(i3.i1.i0.u3.p59==1)")))U("(i3.i1.i1.u6.p68==1)")))))))))
Formula 7 simplified : !G(F"(i6.u13.p95==1)" U FG!F(!X"(i3.i1.i0.u3.p59==1)" U "(i3.i1.i1.u6.p68==1)"))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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,23.9845,613028,1,0,830732,94782,3058,1.88041e+06,2084,1.92121e+06,644089
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X((!(F(X("((u0.p9==1)||(u0.p16==1))"))))&&(!(G(X("(u0.p16==1)"))))))))
Formula 8 simplified : !GX(!FX"((u0.p9==1)||(u0.p16==1))" & !GX"(u0.p16==1)")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:41:39] [INFO ] Computation of co-enabling matrix(34/301) took 26130 ms. Total solver calls (SAT/UNSAT): 9871(6080/3791)
21 unique states visited
21 strongly connected components in search stack
22 transitions explored
21 items max in DFS search stack
151 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,25.4865,653664,1,0,891478,97761,3065,2.01996e+06,2088,2.01991e+06,705727
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((F(G("(u1.p22==1)")))U(F("(u1.p22==1)")))U(X("(u1.p22==1)"))))
Formula 9 simplified : !((FG"(u1.p22==1)" U F"(u1.p22==1)") U X"(u1.p22==1)")
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
215 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,27.6323,727044,1,0,1.0058e+06,100919,3142,2.27378e+06,2090,2.13922e+06,815806
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(("(((i3.i1.i0.u4.p62==1)&&(u1.p36==1))&&(u15.p154==1))")U(G(X(G("((u0.p17==1)&&(u15.p154==1))")))))))
Formula 10 simplified : !X("(((i3.i1.i0.u4.p62==1)&&(u1.p36==1))&&(u15.p154==1))" U GXG"((u0.p17==1)&&(u15.p154==1))")
Computing Next relation with stutter on 65 deadlock states
[2021-05-18 12:41:42] [INFO ] Computation of co-enabling matrix(38/301) took 29250 ms. Total solver calls (SAT/UNSAT): 10921(6797/4124)
21 unique states visited
21 strongly connected components in search stack
23 transitions explored
21 items max in DFS search stack
108 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,28.7151,761872,1,0,1.05635e+06,105449,3189,2.37441e+06,2090,2.22981e+06,871608
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("(u9.p74==1)")||((G("(u9.p74==1)"))&&("(u9.p79==1)")))U(!(((G(X("(i6.u13.p104==1)")))||("(i6.u13.p104==1)"))U("(i6.u13.p104==1)")))))
Formula 11 simplified : !(("(u9.p74==1)" | ("(u9.p79==1)" & G"(u9.p74==1)")) U !(("(i6.u13.p104==1)" | GX"(i6.u13.p104==1)") U "(i6.u13.p104==1)"))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,28.7173,762128,1,0,1.05635e+06,105449,3221,2.37441e+06,2092,2.22981e+06,871647
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA HealthRecord-PT-09-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((F(("((u9.p77==1)&&(u15.p154==1))")U("(u9.p75==1)")))U(X((F((("(u10.p83==1)")U("(u2.p55==1)"))||("(u2.p46==1)")))&&("(u9.p75==1)"))))))
Formula 12 simplified : !X(F("((u9.p77==1)&&(u15.p154==1))" U "(u9.p75==1)") U X("(u9.p75==1)" & F("(u2.p46==1)" | ("(u10.p83==1)" U "(u2.p55==1)"))))
Computing Next relation with stutter on 65 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
92 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.645,791432,1,0,1.09704e+06,106871,3318,2.47052e+06,2097,2.27794e+06,903132
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F((G("(i6.u13.p100==1)"))&&((X("(i6.u13.p104==1)"))U("(u10.p83==1)")))))
Formula 13 simplified : !F(G"(i6.u13.p100==1)" & (X"(i6.u13.p104==1)" U "(u10.p83==1)"))
Computing Next relation with stutter on 65 deadlock states
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
131 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.9577,832076,1,0,1.15767e+06,108219,3378,2.61602e+06,2100,2.33379e+06,963166
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X(X(!(F(G("(u15.p130==1)"))))))))
Formula 14 simplified : !FXX!FG"(u15.p130==1)"
Computing Next relation with stutter on 65 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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.9799,832868,1,0,1.15892e+06,108331,3394,2.61794e+06,2102,2.33652e+06,965402
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:41:46] [INFO ] Computation of co-enabling matrix(42/301) took 32323 ms. Total solver calls (SAT/UNSAT): 11955(7512/4443)
[2021-05-18 12:41:49] [INFO ] Computation of co-enabling matrix(46/301) took 35412 ms. Total solver calls (SAT/UNSAT): 12973(8228/4745)
[2021-05-18 12:41:52] [INFO ] Computation of co-enabling matrix(50/301) took 38529 ms. Total solver calls (SAT/UNSAT): 13975(8943/5032)
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:41:55] [INFO ] Built C files in 43517ms 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 1621341716350

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

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