About the Execution of ITS-Tools for ShieldRVt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.250 | 3600000.00 | 3698568.00 | 3264.30 | FTFFFTFTFFTT?TT? | 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-159033476601065.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-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.1K May 14 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K May 13 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:55 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 136K 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-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15
=== Now, execution of the tool begins
BK_START 1590635090438
[2020-05-28 03:04:52] [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 03:04:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 03:04:52] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2020-05-28 03:04:52] [INFO ] Transformed 403 places.
[2020-05-28 03:04:52] [INFO ] Transformed 403 transitions.
[2020-05-28 03:04:52] [INFO ] Found NUPN structural information;
[2020-05-28 03:04:52] [INFO ] Parsed PT model containing 403 places and 403 transitions in 141 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 612 ms. (steps per millisecond=163 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 402 rows 403 cols
[2020-05-28 03:04:53] [INFO ] Computed 201 place invariants in 11 ms
[2020-05-28 03:04:53] [INFO ] [Real]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:04:54] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-05-28 03:04:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:04:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 15 ms returned unsat
[2020-05-28 03:04:54] [INFO ] [Real]Absence check using 201 positive place invariants in 92 ms returned sat
[2020-05-28 03:04:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:04:54] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2020-05-28 03:04:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-05-28 03:04:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:04:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 70 ms returned sat
[2020-05-28 03:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:04:55] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-05-28 03:04:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 53 ms.
[2020-05-28 03:04:58] [INFO ] Added : 397 causal constraints over 80 iterations in 2938 ms. Result :sat
[2020-05-28 03:04:58] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-05-28 03:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:04:59] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-05-28 03:04:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:04:59] [INFO ] [Nat]Absence check using 201 positive place invariants in 73 ms returned sat
[2020-05-28 03:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:04:59] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2020-05-28 03:04:59] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 22 ms.
[2020-05-28 03:05:02] [INFO ] Added : 399 causal constraints over 80 iterations in 2868 ms. Result :sat
[2020-05-28 03:05:02] [INFO ] [Real]Absence check using 201 positive place invariants in 61 ms returned sat
[2020-05-28 03:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:03] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2020-05-28 03:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:03] [INFO ] [Nat]Absence check using 201 positive place invariants in 65 ms returned sat
[2020-05-28 03:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:03] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2020-05-28 03:05:03] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:05:06] [INFO ] Added : 396 causal constraints over 80 iterations in 3149 ms. Result :sat
[2020-05-28 03:05:06] [INFO ] [Real]Absence check using 201 positive place invariants in 75 ms returned sat
[2020-05-28 03:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:07] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-05-28 03:05:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2020-05-28 03:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:07] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-05-28 03:05:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 15 ms.
[2020-05-28 03:05:10] [INFO ] Added : 397 causal constraints over 80 iterations in 2759 ms. Result :sat
[2020-05-28 03:05:10] [INFO ] [Real]Absence check using 201 positive place invariants in 76 ms returned sat
[2020-05-28 03:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:11] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-05-28 03:05:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 85 ms returned sat
[2020-05-28 03:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:11] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2020-05-28 03:05:11] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-05-28 03:05:14] [INFO ] Added : 400 causal constraints over 81 iterations in 3085 ms. Result :sat
[2020-05-28 03:05:14] [INFO ] [Real]Absence check using 201 positive place invariants in 79 ms returned sat
[2020-05-28 03:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:15] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2020-05-28 03:05:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 53 ms returned sat
[2020-05-28 03:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:15] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2020-05-28 03:05:15] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-05-28 03:05:18] [INFO ] Added : 394 causal constraints over 80 iterations in 2706 ms. Result :sat
[2020-05-28 03:05:18] [INFO ] [Real]Absence check using 201 positive place invariants in 56 ms returned sat
[2020-05-28 03:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:18] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-05-28 03:05:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 52 ms returned sat
[2020-05-28 03:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:19] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2020-05-28 03:05:19] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2020-05-28 03:05:21] [INFO ] Added : 395 causal constraints over 80 iterations in 2636 ms. Result :sat
[2020-05-28 03:05:21] [INFO ] [Real]Absence check using 201 positive place invariants in 53 ms returned sat
[2020-05-28 03:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:22] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-05-28 03:05:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 8 ms returned unsat
[2020-05-28 03:05:22] [INFO ] [Real]Absence check using 201 positive place invariants in 64 ms returned sat
[2020-05-28 03:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:22] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-05-28 03:05:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 53 ms returned sat
[2020-05-28 03:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:23] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2020-05-28 03:05:23] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 20 ms.
[2020-05-28 03:05:26] [INFO ] Added : 397 causal constraints over 80 iterations in 3168 ms. Result :sat
[2020-05-28 03:05:26] [INFO ] [Real]Absence check using 201 positive place invariants in 54 ms returned sat
[2020-05-28 03:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:26] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2020-05-28 03:05:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:27] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2020-05-28 03:05:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 16 ms.
[2020-05-28 03:05:30] [INFO ] Added : 400 causal constraints over 81 iterations in 2981 ms. Result :sat
[2020-05-28 03:05:30] [INFO ] [Real]Absence check using 201 positive place invariants in 93 ms returned sat
[2020-05-28 03:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:30] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-05-28 03:05:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 126 ms returned sat
[2020-05-28 03:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:31] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2020-05-28 03:05:31] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2020-05-28 03:05:35] [INFO ] Added : 397 causal constraints over 80 iterations in 3636 ms. Result :sat
[2020-05-28 03:05:35] [INFO ] [Real]Absence check using 201 positive place invariants in 91 ms returned sat
[2020-05-28 03:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:35] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2020-05-28 03:05:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 59 ms returned sat
[2020-05-28 03:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:36] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2020-05-28 03:05:36] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 17 ms.
[2020-05-28 03:05:39] [INFO ] Added : 397 causal constraints over 80 iterations in 3279 ms. Result :sat
[2020-05-28 03:05:39] [INFO ] [Real]Absence check using 201 positive place invariants in 80 ms returned sat
[2020-05-28 03:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:40] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2020-05-28 03:05:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 9 ms returned unsat
[2020-05-28 03:05:40] [INFO ] [Real]Absence check using 201 positive place invariants in 66 ms returned sat
[2020-05-28 03:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:40] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2020-05-28 03:05:40] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 37 ms.
[2020-05-28 03:05:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 55 ms returned sat
[2020-05-28 03:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:41] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-05-28 03:05:41] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:05:44] [INFO ] Added : 397 causal constraints over 80 iterations in 3393 ms. Result :sat
[2020-05-28 03:05:44] [INFO ] [Real]Absence check using 201 positive place invariants in 81 ms returned sat
[2020-05-28 03:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:45] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2020-05-28 03:05:45] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 22 ms.
[2020-05-28 03:05:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 76 ms returned sat
[2020-05-28 03:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:46] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2020-05-28 03:05:46] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 38 ms.
[2020-05-28 03:05:49] [INFO ] Added : 398 causal constraints over 81 iterations in 3719 ms. Result :sat
[2020-05-28 03:05:49] [INFO ] [Real]Absence check using 201 positive place invariants in 89 ms returned sat
[2020-05-28 03:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:50] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-05-28 03:05:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:05:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2020-05-28 03:05:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:05:50] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2020-05-28 03:05:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 16 ms.
[2020-05-28 03:05:54] [INFO ] Added : 400 causal constraints over 81 iterations in 3364 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-28 03:05:54] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-28 03:05:54] [INFO ] Flatten gal took : 192 ms
FORMULA ShieldRVt-PT-050A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 03:05:54] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 03:05:54] [INFO ] Applying decomposition
[2020-05-28 03:05:55] [INFO ] Flatten gal took : 98 ms
[2020-05-28 03:05:55] [INFO ] Input system was already deterministic with 402 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/graph4861754493339870720.txt, -o, /tmp/graph4861754493339870720.bin, -w, /tmp/graph4861754493339870720.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/graph4861754493339870720.bin, -l, -1, -v, -w, /tmp/graph4861754493339870720.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 402 rows 403 cols
[2020-05-28 03:05:55] [INFO ] Computed 201 place invariants in 8 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p331 + p332 = 1
inv : p0 + p321 + p322 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p351 + p352 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p311 + p312 = 1
inv : p0 + p291 + p292 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p401 + p402 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p391 + p392 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p241 + p242 = 1
inv : p0 + p215 + p216 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p387 + p388 = 1
inv : p0 + p285 + p286 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p367 + p368 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p271 + p272 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p361 + p362 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p385 + p386 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p317 + p318 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p315 + p316 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p327 + p328 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p363 + p364 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p171 + p172 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p339 + p340 = 1
inv : p0 + p165 + p166 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p333 + p334 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p205 + p206 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p357 + p358 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p211 + p212 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p275 + p276 = 1
inv : p0 + p281 + p282 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p217 + p218 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p173 + p174 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p163 + p164 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p213 + p214 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p273 + p274 = 1
inv : p0 + p369 + p370 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p379 + p380 = 1
inv : p0 + p359 + p360 = 1
inv : p0 + p283 + p284 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p289 + p290 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p373 + p374 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p279 + p280 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p323 + p324 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p349 + p350 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p309 + p310 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p239 + p240 = 1
inv : p0 + p329 + p330 = 1
inv : p0 + p393 + p394 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p169 + p170 = 1
inv : p0 + p233 + p234 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p395 + p396 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p207 + p208 = 1
inv : p0 + p355 + p356 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p365 + p366 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p325 + p326 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p347 + p348 = 1
inv : p0 + p167 + p168 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p209 + p210 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p383 + p384 = 1
inv : p0 + p319 + p320 = 1
inv : p0 + p255 + p256 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p389 + p390 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p243 + p244 = 1
inv : p0 + p313 + p314 = 1
inv : p0 + p377 + p378 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p249 + p250 = 1
Total of 201 invariants.
[2020-05-28 03:05:55] [INFO ] Computed 201 place invariants in 22 ms
[2020-05-28 03:05:55] [INFO ] Decomposing Gal with order
[2020-05-28 03:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 03:05:55] [INFO ] Removed a total of 150 redundant transitions.
[2020-05-28 03:05:55] [INFO ] Flatten gal took : 64 ms
[2020-05-28 03:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2020-05-28 03:05:55] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 24 ms
[2020-05-28 03:05:55] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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 10 LTL properties
Checking formula 0 : !((F(G((!(G("((i21.i0.u195.p391==0)||(i13.i1.u117.p235==1))")))||(!(G(F("(i10.i1.u95.p191==1)"))))))))
Formula 0 simplified : !FG(!G"((i21.i0.u195.p391==0)||(i13.i1.u117.p235==1))" | !GF"(i10.i1.u95.p191==1)")
built 22 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 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 20 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 20 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 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 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 20 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 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 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
5 transitions explored
4 items max in DFS search stack
8 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.179485,21888,1,0,4532,101,1468,7101,65,154,10171
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F(!((X("((i20.i2.u189.p379==0)||(i17.i0.u154.p309==1))"))U("((i12.i0.u108.p217==0)||(i18.i1.u168.p338==1))"))))))
Formula 1 simplified : F!(X"((i20.i2.u189.p379==0)||(i17.i0.u154.p309==1))" U "((i12.i0.u108.p217==0)||(i18.i1.u168.p338==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.184912,22296,1,0,5110,101,1518,8107,66,154,11084
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F((G("((i3.i0.u30.p62==0)||(i14.i0.u125.p252==1))"))&&("((i13.i0.u115.p231==0)||(i1.i1.u14.p30==1))")))))
Formula 2 simplified : !GF("((i13.i0.u115.p231==0)||(i1.i1.u14.p30==1))" & G"((i3.i0.u30.p62==0)||(i14.i0.u125.p252==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
4 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.227161,23344,1,0,10772,101,1637,21553,67,154,17629
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(((X(!(X("((i20.i2.u192.p386==0)||(i16.i1.u147.p296==1))"))))||("((i2.i2.u25.p51!=0)&&(i21.i1.u200.p401!=1))"))U(!(F(!(X("((i20.i2.u192.p386==0)||(i16.i1.u147.p296==1))"))))))))
Formula 3 simplified : !X(("((i2.i2.u25.p51!=0)&&(i21.i1.u200.p401!=1))" | X!X"((i20.i2.u192.p386==0)||(i16.i1.u147.p296==1))") U !F!X"((i20.i2.u192.p386==0)||(i16.i1.u147.p296==1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.237339,24776,1,0,11886,101,1679,23418,68,154,19070
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F("((i1.i0.u11.p24!=0)&&(i7.i0.u61.p123!=1))")))
Formula 4 simplified : !F"((i1.i0.u11.p24!=0)&&(i7.i0.u61.p123!=1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.238977,24776,1,0,11887,101,1740,23424,69,154,19220
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-050A-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X("(((i8.i0.u74.p150==1)||(i4.i0.u39.p80==0))||(i10.i0.u89.p179==1))"))))
Formula 5 simplified : !GX"(((i8.i0.u74.p150==1)||(i4.i0.u39.p80==0))||(i10.i0.u89.p179==1))"
[2020-05-28 03:05:57] [INFO ] Proved 403 variables to be positive in 2466 ms
[2020-05-28 03:05:58] [INFO ] Computing symmetric may disable matrix : 402 transitions.
[2020-05-28 03:05:58] [INFO ] Computation of disable matrix completed :0/402 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:05:58] [INFO ] Computation of Complete disable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:05:58] [INFO ] Computing symmetric may enable matrix : 402 transitions.
[2020-05-28 03:05:58] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:06:04] [INFO ] Computing symmetric co enabling matrix : 402 transitions.
[2020-05-28 03:06:07] [INFO ] Computation of co-enabling matrix(0/402) took 3418 ms. Total solver calls (SAT/UNSAT): 401(0/401)
[2020-05-28 03:06:10] [INFO ] Computation of co-enabling matrix(112/402) took 6421 ms. Total solver calls (SAT/UNSAT): 709(112/597)
[2020-05-28 03:06:13] [INFO ] Computation of co-enabling matrix(258/402) took 9444 ms. Total solver calls (SAT/UNSAT): 1270(306/964)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2022 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.4645,437672,1,0,540945,101,1796,2.8147e+06,69,154,176689
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F(X(X(((X(F(F(X("((i14.i0.u126.p253==0)||(i5.i1.u49.p99==1))")))))||("(i0.i0.u1.p4==0)"))||("(i0.i0.u1.p4==1)")))))))
Formula 6 simplified : FXX("(i0.i0.u1.p4==0)" | "(i0.i0.u1.p4==1)" | XFX"((i14.i0.u126.p253==0)||(i5.i1.u49.p99==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,20.4671,438064,1,0,540970,101,1829,2.8147e+06,75,154,177004
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((F("((i5.i1.u49.p99!=0)&&(i5.i1.u50.p101!=1))"))||(F(X("(((i5.i1.u49.p99==0)||(i5.i1.u50.p101==1))&&((i2.i1.u21.p43==0)||(i11.u97.p196==1)))"))))))
Formula 7 simplified : !F(F"((i5.i1.u49.p99!=0)&&(i5.i1.u50.p101!=1))" | FX"(((i5.i1.u49.p99==0)||(i5.i1.u50.p101==1))&&((i2.i1.u21.p43==0)||(i11.u97.p196==1)))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.4684,438064,1,0,540970,101,1880,2.8147e+06,75,154,177086
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-050A-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(!(G(F("((i20.i0.u181.p364==0)||(i4.i0.u40.p81==1))")))))))
Formula 8 simplified : !GF!GF"((i20.i0.u181.p364==0)||(i4.i0.u40.p81==1))"
[2020-05-28 03:06:16] [INFO ] Computation of co-enabling matrix(388/402) took 12451 ms. Total solver calls (SAT/UNSAT): 1443(349/1094)
[2020-05-28 03:06:17] [INFO ] Computation of Finished co-enabling matrix. took 12855 ms. Total solver calls (SAT/UNSAT): 1449(349/1100)
[2020-05-28 03:06:17] [INFO ] Computing Do-Not-Accords matrix : 402 transitions.
[2020-05-28 03:06:17] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:06:17] [INFO ] Built C files in 22486ms 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]
Compilation finished in 4082 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(!( [](<>((LTLAP15==true)))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(!( [](<>((LTLAP15==true)))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(!( [](<>((LTLAP15==true)))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-28 03:26:16] [INFO ] Applying decomposition
[2020-05-28 03:26:16] [INFO ] Flatten gal took : 52 ms
[2020-05-28 03:26:16] [INFO ] Decomposing Gal with order
[2020-05-28 03:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 03:26:16] [INFO ] Removed a total of 150 redundant transitions.
[2020-05-28 03:26:16] [INFO ] Flatten gal took : 83 ms
[2020-05-28 03:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2020-05-28 03:26:16] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 24 ms
[2020-05-28 03:26:16] [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 2 LTL properties
Checking formula 0 : !((G(F(!(G(F("((u182.p364==0)||(u41.p81==1))")))))))
Formula 0 simplified : !GF!GF"((u182.p364==0)||(u41.p81==1))"
built 202 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-28 03:46:36] [INFO ] Flatten gal took : 38 ms
[2020-05-28 03:46:36] [INFO ] Input system was already deterministic with 402 transitions.
[2020-05-28 03:46:36] [INFO ] Transformed 403 places.
[2020-05-28 03:46:36] [INFO ] Transformed 402 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-28 03:46:36] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-28 03:46:36] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(!(G(F("((p364==0)||(p81==1))")))))))
Formula 0 simplified : !GF!GF"((p364==0)||(p81==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
BK_TIME_CONFINEMENT_REACHED
--------------------
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-050A"
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-050A, 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-159033476601065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050A.tgz
mv ShieldRVt-PT-050A 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 '
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 ;