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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
661.060 23227.00 46492.00 216.90 FFFFTFFFTFFTFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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 2.9K May 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:46 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 34K 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-02-00
FORMULA_NAME HealthRecord-PT-02-01
FORMULA_NAME HealthRecord-PT-02-02
FORMULA_NAME HealthRecord-PT-02-03
FORMULA_NAME HealthRecord-PT-02-04
FORMULA_NAME HealthRecord-PT-02-05
FORMULA_NAME HealthRecord-PT-02-06
FORMULA_NAME HealthRecord-PT-02-07
FORMULA_NAME HealthRecord-PT-02-08
FORMULA_NAME HealthRecord-PT-02-09
FORMULA_NAME HealthRecord-PT-02-10
FORMULA_NAME HealthRecord-PT-02-11
FORMULA_NAME HealthRecord-PT-02-12
FORMULA_NAME HealthRecord-PT-02-13
FORMULA_NAME HealthRecord-PT-02-14
FORMULA_NAME HealthRecord-PT-02-15

=== Now, execution of the tool begins

BK_START 1621340976025

[2021-05-18 12:29:37] [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:29:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:29:37] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-18 12:29:37] [INFO ] Transformed 119 places.
[2021-05-18 12:29:37] [INFO ] Transformed 225 transitions.
[2021-05-18 12:29:37] [INFO ] Found NUPN structural information;
[2021-05-18 12:29:37] [INFO ] Parsed PT model containing 119 places and 225 transitions in 84 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5938 resets, run finished after 330 ms. (steps per millisecond=303 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0]
[2021-05-18 12:29:38] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2021-05-18 12:29:38] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 12:29:38] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:38] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-18 12:29:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 32 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned unsat
[2021-05-18 12:29:38] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:38] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:29:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 43 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:38] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-18 12:29:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:29:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:38] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 25 ms.
[2021-05-18 12:29:39] [INFO ] Added : 104 causal constraints over 22 iterations in 437 ms. Result :sat
[2021-05-18 12:29:39] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:39] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-18 12:29:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-18 12:29:39] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:39] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:29:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 35 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:39] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-18 12:29:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:39] [INFO ] Deduced a trap composed of 36 places in 81 ms
[2021-05-18 12:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-18 12:29:39] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 13 ms.
[2021-05-18 12:29:40] [INFO ] Added : 101 causal constraints over 21 iterations in 347 ms. Result :sat
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:29:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-18 12:29:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:40] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:29:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:40] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-18 12:29:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:40] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 14 ms.
[2021-05-18 12:29:41] [INFO ] Added : 98 causal constraints over 20 iterations in 404 ms. Result :sat
[2021-05-18 12:29:41] [INFO ] Deduced a trap composed of 41 places in 35 ms
[2021-05-18 12:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-18 12:29:41] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:41] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:41] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 11 ms.
[2021-05-18 12:29:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 44 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:41] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:41] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 13 ms.
[2021-05-18 12:29:41] [INFO ] Added : 125 causal constraints over 26 iterations in 413 ms. Result :sat
[2021-05-18 12:29:41] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:41] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-18 12:29:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:41] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 13 ms.
[2021-05-18 12:29:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:42] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 10 ms.
[2021-05-18 12:29:42] [INFO ] Added : 108 causal constraints over 23 iterations in 398 ms. Result :sat
[2021-05-18 12:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:42] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:29:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-18 12:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:42] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:29:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 41 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:42] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-18 12:29:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:42] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 19 ms.
[2021-05-18 12:29:43] [INFO ] Added : 79 causal constraints over 16 iterations in 188 ms. Result :sat
[2021-05-18 12:29:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:43] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:43] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-18 12:29:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2021-05-18 12:29:43] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:43] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-18 12:29:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:43] [INFO ] Computed and/alt/rep : 218/1308/210 causal constraints in 13 ms.
[2021-05-18 12:29:43] [INFO ] Added : 126 causal constraints over 26 iterations in 439 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-18 12:29:44] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-18 12:29:44] [INFO ] Flatten gal took : 49 ms
FORMULA HealthRecord-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:29:44] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:29:44] [INFO ] Applying decomposition
[2021-05-18 12:29:44] [INFO ] Flatten gal took : 17 ms
[2021-05-18 12:29:44] [INFO ] Input system was already deterministic with 219 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/graph4799183377117610968.txt, -o, /tmp/graph4799183377117610968.bin, -w, /tmp/graph4799183377117610968.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/graph4799183377117610968.bin, -l, -1, -v, -w, /tmp/graph4799183377117610968.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 211 out of 219 initially.
// Phase 1: matrix 211 rows 119 cols
[2021-05-18 12:29:44] [INFO ] Computed 14 place invariants in 2 ms
inv : -p0 + p26 + p27 + p28 + p29 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - 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 - p112 - p113 - p114 - p115 - p116 - p117 - p118 = -1
inv : -p0 + p31 + p32 + p33 + p34 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - 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 - p112 - p113 - p114 - p115 - p116 - p117 - p118 = -1
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - 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 - p112 - p113 - p114 - p115 - p116 - p117 - p118 = -1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 = 1
inv : 2*p0 + p20 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 2
inv : 2*p0 + p1 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 2
inv : 2*p0 + p35 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 2
inv : 2*p0 + p25 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 2
inv : -p0 + p36 + p37 + p38 + p39 + p40 + p41 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - 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 - p112 - p113 - p114 - p115 - p116 - p117 - p118 = -1
inv : 2*p0 + p30 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 2
inv : -p0 + p43 + p44 + p45 + p46 + p47 + p48 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - 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 - p112 - p113 - p114 - p115 - p116 - p117 - p118 = -1
inv : 2*p0 + p42 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 2
inv : p0 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + 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 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 1
inv : -p0 + p21 + p22 + p23 + p24 - p50 - p51 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - 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 - p112 - p113 - p114 - p115 - p116 - p117 - p118 = -1
Total of 14 invariants.
[2021-05-18 12:29:44] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-18 12:29:44] [INFO ] Decomposing Gal with order
[2021-05-18 12:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 12:29:44] [INFO ] Removed a total of 53 redundant transitions.
[2021-05-18 12:29:44] [INFO ] Flatten gal took : 64 ms
[2021-05-18 12:29:44] [INFO ] Proved 119 variables to be positive in 152 ms
[2021-05-18 12:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 11 ms.
[2021-05-18 12:29:44] [INFO ] Computing symmetric may disable matrix : 219 transitions.
[2021-05-18 12:29:44] [INFO ] Computation of disable matrix completed :0/219 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:29:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2021-05-18 12:29:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
[2021-05-18 12:29:44] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:29:44] [INFO ] Computing symmetric may enable matrix : 219 transitions.
[2021-05-18 12:29:44] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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 11 LTL properties
Checking formula 0 : !((F(G("((u7.p38==0)||(i8.u14.p95==1))"))))
Formula 0 simplified : !FG"((u7.p38==0)||(i8.u14.p95==1))"
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 24 ordering constraints for composite.
built 51 ordering constraints for composite.
[2021-05-18 12:29:45] [INFO ] Computing symmetric co enabling matrix : 219 transitions.
Reverse transition relation is NOT exact ! Due to transitions t12, u0.t134, u0.t135, u0.t136, u0.t137, u0.t138, u0.t139, u0.t140, u0.t141, u0.t142, u0.t143, u0.t144, u0.t145, u0.t146, u0.t147, u0.t148, u0.t149, u0.t150, u0.t151, u0.t152, u0.t153, u0.t154, u0.t155, u0.t157, u0.t158, u0.t159, u0.t161, u0.t162, u0.t164, u0.t165, u0.t168, u7.t113, u7.t114, u7.t115, u7.t116, u7.t117, u7.t119, u7.t120, u7.t121, u8.t104, u8.t105, u8.t106, u8.t107, u8.t108, u8.t110, u8.t111, u8.t112, i6.t66, i6.t62, i6.u11.t60, i6.u11.t61, i6.u11.t70, i6.u11.t71, i6.u11.t72, i6.u11.t73, i6.u11.t74, i6.u11.t75, i6.u11.t76, i6.u11.t77, i6.u11.t78, i6.u11.t79, i6.u11.t80, i6.u11.t81, i6.u11.t82, i6.u11.t83, i6.u11.t84, i6.u11.t85, i6.u11.t86, i6.u11.t87, i6.u11.t88, i6.u11.t89, i6.u11.t90, i6.u11.t91, i6.u11.t92, i6.u11.t93, i6.u11.t94, i6.u11.t95, i6.u11.t96, i6.u11.t97, i6.u11.t98, i6.u11.t99, i6.u11.t100, i6.u11.t101, i6.u11.t102, i6.u11.t103, i8.t52, i8.t41, i8.t9, i8.u13.t2, i8.u13.t5, i8.u13.t17, i8.u13.t20, i8.u13.t23, i8.u13.t28, i8.u13.t34, i8.u13.t46, i8.u13.t50, i8.u13.t53, i8.u13.t56, i8.u14.t6, i8.u14.t7, i8.u14.t8, i8.u14.t14, i8.u14.t15, i8.u14.t18, i8.u14.t21, i8.u14.t24, i8.u14.t25, i8.u14.t26, i8.u14.t30, i8.u14.t31, i8.u14.t32, i8.u14.t36, i8.u14.t37, i8.u14.t38, i8.u14.t39, i8.u14.t42, i8.u14.t43, i8.u14.t44, i8.u14.t48, i8.u14.t51, i8.u14.t54, i8.u14.t57, i8.u14.t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/124/199
Computing Next relation with stutter on 17 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.34126,91020,1,0,96321,72399,2320,197712,1596,343376,163705
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((F(G("(((u8.p43==0)||(i6.u11.p60==1))&&((i2.u3.p27==0)||(i8.u14.p87==1)))")))||("((u8.p43!=0)&&(i6.u11.p60!=1))"))U(X(((!(F("((u8.p43==0)||(i6.u11.p60==1))")))&&("(i2.u3.p27!=0)"))&&("(i8.u14.p87!=1)")))))
Formula 1 simplified : !(("((u8.p43!=0)&&(i6.u11.p60!=1))" | FG"(((u8.p43==0)||(i6.u11.p60==1))&&((i2.u3.p27==0)||(i8.u14.p87==1)))") U X("(i2.u3.p27!=0)" & "(i8.u14.p87!=1)" & !F"((u8.p43==0)||(i6.u11.p60==1))"))
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:29:47] [INFO ] Computation of co-enabling matrix(7/219) took 2551 ms. Total solver calls (SAT/UNSAT): 1709(803/906)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
248 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,4.82369,170996,1,0,217674,92602,2404,405868,1604,510698,278758
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G((X("((i3.u6.p0==0)||(i6.u11.p55==1))"))U("(u0.p5==1)")))))
Formula 2 simplified : !XG(X"((i3.u6.p0==0)||(i6.u11.p55==1))" U "(u0.p5==1)")
Computing Next relation with stutter on 17 deadlock states
17 unique states visited
17 strongly connected components in search stack
18 transitions explored
17 items max in DFS search stack
74 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,5.57215,190052,1,0,239319,101589,2661,464221,1641,577356,307848
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((F((G(((X("((i6.u11.p50==0)||(u8.p44==1))"))||("(i6.u11.p50==0)"))||("(u8.p44==1)")))||("((i6.u11.p62!=0)&&(i6.u11.p53!=1))")))&&(G("((i6.u11.p50==0)||(u8.p44==1))")))&&(G("((u0.p11==0)||(u0.p14==1))"))))
Formula 3 simplified : !(F("((i6.u11.p62!=0)&&(i6.u11.p53!=1))" | G("(i6.u11.p50==0)" | "(u8.p44==1)" | X"((i6.u11.p50==0)||(u8.p44==1))")) & G"((i6.u11.p50==0)||(u8.p44==1))" & G"((u0.p11==0)||(u0.p14==1))")
Computing Next relation with stutter on 17 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
63 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,6.20344,211388,1,0,266050,112379,2706,524351,1648,652361,347624
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F((!(F("((u0.p2==0)||(i8.u14.p94==1))")))U("(i6.u11.p60==1)")))||((F("(i6.u11.p60==1)"))U("(i6.u11.p60==1)"))))
Formula 4 simplified : !(F(!F"((u0.p2==0)||(i8.u14.p94==1))" U "(i6.u11.p60==1)") | (F"(i6.u11.p60==1)" U "(i6.u11.p60==1)"))
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:29:51] [INFO ] Computation of co-enabling matrix(16/219) took 5820 ms. Total solver calls (SAT/UNSAT): 3554(1837/1717)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
39 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,6.58751,224852,1,0,283388,117967,2729,564399,1648,693639,365729
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(F(!(G("((i8.u13.p79==0)||(u0.p10==1))")))))))
Formula 5 simplified : !X!F!G"((i8.u13.p79==0)||(u0.p10==1))"
Computing Next relation with stutter on 17 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
60 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,7.18629,245972,1,0,312799,125462,2754,623632,1648,760792,399491
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(!(X("((i8.u14.p84==0)||(u0.p17==1))")))))
Formula 6 simplified : !F!X"((i8.u14.p84==0)||(u0.p17==1))"
Computing Next relation with stutter on 17 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
53 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,7.71145,262604,1,0,335016,129739,2773,667852,1650,805075,425415
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(!(F("((i8.u14.p95==0)||(i2.u3.p26==1))")))))
Formula 7 simplified : !F!F"((i8.u14.p95==0)||(i2.u3.p26==1))"
Computing Next relation with stutter on 17 deadlock states
[2021-05-18 12:29:54] [INFO ] Computation of co-enabling matrix(25/219) took 9011 ms. Total solver calls (SAT/UNSAT): 5318(2870/2448)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
235 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0634,334572,1,0,459532,139520,2802,884476,1652,950995,493094
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(!(X(X(((X(X(((G("((i6.u10.p72==0)||(u0.p17==1))"))||("(i6.u10.p72==0)"))||("(u0.p17==1)"))))||("(i6.u10.p72==0)"))||("(u0.p17==1)")))))))
Formula 8 simplified : !X!XX("(i6.u10.p72==0)" | "(u0.p17==1)" | XX("(i6.u10.p72==0)" | "(u0.p17==1)" | G"((i6.u10.p72==0)||(u0.p17==1))"))
Computing Next relation with stutter on 17 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.2062,339852,1,0,465364,140694,2820,897156,1655,959809,499094
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(G(F("((u0.p6==0)||(i6.u11.p62==1))")))))
Formula 9 simplified : GF"((u0.p6==0)||(i6.u11.p62==1))"
Computing Next relation with stutter on 17 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
121 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,11.4149,392388,1,0,550011,146695,2847,1.05884e+06,1656,1.04707e+06,571229
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(G(X("((u12.p108==0)||(i1.u2.p24==1))"))))))
Formula 10 simplified : !G!GX"((u12.p108==0)||(i1.u2.p24==1))"
Computing Next relation with stutter on 17 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 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,11.4264,392652,1,0,550391,146695,2878,1.05959e+06,1656,1.04707e+06,572784
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:29:57] [INFO ] Computation of co-enabling matrix(34/219) took 12210 ms. Total solver calls (SAT/UNSAT): 7001(3904/3097)
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:29:58] [INFO ] Built C files in 14166ms 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 1621340999252

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

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