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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
547.712 18142.00 38057.00 308.50 TFFFTTFFFFFFFFFF 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-162124171200138.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-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 16K May 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 35K 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-03-00
FORMULA_NAME HealthRecord-PT-03-01
FORMULA_NAME HealthRecord-PT-03-02
FORMULA_NAME HealthRecord-PT-03-03
FORMULA_NAME HealthRecord-PT-03-04
FORMULA_NAME HealthRecord-PT-03-05
FORMULA_NAME HealthRecord-PT-03-06
FORMULA_NAME HealthRecord-PT-03-07
FORMULA_NAME HealthRecord-PT-03-08
FORMULA_NAME HealthRecord-PT-03-09
FORMULA_NAME HealthRecord-PT-03-10
FORMULA_NAME HealthRecord-PT-03-11
FORMULA_NAME HealthRecord-PT-03-12
FORMULA_NAME HealthRecord-PT-03-13
FORMULA_NAME HealthRecord-PT-03-14
FORMULA_NAME HealthRecord-PT-03-15

=== Now, execution of the tool begins

BK_START 1621341037907

[2021-05-18 12:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:30:39] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-18 12:30:39] [INFO ] Transformed 121 places.
[2021-05-18 12:30:39] [INFO ] Transformed 232 transitions.
[2021-05-18 12:30:39] [INFO ] Found NUPN structural information;
[2021-05-18 12:30:39] [INFO ] Parsed PT model containing 121 places and 232 transitions in 83 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6753 resets, run finished after 320 ms. (steps per millisecond=312 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-18 12:30:39] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2021-05-18 12:30:39] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 12:30:40] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2021-05-18 12:30:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:40] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:30:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:30:40] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:30:40] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 19 ms.
[2021-05-18 12:30:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:30:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 49 ms returned sat
[2021-05-18 12:30:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-18 12:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:40] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-18 12:30:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:30:40] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 21 ms.
[2021-05-18 12:30:40] [INFO ] Added : 124 causal constraints over 26 iterations in 505 ms. Result :sat
[2021-05-18 12:30:41] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:41] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:41] [INFO ] Deduced a trap composed of 39 places in 61 ms
[2021-05-18 12:30:41] [INFO ] Deduced a trap composed of 37 places in 40 ms
[2021-05-18 12:30:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 124 ms
[2021-05-18 12:30:41] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:41] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:41] [INFO ] Deduced a trap composed of 37 places in 44 ms
[2021-05-18 12:30:41] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:30:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2021-05-18 12:30:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:30:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 44 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:41] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:30:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:41] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 17 ms.
[2021-05-18 12:30:42] [INFO ] Added : 110 causal constraints over 22 iterations in 608 ms. Result :sat
[2021-05-18 12:30:42] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-18 12:30:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-18 12:30:42] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:30:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:42] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:30:42] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:42] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 13 ms.
[2021-05-18 12:30:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:30:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 50 ms returned sat
[2021-05-18 12:30:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-18 12:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:42] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-18 12:30:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:42] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 15 ms.
[2021-05-18 12:30:42] [INFO ] Added : 108 causal constraints over 23 iterations in 368 ms. Result :sat
[2021-05-18 12:30:43] [INFO ] Deduced a trap composed of 36 places in 41 ms
[2021-05-18 12:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-18 12:30:43] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2021-05-18 12:30:43] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-18 12:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:43] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-18 12:30:43] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:43] [INFO ] Deduced a trap composed of 34 places in 34 ms
[2021-05-18 12:30:43] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-18 12:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2021-05-18 12:30:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:30:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 42 ms returned sat
[2021-05-18 12:30:43] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-18 12:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:30:43] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:30:43] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 13 ms.
[2021-05-18 12:30:43] [INFO ] Added : 100 causal constraints over 20 iterations in 302 ms. Result :sat
[2021-05-18 12:30:43] [INFO ] Deduced a trap composed of 37 places in 31 ms
[2021-05-18 12:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-18 12:30:43] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-18 12:30:43] [INFO ] Flatten gal took : 48 ms
FORMULA HealthRecord-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:30:44] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:30:44] [INFO ] Applying decomposition
[2021-05-18 12:30:44] [INFO ] Flatten gal took : 13 ms
[2021-05-18 12:30:44] [INFO ] Input system was already deterministic with 225 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/graph754078071116303013.txt, -o, /tmp/graph754078071116303013.bin, -w, /tmp/graph754078071116303013.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/graph754078071116303013.bin, -l, -1, -v, -w, /tmp/graph754078071116303013.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:30:44] [INFO ] Decomposing Gal with order
[2021-05-18 12:30:44] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 217 out of 225 initially.
// Phase 1: matrix 217 rows 121 cols
[2021-05-18 12:30:44] [INFO ] Computed 14 place invariants in 3 ms
inv : 2*p0 + p1 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + 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 + p119 + p120 = 2
inv : 2*p0 + p37 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + 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 + p119 + p120 = 2
inv : 2*p0 + p25 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + 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 + p119 + p120 = 2
inv : p0 + 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 + p76 + p77 = 1
inv : 2*p0 + p44 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + 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 + p119 + p120 = 2
inv : -p0 + p31 + p32 + p33 + p34 + p35 + p36 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - 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 - p119 - p120 = -1
inv : 2*p0 + p20 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + 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 + p119 + p120 = 2
inv : p0 + 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 + p119 + p120 = 1
inv : -p0 + p38 + p39 + p40 + p41 + p42 + p43 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - 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 - p119 - p120 = -1
inv : -p0 + p45 + p46 + p47 + p48 + p49 + p50 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - 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 - p119 - p120 = -1
inv : -p0 + p21 + p22 + p23 + p24 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - 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 - p119 - p120 = -1
inv : -p0 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - 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 - p119 - p120 = -1
inv : -p0 + p26 + p27 + p28 + p29 - p52 - p53 - p54 - p55 - p56 - p57 - p58 - p59 - p60 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p69 - p70 - p71 - p72 - p73 - p74 - p75 - p76 - p77 - 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 - p119 - p120 = -1
inv : 2*p0 + p30 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + 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 + p119 + p120 = 2
Total of 14 invariants.
[2021-05-18 12:30:44] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 12:30:44] [INFO ] Removed a total of 58 redundant transitions.
[2021-05-18 12:30:44] [INFO ] Flatten gal took : 55 ms
[2021-05-18 12:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 8 ms.
[2021-05-18 12:30:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2021-05-18 12:30:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !(((G(F(X("(i1.i1.u4.p0==1)"))))&&(F(G(X(!(F(G(!(X(G("(u6.p40==1)"))))))))))))
Formula 0 simplified : !(GFX"(i1.i1.u4.p0==1)" & FGX!FG!XG"(u6.p40==1)")
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 24 ordering constraints for composite.
built 50 ordering constraints for composite.
[2021-05-18 12:30:44] [INFO ] Proved 121 variables to be positive in 228 ms
[2021-05-18 12:30:44] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2021-05-18 12:30:44] [INFO ] Computation of disable matrix completed :0/225 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:30:44] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:30:44] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2021-05-18 12:30:44] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:30:45] [INFO ] Computing symmetric co enabling matrix : 225 transitions.
Reverse transition relation is NOT exact ! Due to transitions t12, 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.t156, u0.t157, u0.t158, u0.t159, u0.t160, u0.t162, u0.t163, u0.t164, u0.t166, u0.t167, u0.t169, u0.t170, u0.t173, u5.t122, u5.t123, u5.t124, u5.t125, u5.t126, u5.t128, u5.t129, u5.t130, u6.t113, u6.t114, u6.t115, u6.t116, u6.t117, u6.t119, u6.t120, u6.t121, u7.t104, u7.t105, u7.t106, u7.t107, u7.t108, u7.t110, u7.t111, u7.t112, i5.t68, i5.t62, i5.u10.t60, i5.u10.t61, i5.u10.t70, i5.u10.t71, i5.u10.t72, i5.u10.t73, i5.u10.t74, i5.u10.t75, i5.u10.t76, i5.u10.t77, i5.u10.t78, i5.u10.t79, i5.u10.t80, i5.u10.t81, i5.u10.t82, i5.u10.t83, i5.u10.t84, i5.u10.t85, i5.u10.t86, i5.u10.t87, i5.u10.t88, i5.u10.t89, i5.u10.t90, i5.u10.t91, i5.u10.t92, i5.u10.t93, i5.u10.t94, i5.u10.t95, i5.u10.t96, i5.u10.t97, i5.u10.t98, i5.u10.t99, i5.u10.t100, i5.u10.t101, i5.u10.t102, i5.u10.t103, i7.t53, i7.t45, i7.t8, i7.u12.t2, i7.u12.t5, i7.u12.t9, i7.u12.t17, i7.u12.t20, i7.u12.t23, i7.u12.t28, i7.u12.t46, i7.u12.t50, i7.u12.t59, i7.u13.t6, i7.u13.t7, i7.u13.t14, i7.u13.t15, i7.u13.t18, i7.u13.t21, i7.u13.t24, i7.u13.t25, i7.u13.t26, i7.u13.t30, i7.u13.t31, i7.u13.t32, i7.u13.t33, i7.u13.t36, i7.u13.t37, i7.u13.t38, i7.u13.t39, i7.u13.t42, i7.u13.t43, i7.u13.t44, i7.u13.t48, i7.u13.t51, i7.u13.t52, i7.u13.t54, i7.u13.t55, i7.u13.t57, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/73/132/205
Computing Next relation with stutter on 33 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
255 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.59609,84568,1,0,86571,61258,2633,178741,1684,264484,173860
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F((X(G("((u5.p34==1)&&(i7.u12.p118==1))")))U(F("(i5.u10.p64==1)"))))||(G("((u5.p34==1)&&(i7.u12.p118==1))"))))
Formula 1 simplified : !(G"((u5.p34==1)&&(i7.u12.p118==1))" | F(XG"((u5.p34==1)&&(i7.u12.p118==1))" U F"(i5.u10.p64==1)"))
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:30:47] [INFO ] Computation of co-enabling matrix(5/225) took 2138 ms. Total solver calls (SAT/UNSAT): 1324(588/736)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
81 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,3.39787,110864,1,0,125987,72970,2698,251565,1688,341533,208995
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G(F("((i5.u10.p57==1)||((u0.p16==1)&&(i7.u12.p118==1)))")))||(F("((u0.p16==1)&&(i7.u12.p118==1))")))||(!(F("(u11.p111==1)")))))
Formula 2 simplified : !(GF"((i5.u10.p57==1)||((u0.p16==1)&&(i7.u12.p118==1)))" | F"((u0.p16==1)&&(i7.u12.p118==1))" | !F"(u11.p111==1)")
Computing Next relation with stutter on 33 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 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,3.53935,117248,1,0,138588,72996,2789,265095,1692,341956,237902
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(F((X(!(F(G(F("((i5.u10.p75==1)&&(i7.u13.p115==1))"))))))||(X("(((u0.p16==1)&&(i7.u12.p118==1))||(i7.u12.p120!=1))")))))))
Formula 3 simplified : !FGF(X!FGF"((i5.u10.p75==1)&&(i7.u13.p115==1))" | X"(((u0.p16==1)&&(i7.u12.p118==1))||(i7.u12.p120!=1))")
Computing Next relation with stutter on 33 deadlock states
19 unique states visited
0 strongly connected components in search stack
20 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,3.55711,117632,1,0,138873,72996,2832,265478,1695,341957,239687
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HealthRecord-PT-03-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G("((i5.u10.p75==1)&&(i7.u13.p104==1))"))))
Formula 4 simplified : !FG"((i5.u10.p75==1)&&(i7.u13.p104==1))"
Computing Next relation with stutter on 33 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
257 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.11722,219008,1,0,305132,102129,2862,534580,1696,632771,331574
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((("((i7.u13.p90!=1)&&((u5.p34!=1)||(i7.u12.p118!=1)))")U("(i7.u13.p90==1)"))U(F("((i7.u12.p85==1)&&(i5.u10.p60!=1))")))))
Formula 5 simplified : !F(("((i7.u13.p90!=1)&&((u5.p34!=1)||(i7.u12.p118!=1)))" U "(i7.u13.p90==1)") U F"((i7.u12.p85==1)&&(i5.u10.p60!=1))")
Computing Next relation with stutter on 33 deadlock states
[2021-05-18 12:30:50] [INFO ] Computation of co-enabling matrix(13/225) took 5305 ms. Total solver calls (SAT/UNSAT): 3032(1531/1501)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
101 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.13239,258080,1,0,368480,109576,2884,631366,1697,709139,388407
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G(X("((i5.u10.p75==1)&&(i7.u13.p80==1))"))))))
Formula 6 simplified : !FXGX"((i5.u10.p75==1)&&(i7.u13.p80==1))"
Computing Next relation with stutter on 33 deadlock states
11 unique states visited
10 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
10 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.22774,260180,1,0,370882,110143,2898,637566,1698,713482,393181
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((F("(u7.p46!=1)"))U(X(X(F("(i5.u9.p74==1)")))))&&(X("(i5.u9.p74==1)"))))
Formula 7 simplified : !((F"(u7.p46!=1)" U XXF"(i5.u9.p74==1)") & X"(i5.u9.p74==1)")
Computing Next relation with stutter on 33 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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.24599,260944,1,0,371303,110153,2907,638191,1699,713524,393974
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((!(X(!(F(X("(i7.u13.p94==1)"))))))&&(!(X("(u0.p5==1)"))))))
Formula 8 simplified : !F(!X!FX"(i7.u13.p94==1)" & !X"(u0.p5==1)")
Computing Next relation with stutter on 33 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
81 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,8.06466,289984,1,0,419006,118501,2936,711697,1701,779732,435677
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("(i5.u10.p65==1)"))U((X(G(X("(u0.p9==1)"))))&&(("(i5.u10.p65==1)")U(F("(u6.p40!=1)"))))))
Formula 9 simplified : !(F"(i5.u10.p65==1)" U (XGX"(u0.p9==1)" & ("(i5.u10.p65==1)" U F"(u6.p40!=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
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.29501,292140,1,0,421808,118504,2961,715046,1704,779805,444069
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(("((u0.p16==1)&&(i7.u12.p118==1))")U(F(X(F("((u0.p16==1)&&(i7.u12.p118==1))")))))))
Formula 10 simplified : !G("((u0.p16==1)&&(i7.u12.p118==1))" U FXF"((u0.p16==1)&&(i7.u12.p118==1))")
Computing Next relation with stutter on 33 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
35 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,8.64859,305340,1,0,443236,121498,2965,749044,1704,802962,463449
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 12:30:54] [INFO ] Computation of co-enabling matrix(21/225) took 8378 ms. Total solver calls (SAT/UNSAT): 4676(2473/2203)
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 12:30:55] [INFO ] Built C files in 10900ms 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 1621341056049

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is HealthRecord-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-03.tgz
mv HealthRecord-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;