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

About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15780.620 3600000.00 3512633.00 111784.00 ?????????????F?? 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.r126-tajo-158961390300436.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 PolyORBLF-PT-S02J06T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390300436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 9.5K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.1K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 9 17:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 9 17:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 983K Mar 24 05:37 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 PolyORBLF-PT-S02J06T06-CTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589817828569

[2020-05-18 16:03:50] [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-18 16:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 16:03:50] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2020-05-18 16:03:50] [INFO ] Transformed 536 places.
[2020-05-18 16:03:50] [INFO ] Transformed 1064 transitions.
[2020-05-18 16:03:50] [INFO ] Parsed PT model containing 536 places and 1064 transitions in 233 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 81 ms.
Incomplete random walk after 100000 steps, including 33 resets, run finished after 495 ms. (steps per millisecond=202 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1]
[2020-05-18 16:03:51] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2020-05-18 16:03:51] [INFO ] Computed 50 place invariants in 90 ms
[2020-05-18 16:03:51] [INFO ] [Real]Absence check using 19 positive place invariants in 39 ms returned sat
[2020-05-18 16:03:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 48 ms returned sat
[2020-05-18 16:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:03:53] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2020-05-18 16:03:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:03:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2020-05-18 16:03:53] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 37 ms returned sat
[2020-05-18 16:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:03:55] [INFO ] [Nat]Absence check using state equation in 2456 ms returned sat
[2020-05-18 16:03:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-05-18 16:03:56] [INFO ] [Nat]Added 78 Read/Feed constraints in 727 ms returned sat
[2020-05-18 16:03:57] [INFO ] Deduced a trap composed of 328 places in 462 ms
[2020-05-18 16:04:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 16:04:01] [INFO ] Deduced a trap composed of 73 places in 80 ms
[2020-05-18 16:04:04] [INFO ] Deduced a trap composed of 246 places in 415 ms
[2020-05-18 16:04:04] [INFO ] Deduced a trap composed of 15 places in 408 ms
[2020-05-18 16:04:05] [INFO ] Deduced a trap composed of 74 places in 78 ms
[2020-05-18 16:04:06] [INFO ] Deduced a trap composed of 73 places in 366 ms
[2020-05-18 16:04:07] [INFO ] Deduced a trap composed of 113 places in 403 ms
[2020-05-18 16:04:08] [INFO ] Deduced a trap composed of 305 places in 376 ms
[2020-05-18 16:04:09] [INFO ] Deduced a trap composed of 75 places in 113 ms
[2020-05-18 16:04:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 13276 ms
[2020-05-18 16:04:09] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 90 ms.
[2020-05-18 16:04:13] [INFO ] Added : 35 causal constraints over 7 iterations in 3423 ms. Result :(error "Failed to check-sat")
[2020-05-18 16:04:13] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2020-05-18 16:04:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 27 ms returned unsat
[2020-05-18 16:04:13] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2020-05-18 16:04:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 30 ms returned sat
[2020-05-18 16:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:04:16] [INFO ] [Real]Absence check using state equation in 3325 ms returned sat
[2020-05-18 16:04:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:04:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 112 ms returned sat
[2020-05-18 16:04:17] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 44 ms returned sat
[2020-05-18 16:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:04:21] [INFO ] [Nat]Absence check using state equation in 4536 ms returned sat
[2020-05-18 16:04:21] [INFO ] [Nat]Added 78 Read/Feed constraints in 342 ms returned sat
[2020-05-18 16:04:22] [INFO ] Deduced a trap composed of 37 places in 448 ms
[2020-05-18 16:04:22] [INFO ] Deduced a trap composed of 75 places in 68 ms
[2020-05-18 16:04:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1284 ms
[2020-05-18 16:04:23] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 149 ms.
[2020-05-18 16:04:36] [INFO ] Added : 340 causal constraints over 68 iterations in 13630 ms. Result :(error "Failed to check-sat")
[2020-05-18 16:04:37] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned sat
[2020-05-18 16:04:37] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 67 ms returned sat
[2020-05-18 16:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:04:39] [INFO ] [Real]Absence check using state equation in 2333 ms returned sat
[2020-05-18 16:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:04:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2020-05-18 16:04:39] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 30 ms returned sat
[2020-05-18 16:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:04:41] [INFO ] [Nat]Absence check using state equation in 2203 ms returned sat
[2020-05-18 16:04:42] [INFO ] [Nat]Added 78 Read/Feed constraints in 436 ms returned sat
[2020-05-18 16:04:42] [INFO ] Deduced a trap composed of 37 places in 302 ms
[2020-05-18 16:04:43] [INFO ] Deduced a trap composed of 74 places in 74 ms
[2020-05-18 16:04:43] [INFO ] Deduced a trap composed of 75 places in 76 ms
[2020-05-18 16:04:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1143 ms
[2020-05-18 16:04:43] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 77 ms.
[2020-05-18 16:04:59] [INFO ] Added : 475 causal constraints over 95 iterations in 16127 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-18 16:04:59] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2020-05-18 16:04:59] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 35 ms returned sat
[2020-05-18 16:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:05:01] [INFO ] [Real]Absence check using state equation in 1705 ms returned sat
[2020-05-18 16:05:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:05:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2020-05-18 16:05:01] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 35 ms returned sat
[2020-05-18 16:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:05:03] [INFO ] [Nat]Absence check using state equation in 2134 ms returned sat
[2020-05-18 16:05:04] [INFO ] [Nat]Added 78 Read/Feed constraints in 637 ms returned sat
[2020-05-18 16:05:04] [INFO ] Deduced a trap composed of 37 places in 303 ms
[2020-05-18 16:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 700 ms
[2020-05-18 16:05:05] [INFO ] Computed and/alt/rep : 966/12574/954 causal constraints in 87 ms.
[2020-05-18 16:05:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t178 0) (and (or (and (> t27 0) (< o27 o178)) (and (> t49 0) (< o49 o178)) (and (> t61 0) (< o61 o178)) (and (> t89 0) (< o89 o178)) (and (> t118 0) (< o118 o178)) (and (> t132 0) (< o132 o178)) (and (> t142 0) (< o142 o178)) (and (> t161 0) (< o161 o178)) (and (> t212 0) (< o212 o178)) (and (> t227 0) (< o227 o178)) (and (> t253 0) (< o253 o178)) (and (> t278 0) (< o278 o178)) (and (> t286 0) (< o286 o178)) (and (> t345 0) (< o345 o178)) (and (> t365 0) (< o365 o178)) (and (> t382 0) (< o382 o178)) (and (> t452 0) (< o452 o178)) (and (> t455 0) (< o455 o178)) (and (> t464 0) (< o464 o178)) (and (> t475 0) (< o475 o178)) (and (> t485 0) (< o485 o178)) (and (> t531 0) (< o531 o178)) (and (> t536 0) (< o536 o178)) (and (> t555 0) (< o555 o178)) (and (> t613 0) (< o613 o178)) (and (> t620 0) (< o620 o178)) (and (> t623 0) (< o623 o178)) (and (> t628 0) (< o628 o178)) (and (> t639 0) (< o639 o178)) (and (> t688 0) (< o688 o178)) (and (> t728 0) (< o728 o178)) (and (> t748 0) (< o748 o178)) (and (> t763 0) (< o763 o178)) (and (> t776 0) (< o776 o178)) (and (> t788 0) (< o788 o178)) (and (> t811 0) (< o811 o178)) (and (> t839 0) (< o839 o178)) (and (> t842 0) (< o842 o178)) (and (> t925 0) (< o925 o178)) (and (> t927 0) (< o927 o178)) (and (> t931 0) (< o931 o178)) (and (> t944 0) (< o944 o178))) (and (> t518 0) (< o518 o178)) (or (and (> t102 0) (< o102 o178)) (and (> t107 0) (< o107 o178)) (and (> t267 0) (< o267 o178)) (and (> t318 0) (< o318 o178)) (and (> t781 0) (< o781 o178)) (and (> t930 0) (< o930 o178)))))") while checking expression at index 4
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 35 ms returned unsat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 47 ms returned unsat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2020-05-18 16:05:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 38 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-18 16:05:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 16:05:22] [INFO ] Flatten gal took : 153 ms
[2020-05-18 16:05:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 16:05:22] [INFO ] Flatten gal took : 65 ms
FORMULA PolyORBLF-PT-S02J06T06-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 16:05:22] [INFO ] Applying decomposition
[2020-05-18 16:05:22] [INFO ] Flatten gal took : 56 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/graph967045952652423773.txt, -o, /tmp/graph967045952652423773.bin, -w, /tmp/graph967045952652423773.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/graph967045952652423773.bin, -l, -1, -v, -w, /tmp/graph967045952652423773.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 16:05:22] [INFO ] Decomposing Gal with order
[2020-05-18 16:05:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 16:05:22] [INFO ] Removed a total of 709 redundant transitions.
[2020-05-18 16:05:22] [INFO ] Flatten gal took : 163 ms
[2020-05-18 16:05:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 27 ms.
[2020-05-18 16:05:23] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 18 ms
[2020-05-18 16:05:23] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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 15 CTL formulae.
built 97 ordering constraints for composite.
built 50 ordering constraints for composite.
built 46 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 25 ordering constraints for composite.
built 27 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 27 ordering constraints for composite.
built 81 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 67 ordering constraints for composite.
built 24 ordering constraints for composite.
built 27 ordering constraints for composite.
built 77 ordering constraints for composite.
built 26 ordering constraints for composite.
built 40 ordering constraints for composite.
built 35 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-18 16:25:53] [INFO ] Flatten gal took : 95 ms
[2020-05-18 16:25:53] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2020-05-18 16:25:53] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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, --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 --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2020-05-18 16:46:27] [INFO ] Flatten gal took : 637 ms
[2020-05-18 16:46:28] [INFO ] Input system was already deterministic with 968 transitions.
[2020-05-18 16:46:28] [INFO ] Transformed 536 places.
[2020-05-18 16:46:28] [INFO ] Transformed 968 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-18 16:46:58] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-18 16:46:58] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 6 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 15 CTL formulae.

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="PolyORBLF-PT-S02J06T06"
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 PolyORBLF-PT-S02J06T06, 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 r126-tajo-158961390300436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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