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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1660.048 88880.00 165487.00 393.40 TFFFFFTFFFFFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171300174.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.0K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 51K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-00
FORMULA_NAME HealthRecord-PT-12-01
FORMULA_NAME HealthRecord-PT-12-02
FORMULA_NAME HealthRecord-PT-12-03
FORMULA_NAME HealthRecord-PT-12-04
FORMULA_NAME HealthRecord-PT-12-05
FORMULA_NAME HealthRecord-PT-12-06
FORMULA_NAME HealthRecord-PT-12-07
FORMULA_NAME HealthRecord-PT-12-08
FORMULA_NAME HealthRecord-PT-12-09
FORMULA_NAME HealthRecord-PT-12-10
FORMULA_NAME HealthRecord-PT-12-11
FORMULA_NAME HealthRecord-PT-12-12
FORMULA_NAME HealthRecord-PT-12-13
FORMULA_NAME HealthRecord-PT-12-14
FORMULA_NAME HealthRecord-PT-12-15

=== Now, execution of the tool begins

BK_START 1621341882983

[2021-05-18 12:44:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:44:44] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-18 12:44:44] [INFO ] Transformed 160 places.
[2021-05-18 12:44:44] [INFO ] Transformed 340 transitions.
[2021-05-18 12:44:44] [INFO ] Found NUPN structural information;
[2021-05-18 12:44:44] [INFO ] Parsed PT model containing 160 places and 340 transitions in 91 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 7231 resets, run finished after 377 ms. (steps per millisecond=265 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1]
[2021-05-18 12:44:45] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-18 12:44:45] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:44:45] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2021-05-18 12:44:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:45] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-18 12:44:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:44:45] [INFO ] [Real]Added 1 Read/Feed constraints in 13 ms returned sat
[2021-05-18 12:44:45] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2021-05-18 12:44:45] [INFO ] Deduced a trap composed of 29 places in 86 ms
[2021-05-18 12:44:46] [INFO ] Deduced a trap composed of 29 places in 68 ms
[2021-05-18 12:44:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 301 ms
[2021-05-18 12:44:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 53 ms returned sat
[2021-05-18 12:44:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-18 12:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:46] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-18 12:44:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:44:46] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 37 ms.
[2021-05-18 12:44:47] [INFO ] Added : 169 causal constraints over 34 iterations in 1660 ms. Result :sat
[2021-05-18 12:44:48] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned unsat
[2021-05-18 12:44:48] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:48] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:48] [INFO ] Deduced a trap composed of 39 places in 101 ms
[2021-05-18 12:44:48] [INFO ] Deduced a trap composed of 40 places in 45 ms
[2021-05-18 12:44:48] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2021-05-18 12:44:48] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2021-05-18 12:44:48] [INFO ] Deduced a trap composed of 41 places in 35 ms
[2021-05-18 12:44:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 322 ms
[2021-05-18 12:44:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:48] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-18 12:44:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:48] [INFO ] Deduced a trap composed of 40 places in 40 ms
[2021-05-18 12:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-18 12:44:48] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 23 ms.
[2021-05-18 12:44:52] [INFO ] Added : 166 causal constraints over 34 iterations in 3683 ms. Result :sat
[2021-05-18 12:44:52] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2021-05-18 12:44:52] [INFO ] Deduced a trap composed of 40 places in 36 ms
[2021-05-18 12:44:52] [INFO ] Deduced a trap composed of 39 places in 36 ms
[2021-05-18 12:44:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 234 ms
[2021-05-18 12:44:52] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-18 12:44:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:52] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:44:52] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:52] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2021-05-18 12:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-18 12:44:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:44:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:53] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:44:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:53] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 18 ms.
[2021-05-18 12:44:54] [INFO ] Added : 170 causal constraints over 34 iterations in 1422 ms. Result :sat
[2021-05-18 12:44:54] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:44:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:54] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:44:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:54] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 19 ms.
[2021-05-18 12:44:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:44:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:55] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-18 12:44:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:55] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 34 ms.
[2021-05-18 12:44:56] [INFO ] Added : 162 causal constraints over 33 iterations in 1136 ms. Result :sat
[2021-05-18 12:44:56] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:56] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-18 12:44:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:56] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2021-05-18 12:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-18 12:44:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:44:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:56] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:44:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:56] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 18 ms.
[2021-05-18 12:44:57] [INFO ] Added : 152 causal constraints over 32 iterations in 1171 ms. Result :sat
[2021-05-18 12:44:57] [INFO ] Deduced a trap composed of 29 places in 23 ms
[2021-05-18 12:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-18 12:44:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:58] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:44:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:58] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2021-05-18 12:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:44:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:44:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:58] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:44:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:58] [INFO ] Deduced a trap composed of 29 places in 27 ms
[2021-05-18 12:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:44:58] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 17 ms.
[2021-05-18 12:44:59] [INFO ] Added : 159 causal constraints over 33 iterations in 1656 ms. Result :sat
[2021-05-18 12:45:00] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:00] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:45:00] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:45:00] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:45:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-18 12:45:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:45:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:00] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:45:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:00] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 18 ms.
[2021-05-18 12:45:01] [INFO ] Added : 160 causal constraints over 32 iterations in 1003 ms. Result :sat
[2021-05-18 12:45:01] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-18 12:45:01] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:01] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:01] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:45:01] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:01] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:45:01] [INFO ] Deduced a trap composed of 37 places in 31 ms
[2021-05-18 12:45:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2021-05-18 12:45:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 34 ms returned sat
[2021-05-18 12:45:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:01] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:45:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:01] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 15 ms.
[2021-05-18 12:45:03] [INFO ] Added : 167 causal constraints over 34 iterations in 1414 ms. Result :sat
[2021-05-18 12:45:03] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:45:03] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2021-05-18 12:45:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:03] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:45:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:45:03] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 16 ms.
[2021-05-18 12:45:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:45:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:03] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:45:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:45:03] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 16 ms.
[2021-05-18 12:45:04] [INFO ] Added : 151 causal constraints over 31 iterations in 830 ms. Result :sat
[2021-05-18 12:45:04] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:45:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:04] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:45:04] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:04] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2021-05-18 12:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-18 12:45:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:45:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:05] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:45:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:05] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 15 ms.
[2021-05-18 12:45:06] [INFO ] Added : 170 causal constraints over 37 iterations in 1636 ms. Result :sat
[2021-05-18 12:45:06] [INFO ] Deduced a trap composed of 29 places in 21 ms
[2021-05-18 12:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-18 12:45:06] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:45:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:07] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:45:07] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:07] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2021-05-18 12:45:07] [INFO ] Deduced a trap composed of 38 places in 40 ms
[2021-05-18 12:45:07] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:45:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2021-05-18 12:45:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:45:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:07] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:45:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:07] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-18 12:45:07] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 15 ms.
[2021-05-18 12:45:08] [INFO ] Added : 151 causal constraints over 31 iterations in 1051 ms. Result :sat
[2021-05-18 12:45:08] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:45:08] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-18 12:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2021-05-18 12:45:08] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:45:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:08] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:45:08] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:45:08] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-18 12:45:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:45:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:45:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:45:09] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:45:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:45:09] [INFO ] Computed and/alt/rep : 311/2449/299 causal constraints in 29 ms.
[2021-05-18 12:45:10] [INFO ] Added : 169 causal constraints over 34 iterations in 1778 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-18 12:45:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 12:45:11] [INFO ] Flatten gal took : 98 ms
FORMULA HealthRecord-PT-12-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:45:11] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:45:11] [INFO ] Applying decomposition
[2021-05-18 12:45:11] [INFO ] Flatten gal took : 21 ms
[2021-05-18 12:45:11] [INFO ] Input system was already deterministic with 312 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 300 out of 312 initially.
// Phase 1: matrix 300 rows 160 cols
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/graph4588596250646400246.txt, -o, /tmp/graph4588596250646400246.bin, -w, /tmp/graph4588596250646400246.weights], workingDir=null]
[2021-05-18 12:45:11] [INFO ] Computed 18 place invariants in 41 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4588596250646400246.bin, -l, -1, -v, -w, /tmp/graph4588596250646400246.weights, -q, 0, -e, 0.001], workingDir=null]
inv : -p0 + p19 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : 2*p0 + p76 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : 2*p0 + p20 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : 2*p0 + p83 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : p0 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 = 1
inv : 2*p0 + p1 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : 2*p0 + p57 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : -p0 + p63 + p64 + p65 + p66 + p67 + p68 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : p0 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 1
inv : 2*p0 + p62 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : -p0 + p84 + p85 + p86 + p87 + p88 + p89 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : -p0 + p70 + p71 + p72 + p73 + p74 + p75 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : -p0 + p38 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : -p0 + p77 + p78 + p79 + p80 + p81 + p82 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
inv : 2*p0 + p39 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : 2*p0 + p69 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 2
inv : -p0 + p58 + p59 + p60 + p61 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 = -1
Total of 18 invariants.
[2021-05-18 12:45:11] [INFO ] Computed 18 place invariants in 44 ms
[2021-05-18 12:45:11] [INFO ] Decomposing Gal with order
[2021-05-18 12:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 12:45:11] [INFO ] Removed a total of 50 redundant transitions.
[2021-05-18 12:45:11] [INFO ] Flatten gal took : 162 ms
[2021-05-18 12:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2021-05-18 12:45:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2021-05-18 12:45:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F((((G(("(i3.u5.p63==1)")U("(u7.p79==1)")))&&(F("(u0.p8!=1)")))&&(G("(u13.p156==1)")))&&("(u13.p156==1)"))))
Formula 0 simplified : !F("(u13.p156==1)" & G("(i3.u5.p63==1)" U "(u7.p79==1)") & F"(u0.p8!=1)" & G"(u13.p156==1)")
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:45:12] [INFO ] Proved 160 variables to be positive in 664 ms
[2021-05-18 12:45:12] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2021-05-18 12:45:12] [INFO ] Computation of disable matrix completed :0/312 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:45:12] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:45:12] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2021-05-18 12:45:12] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:45:14] [INFO ] Computing symmetric co enabling matrix : 312 transitions.
[2021-05-18 12:45:15] [INFO ] Computation of co-enabling matrix(2/312) took 1652 ms. Total solver calls (SAT/UNSAT): 928(369/559)
[2021-05-18 12:45:19] [INFO ] Computation of co-enabling matrix(7/312) took 5355 ms. Total solver calls (SAT/UNSAT): 2453(1293/1160)
Reverse transition relation is NOT exact ! Due to transitions t12, t276, t281, t285, t289, t293, t298, t301, t304, u0.t222, u0.t223, u0.t224, u0.t225, u0.t226, u0.t227, u0.t228, u0.t229, u0.t230, u0.t231, u0.t232, u0.t233, u0.t234, u0.t235, u0.t236, u0.t238, u0.t239, u0.t241, u0.t242, u0.t244, u0.t245, u0.t247, u0.t248, u0.t250, u0.t251, u0.t252, u0.t254, u0.t255, u0.t257, u0.t258, u1.t183, u1.t184, u1.t185, u1.t186, u1.t187, u1.t188, u1.t189, u1.t190, u1.t191, u1.t192, u1.t193, u1.t194, u1.t195, u1.t196, u1.t198, u1.t199, u1.t201, u1.t202, u1.t204, u1.t205, u1.t207, u1.t208, u1.t210, u1.t211, u1.t212, u1.t214, u1.t215, u1.t217, u1.t218, u1.t221, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t159, u2.t160, u2.t162, u2.t163, u2.t165, u2.t166, u2.t168, u2.t169, u2.t171, u2.t172, u2.t173, u2.t175, u2.t176, u2.t178, u2.t179, u2.t182, u6.t122, u6.t123, u6.t124, u6.t125, u6.t126, u6.t128, u6.t129, u6.t130, u7.t113, u7.t114, u7.t115, u7.t116, u7.t117, u7.t119, u7.t120, u7.t121, u8.t104, u8.t105, u8.t106, u8.t107, u8.t108, u8.t110, u8.t111, u8.t112, u13.t1, u13.t2, u13.t3, u13.t4, u13.t5, u13.t6, u13.t7, u13.t8, u13.t9, u13.t14, u13.t15, u13.t16, u13.t17, u13.t18, u13.t19, u13.t20, u13.t21, u13.t22, u13.t23, u13.t24, u13.t25, u13.t26, u13.t27, u13.t28, u13.t29, u13.t30, u13.t31, u13.t32, u13.t33, u13.t34, u13.t35, u13.t36, u13.t37, u13.t38, u13.t39, u13.t40, u13.t41, u13.t42, u13.t43, u13.t44, u13.t45, u13.t46, u13.t47, u13.t48, u13.t49, u13.t50, u13.t51, u13.t52, u13.t53, u13.t54, u13.t55, u13.t56, u13.t57, u13.t58, u13.t59, i3.u5.t131, i3.u5.t132, i3.u5.t133, i3.u5.t134, i3.u5.t135, i3.u5.t137, i3.u5.t138, i3.u5.t139, i7.t66, i7.t62, i7.u11.t60, i7.u11.t61, i7.u11.t70, i7.u11.t71, i7.u11.t72, i7.u11.t73, i7.u11.t74, i7.u11.t75, i7.u11.t76, i7.u11.t77, i7.u11.t78, i7.u11.t79, i7.u11.t80, i7.u11.t81, i7.u11.t82, i7.u11.t83, i7.u11.t84, i7.u11.t85, i7.u11.t86, i7.u11.t87, i7.u11.t88, i7.u11.t89, i7.u11.t90, i7.u11.t91, i7.u11.t92, i7.u11.t93, i7.u11.t94, i7.u11.t95, i7.u11.t96, i7.u11.t97, i7.u11.t98, i7.u11.t99, i7.u11.t100, i7.u11.t101, i7.u11.t102, i7.u11.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/224/307
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:22] [INFO ] Computation of co-enabling matrix(11/312) took 8365 ms. Total solver calls (SAT/UNSAT): 3655(2033/1622)
[2021-05-18 12:45:25] [INFO ] Computation of co-enabling matrix(15/312) took 11382 ms. Total solver calls (SAT/UNSAT): 4841(2772/2069)
[2021-05-18 12:45:29] [INFO ] Computation of co-enabling matrix(20/312) took 15063 ms. Total solver calls (SAT/UNSAT): 6301(3695/2606)
19 unique states visited
19 strongly connected components in search stack
19 transitions explored
19 items max in DFS search stack
1900 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,19.0522,456368,1,0,677877,82047,2707,1.27694e+06,2296,1.28093e+06,734785
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X((G("(u1.p35==1)"))&&("(u1.p21==1)")))||(X(F("(u0.p3==1)")))))
Formula 1 simplified : !(X("(u1.p21==1)" & G"(u1.p35==1)") | XF"(u0.p3==1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:32] [INFO ] Computation of co-enabling matrix(25/312) took 18705 ms. Total solver calls (SAT/UNSAT): 7736(4620/3116)
[2021-05-18 12:45:36] [INFO ] Computation of co-enabling matrix(30/312) took 22366 ms. Total solver calls (SAT/UNSAT): 9146(5544/3602)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
603 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.0806,627832,1,0,955915,91131,2840,1.83091e+06,2326,1.58543e+06,946766
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(X((G(F((F("(u6.p72!=1)"))||("(u13.p146==1)"))))&&(F("(u7.p79==1)")))))))
Formula 2 simplified : !FXX(GF("(u13.p146==1)" | F"(u6.p72!=1)") & F"(u7.p79==1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:40] [INFO ] Computation of co-enabling matrix(35/312) took 26021 ms. Total solver calls (SAT/UNSAT): 10531(6469/4062)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
385 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.9279,751556,1,0,1.14926e+06,97229,2911,2.22898e+06,2328,1.77287e+06,1059444
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(G(X((F("(i7.u11.p97==1)"))U("(u2.p52==1)")))))U("(u2.p52==1)")))
Formula 3 simplified : !(FGX(F"(i7.u11.p97==1)" U "(u2.p52==1)") U "(u2.p52==1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:43] [INFO ] Computation of co-enabling matrix(40/312) took 29719 ms. Total solver calls (SAT/UNSAT): 11891(7394/4497)
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
605 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,34.9803,950028,1,0,1.44984e+06,101669,2973,2.82987e+06,2330,1.9202e+06,1217378
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((!(X(F(X(X("((u1.p35==1)&&(u13.p157==1))"))))))U("(((u1.p35!=1)||(u13.p157!=1))||(u2.p44!=1))"))&&(X("(i3.u5.p68==1)"))))
Formula 4 simplified : !((!XFXX"((u1.p35==1)&&(u13.p157==1))" U "(((u1.p35!=1)||(u13.p157!=1))||(u2.p44!=1))") & X"(i3.u5.p68==1)")
Computing Next relation with stutter on 129 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,34.9821,950476,1,0,1.44984e+06,101669,2987,2.82987e+06,2333,1.9202e+06,1217406
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HealthRecord-PT-12-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(F(!(G(F("((u7.p80==1)&&(u13.p157==1))"))))))||(X(G(X("(i7.u11.p93!=1)"))))))
Formula 5 simplified : !(GF!GF"((u7.p80==1)&&(u13.p157==1))" | XGX"(i7.u11.p93!=1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:47] [INFO ] Computation of co-enabling matrix(45/312) took 33401 ms. Total solver calls (SAT/UNSAT): 13226(8320/4906)
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 items max in DFS search stack
380 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,38.7757,1067672,1,0,1.64094e+06,107316,3022,3.21154e+06,2336,2.11232e+06,1358820
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(X("((i7.u11.p114==1)&&(u13.p154==1))")))))
Formula 6 simplified : !XGX"((i7.u11.p114==1)&&(u13.p154==1))"
Computing Next relation with stutter on 129 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,38.7774,1067936,1,0,1.64094e+06,107316,3048,3.21154e+06,2337,2.11232e+06,1358836
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F("((i7.u11.p114==1)&&(u13.p139==1))"))U(G((X("((i7.u11.p114==1)&&(u13.p139==1))"))||("(u6.p75==1)")))))
Formula 7 simplified : !(F"((i7.u11.p114==1)&&(u13.p139==1))" U G("(u6.p75==1)" | X"((i7.u11.p114==1)&&(u13.p139==1))"))
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:51] [INFO ] Computation of co-enabling matrix(50/312) took 37056 ms. Total solver calls (SAT/UNSAT): 14536(9243/5293)
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
64 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,39.4259,1087728,1,0,1.67209e+06,107811,3092,3.2645e+06,2338,2.12345e+06,1378484
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X((!(X("(u0.p13==1)")))||(!(((F("(i7.u11.p105==1)"))&&("(i7.u11.p94!=1)"))U("(i7.u11.p105==1)")))))))
Formula 8 simplified : X(!X"(u0.p13==1)" | !(("(i7.u11.p94!=1)" & F"(i7.u11.p105==1)") U "(i7.u11.p105==1)"))
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:54] [INFO ] Computation of co-enabling matrix(55/312) took 40737 ms. Total solver calls (SAT/UNSAT): 15821(10167/5654)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
396 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,43.3871,1154568,1,0,1.77886e+06,111430,3134,3.47263e+06,2345,2.2205e+06,1447560
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((((!(G("(i7.u11.p102==1)")))||("(u6.p73!=1)"))||("(u13.p157!=1)"))||("(u7.p79!=1)"))))
Formula 9 simplified : !X("(u6.p73!=1)" | "(u7.p79!=1)" | "(u13.p157!=1)" | !G"(i7.u11.p102==1)")
Computing Next relation with stutter on 129 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,43.3879,1154832,1,0,1.77886e+06,111430,3153,3.47263e+06,2345,2.2205e+06,1447567
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA HealthRecord-PT-12-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F((G("(u2.p43!=1)"))U((G(!(("(i7.u10.p111==1)")U(F("(u13.p130==1)")))))U("(u2.p45==1)"))))))
Formula 10 simplified : F(G"(u2.p43!=1)" U (G!("(i7.u10.p111==1)" U F"(u13.p130==1)") U "(u2.p45==1)"))
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:45:58] [INFO ] Computation of co-enabling matrix(60/312) took 44494 ms. Total solver calls (SAT/UNSAT): 17081(11090/5991)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
378 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,47.177,1286264,1,0,2.00132e+06,118088,3164,3.87769e+06,2345,2.40615e+06,1625627
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(!(G(("(u6.p71!=1)")U("(u6.p71==1)"))))))
Formula 11 simplified : !G!G("(u6.p71!=1)" U "(u6.p71==1)")
Computing Next relation with stutter on 129 deadlock states
[2021-05-18 12:46:02] [INFO ] Computation of co-enabling matrix(65/312) took 48165 ms. Total solver calls (SAT/UNSAT): 18316(12012/6304)
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
312 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,50.2886,1388956,1,0,2.16655e+06,120140,3213,4.16195e+06,2347,2.49842e+06,1751158
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(F(X(!(F("(i7.u10.p113==1)")))))))
Formula 12 simplified : FX!F"(i7.u10.p113==1)"
Computing Next relation with stutter on 129 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,50.2992,1388956,1,0,2.16686e+06,120140,3229,4.16248e+06,2347,2.49842e+06,1752225
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-12-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:46:05] [INFO ] Computation of co-enabling matrix(70/312) took 51879 ms. Total solver calls (SAT/UNSAT): 19526(12935/6591)
[2021-05-18 12:46:09] [INFO ] Computation of co-enabling matrix(75/312) took 55497 ms. Total solver calls (SAT/UNSAT): 20711(13857/6854)
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:46:10] [INFO ] Built C files in 59652ms 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 1621341971863

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

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