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-159033475600345.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 ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475600345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 3.4K May 14 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 2.8K May 13 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 13 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 212K 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 ShieldIIPt-PT-040A-00
FORMULA_NAME ShieldIIPt-PT-040A-01
FORMULA_NAME ShieldIIPt-PT-040A-02
FORMULA_NAME ShieldIIPt-PT-040A-03
FORMULA_NAME ShieldIIPt-PT-040A-04
FORMULA_NAME ShieldIIPt-PT-040A-05
FORMULA_NAME ShieldIIPt-PT-040A-06
FORMULA_NAME ShieldIIPt-PT-040A-07
FORMULA_NAME ShieldIIPt-PT-040A-08
FORMULA_NAME ShieldIIPt-PT-040A-09
FORMULA_NAME ShieldIIPt-PT-040A-10
FORMULA_NAME ShieldIIPt-PT-040A-11
FORMULA_NAME ShieldIIPt-PT-040A-12
FORMULA_NAME ShieldIIPt-PT-040A-13
FORMULA_NAME ShieldIIPt-PT-040A-14
FORMULA_NAME ShieldIIPt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1590584268753

[2020-05-27 12:57:51] [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-27 12:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:57:51] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2020-05-27 12:57:51] [INFO ] Transformed 763 places.
[2020-05-27 12:57:51] [INFO ] Transformed 563 transitions.
[2020-05-27 12:57:51] [INFO ] Found NUPN structural information;
[2020-05-27 12:57:51] [INFO ] Parsed PT model containing 763 places and 563 transitions in 244 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 753 ms. (steps per millisecond=132 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1]
// Phase 1: matrix 562 rows 763 cols
[2020-05-27 12:57:52] [INFO ] Computed 361 place invariants in 21 ms
[2020-05-27 12:57:53] [INFO ] [Real]Absence check using 361 positive place invariants in 299 ms returned sat
[2020-05-27 12:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:57:54] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2020-05-27 12:57:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:57:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 212 ms returned sat
[2020-05-27 12:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:57:55] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2020-05-27 12:57:55] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 58 ms.
[2020-05-27 12:58:04] [INFO ] Added : 555 causal constraints over 114 iterations in 8713 ms. Result :sat
[2020-05-27 12:58:05] [INFO ] [Real]Absence check using 361 positive place invariants in 229 ms returned sat
[2020-05-27 12:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:06] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2020-05-27 12:58:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:58:06] [INFO ] [Nat]Absence check using 361 positive place invariants in 192 ms returned sat
[2020-05-27 12:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:07] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2020-05-27 12:58:07] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 53 ms.
[2020-05-27 12:58:14] [INFO ] Added : 550 causal constraints over 112 iterations in 6986 ms. Result :sat
[2020-05-27 12:58:15] [INFO ] [Real]Absence check using 361 positive place invariants in 198 ms returned sat
[2020-05-27 12:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:16] [INFO ] [Real]Absence check using state equation in 1141 ms returned sat
[2020-05-27 12:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:58:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 197 ms returned sat
[2020-05-27 12:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:17] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2020-05-27 12:58:17] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 32 ms.
[2020-05-27 12:58:26] [INFO ] Added : 555 causal constraints over 112 iterations in 8269 ms. Result :sat
[2020-05-27 12:58:26] [INFO ] [Real]Absence check using 361 positive place invariants in 148 ms returned sat
[2020-05-27 12:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:27] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2020-05-27 12:58:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:58:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 141 ms returned sat
[2020-05-27 12:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:28] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2020-05-27 12:58:28] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 58 ms.
[2020-05-27 12:58:38] [INFO ] Added : 555 causal constraints over 112 iterations in 9849 ms. Result :sat
[2020-05-27 12:58:38] [INFO ] [Real]Absence check using 361 positive place invariants in 186 ms returned sat
[2020-05-27 12:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:40] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2020-05-27 12:58:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:58:40] [INFO ] [Nat]Absence check using 361 positive place invariants in 146 ms returned sat
[2020-05-27 12:58:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:41] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2020-05-27 12:58:41] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 44 ms.
[2020-05-27 12:58:49] [INFO ] Added : 552 causal constraints over 111 iterations in 8690 ms. Result :sat
[2020-05-27 12:58:50] [INFO ] [Real]Absence check using 361 positive place invariants in 199 ms returned sat
[2020-05-27 12:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:51] [INFO ] [Real]Absence check using state equation in 1054 ms returned sat
[2020-05-27 12:58:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:58:51] [INFO ] [Nat]Absence check using 361 positive place invariants in 147 ms returned sat
[2020-05-27 12:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:58:52] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2020-05-27 12:58:52] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 26 ms.
[2020-05-27 12:58:59] [INFO ] Added : 549 causal constraints over 112 iterations in 6703 ms. Result :sat
[2020-05-27 12:58:59] [INFO ] [Real]Absence check using 361 positive place invariants in 262 ms returned sat
[2020-05-27 12:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:00] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2020-05-27 12:59:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 195 ms returned sat
[2020-05-27 12:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:02] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2020-05-27 12:59:02] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 31 ms.
[2020-05-27 12:59:10] [INFO ] Added : 558 causal constraints over 113 iterations in 8239 ms. Result :sat
[2020-05-27 12:59:11] [INFO ] [Real]Absence check using 361 positive place invariants in 193 ms returned sat
[2020-05-27 12:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:12] [INFO ] [Real]Absence check using state equation in 1054 ms returned sat
[2020-05-27 12:59:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:12] [INFO ] [Nat]Absence check using 361 positive place invariants in 20 ms returned unsat
[2020-05-27 12:59:12] [INFO ] [Real]Absence check using 361 positive place invariants in 207 ms returned sat
[2020-05-27 12:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:13] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2020-05-27 12:59:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:14] [INFO ] [Nat]Absence check using 361 positive place invariants in 198 ms returned sat
[2020-05-27 12:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:15] [INFO ] [Nat]Absence check using state equation in 1277 ms returned sat
[2020-05-27 12:59:15] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 70 ms.
[2020-05-27 12:59:23] [INFO ] Added : 548 causal constraints over 112 iterations in 8345 ms. Result :sat
[2020-05-27 12:59:24] [INFO ] [Real]Absence check using 361 positive place invariants in 202 ms returned sat
[2020-05-27 12:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:25] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2020-05-27 12:59:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 19 ms returned unsat
[2020-05-27 12:59:25] [INFO ] [Real]Absence check using 361 positive place invariants in 217 ms returned sat
[2020-05-27 12:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:27] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2020-05-27 12:59:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 19 ms returned unsat
[2020-05-27 12:59:27] [INFO ] [Real]Absence check using 361 positive place invariants in 209 ms returned sat
[2020-05-27 12:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:28] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2020-05-27 12:59:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:29] [INFO ] [Nat]Absence check using 361 positive place invariants in 206 ms returned sat
[2020-05-27 12:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:30] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2020-05-27 12:59:30] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 35 ms.
[2020-05-27 12:59:42] [INFO ] Added : 555 causal constraints over 114 iterations in 11932 ms. Result :sat
[2020-05-27 12:59:42] [INFO ] [Real]Absence check using 361 positive place invariants in 188 ms returned sat
[2020-05-27 12:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:43] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2020-05-27 12:59:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 189 ms returned sat
[2020-05-27 12:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:44] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2020-05-27 12:59:44] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 27 ms.
[2020-05-27 12:59:51] [INFO ] Added : 546 causal constraints over 110 iterations in 6741 ms. Result :sat
[2020-05-27 12:59:52] [INFO ] [Real]Absence check using 361 positive place invariants in 188 ms returned sat
[2020-05-27 12:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:53] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2020-05-27 12:59:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 20 ms returned unsat
[2020-05-27 12:59:53] [INFO ] [Real]Absence check using 361 positive place invariants in 151 ms returned sat
[2020-05-27 12:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:54] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2020-05-27 12:59:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:59:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 142 ms returned sat
[2020-05-27 12:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:59:55] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2020-05-27 12:59:55] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 25 ms.
[2020-05-27 13:00:02] [INFO ] Added : 554 causal constraints over 112 iterations in 6143 ms. Result :sat
[2020-05-27 13:00:02] [INFO ] [Real]Absence check using 361 positive place invariants in 172 ms returned sat
[2020-05-27 13:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 13:00:03] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2020-05-27 13:00:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 13:00:03] [INFO ] [Nat]Absence check using 361 positive place invariants in 132 ms returned sat
[2020-05-27 13:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 13:00:04] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2020-05-27 13:00:04] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 26 ms.
[2020-05-27 13:00:12] [INFO ] Added : 554 causal constraints over 112 iterations in 7805 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-27 13:00:12] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-27 13:00:12] [INFO ] Flatten gal took : 189 ms
FORMULA ShieldIIPt-PT-040A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 13:00:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 13:00:12] [INFO ] Flatten gal took : 79 ms
[2020-05-27 13:00:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldIIPt-PT-040A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 13:00:12] [INFO ] Applying decomposition
[2020-05-27 13:00:13] [INFO ] Flatten gal took : 54 ms
[2020-05-27 13:00:13] [INFO ] Input system was already deterministic with 562 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/graph9687799633192585815.txt, -o, /tmp/graph9687799633192585815.bin, -w, /tmp/graph9687799633192585815.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/graph9687799633192585815.bin, -l, -1, -v, -w, /tmp/graph9687799633192585815.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 13:00:13] [INFO ] Decomposing Gal with order
[2020-05-27 13:00:13] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 562 rows 763 cols
[2020-05-27 13:00:13] [INFO ] Computed 361 place invariants in 15 ms
inv : p0 + p622 + p623 = 1
inv : p0 + p35 + p36 = 1
inv : p0 + p637 + p638 = 1
inv : p0 + p592 + p593 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p582 + p583 = 1
inv : p0 + p746 + p749 + p750 = 1
inv : p0 + p50 + p51 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p702 + p703 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p662 + p663 = 1
inv : p0 + p717 + p718 = 1
inv : p0 + p542 + p543 = 1
inv : p0 + p512 + p513 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p556 + p559 + p560 = 1
inv : p0 + p487 + p488 = 1
inv : p0 + p632 + p633 + p634 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p309 + p312 + p313 = 1
inv : p0 + p176 + p179 + p180 = 1
inv : p0 + p647 + p648 = 1
inv : p0 + p567 + p568 = 1
inv : p0 + p62 + p63 + p64 = 1
inv : p0 + p210 + p211 = 1
inv : p0 + p417 + p418 = 1
inv : p0 + p457 + p458 = 1
inv : p0 + p402 + p403 = 1
inv : p0 + p575 + p576 + p577 = 1
inv : p0 + p252 + p253 + p254 = 1
inv : p0 + p250 + p251 = 1
inv : p0 + p472 + p473 = 1
inv : p0 + p742 + p743 = 1
inv : p0 + p280 + p281 = 1
inv : p0 + p352 + p353 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p119 + p122 + p123 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p757 + p758 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p366 + p369 + p370 = 1
inv : p0 + p687 + p688 = 1
inv : p0 + p527 + p528 = 1
inv : p0 + p415 + p416 = 1
inv : p0 + p499 + p500 + p501 = 1
inv : p0 + p282 + p283 = 1
inv : p0 + p62 + p65 + p66 = 1
inv : p0 + p138 + p139 + p140 = 1
inv : p0 + p759 + p760 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p362 + p363 = 1
inv : p0 + p689 + p692 + p693 = 1
inv : p0 + p525 + p526 = 1
inv : p0 + p455 + p456 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p442 + p445 + p446 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p385 + p386 + p387 = 1
inv : p0 + p708 + p709 + p710 = 1
inv : p0 + p590 + p591 = 1
inv : p0 + p432 + p433 = 1
inv : p0 + p200 + p201 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p624 + p625 = 1
inv : p0 + p630 + p631 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p392 + p393 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p240 + p241 = 1
inv : p0 + p694 + p695 = 1
inv : p0 + p130 + p131 = 1
inv : p0 + p233 + p236 + p237 = 1
inv : p0 + p700 + p701 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p584 + p585 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p485 + p486 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p514 + p515 = 1
inv : p0 + p677 + p678 = 1
inv : p0 + p607 + p608 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p474 + p475 = 1
inv : p0 + p449 + p450 = 1
inv : p0 + p176 + p177 + p178 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p715 + p716 = 1
inv : p0 + p208 + p209 = 1
inv : p0 + p459 + p460 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p651 + p652 + p653 = 1
inv : p0 + p379 + p380 = 1
inv : p0 + p544 + p545 = 1
inv : p0 + p746 + p747 + p748 = 1
inv : p0 + p394 + p395 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p660 + p661 = 1
inv : p0 + p529 + p530 = 1
inv : p0 + p81 + p82 + p83 = 1
inv : p0 + p599 + p600 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p575 + p578 + p579 = 1
inv : p0 + p580 + p581 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p679 + p680 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p565 + p566 = 1
inv : p0 + p314 + p315 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p664 + p665 = 1
inv : p0 + p358 + p359 = 1
inv : p0 + p413 + p414 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p609 + p610 = 1
inv : p0 + p288 + p289 = 1
inv : p0 + p734 + p735 = 1
inv : p0 + p58 + p59 = 1
inv : p0 + p495 + p496 = 1
inv : p0 + p347 + p350 + p351 = 1
inv : p0 + p670 + p673 + p674 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p309 + p310 + p311 = 1
inv : p0 + p725 + p726 = 1
inv : p0 + p751 + p752 = 1
inv : p0 + p100 + p103 + p104 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p556 + p557 + p558 = 1
inv : p0 + p696 + p697 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p242 + p243 = 1
inv : p0 + p681 + p682 = 1
inv : p0 + p430 + p431 = 1
inv : p0 + p404 + p405 + p406 = 1
inv : p0 + p423 + p426 + p427 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p440 + p441 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p328 + p331 + p332 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p761 + p762 = 1
inv : p0 + p563 + p564 = 1
inv : p0 + p360 + p361 = 1
inv : p0 + p611 + p612 = 1
inv : p0 + p328 + p329 + p330 = 1
inv : p0 + p510 + p511 = 1
inv : p0 + p233 + p234 + p235 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p628 + p629 = 1
inv : p0 + p493 + p494 = 1
inv : p0 + p56 + p57 = 1
inv : p0 + p244 + p245 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p698 + p699 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p447 + p448 = 1
inv : p0 + p499 + p502 + p503 = 1
inv : p0 + p92 + p93 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p744 + p745 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p252 + p255 + p256 = 1
inv : p0 + p732 + p733 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p476 + p477 = 1
inv : p0 + p546 + p547 = 1
inv : p0 + p645 + p646 = 1
inv : p0 + p377 + p378 = 1
inv : p0 + p157 + p158 + p159 = 1
inv : p0 + p326 + p327 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p727 + p728 + p729 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p461 + p464 + p465 = 1
inv : p0 + p411 + p412 = 1
inv : p0 + p100 + p101 + p102 = 1
inv : p0 + p24 + p27 + p28 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p276 + p277 = 1
inv : p0 + p286 + p287 = 1
inv : p0 + p347 + p348 + p349 = 1
inv : p0 + p206 + p207 = 1
inv : p0 + p436 + p437 = 1
inv : p0 + p356 + p357 = 1
inv : p0 + p404 + p407 + p408 = 1
inv : p0 + p81 + p84 + p85 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p516 + p517 = 1
inv : p0 + p506 + p507 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p594 + p597 + p598 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p713 + p714 = 1
inv : p0 + p451 + p452 = 1
inv : p0 + p571 + p572 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p537 + p538 + p539 = 1
inv : p0 + p466 + p467 = 1
inv : p0 + p588 + p589 = 1
inv : p0 + p651 + p654 + p655 = 1
inv : p0 + p626 + p627 = 1
inv : p0 + p166 + p167 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p396 + p397 = 1
inv : p0 + p658 + p659 = 1
inv : p0 + p548 + p549 = 1
inv : p0 + p594 + p595 + p596 = 1
inv : p0 + p518 + p521 + p522 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p573 + p574 = 1
inv : p0 + p641 + p642 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p643 + p644 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p468 + p469 = 1
inv : p0 + p214 + p215 + p216 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p164 + p165 = 1
inv : p0 + p157 + p160 + p161 = 1
inv : p0 + p736 + p737 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p618 + p619 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p666 + p667 = 1
inv : p0 + p136 + p137 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p727 + p730 + p731 = 1
inv : p0 + p723 + p724 = 1
inv : p0 + p398 + p399 = 1
inv : p0 + p339 + p340 = 1
inv : p0 + p561 + p562 = 1
inv : p0 + p271 + p274 + p275 = 1
inv : p0 + p683 + p684 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p491 + p492 = 1
inv : p0 + p333 + p334 = 1
inv : p0 + p753 + p754 = 1
inv : p0 + p531 + p532 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p421 + p422 = 1
inv : p0 + p601 + p602 = 1
inv : p0 + p246 + p247 = 1
inv : p0 + p409 + p410 = 1
inv : p0 + p438 + p439 = 1
inv : p0 + p670 + p671 + p672 = 1
inv : p0 + p508 + p509 = 1
inv : p0 + p423 + p424 + p425 = 1
inv : p0 + p706 + p707 = 1
inv : p0 + p316 + p317 = 1
inv : p0 + p54 + p55 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p271 + p272 + p273 = 1
inv : p0 + p168 + p169 = 1
inv : p0 + p740 + p741 = 1
inv : p0 + p755 + p756 = 1
inv : p0 + p195 + p198 + p199 = 1
inv : p0 + p290 + p293 + p294 = 1
inv : p0 + p489 + p490 = 1
inv : p0 + p461 + p462 + p463 = 1
inv : p0 + p419 + p420 = 1
inv : p0 + p504 + p505 = 1
inv : p0 + p248 + p249 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p554 + p555 = 1
inv : p0 + p685 + p686 = 1
inv : p0 + p675 + p676 = 1
inv : p0 + p88 + p89 = 1
inv : p0 + p318 + p319 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p366 + p367 + p368 = 1
inv : p0 + p238 + p239 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p649 + p650 = 1
inv : p0 + p373 + p374 = 1
inv : p0 + p613 + p614 + p615 = 1
inv : p0 + p605 + p606 = 1
inv : p0 + p620 + p621 = 1
inv : p0 + p52 + p53 = 1
inv : p0 + p518 + p519 + p520 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p550 + p551 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p138 + p141 + p142 = 1
inv : p0 + p204 + p205 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p434 + p435 = 1
inv : p0 + p385 + p388 + p389 = 1
inv : p0 + p719 + p720 = 1
inv : p0 + p632 + p635 + p636 = 1
inv : p0 + p134 + p135 = 1
inv : p0 + p364 + p365 = 1
inv : p0 + p24 + p25 + p26 = 1
inv : p0 + p400 + p401 = 1
inv : p0 + p613 + p616 + p617 = 1
inv : p0 + p390 + p391 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p43 + p44 + p45 = 1
inv : p0 + p656 + p657 = 1
inv : p0 + p533 + p534 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p603 + p604 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p202 + p203 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p721 + p722 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p523 + p524 = 1
inv : p0 + p119 + p120 + p121 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p704 + p705 = 1
inv : p0 + p586 + p587 = 1
inv : p0 + p708 + p711 + p712 = 1
inv : p0 + p43 + p46 + p47 = 1
inv : p0 + p535 + p536 = 1
inv : p0 + p738 + p739 = 1
inv : p0 + p284 + p285 = 1
inv : p0 + p383 + p384 = 1
inv : p0 + p537 + p540 + p541 = 1
inv : p0 + p214 + p217 + p218 = 1
inv : p0 + p195 + p196 + p197 = 1
inv : p0 + p569 + p570 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p552 + p553 = 1
inv : p0 + p470 + p471 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p442 + p443 + p444 = 1
inv : p0 + p668 + p669 = 1
inv : p0 + p354 + p355 = 1
inv : p0 + p639 + p640 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p689 + p690 + p691 = 1
inv : p0 + p86 + p87 = 1
Total of 361 invariants.
[2020-05-27 13:00:13] [INFO ] Computed 361 place invariants in 31 ms
[2020-05-27 13:00:13] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-27 13:00:13] [INFO ] Flatten gal took : 238 ms
[2020-05-27 13:00:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 67 ms.
[2020-05-27 13:00:14] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 56 ms
[2020-05-27 13:00:14] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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 5 LTL properties
Checking formula 0 : !((G(X(!(X(X(F(G("((i10.i0.i1.u142.p339==0)||(i3.i0.i0.u47.p113==1))")))))))))
Formula 0 simplified : !GX!XXFG"((i10.i0.i1.u142.p339==0)||(i3.i0.i0.u47.p113==1))"
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 38 ordering constraints for composite.
built 20 ordering constraints for composite.
built 38 ordering constraints for composite.
built 20 ordering constraints for composite.
built 38 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
65 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.740478,35848,1,0,36370,464,3725,67935,120,2562,80153
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(X(G((!(G("((i7.u112.p267==0)||(i22.i1.i2.u317.p756==1))")))||("((i10.i0.i1.u138.p330!=0)&&(i19.i0.i2.u264.p628!=1))")))))))
Formula 1 simplified : !FXXG("((i10.i0.i1.u138.p330!=0)&&(i19.i0.i2.u264.p628!=1))" | !G"((i7.u112.p267==0)||(i22.i1.i2.u317.p756==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.753958,36980,1,0,38469,464,3808,72586,123,2562,81819
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(F(G(X(G("((i0.i0.i1.u2.p8==0)||(i14.u194.p464==1))")))))))
Formula 2 simplified : !FGXG"((i0.i0.i1.u2.p8==0)||(i14.u194.p464==1))"
3 unique states visited
2 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.759871,37472,1,0,39350,464,3819,73715,125,2562,83329
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G("((i11.i0.i1.u160.p382==0)||(i19.i1.i1.u266.p633==1))"))&&(X("((i11.i0.i1.u160.p382==0)||(i19.i1.i1.u266.p633==1))"))))
Formula 3 simplified : !(G"((i11.i0.i1.u160.p382==0)||(i19.i1.i1.u266.p633==1))" & X"((i11.i0.i1.u160.p382==0)||(i19.i1.i1.u266.p633==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.762324,37716,1,0,39415,464,3865,73726,126,2562,84227
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F("(((i20.u273.p650==0)||(i20.u273.p650==1))&&((i0.i0.i1.u2.p8==0)||(i17.u237.p565==1)))")))||(G(F(F("((i16.u212.p507==0)||(i2.u43.p105==1))"))))))
Formula 4 simplified : !(!F"(((i20.u273.p650==0)||(i20.u273.p650==1))&&((i0.i0.i1.u2.p8==0)||(i17.u237.p565==1)))" | GF"((i16.u212.p507==0)||(i2.u43.p105==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.767816,37924,1,0,39911,464,3959,74563,127,2562,84973
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Stream closed (< (select (select s 1) 84) 0)")
java.lang.RuntimeException: SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Stream closed (< (select (select s 1) 84) 0)")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:114)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-27 13:00:15] [INFO ] Built C files in 2179ms 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 1590584415434

--------------------
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="ShieldIIPt-PT-040A"
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 ShieldIIPt-PT-040A, 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-159033475600345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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