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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 48K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621341366941

[2021-05-18 12:36:20] [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:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:36:20] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-18 12:36:20] [INFO ] Transformed 155 places.
[2021-05-18 12:36:20] [INFO ] Transformed 320 transitions.
[2021-05-18 12:36:20] [INFO ] Found NUPN structural information;
[2021-05-18 12:36:20] [INFO ] Parsed PT model containing 155 places and 320 transitions in 99 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5266 resets, run finished after 349 ms. (steps per millisecond=286 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1]
[2021-05-18 12:36:20] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
// Phase 1: matrix 283 rows 155 cols
[2021-05-18 12:36:20] [INFO ] Computed 18 place invariants in 14 ms
[2021-05-18 12:36:20] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:36:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:20] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-18 12:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:36:20] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 30 places in 94 ms
[2021-05-18 12:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-18 12:36:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 56 ms returned sat
[2021-05-18 12:36:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:21] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:36:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 30 places in 88 ms
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 44 places in 56 ms
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 42 places in 54 ms
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 45 places in 51 ms
[2021-05-18 12:36:21] [INFO ] Deduced a trap composed of 39 places in 48 ms
[2021-05-18 12:36:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 517 ms
[2021-05-18 12:36:21] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 41 ms.
[2021-05-18 12:36:23] [INFO ] Added : 156 causal constraints over 32 iterations in 2008 ms. Result :sat
[2021-05-18 12:36:23] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:36:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-18 12:36:24] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:24] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:36:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:36:24] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 23 ms.
[2021-05-18 12:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:36:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:24] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:24] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 19 ms.
[2021-05-18 12:36:25] [INFO ] Added : 165 causal constraints over 34 iterations in 1080 ms. Result :sat
[2021-05-18 12:36:25] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:36:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:25] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:36:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:36:25] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:36:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-18 12:36:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 50 ms returned sat
[2021-05-18 12:36:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:25] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:36:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:25] [INFO ] Deduced a trap composed of 40 places in 35 ms
[2021-05-18 12:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-18 12:36:26] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 19 ms.
[2021-05-18 12:36:27] [INFO ] Added : 144 causal constraints over 30 iterations in 1375 ms. Result :sat
[2021-05-18 12:36:27] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:36:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:27] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-18 12:36:27] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:27] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 19 ms.
[2021-05-18 12:36:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-18 12:36:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:27] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:27] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 17 ms.
[2021-05-18 12:36:28] [INFO ] Added : 155 causal constraints over 32 iterations in 797 ms. Result :sat
[2021-05-18 12:36:28] [INFO ] [Real]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:36:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-18 12:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:28] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:36:28] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:28] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 28 ms.
[2021-05-18 12:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-18 12:36:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:29] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-18 12:36:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:29] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 17 ms.
[2021-05-18 12:36:30] [INFO ] Added : 155 causal constraints over 32 iterations in 821 ms. Result :sat
[2021-05-18 12:36:30] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:36:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:30] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:36:30] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:30] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 15 ms.
[2021-05-18 12:36:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:36:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:30] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:36:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:30] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 13 ms.
[2021-05-18 12:36:31] [INFO ] Added : 147 causal constraints over 30 iterations in 805 ms. Result :sat
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-18 12:36:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:31] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:36:31] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 45 places in 47 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 44 places in 46 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 38 places in 50 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 38 places in 44 ms
[2021-05-18 12:36:31] [INFO ] Deduced a trap composed of 40 places in 46 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 38 places in 40 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 40 places in 40 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 42 places in 40 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 42 places in 40 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:36:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1155 ms
[2021-05-18 12:36:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 43 ms returned sat
[2021-05-18 12:36:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:32] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:36:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:32] [INFO ] Deduced a trap composed of 39 places in 36 ms
[2021-05-18 12:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-18 12:36:32] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 15 ms.
[2021-05-18 12:36:34] [INFO ] Added : 140 causal constraints over 28 iterations in 1247 ms. Result :sat
[2021-05-18 12:36:34] [INFO ] Deduced a trap composed of 39 places in 61 ms
[2021-05-18 12:36:34] [INFO ] Deduced a trap composed of 38 places in 35 ms
[2021-05-18 12:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2021-05-18 12:36:34] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:34] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:34] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:34] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-18 12:36:34] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:36:34] [INFO ] Deduced a trap composed of 38 places in 35 ms
[2021-05-18 12:36:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2021-05-18 12:36:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:36:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:34] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:36:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:34] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:36:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-18 12:36:34] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 15 ms.
[2021-05-18 12:36:35] [INFO ] Added : 146 causal constraints over 30 iterations in 743 ms. Result :sat
[2021-05-18 12:36:35] [INFO ] Deduced a trap composed of 38 places in 34 ms
[2021-05-18 12:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-18 12:36:35] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:35] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:36:35] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:35] [INFO ] Deduced a trap composed of 44 places in 49 ms
[2021-05-18 12:36:35] [INFO ] Deduced a trap composed of 45 places in 46 ms
[2021-05-18 12:36:35] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 44 places in 54 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 37 places in 50 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 37 places in 49 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 38 places in 41 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 40 places in 46 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 38 places in 41 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 41 places in 39 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 42 places in 41 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 42 places in 41 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:36:36] [INFO ] Deduced a trap composed of 41 places in 39 ms
[2021-05-18 12:36:36] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1125 ms
[2021-05-18 12:36:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 43 ms returned sat
[2021-05-18 12:36:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:37] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:36:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:37] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:36:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-18 12:36:37] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 17 ms.
[2021-05-18 12:36:38] [INFO ] Added : 140 causal constraints over 28 iterations in 1278 ms. Result :sat
[2021-05-18 12:36:38] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:36:38] [INFO ] Deduced a trap composed of 38 places in 37 ms
[2021-05-18 12:36:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2021-05-18 12:36:38] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:38] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:38] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:38] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 15 ms.
[2021-05-18 12:36:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:36:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:38] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:36:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:38] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 14 ms.
[2021-05-18 12:36:41] [INFO ] Added : 166 causal constraints over 34 iterations in 2074 ms. Result :sat
[2021-05-18 12:36:41] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:41] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:36:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 47 places in 47 ms
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 38 places in 40 ms
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 36 places in 42 ms
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 37 places in 39 ms
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:36:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 302 ms
[2021-05-18 12:36:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:36:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:41] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:41] [INFO ] Deduced a trap composed of 38 places in 31 ms
[2021-05-18 12:36:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:36:41] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 23 ms.
[2021-05-18 12:36:43] [INFO ] Added : 149 causal constraints over 31 iterations in 1270 ms. Result :sat
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 30 places in 44 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2021-05-18 12:36:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 321 ms
[2021-05-18 12:36:43] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:36:43] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:43] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:36:43] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 58 places in 55 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 39 places in 56 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 46 places in 55 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 40 places in 43 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:36:43] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 37 places in 42 ms
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 38 places in 41 ms
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 39 places in 53 ms
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:36:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 759 ms
[2021-05-18 12:36:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:36:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:44] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:36:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:44] [INFO ] Deduced a trap composed of 39 places in 27 ms
[2021-05-18 12:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-18 12:36:44] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 17 ms.
[2021-05-18 12:36:45] [INFO ] Added : 143 causal constraints over 29 iterations in 1395 ms. Result :sat
[2021-05-18 12:36:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:46] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:46] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:46] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 14 ms.
[2021-05-18 12:36:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 41 ms returned sat
[2021-05-18 12:36:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:46] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:36:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:46] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 11 ms.
[2021-05-18 12:36:47] [INFO ] Added : 166 causal constraints over 34 iterations in 1386 ms. Result :sat
[2021-05-18 12:36:47] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:47] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:47] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:36:47] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:36:47] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2021-05-18 12:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:36:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:36:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:48] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:36:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:48] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 13 ms.
[2021-05-18 12:36:48] [INFO ] Added : 143 causal constraints over 29 iterations in 747 ms. Result :sat
[2021-05-18 12:36:48] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2021-05-18 12:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-18 12:36:48] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:49] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:36:49] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:49] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2021-05-18 12:36:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:36:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:36:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:49] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-18 12:36:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:49] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 14 ms.
[2021-05-18 12:36:50] [INFO ] Added : 143 causal constraints over 29 iterations in 739 ms. Result :sat
[2021-05-18 12:36:50] [INFO ] Deduced a trap composed of 30 places in 20 ms
[2021-05-18 12:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-18 12:36:50] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:36:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:50] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:36:50] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:36:50] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 13 ms.
[2021-05-18 12:36:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:36:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:36:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:36:50] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:36:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:36:50] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 14 ms.
[2021-05-18 12:36:51] [INFO ] Added : 147 causal constraints over 30 iterations in 1043 ms. Result :sat
[2021-05-18 12:36:56] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 12:36:56] [INFO ] Flatten gal took : 70 ms
FORMULA HealthRecord-PT-07-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:36:56] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:36:56] [INFO ] Applying decomposition
[2021-05-18 12:36:57] [INFO ] Flatten gal took : 24 ms
[2021-05-18 12:36:57] [INFO ] Input system was already deterministic with 295 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/graph14923998582819245793.txt, -o, /tmp/graph14923998582819245793.bin, -w, /tmp/graph14923998582819245793.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/graph14923998582819245793.bin, -l, -1, -v, -w, /tmp/graph14923998582819245793.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:36:57] [INFO ] Decomposing Gal with order
[2021-05-18 12:36:57] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 283 out of 295 initially.
// Phase 1: matrix 283 rows 155 cols
[2021-05-18 12:36:57] [INFO ] Computed 18 place invariants in 3 ms
inv : p0 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 = 1
inv : -p0 + p20 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : -p0 + p69 + p70 + p71 + p72 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : -p0 + p59 + p60 + p61 + p62 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : 2*p0 + p58 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : 2*p0 + p2 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : 2*p0 + p63 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : 2*p0 + p40 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : 2*p0 + p73 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : -p0 + p39 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : -p0 + p74 + p75 + p76 + p77 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : 2*p0 + p21 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : 2*p0 + p78 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : p0 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 1
inv : -p0 + p64 + p65 + p66 + p67 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : -p0 + p1 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
inv : 2*p0 + p68 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 2
inv : -p0 + p79 + p80 + p81 + p82 + p83 + p84 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 = -1
Total of 18 invariants.
[2021-05-18 12:36:57] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-18 12:36:57] [INFO ] Removed a total of 42 redundant transitions.
[2021-05-18 12:36:57] [INFO ] Flatten gal took : 77 ms
[2021-05-18 12:36:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 24 ms.
[2021-05-18 12:36:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2021-05-18 12:36:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F(X(X(G("((u16.p120==1)||(u2.p47==1))"))))))
Formula 0 simplified : !FXXG"((u16.p120==1)||(u2.p47==1))"
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:36:57] [INFO ] Proved 155 variables to be positive in 253 ms
[2021-05-18 12:36:57] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2021-05-18 12:36:57] [INFO ] Computation of disable matrix completed :0/295 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:36:57] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:36:57] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2021-05-18 12:36:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:36:59] [INFO ] Computing symmetric co enabling matrix : 295 transitions.
[2021-05-18 12:37:00] [INFO ] Computation of co-enabling matrix(2/295) took 1505 ms. Total solver calls (SAT/UNSAT): 877(351/526)
Reverse transition relation is NOT exact ! Due to transitions t10, u0.t207, u0.t208, u0.t209, u0.t210, u0.t211, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t222, u0.t223, u0.t225, u0.t226, u0.t228, u0.t229, u0.t231, u0.t232, u0.t234, u0.t235, u0.t236, u0.t238, u0.t239, u0.t241, u0.t242, u0.t245, u1.t168, u1.t169, u1.t170, u1.t171, u1.t172, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t183, u1.t184, u1.t186, u1.t187, u1.t189, u1.t190, u1.t192, u1.t193, u1.t195, u1.t196, u1.t197, u1.t199, u1.t200, u1.t202, u1.t203, u1.t206, u2.t129, u2.t130, u2.t131, u2.t132, u2.t133, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t144, u2.t145, u2.t147, u2.t148, u2.t150, u2.t151, u2.t153, u2.t154, u2.t156, u2.t157, u2.t158, u2.t160, u2.t161, u2.t163, u2.t164, u2.t167, u11.t104, u11.t105, u11.t106, u11.t107, u11.t108, u11.t110, u11.t111, u11.t112, u16.t1, u16.t2, u16.t3, u16.t4, u16.t5, u16.t6, u16.t7, u16.t8, u16.t9, u16.t14, u16.t15, u16.t16, u16.t17, u16.t18, u16.t19, u16.t20, u16.t21, u16.t22, u16.t23, u16.t24, u16.t25, u16.t26, u16.t27, u16.t28, u16.t29, u16.t30, u16.t31, u16.t32, u16.t33, u16.t34, u16.t35, u16.t36, u16.t37, u16.t38, u16.t39, u16.t40, u16.t41, u16.t42, u16.t43, u16.t44, u16.t45, u16.t46, u16.t47, u16.t48, u16.t49, u16.t50, u16.t51, u16.t52, u16.t53, u16.t54, u16.t55, u16.t56, u16.t57, u16.t58, u16.t59, i8.t66, i8.t64, i8.u14.t60, i8.u14.t61, i8.u14.t70, i8.u14.t71, i8.u14.t72, i8.u14.t73, i8.u14.t74, i8.u14.t75, i8.u14.t76, i8.u14.t77, i8.u14.t78, i8.u14.t79, i8.u14.t80, i8.u14.t81, i8.u14.t82, i8.u14.t83, i8.u14.t84, i8.u14.t85, i8.u14.t86, i8.u14.t87, i8.u14.t88, i8.u14.t89, i8.u14.t90, i8.u14.t91, i8.u14.t92, i8.u14.t93, i8.u14.t94, i8.u14.t95, i8.u14.t96, i8.u14.t97, i8.u14.t98, i8.u14.t99, i8.u14.t100, i8.u14.t101, i8.u14.t102, i8.u14.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/98/192/290
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:37:04] [INFO ] Computation of co-enabling matrix(7/295) took 4878 ms. Total solver calls (SAT/UNSAT): 2317(1230/1087)
[2021-05-18 12:37:07] [INFO ] Computation of co-enabling matrix(12/295) took 8271 ms. Total solver calls (SAT/UNSAT): 3732(2110/1622)
[2021-05-18 12:37:11] [INFO ] Computation of co-enabling matrix(17/295) took 11686 ms. Total solver calls (SAT/UNSAT): 5122(2988/2134)
[2021-05-18 12:37:14] [INFO ] Computation of co-enabling matrix(22/295) took 15120 ms. Total solver calls (SAT/UNSAT): 6487(3867/2620)
[2021-05-18 12:37:17] [INFO ] Computation of co-enabling matrix(27/295) took 18595 ms. Total solver calls (SAT/UNSAT): 7827(4747/3080)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2064 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.6654,667404,1,0,1.08092e+06,110560,2287,2.02746e+06,1917,1.84841e+06,795943
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G((F(!(("(u15.p144==1)")U(X((F("(i8.u14.p94==1)"))&&("(u2.p57==1)"))))))||("(u16.p151==1)")))))
Formula 1 simplified : !XG("(u16.p151==1)" | F!("(u15.p144==1)" U X("(u2.p57==1)" & F"(i8.u14.p94==1)")))
Computing Next relation with stutter on 33 deadlock states
37 unique states visited
28 strongly connected components in search stack
41 transitions explored
35 items max in DFS search stack
141 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,22.0762,711100,1,0,1.14369e+06,115996,2693,2.15146e+06,2026,1.98231e+06,908859
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X((X(G("(u16.p127==1)")))||(F((G("((u1.p36==1)&&(u16.p152==1))"))U("(u2.p51==1)")))))))
Formula 2 simplified : X(XG"(u16.p127==1)" | F(G"((u1.p36==1)&&(u16.p152==1))" U "(u2.p51==1)"))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:37:21] [INFO ] Computation of co-enabling matrix(32/295) took 21997 ms. Total solver calls (SAT/UNSAT): 9142(5627/3515)
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
231 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,24.3914,791628,1,0,1.2855e+06,123666,2716,2.42484e+06,2028,2.13036e+06,1113763
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(G("((i8.u14.p101==1)||((u1.p36==1)&&(u16.p152==1)))")))U(G(X((("((u1.p36==1)&&(u16.p152==1))")U("(i8.u14.p101==1)"))&&(X("(u1.p30==1)")))))))
Formula 3 simplified : !(FG"((i8.u14.p101==1)||((u1.p36==1)&&(u16.p152==1)))" U GX(("((u1.p36==1)&&(u16.p152==1))" U "(i8.u14.p101==1)") & X"(u1.p30==1)"))
Computing Next relation with stutter on 33 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,24.6205,799336,1,0,1.29588e+06,129047,2782,2.4433e+06,2032,2.16009e+06,1137310
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((("((i8.u14.p109!=1)||(u16.p132!=1))")U(!(("((i8.u14.p109==1)&&(u16.p132==1))")U("(u1.p31==1)"))))U(X((G("(u0.p12==1)"))||("(u0.p12==1)")))))
Formula 4 simplified : !(("((i8.u14.p109!=1)||(u16.p132!=1))" U !("((i8.u14.p109==1)&&(u16.p132==1))" U "(u1.p31==1)")) U X("(u0.p12==1)" | G"(u0.p12==1)"))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:37:24] [INFO ] Computation of co-enabling matrix(37/295) took 25481 ms. Total solver calls (SAT/UNSAT): 10432(6507/3925)
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
334 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.9621,905228,1,0,1.48537e+06,138695,2935,2.80178e+06,2037,2.32064e+06,1390352
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(F(((G("((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u16.p131==1))"))||(F("(i8.u14.p95==1)")))&&(F("(i8.u14.p95==1)"))))))
Formula 5 simplified : F(F"(i8.u14.p95==1)" & (G"((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u16.p131==1))" | F"(i8.u14.p95==1)"))
Computing Next relation with stutter on 33 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
197 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.9323,959876,1,0,1.57019e+06,144158,2957,2.98437e+06,2039,2.47572e+06,1499577
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(X(!(X(X(X(G(X((G("(i4.u6.p85==1)"))||("(i4.u6.p85!=1)"))))))))))))
Formula 6 simplified : !XFX!XXXGX("(i4.u6.p85!=1)" | G"(i4.u6.p85==1)")
Computing Next relation with stutter on 33 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 items max in DFS search stack
46 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.3857,973340,1,0,1.59496e+06,144285,3000,3.02612e+06,2041,2.4886e+06,1533728
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(F("(i8.u13.p106==1)")))&&((G(F("(i8.u14.p89==1)")))||(!(("(i8.u13.p106==1)")U("((i8.u14.p109==1)&&(u16.p116==1))"))))))
Formula 7 simplified : !(!F"(i8.u13.p106==1)" & (GF"(i8.u14.p89==1)" | !("(i8.u13.p106==1)" U "((i8.u14.p109==1)&&(u16.p116==1))")))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:37:28] [INFO ] Computation of co-enabling matrix(42/295) took 28912 ms. Total solver calls (SAT/UNSAT): 11697(7386/4311)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
79 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,31.1774,994460,1,0,1.62858e+06,144830,3045,3.09929e+06,2046,2.51715e+06,1572829
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(((!(F("(u16.p131==1)")))&&("(u16.p125!=1)"))U(("(u16.p131==1)")U("((i8.u14.p109==1)&&(u16.p130==1))"))))||(!(F("(u16.p125==1)")))))
Formula 8 simplified : !(!(("(u16.p125!=1)" & !F"(u16.p131==1)") U ("(u16.p131==1)" U "((i8.u14.p109==1)&&(u16.p130==1))")) | !F"(u16.p125==1)")
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:37:31] [INFO ] Computation of co-enabling matrix(47/295) took 32369 ms. Total solver calls (SAT/UNSAT): 12937(8266/4671)
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
317 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.3537,1066888,1,0,1.75633e+06,147113,3142,3.33735e+06,2068,2.68219e+06,1718347
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA HealthRecord-PT-07-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((!(X(G("(u2.p50==1)"))))||(!(G("(u2.p57!=1)"))))||(F("(u16.p148==1)"))))
Formula 9 simplified : !(!XG"(u2.p50==1)" | !G"(u2.p57!=1)" | F"(u16.p148==1)")
Computing Next relation with stutter on 33 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.3549,1067152,1,0,1.75633e+06,147113,3172,3.33735e+06,2072,2.68219e+06,1718380
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA HealthRecord-PT-07-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(G(!((X("(u0.p17==1)"))U(G("((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(i4.u6.p66==1))&&(i5.u8.p71==1))&&(i6.u10.p76==1))&&(u11.p83==1))&&(i8.u14.p110==1))&&(u16.p147==1))"))))))&&(!(F(("(u16.p121==1)")U("(u1.p36!=1)")))))))
Formula 10 simplified : !X(!G!(X"(u0.p17==1)" U G"((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(i4.u6.p66==1))&&(i5.u8.p71==1))&&(i6.u10.p76==1))&&(u11.p83==1))&&(i8.u14.p110==1))&&(u16.p147==1))") & !F("(u16.p121==1)" U "(u1.p36!=1)"))
Computing Next relation with stutter on 33 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,34.3633,1067152,1,0,1.75666e+06,147113,3175,3.33788e+06,2072,2.68224e+06,1718734
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X((X("(u1.p34!=1)"))U(X("(u1.p34==1)"))))))
Formula 11 simplified : !FX(X"(u1.p34!=1)" U X"(u1.p34==1)")
Computing Next relation with stutter on 33 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
201 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,36.3779,1102392,1,0,1.818e+06,150243,3265,3.45017e+06,2074,2.72047e+06,1810162
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(F(("(i8.u14.p92==1)")U(X(X(F(("((u1.p36==1)&&(u16.p152==1))")U("((u0.p17==1)&&(u16.p152==1))"))))))))))
Formula 12 simplified : !XGF("(i8.u14.p92==1)" U XXF("((u1.p36==1)&&(u16.p152==1))" U "((u0.p17==1)&&(u16.p152==1))"))
Computing Next relation with stutter on 33 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
82 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,37.2075,1132752,1,0,1.86817e+06,156788,3291,3.5367e+06,2074,2.80498e+06,1872751
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:37:35] [INFO ] Computation of co-enabling matrix(52/295) took 35793 ms. Total solver calls (SAT/UNSAT): 14152(9145/5007)
[2021-05-18 12:37:38] [INFO ] Computation of co-enabling matrix(57/295) took 39174 ms. Total solver calls (SAT/UNSAT): 15342(10023/5319)
[2021-05-18 12:37:41] [INFO ] Computation of co-enabling matrix(62/295) took 42476 ms. Total solver calls (SAT/UNSAT): 16507(10877/5630)
ITS tools runner thread asked to quit. Dying gracefully.
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:37:42] [INFO ] Built C files in 44998ms 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 1621341463186

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

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