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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.630 3600000.00 3648274.00 4871.50 FTFTTFTTTFT????? 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-159033475500316.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-020A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.2K May 14 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:05 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 105K 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-020A-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-020A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590582045693

[2020-05-27 12:20:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:20:48] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2020-05-27 12:20:48] [INFO ] Transformed 383 places.
[2020-05-27 12:20:48] [INFO ] Transformed 283 transitions.
[2020-05-27 12:20:48] [INFO ] Found NUPN structural information;
[2020-05-27 12:20:48] [INFO ] Parsed PT model containing 383 places and 283 transitions in 168 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 673 ms. (steps per millisecond=148 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 282 rows 383 cols
[2020-05-27 12:20:49] [INFO ] Computed 181 place invariants in 11 ms
[2020-05-27 12:20:49] [INFO ] [Real]Absence check using 181 positive place invariants in 94 ms returned sat
[2020-05-27 12:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:20:49] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-05-27 12:20:50] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 26 ms.
[2020-05-27 12:20:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:20:50] [INFO ] [Nat]Absence check using 181 positive place invariants in 124 ms returned sat
[2020-05-27 12:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:20:50] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2020-05-27 12:20:50] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 15 ms.
[2020-05-27 12:20:52] [INFO ] Added : 281 causal constraints over 59 iterations in 2011 ms. Result :sat
[2020-05-27 12:20:52] [INFO ] [Real]Absence check using 181 positive place invariants in 102 ms returned sat
[2020-05-27 12:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:20:53] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-05-27 12:20:53] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 55 ms.
[2020-05-27 12:20:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:20:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-05-27 12:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:20:54] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2020-05-27 12:20:54] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 34 ms.
[2020-05-27 12:20:55] [INFO ] Added : 279 causal constraints over 56 iterations in 1649 ms. Result :sat
[2020-05-27 12:20:56] [INFO ] [Real]Absence check using 181 positive place invariants in 341 ms returned sat
[2020-05-27 12:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:20:56] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2020-05-27 12:20:56] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 21 ms.
[2020-05-27 12:20:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:20:57] [INFO ] [Nat]Absence check using 181 positive place invariants in 82 ms returned sat
[2020-05-27 12:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:20:57] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2020-05-27 12:20:57] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 22 ms.
[2020-05-27 12:20:59] [INFO ] Added : 270 causal constraints over 56 iterations in 2395 ms. Result :sat
[2020-05-27 12:21:00] [INFO ] [Real]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-05-27 12:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:00] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2020-05-27 12:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:00] [INFO ] [Nat]Absence check using 181 positive place invariants in 144 ms returned sat
[2020-05-27 12:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:01] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2020-05-27 12:21:01] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 28 ms.
[2020-05-27 12:21:02] [INFO ] Added : 277 causal constraints over 57 iterations in 1351 ms. Result :sat
[2020-05-27 12:21:02] [INFO ] [Real]Absence check using 181 positive place invariants in 88 ms returned sat
[2020-05-27 12:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:03] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2020-05-27 12:21:03] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 28 ms.
[2020-05-27 12:21:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:03] [INFO ] [Nat]Absence check using 181 positive place invariants in 97 ms returned sat
[2020-05-27 12:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:04] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2020-05-27 12:21:04] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-05-27 12:21:06] [INFO ] Added : 277 causal constraints over 57 iterations in 2187 ms. Result :sat
[2020-05-27 12:21:06] [INFO ] [Real]Absence check using 181 positive place invariants in 201 ms returned sat
[2020-05-27 12:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:07] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2020-05-27 12:21:07] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 33 ms.
[2020-05-27 12:21:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 73 ms returned sat
[2020-05-27 12:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:08] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2020-05-27 12:21:08] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-05-27 12:21:09] [INFO ] Added : 278 causal constraints over 57 iterations in 1884 ms. Result :sat
[2020-05-27 12:21:10] [INFO ] [Real]Absence check using 181 positive place invariants in 71 ms returned sat
[2020-05-27 12:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:10] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2020-05-27 12:21:10] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 17 ms.
[2020-05-27 12:21:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 76 ms returned sat
[2020-05-27 12:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:11] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2020-05-27 12:21:11] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 12 ms.
[2020-05-27 12:21:12] [INFO ] Added : 272 causal constraints over 56 iterations in 1640 ms. Result :sat
[2020-05-27 12:21:12] [INFO ] [Real]Absence check using 181 positive place invariants in 72 ms returned sat
[2020-05-27 12:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:13] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2020-05-27 12:21:13] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 16 ms.
[2020-05-27 12:21:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:13] [INFO ] [Nat]Absence check using 181 positive place invariants in 69 ms returned sat
[2020-05-27 12:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:13] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2020-05-27 12:21:13] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 28 ms.
[2020-05-27 12:21:15] [INFO ] Added : 276 causal constraints over 58 iterations in 1587 ms. Result :sat
[2020-05-27 12:21:15] [INFO ] [Real]Absence check using 181 positive place invariants in 71 ms returned sat
[2020-05-27 12:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:15] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2020-05-27 12:21:15] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 10 ms.
[2020-05-27 12:21:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:16] [INFO ] [Nat]Absence check using 181 positive place invariants in 51 ms returned sat
[2020-05-27 12:21:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:16] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2020-05-27 12:21:16] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 16 ms.
[2020-05-27 12:21:17] [INFO ] Added : 278 causal constraints over 57 iterations in 1415 ms. Result :sat
[2020-05-27 12:21:17] [INFO ] [Real]Absence check using 181 positive place invariants in 57 ms returned sat
[2020-05-27 12:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:18] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2020-05-27 12:21:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:18] [INFO ] [Nat]Absence check using 181 positive place invariants in 73 ms returned sat
[2020-05-27 12:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:18] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2020-05-27 12:21:18] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 24 ms.
[2020-05-27 12:21:20] [INFO ] Added : 279 causal constraints over 57 iterations in 1381 ms. Result :sat
[2020-05-27 12:21:20] [INFO ] [Real]Absence check using 181 positive place invariants in 82 ms returned sat
[2020-05-27 12:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:20] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2020-05-27 12:21:20] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 27 ms.
[2020-05-27 12:21:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:20] [INFO ] [Nat]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-05-27 12:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:21] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2020-05-27 12:21:21] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-05-27 12:21:22] [INFO ] Added : 276 causal constraints over 57 iterations in 1650 ms. Result :sat
[2020-05-27 12:21:23] [INFO ] [Real]Absence check using 181 positive place invariants in 82 ms returned sat
[2020-05-27 12:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:23] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2020-05-27 12:21:23] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 16 ms.
[2020-05-27 12:21:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:23] [INFO ] [Nat]Absence check using 181 positive place invariants in 87 ms returned sat
[2020-05-27 12:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:24] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2020-05-27 12:21:24] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 18 ms.
[2020-05-27 12:21:26] [INFO ] Added : 274 causal constraints over 56 iterations in 1978 ms. Result :sat
[2020-05-27 12:21:26] [INFO ] [Real]Absence check using 181 positive place invariants in 56 ms returned sat
[2020-05-27 12:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:26] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-05-27 12:21:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:21:26] [INFO ] [Nat]Absence check using 181 positive place invariants in 74 ms returned sat
[2020-05-27 12:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:21:27] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2020-05-27 12:21:27] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 21 ms.
[2020-05-27 12:21:28] [INFO ] Added : 280 causal constraints over 58 iterations in 1962 ms. Result :sat
[2020-05-27 12:21:29] [INFO ] Flatten gal took : 92 ms
[2020-05-27 12:21:29] [INFO ] Flatten gal took : 38 ms
[2020-05-27 12:21:29] [INFO ] Applying decomposition
[2020-05-27 12:21:29] [INFO ] Flatten gal took : 34 ms
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/graph1719373190427202839.txt, -o, /tmp/graph1719373190427202839.bin, -w, /tmp/graph1719373190427202839.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/graph1719373190427202839.bin, -l, -1, -v, -w, /tmp/graph1719373190427202839.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:21:29] [INFO ] Decomposing Gal with order
[2020-05-27 12:21:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:21:29] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-27 12:21:29] [INFO ] Flatten gal took : 80 ms
[2020-05-27 12:21:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2020-05-27 12:21:30] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 13 ms
[2020-05-27 12:21:30] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 20 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 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 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 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 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 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 9 ordering constraints for composite.
built 7 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 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 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 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 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 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 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 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65846e+56,0.287255,13048,122,15,17311,351,496,32899,31,1353,0


