fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476601017
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldRVt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.320 12865.00 24674.00 38.20 TFFTFFTTFFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476601017.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itstools
Input is ShieldRVt-PT-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K May 14 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 20:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 54K May 12 20:42 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 ShieldRVt-PT-020A-00
FORMULA_NAME ShieldRVt-PT-020A-01
FORMULA_NAME ShieldRVt-PT-020A-02
FORMULA_NAME ShieldRVt-PT-020A-03
FORMULA_NAME ShieldRVt-PT-020A-04
FORMULA_NAME ShieldRVt-PT-020A-05
FORMULA_NAME ShieldRVt-PT-020A-06
FORMULA_NAME ShieldRVt-PT-020A-07
FORMULA_NAME ShieldRVt-PT-020A-08
FORMULA_NAME ShieldRVt-PT-020A-09
FORMULA_NAME ShieldRVt-PT-020A-10
FORMULA_NAME ShieldRVt-PT-020A-11
FORMULA_NAME ShieldRVt-PT-020A-12
FORMULA_NAME ShieldRVt-PT-020A-13
FORMULA_NAME ShieldRVt-PT-020A-14
FORMULA_NAME ShieldRVt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1590631450368

[2020-05-28 02:04:11] [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]
[2020-05-28 02:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 02:04:11] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-05-28 02:04:11] [INFO ] Transformed 163 places.
[2020-05-28 02:04:12] [INFO ] Transformed 163 transitions.
[2020-05-28 02:04:12] [INFO ] Found NUPN structural information;
[2020-05-28 02:04:12] [INFO ] Parsed PT model containing 163 places and 163 transitions in 93 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 339 ms. (steps per millisecond=294 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 162 rows 163 cols
[2020-05-28 02:04:12] [INFO ] Computed 81 place invariants in 7 ms
[2020-05-28 02:04:12] [INFO ] [Real]Absence check using 81 positive place invariants in 39 ms returned sat
[2020-05-28 02:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:12] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-05-28 02:04:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned unsat
[2020-05-28 02:04:12] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2020-05-28 02:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:12] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2020-05-28 02:04:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 6 ms returned unsat
[2020-05-28 02:04:13] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2020-05-28 02:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:13] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-05-28 02:04:13] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 12 ms.
[2020-05-28 02:04:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 28 ms returned sat
[2020-05-28 02:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-05-28 02:04:13] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 21 ms.
[2020-05-28 02:04:13] [INFO ] Added : 158 causal constraints over 32 iterations in 509 ms. Result :sat
[2020-05-28 02:04:13] [INFO ] [Real]Absence check using 81 positive place invariants in 28 ms returned sat
[2020-05-28 02:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:13] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-05-28 02:04:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2020-05-28 02:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:14] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-05-28 02:04:14] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 12 ms.
[2020-05-28 02:04:14] [INFO ] Added : 161 causal constraints over 33 iterations in 353 ms. Result :sat
[2020-05-28 02:04:14] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2020-05-28 02:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:14] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-05-28 02:04:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2020-05-28 02:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:14] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2020-05-28 02:04:14] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2020-05-28 02:04:15] [INFO ] Added : 158 causal constraints over 32 iterations in 354 ms. Result :sat
[2020-05-28 02:04:15] [INFO ] [Real]Absence check using 81 positive place invariants in 36 ms returned sat
[2020-05-28 02:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:15] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-05-28 02:04:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:15] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2020-05-28 02:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:15] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2020-05-28 02:04:15] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 13 ms.
[2020-05-28 02:04:15] [INFO ] Added : 160 causal constraints over 33 iterations in 502 ms. Result :sat
[2020-05-28 02:04:16] [INFO ] [Real]Absence check using 81 positive place invariants in 35 ms returned sat
[2020-05-28 02:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:16] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-28 02:04:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned unsat
[2020-05-28 02:04:16] [INFO ] [Real]Absence check using 81 positive place invariants in 36 ms returned sat
[2020-05-28 02:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:16] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-05-28 02:04:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 35 ms returned sat
[2020-05-28 02:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:16] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2020-05-28 02:04:16] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 12 ms.
[2020-05-28 02:04:17] [INFO ] Added : 161 causal constraints over 33 iterations in 543 ms. Result :sat
[2020-05-28 02:04:17] [INFO ] [Real]Absence check using 81 positive place invariants in 27 ms returned sat
[2020-05-28 02:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:17] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2020-05-28 02:04:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 6 ms returned unsat
[2020-05-28 02:04:17] [INFO ] [Real]Absence check using 81 positive place invariants in 43 ms returned sat
[2020-05-28 02:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:17] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-05-28 02:04:17] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 12 ms.
[2020-05-28 02:04:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2020-05-28 02:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:17] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2020-05-28 02:04:17] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 13 ms.
[2020-05-28 02:04:18] [INFO ] Added : 159 causal constraints over 33 iterations in 517 ms. Result :sat
[2020-05-28 02:04:18] [INFO ] [Real]Absence check using 81 positive place invariants in 28 ms returned sat
[2020-05-28 02:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:18] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2020-05-28 02:04:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 28 ms returned sat
[2020-05-28 02:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:18] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2020-05-28 02:04:18] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2020-05-28 02:04:19] [INFO ] Added : 160 causal constraints over 33 iterations in 581 ms. Result :sat
[2020-05-28 02:04:19] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2020-05-28 02:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:19] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-28 02:04:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 28 ms returned sat
[2020-05-28 02:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:19] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2020-05-28 02:04:19] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2020-05-28 02:04:20] [INFO ] Added : 160 causal constraints over 33 iterations in 500 ms. Result :sat
[2020-05-28 02:04:20] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2020-05-28 02:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:20] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-05-28 02:04:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:20] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2020-05-28 02:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:20] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2020-05-28 02:04:20] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 13 ms.
[2020-05-28 02:04:20] [INFO ] Added : 160 causal constraints over 33 iterations in 496 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-28 02:04:21] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-28 02:04:21] [INFO ] Flatten gal took : 62 ms
FORMULA ShieldRVt-PT-020A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 02:04:21] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 02:04:21] [INFO ] Applying decomposition
[2020-05-28 02:04:21] [INFO ] Flatten gal took : 19 ms
[2020-05-28 02:04:21] [INFO ] Input system was already deterministic with 162 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/graph7197308750885740524.txt, -o, /tmp/graph7197308750885740524.bin, -w, /tmp/graph7197308750885740524.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 162 rows 163 cols
[2020-05-28 02:04:21] [INFO ] Computed 81 place invariants in 4 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p153 + p154 = 1
Total of 81 invariants.
[2020-05-28 02:04:21] [INFO ] Computed 81 place invariants in 14 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7197308750885740524.bin, -l, -1, -v, -w, /tmp/graph7197308750885740524.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 02:04:21] [INFO ] Decomposing Gal with order
[2020-05-28 02:04:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:04:21] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-28 02:04:21] [INFO ] Flatten gal took : 91 ms
[2020-05-28 02:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2020-05-28 02:04:21] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 20 ms
[2020-05-28 02:04:21] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/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 8 LTL properties
Checking formula 0 : !((X((((G("((i1.i0.u8.p18==0)||(i6.i1.u41.p83==1))"))||("(i10.i1.u69.p140==0)"))||("(i3.i1.u23.p47==1)"))U("(i9.u62.p125==1)"))))
Formula 0 simplified : !X(("(i3.i1.u23.p47==1)" | "(i10.i1.u69.p140==0)" | G"((i1.i0.u8.p18==0)||(i6.i1.u41.p83==1))") U "(i9.u62.p125==1)")
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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,0.085559,19440,1,0,1774,66,826,2584,66,110,4372
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((i1.i0.u7.p16==0)||(i4.u28.p58==1))")||(F(G(X(G("((i7.i1.u51.p103==0)||(i1.i1.u11.p24==1))")))))))))
Formula 1 simplified : !GF("((i1.i0.u7.p16==0)||(i4.u28.p58==1))" | FGXG"((i7.i1.u51.p103==0)||(i1.i1.u11.p24==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,0.092996,19960,1,0,2531,66,902,3947,68,110,5638
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(G((!(F(G("((i10.i1.u71.p144==0)||(i8.i1.u60.p121==1))"))))||((G("((i8.i0.u53.p107==0)||(i2.u13.p28==1))"))U("((i8.i1.u59.p120==0)||(i1.i0.u5.p11==1))")))))))
Formula 2 simplified : !G!G(!FG"((i10.i1.u71.p144==0)||(i8.i1.u60.p121==1))" | (G"((i8.i0.u53.p107==0)||(i2.u13.p28==1))" U "((i8.i1.u59.p120==0)||(i1.i0.u5.p11==1))"))
[2020-05-28 02:04:22] [INFO ] Proved 163 variables to be positive in 552 ms
[2020-05-28 02:04:22] [INFO ] Computing symmetric may disable matrix : 162 transitions.
[2020-05-28 02:04:22] [INFO ] Computation of disable matrix completed :0/162 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:04:22] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:04:22] [INFO ] Computing symmetric may enable matrix : 162 transitions.
[2020-05-28 02:04:22] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
26 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,0.35011,32076,1,0,26613,66,959,83531,68,110,19869
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(!(X(G(!(G("((i7.i0.u46.p94==0)||(i3.i1.u23.p47==1))")))))))))
Formula 3 simplified : !XG!XG!G"((i7.i0.u46.p94==0)||(i3.i1.u23.p47==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
38 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,0.734823,46860,1,0,52145,66,999,177899,68,110,31871
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(!(F(((F("((i0.u1.p4==0)||(i4.u28.p57==1))"))&&("(i0.u1.p4!=0)"))&&("(i4.u28.p57!=1)"))))))
Formula 4 simplified : !X!F("(i0.u1.p4!=0)" & "(i4.u28.p57!=1)" & F"((i0.u1.p4==0)||(i4.u28.p57==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
3 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,0.764454,47384,1,0,52547,66,1064,178330,68,110,32773
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(("((i3.i1.u22.p46==0)||(i3.i1.u22.p45==1))")U("((i10.i1.u69.p139!=0)&&(i8.i1.u57.p116!=1))"))))
Formula 5 simplified : !X("((i3.i1.u22.p46==0)||(i3.i1.u22.p45==1))" U "((i10.i1.u69.p139!=0)&&(i8.i1.u57.p116!=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.765139,47384,1,0,52547,66,1094,178330,72,110,32814
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(F(G("((i7.i0.u45.p91==0)||(i7.i0.u46.p94==1))")))))
Formula 6 simplified : !FG"((i7.i0.u45.p91==0)||(i7.i0.u46.p94==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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,0.835358,50548,1,0,59934,66,1133,197067,72,110,39931
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(!(X(X(F(((G("((i10.i0.u67.p136==0)||(i7.i0.u46.p94==1))"))||("(i8.i1.u60.p122==0)"))||("(i5.i1.u34.p69==1)")))))))&&(F("((i8.i1.u60.p122==0)||(i5.i1.u34.p69==1))"))))
Formula 7 simplified : !(X!XXF("(i5.i1.u34.p69==1)" | "(i8.i1.u60.p122==0)" | G"((i10.i0.u67.p136==0)||(i7.i0.u46.p94==1))") & F"((i8.i1.u60.p122==0)||(i5.i1.u34.p69==1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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,0.838993,51044,1,0,60074,66,1186,197219,72,110,40321
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-28 02:04:23] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 56) 1) (>= (select s0 58) 1)) (>= (select s0 63) 1)) (= (store (store (store (store (store (store s0 55 (+ (select s0 55) 1)) 63 (- (select s0 63) 1)) 56 (- (select s0 56) 1)) 58 (- (select s0 58) 1)) 64 (+ (select s0 64) 1)) 57 (+ (select s0 57) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (>= (select s0 56) 1) (>= (select s0 58) 1)) (>= (select s0 63) 1)) (= (store (store (store (store (store (store s0 55 (+ (select s0 55) 1)) 63 (- (select s0 63) 1)) 56 (- (select s0 56) 1)) 58 (- (select s0 58) 1)) 64 (+ (select s0 64) 1)) 57 (+ (select s0 57) 1)) s1))")
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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)
[2020-05-28 02:04:23] [INFO ] Built C files in 1637ms 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 1590631463233

--------------------
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="ShieldRVt-PT-020A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itstools"
echo " Input is ShieldRVt-PT-020A, 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 r210-tajo-159033476601017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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