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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15: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 49K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621341477200

[2021-05-18 12:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:37:58] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-18 12:37:58] [INFO ] Transformed 156 places.
[2021-05-18 12:37:58] [INFO ] Transformed 326 transitions.
[2021-05-18 12:37:58] [INFO ] Found NUPN structural information;
[2021-05-18 12:37:58] [INFO ] Parsed PT model containing 156 places and 326 transitions in 87 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5609 resets, run finished after 420 ms. (steps per millisecond=238 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1]
[2021-05-18 12:37:59] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-18 12:37:59] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-18 12:37:59] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-18 12:37:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:59] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-18 12:37:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:37:59] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:59] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 23 ms.
[2021-05-18 12:37:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 262 ms returned sat
[2021-05-18 12:38:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:00] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:38:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:38:00] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 28 ms.
[2021-05-18 12:38:02] [INFO ] Added : 174 causal constraints over 36 iterations in 2099 ms. Result :sat
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:38:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned unsat
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:38:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned unsat
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:02] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:38:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned unsat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned unsat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned unsat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned unsat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned unsat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:03] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 267 ms returned sat
[2021-05-18 12:38:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:04] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:38:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:38:04] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 19 ms.
[2021-05-18 12:38:05] [INFO ] Added : 158 causal constraints over 32 iterations in 990 ms. Result :sat
[2021-05-18 12:38:05] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-18 12:38:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:05] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:38:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2021-05-18 12:38:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:05] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:38:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:38:05] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 33 ms.
[2021-05-18 12:38:06] [INFO ] Added : 144 causal constraints over 29 iterations in 830 ms. Result :sat
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 29 places in 49 ms
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 29 places in 27 ms
[2021-05-18 12:38:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2021-05-18 12:38:06] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:38:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:06] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:38:06] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 42 places in 42 ms
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 43 places in 38 ms
[2021-05-18 12:38:06] [INFO ] Deduced a trap composed of 40 places in 36 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 39 places in 45 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 47 places in 53 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 41 places in 52 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 45 places in 43 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 30 places in 64 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 44 places in 50 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 46 places in 80 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 45 places in 48 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 46 places in 52 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2021-05-18 12:38:07] [INFO ] Deduced a trap composed of 39 places in 54 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 43 places in 75 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 43 places in 53 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 39 places in 54 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 41 places in 46 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 41 places in 45 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 40 places in 47 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 48 places in 46 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 49 places in 46 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 41 places in 45 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 50 places in 41 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 44 places in 43 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 45 places in 48 ms
[2021-05-18 12:38:08] [INFO ] Deduced a trap composed of 42 places in 45 ms
[2021-05-18 12:38:08] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 2161 ms
[2021-05-18 12:38:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 269 ms returned sat
[2021-05-18 12:38:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:09] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:38:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:38:09] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 20 ms.
[2021-05-18 12:38:09] [INFO ] Added : 145 causal constraints over 30 iterations in 679 ms. Result :sat
[2021-05-18 12:38:10] [INFO ] Deduced a trap composed of 40 places in 35 ms
[2021-05-18 12:38:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-18 12:38:10] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:10] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:38:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 304 ms returned sat
[2021-05-18 12:38:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:10] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:38:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:38:10] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 20 ms.
[2021-05-18 12:38:11] [INFO ] Added : 155 causal constraints over 31 iterations in 1248 ms. Result :sat
[2021-05-18 12:38:11] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:38:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:12] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:38:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:38:12] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-18 12:38:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 298 ms returned sat
[2021-05-18 12:38:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:12] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-18 12:38:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:38:12] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 18 ms.
[2021-05-18 12:38:13] [INFO ] Added : 160 causal constraints over 33 iterations in 1273 ms. Result :sat
[2021-05-18 12:38:13] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:38:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:13] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:38:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned unsat
[2021-05-18 12:38:14] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:38:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:14] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:38:14] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 31 places in 70 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 39 places in 46 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 42 places in 44 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 40 places in 43 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2021-05-18 12:38:14] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:38:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 525 ms
[2021-05-18 12:38:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:38:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 81 ms returned sat
[2021-05-18 12:38:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:38:14] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:38:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:38:14] [INFO ] Computed and/alt/rep : 299/2289/287 causal constraints in 28 ms.
[2021-05-18 12:38:16] [INFO ] Added : 159 causal constraints over 33 iterations in 1443 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2021-05-18 12:38:16] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 12:38:16] [INFO ] Flatten gal took : 52 ms
FORMULA HealthRecord-PT-08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:38:16] [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:38:16] [INFO ] Applying decomposition
[2021-05-18 12:38:16] [INFO ] Flatten gal took : 17 ms
[2021-05-18 12:38:16] [INFO ] Input system was already deterministic with 300 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/graph14944936670021503323.txt, -o, /tmp/graph14944936670021503323.bin, -w, /tmp/graph14944936670021503323.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/graph14944936670021503323.bin, -l, -1, -v, -w, /tmp/graph14944936670021503323.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:38:16] [INFO ] Decomposing Gal with order
[2021-05-18 12:38:16] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 288 out of 300 initially.
// Phase 1: matrix 288 rows 156 cols
[2021-05-18 12:38:16] [INFO ] Computed 18 place invariants in 4 ms
inv : 2*p0 + p39 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : -p0 + p58 + p59 + p60 + p61 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : 2*p0 + p79 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : -p0 + p68 + p69 + p70 + p71 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : p0 + 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 + p112 = 1
inv : p0 + 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 + p155 = 1
inv : -p0 + p38 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : 2*p0 + p67 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : 2*p0 + p72 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : 2*p0 + p57 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : -p0 + p63 + p64 + p65 + p66 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : -p0 + p19 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : 2*p0 + p1 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : -p0 + p80 + p81 + p82 + p83 + p84 + p85 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : 2*p0 + p20 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : -p0 + p73 + p74 + p75 + p76 + p77 + p78 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p114 - p115 - p116 - p117 - p118 - p119 - p120 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 = -1
inv : 2*p0 + p62 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 2
Total of 18 invariants.
[2021-05-18 12:38:16] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-18 12:38:16] [INFO ] Removed a total of 44 redundant transitions.
[2021-05-18 12:38:16] [INFO ] Flatten gal took : 85 ms
[2021-05-18 12:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2021-05-18 12:38:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
[2021-05-18 12:38:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((!(X((((((F(G(F("((u9.p74==0)||(u0.p5==1))"))))&&(((F("((u9.p74==0)||(u0.p5==1))"))||("(i3.i0.i0.u6.p66==0)"))||("(i3.i0.i0.u5.p64==1)")))||("(i3.i0.i0.u6.p66==0)"))||("(i3.i0.i0.u5.p64==1)"))||("(u15.p118==0)"))||("(u14.p146==1)")))))
Formula 0 simplified : X("(i3.i0.i0.u5.p64==1)" | "(i3.i0.i0.u6.p66==0)" | "(u14.p146==1)" | "(u15.p118==0)" | (FGF"((u9.p74==0)||(u0.p5==1))" & ("(i3.i0.i0.u5.p64==1)" | "(i3.i0.i0.u6.p66==0)" | F"((u9.p74==0)||(u0.p5==1))")))
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:38:17] [INFO ] Proved 156 variables to be positive in 243 ms
[2021-05-18 12:38:17] [INFO ] Computing symmetric may disable matrix : 300 transitions.
[2021-05-18 12:38:17] [INFO ] Computation of disable matrix completed :0/300 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:38:17] [INFO ] Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:38:17] [INFO ] Computing symmetric may enable matrix : 300 transitions.
[2021-05-18 12:38:17] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:38:17] [INFO ] Computing symmetric co enabling matrix : 300 transitions.
[2021-05-18 12:38:20] [INFO ] Computation of co-enabling matrix(4/300) took 2929 ms. Total solver calls (SAT/UNSAT): 1481(715/766)
Reverse transition relation is NOT exact ! Due to transitions t10, t260, t265, t269, t273, t277, t282, t285, t288, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t222, u0.t223, u0.t224, u0.t225, u0.t226, u0.t228, u0.t229, u0.t231, u0.t232, u0.t234, u0.t235, u0.t237, u0.t238, u0.t240, u0.t241, u0.t242, u0.t244, u0.t245, u0.t247, u0.t248, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t182, u1.t183, u1.t184, u1.t185, u1.t186, u1.t188, u1.t189, u1.t191, u1.t192, u1.t194, u1.t195, u1.t197, u1.t198, u1.t200, u1.t201, u1.t202, u1.t204, u1.t205, u1.t207, u1.t208, u1.t211, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t149, u2.t150, u2.t152, u2.t153, u2.t155, u2.t156, u2.t158, u2.t159, u2.t161, u2.t162, u2.t163, u2.t165, u2.t166, u2.t168, u2.t169, u2.t172, u9.t113, u9.t114, u9.t115, u9.t116, u9.t117, u9.t119, u9.t120, u9.t121, u10.t104, u10.t105, u10.t106, u10.t107, u10.t108, u10.t110, u10.t111, u10.t112, u15.t1, u15.t2, u15.t3, u15.t4, u15.t5, u15.t6, u15.t7, u15.t8, u15.t9, u15.t14, u15.t15, u15.t16, u15.t17, u15.t18, u15.t19, u15.t20, u15.t21, u15.t22, u15.t23, u15.t24, u15.t25, u15.t26, u15.t27, u15.t28, u15.t29, u15.t30, u15.t31, u15.t32, u15.t33, u15.t34, u15.t35, u15.t36, u15.t37, u15.t38, u15.t39, u15.t40, u15.t41, u15.t42, u15.t43, u15.t44, u15.t45, u15.t46, u15.t47, u15.t48, u15.t49, u15.t50, u15.t51, u15.t52, u15.t53, u15.t54, u15.t55, u15.t56, u15.t57, u15.t58, u15.t59, i6.t68, i6.t62, i6.u13.t60, i6.u13.t61, i6.u13.t70, i6.u13.t71, i6.u13.t72, i6.u13.t73, i6.u13.t74, i6.u13.t75, i6.u13.t76, i6.u13.t77, i6.u13.t78, i6.u13.t79, i6.u13.t80, i6.u13.t81, i6.u13.t82, i6.u13.t83, i6.u13.t84, i6.u13.t85, i6.u13.t86, i6.u13.t87, i6.u13.t88, i6.u13.t89, i6.u13.t90, i6.u13.t91, i6.u13.t92, i6.u13.t93, i6.u13.t94, i6.u13.t95, i6.u13.t96, i6.u13.t97, i6.u13.t98, i6.u13.t99, i6.u13.t100, i6.u13.t101, i6.u13.t102, i6.u13.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/87/208/295
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:38:24] [INFO ] Computation of co-enabling matrix(9/300) took 6440 ms. Total solver calls (SAT/UNSAT): 2936(1610/1326)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
927 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.29965,190204,1,0,214093,84494,2874,472896,2272,961686,358934
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(X(F("((u2.p54==0)||(u1.p30==1))"))))))
Formula 1 simplified : !X!XF"((u2.p54==0)||(u1.p30==1))"
Computing Next relation with stutter on 33 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
40 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.70043,206300,1,0,232949,87035,2894,514283,2274,961686,365306
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((!((F("(u2.p41==1)"))U(((X("((u15.p141==0)||(i3.i0.i1.u8.p71==1))"))||("(u1.p21==0)"))||("(u1.p21==1)"))))||("(u2.p41==1)"))))
Formula 2 simplified : !F("(u2.p41==1)" | !(F"(u2.p41==1)" U ("(u1.p21==0)" | "(u1.p21==1)" | X"((u15.p141==0)||(i3.i0.i1.u8.p71==1))")))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:38:27] [INFO ] Computation of co-enabling matrix(14/300) took 9948 ms. Total solver calls (SAT/UNSAT): 4366(2503/1863)
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
347 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.1623,318092,1,0,389386,100589,2983,891155,2285,1.28523e+06,502716
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("((u14.p147==0)||(u1.p32==1))")))
Formula 3 simplified : !X"((u14.p147==0)||(u1.p32==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,13.1634,318356,1,0,389386,100589,2990,891155,2287,1.28523e+06,502730
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HealthRecord-PT-08-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(("(((u1.p22==0)||(u15.p120==1))||(u10.p81==1))")U((((!(F("(u1.p36!=1)")))||("(u1.p36!=1)"))&&("(u15.p129!=0)"))&&("(u2.p38!=1)")))))
Formula 4 simplified : "(((u1.p22==0)||(u15.p120==1))||(u10.p81==1))" U ("(u2.p38!=1)" & "(u15.p129!=0)" & ("(u1.p36!=1)" | !F"(u1.p36!=1)"))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:38:31] [INFO ] Computation of co-enabling matrix(19/300) took 13451 ms. Total solver calls (SAT/UNSAT): 5771(3397/2374)
[2021-05-18 12:38:34] [INFO ] Computation of co-enabling matrix(24/300) took 16939 ms. Total solver calls (SAT/UNSAT): 7151(4290/2861)
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
759 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.765,551844,1,0,704703,120979,3048,1.65992e+06,2292,1.87085e+06,785151
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X(X(X(G(("((u1.p32==0)||(u15.p132==1))")||((F("((i6.u13.p91==0)||(u2.p46==1))"))&&("((i6.u13.p91==0)||(u2.p46==1))"))))))))))
Formula 5 simplified : !XGXXXG("((u1.p32==0)||(u15.p132==1))" | ("((i6.u13.p91==0)||(u2.p46==1))" & F"((i6.u13.p91==0)||(u2.p46==1))"))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:38:38] [INFO ] Computation of co-enabling matrix(29/300) took 20395 ms. Total solver calls (SAT/UNSAT): 8506(5185/3321)
[2021-05-18 12:38:41] [INFO ] Computation of co-enabling matrix(34/300) took 23887 ms. Total solver calls (SAT/UNSAT): 9836(6080/3756)
[2021-05-18 12:38:45] [INFO ] Computation of co-enabling matrix(39/300) took 27383 ms. Total solver calls (SAT/UNSAT): 11141(6976/4165)
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
966 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.4184,891212,1,0,1.27744e+06,134349,3085,2.75048e+06,2296,2.37615e+06,1157458
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((((X(!(X(X(F("(u15.p134==1)"))))))||("(u15.p134==1)"))||("(u1.p33==0)"))||("(u1.p33==1)"))))
Formula 6 simplified : !G("(u1.p33==0)" | "(u1.p33==1)" | "(u15.p134==1)" | X!XXF"(u15.p134==1)")
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:38:48] [INFO ] Computation of co-enabling matrix(44/300) took 30919 ms. Total solver calls (SAT/UNSAT): 12421(7871/4550)
13 unique states visited
0 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
283 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,33.2503,978572,1,0,1.40679e+06,136632,3134,3.04e+06,2305,2.51211e+06,1275248
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA HealthRecord-PT-08-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(G("((i3.i0.i1.u7.p69==0)||(u15.p119==1))")))))
Formula 7 simplified : !G!G"((i3.i0.i1.u7.p69==0)||(u15.p119==1))"
Computing Next relation with stutter on 33 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 items max in DFS search stack
50 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,33.7496,993616,1,0,1.43088e+06,136912,3166,3.08054e+06,2306,2.52167e+06,1295274
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F(G(!(G("((u10.p83==0)||(i3.i1.u4.p61==1))")))))))
Formula 8 simplified : FG!G"((u10.p83==0)||(i3.i1.u4.p61==1))"
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:38:52] [INFO ] Computation of co-enabling matrix(49/300) took 34458 ms. Total solver calls (SAT/UNSAT): 13676(8765/4911)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
507 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.8124,1118872,1,0,1.61499e+06,142602,3200,3.49165e+06,2306,2.73177e+06,1454831
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-08-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:38:55] [INFO ] Computation of co-enabling matrix(54/300) took 38008 ms. Total solver calls (SAT/UNSAT): 14906(9658/5248)
[2021-05-18 12:38:59] [INFO ] Computation of co-enabling matrix(59/300) took 41608 ms. Total solver calls (SAT/UNSAT): 16111(10551/5560)
[2021-05-18 12:39:02] [INFO ] Computation of co-enabling matrix(64/300) took 44886 ms. Total solver calls (SAT/UNSAT): 17291(11414/5877)
[2021-05-18 12:39:02] [WARNING] Script execution failed on command (assert (>= (select s0 106) 1)) with error (error "Failed to assert expression: java.io.IOException: Stream closed (>= (select s0 106) 1)")
[(assert (>= (select s0 106) 1))]
Skipping mayMatrices nes/nds SMT solver raised an exception.
java.lang.RuntimeException: SMT solver raised an exception.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:477)
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:39:02] [INFO ] Built C files in 46213ms 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 1621341543920

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-08"
export BK_EXAMINATION="LTLCardinality"
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-08, examination is LTLCardinality"
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-162124171200157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;