Converting to forward existential form...Done !
original formula: !(EF((((i3.u26.p65==1)&&(i3.u31.p76==1))&&(((((i9.i2.u91.p220==1)&&(i11.i1.u93.p224==1))&&(i11.i2.u96.p230==1))||((i8.i0.u66.p159==1)&&(i8.i0.u66.p161==1)))||((((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))&&(i5.i2.u42.p103==1))&&(i5.i3.u47.p114==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i3.u26.p65==1)&&(i3.u31.p76==1))&&(((((i9.i2.u91.p220==1)&&(i11.i1.u93.p224==1))&&(i11.i2.u96.p230==1))||((i8.i0.u66.p159==1)&&(i8.i0.u66.p161==1)))||((((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))&&(i5.i2.u42.p103==1))&&(i5.i3.u47.p114==1)))))] = FALSE
(forward)formula 0,0,0.290322,13484,1,0,17311,351,569,32899,44,1353,114
FORMULA ShieldIIPt-PT-020A-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(((i9.i2.u85.p204==1)&&(i15.i3.u127.p303==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i9.i2.u85.p204==1)&&(i15.i3.u127.p303==1)))] != FALSE
(forward)formula 1,1,0.290819,13484,1,0,17311,351,574,32899,44,1353,138
FORMULA ShieldIIPt-PT-020A-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG((((((((i0.i1.u1.p4!=1)||(i0.i3.u6.p17!=1))&&(((i7.i1.u58.p140==1)&&(i7.i1.u58.p142==1))||((i17.i0.u137.p326==1)&&(i17.i0.u144.p343==1))))||(i15.i1.u125.p299!=1))||(i15.i1.u131.p314!=1))||(i0.i0.u0.p2!=1))||(i0.i0.u3.p10!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((i0.i1.u1.p4!=1)||(i0.i3.u6.p17!=1))&&(((i7.i1.u58.p140==1)&&(i7.i1.u58.p142==1))||((i17.i0.u137.p326==1)&&(i17.i0.u144.p343==1))))||(i15.i1.u125.p299!=1))||(i15.i1.u131.p314!=1))||(i0.i0.u0.p2!=1))||(i0.i0.u3.p10!=1))))] = FALSE
(forward)formula 2,0,0.29298,13484,1,0,17311,351,628,32899,48,1353,304
FORMULA ShieldIIPt-PT-020A-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(((i0.i3.u2.p8==1)&&(i0.i0.u7.p19==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i0.i3.u2.p8==1)&&(i0.i0.u7.p19==1)))] != FALSE
(forward)formula 3,1,0.29343,13484,1,0,17311,351,636,32899,48,1353,355
FORMULA ShieldIIPt-PT-020A-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(((i12.i1.u98.p235==1)&&(i12.i1.u98.p237==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i12.i1.u98.p235==1)&&(i12.i1.u98.p237==1)))] != FALSE
(forward)formula 4,1,0.293868,13484,1,0,17311,351,640,32899,48,1353,374
FORMULA ShieldIIPt-PT-020A-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (!(EF((i3.u32.p77==1))) * EF((i7.i0.u64.p153!=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i3.u32.p77==1))] = FALSE * [(Init * !(E(TRUE U (i7.i0.u64.p153!=1))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 5,0,0.313696,13484,1,0,17311,351,1991,32899,126,1353,4599
FORMULA ShieldIIPt-PT-020A-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EF(((i6.i1.u49.p117==1)&&(i6.i1.u56.p134==1))) * EF(((((i16.u124.p297==1)&&(i16.u135.p322==1))&&(i5.i2.u42.p103==1))&&(i5.i3.u47.p114==1))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((i6.i1.u49.p117==1)&&(i6.i1.u56.p134==1)))),TRUE) * ((((i16.u124.p297==1)&&(i16.u135.p322==1))&&(i5.i2.u42.p103==1))&&(i5.i3.u47.p114==1)))] != FALSE
(forward)formula 6,1,0.460735,15068,1,0,20946,351,2681,39887,131,1353,40482
FORMULA ShieldIIPt-PT-020A-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(EX(((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1)))] != FALSE
(forward)formula 7,1,0.466598,15332,1,0,21510,351,2728,41177,131,1353,41266
FORMULA ShieldIIPt-PT-020A-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EF(((((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))&&(i12.i1.u98.p235==1))&&(i12.i1.u98.p237==1))) * AX((((((i11.i1.u90.p214==1)&&(i11.i2.u94.p225==1))||(i10.u77.p185!=1))||(i3.u29.p71!=1))||(i3.u35.p86!=1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))&&(i12.i1.u98.p235==1))&&(i12.i1.u98.p237==1)))))] = FALSE * [(EY(Init) * !((((((i11.i1.u90.p214==1)&&(i11.i2.u94.p225==1))||(i10.u77.p185!=1))||(i3.u29.p71!=1))||(i3.u35.p86!=1))))] = FALSE)
(forward)formula 8,1,0.472624,15860,1,0,21964,351,2750,42144,131,1353,42433
FORMULA ShieldIIPt-PT-020A-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG((((i13.i2.u109.p261!=1)||(i13.i2.u115.p276!=1))||(((i15.i2.u122.p292!=1)||(i15.i2.u122.p294!=1))&&((i12.i1.u98.p233!=1)||(i12.i2.u102.p244!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i13.i2.u109.p261!=1)||(i13.i2.u115.p276!=1))||(((i15.i2.u122.p292!=1)||(i15.i2.u122.p294!=1))&&((i12.i1.u98.p233!=1)||(i12.i2.u102.p244!=1))))))] = FALSE
(forward)formula 9,0,0.473686,15860,1,0,21997,351,2778,42188,134,1353,42500
FORMULA ShieldIIPt-PT-020A-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(EF(((i11.i1.u93.p223==1)&&(i11.i1.u99.p238==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((i11.i1.u93.p223==1)&&(i11.i1.u99.p238==1)))))] = FALSE
(forward)formula 10,1,0.474824,15860,1,0,22078,351,2785,42328,134,1353,42697
FORMULA ShieldIIPt-PT-020A-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2020-05-27 12:41:43] [INFO ] Applying decomposition
[2020-05-27 12:41:43] [INFO ] Flatten gal took : 39 ms
[2020-05-27 12:41:43] [INFO ] Decomposing Gal with order
[2020-05-27 12:41:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:41:43] [INFO ] Removed a total of 80 redundant transitions.
[2020-05-27 12:41:43] [INFO ] Flatten gal took : 38 ms
[2020-05-27 12:41:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-27 12:41:43] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2020-05-27 12:41:43] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
built 181 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65846e+56,0.488552,25708,334,5,45996,559,832,59306,12,418,0


Converting to forward existential form...Done !
original formula: E((((u151.p286!=1) * EF((((u177.p336==1)&&(u180.p342==1))&&(u181.p344==1)))) * ((i90.u115.p217!=1)||(u120.p228!=1))) U AX(((u79.p149==1)||(((u56.p106==1)&&(u58.p110==1))&&(u61.p116==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(((u151.p286!=1) * E(TRUE U (((u177.p336==1)&&(u180.p342==1))&&(u181.p344==1)))) * ((i90.u115.p217!=1)||(u120.p228!=1)))) * !(EX(!(((u79.p149==1)||(((u56.p106==1)&&(u58.p110==1))&&(u61.p116==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-27 13:01:56] [INFO ] Flatten gal took : 29 ms
[2020-05-27 13:01:56] [INFO ] Input system was already deterministic with 282 transitions.
[2020-05-27 13:01:56] [INFO ] Transformed 383 places.
[2020-05-27 13:01:56] [INFO ] Transformed 282 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-27 13:01:56] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-27 13:01:56] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.65846e+56,0.828437,36216,2,5154,5,136849,6,0,1816,157749,0


Converting to forward existential form...Done !
original formula: E((((p286!=1) * EF((((p336==1)&&(p342==1))&&(p344==1)))) * ((p217!=1)||(p228!=1))) U AX(((p149==1)||(((p106==1)&&(p110==1))&&(p116==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(((p286!=1) * E(TRUE U (((p336==1)&&(p342==1))&&(p344==1)))) * ((p217!=1)||(p228!=1)))) * !(EX(!(((p149==1)||(((p106==1)&&(p110==1))&&(p116==1)))))))] != FALSE
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-020A"
export BK_EXAMINATION="CTLFireability"
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-020A, examination is CTLFireability"
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-159033475500316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020A.tgz
mv ShieldIIPt-PT-020A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;