fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r235-smll-162106564600178
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
223.340 7949.00 18360.00 392.30 FTTTTTFTFFFTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564600178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-001A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564600178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.7K May 5 16:52 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-001A-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621239231149

Running Version 0
[2021-05-17 08:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 08:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 08:13:54] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-17 08:13:54] [INFO ] Transformed 11 places.
[2021-05-17 08:13:54] [INFO ] Transformed 11 transitions.
[2021-05-17 08:13:54] [INFO ] Found NUPN structural information;
[2021-05-17 08:13:54] [INFO ] Parsed PT model containing 11 places and 11 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 08:13:54] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 11 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 08:13:54] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-17 08:13:54] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 08:13:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 08:13:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 08:13:54] [INFO ] Computed 5 place invariants in 10 ms
[2021-05-17 08:13:54] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 10/10 transitions.
[2021-05-17 08:13:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-17 08:13:55] [INFO ] Flatten gal took : 40 ms
FORMULA ShieldRVt-PT-001A-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 08:13:55] [INFO ] Flatten gal took : 12 ms
[2021-05-17 08:13:55] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 993 ms. (steps per millisecond=100 ) properties (out of 80) seen :64
Running SMT prover for 16 properties.
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 08:13:56] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 08:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-17 08:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 08:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 08:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 08:13:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 08:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 08:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 08:13:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 08:13:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 08:13:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 14 simplifications.
Applied a total of 0 rules in 6 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Input system was already deterministic with 10 transitions.
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 2 ms
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8639549139657273742.gal : 2 ms
[2021-05-17 08:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9621312454376825148.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8639549139657273742.gal, -t, CGAL, -ctl, /tmp/CTLFireability9621312454376825148.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8639549139657273742.gal -t CGAL -ctl /tmp/CTLFireability9621312454376825148.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,33,0.014172,4180,2,26,5,264,6,0,56,272,0


Converting to forward existential form...Done !
original formula: EF((EG(((((((p0==1)||(((p4==1)&&(p5==1))&&(p8==1)))||(p5==1))||((p6==1)&&(p9==1)))||(p9==1))||((p1==1)&&(p7==1)))) * ((((p5==1)||(p9==1))||((p8==1)&&(p10==1)))||((p1==1)&&(p7==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * ((((p5==1)||(p9==1))||((p8==1)&&(p10==1)))||((p1==1)&&(p7==1)))),((((((p0==1)||(((p4==1)&&(p5==1))&&(p8==1)))||(p5==1))||((p6==1)&&(p9==1)))||(p9==1))||((p1==1)&&(p7==1))))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/10
(forward)formula 0,1,0.018702,4632,1,0,9,324,20,2,310,279,10
FORMULA ShieldRVt-PT-001A-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Applied a total of 0 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Input system was already deterministic with 10 transitions.
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 08:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability506155299274644697.gal : 1 ms
[2021-05-17 08:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17091268324050699550.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability506155299274644697.gal, -t, CGAL, -ctl, /tmp/CTLFireability17091268324050699550.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability506155299274644697.gal -t CGAL -ctl /tmp/CTLFireability17091268324050699550.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,33,0.006746,4380,2,26,5,264,6,0,56,272,0


Converting to forward existential form...Done !
original formula: EG(EF(((((((p3==1)||(p5==1))||(p9==1))||((p8==1)&&(p10==1)))||((p1==1)&&(p7==1)))||(((p2==1)&&(p4==1))&&(p10==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((((p3==1)||(p5==1))||(p9==1))||((p8==1)&&(p10==1)))||((p1==1)&&(p7==1)))||(((p2==1)&&(p4==1))&&(p10==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.014761,4820,1,0,6,421,18,1,312,416,11
FORMULA ShieldRVt-PT-001A-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-17 08:13:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 11 ms
FORMULA ShieldRVt-PT-001A-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 7 ms
[2021-05-17 08:13:57] [INFO ] Applying decomposition
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4418933651355799562.txt, -o, /tmp/graph4418933651355799562.bin, -w, /tmp/graph4418933651355799562.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4418933651355799562.bin, -l, -1, -v, -w, /tmp/graph4418933651355799562.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 08:13:57] [INFO ] Decomposing Gal with order
[2021-05-17 08:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 08:13:57] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-17 08:13:57] [INFO ] Flatten gal took : 62 ms
[2021-05-17 08:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 08:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9322596990038334937.gal : 2 ms
[2021-05-17 08:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13971531601789759267.ctl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9322596990038334937.gal, -t, CGAL, -ctl, /tmp/CTLFireability13971531601789759267.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9322596990038334937.gal -t CGAL -ctl /tmp/CTLFireability13971531601789759267.ctl
No direction supplied, using forward translation only.
Parsed 11 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,33,0.007764,4320,16,9,124,31,44,110,18,36,0


Converting to forward existential form...Done !
original formula: A((!(AG((((((i0.u0.p0==1)||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) + ((EX(((((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))&&((((i0.u0.p0==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))))&&(((((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) * AF((((((((i0.u0.p0==1)||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))&&(((i0.u3.p8==1)&&(u4.p10==1))||((u2.p6==1)&&(u4.p9==1)))))) * ((((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))||((i0.u3.p8==1)&&(u4.p10==1)))||((u2.p6==1)&&(u4.p9==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) U !(EF(EX((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U EX((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))))))))) * !(E(!(!(E(TRUE U EX((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1)))))) U (!((!(!(E(TRUE U !((((((i0.u0.p0==1)||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))) + ((EX(((((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))&&((((i0.u0.p0==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))))&&(((((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) * !(EG(!((((((((i0.u0.p0==1)||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))&&(((i0.u3.p8==1)&&(u4.p10==1))||((u2.p6==1)&&(u4.p9==1)))))))) * ((((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))||((i0.u3.p8==1)&&(u4.p10==1)))||((u2.p6==1)&&(u4.p9==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))))) * !(!(E(TRUE U EX((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.043998,5084,1,0,358,44,283,407,68,42,1219
FORMULA ShieldRVt-PT-001A-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(((AF(AX((((((((i0.u0.p0==0)&&(u1.p3==0))&&(u2.p5==0))&&((u2.p6==0)||(u4.p9==0)))&&(i0.u3.p7==0))&&(u4.p9==0))&&((i0.u0.p1==0)||(i0.u3.p7==0))))) + (i0.u0.p0==1)) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))))
=> equivalent forward existential formula: (([(EY(Init) * !(EG(!(!(EX(!((((((((i0.u0.p0==0)&&(u1.p3==0))&&(u2.p5==0))&&((u2.p6==0)||(u4.p9==0)))&&(i0.u3.p7==0))&&(u4.p9==0))&&((i0.u0.p1==0)||(i0.u3.p7==0))))))))))] = FALSE * [(EY(Init) * (i0.u0.p0==1))] = FALSE) * [(EY(Init) * (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))] = FALSE)
(forward)formula 1,1,0.050773,5084,1,0,373,44,337,451,72,42,1380
FORMULA ShieldRVt-PT-001A-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(((((((((((((AX((((((((((u1.p3==0)&&((i0.u3.p8==0)||(u4.p10==0)))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(u2.p5==0))&&((u2.p6==0)||(u4.p9==0)))&&(i0.u3.p7==0))&&(u4.p9==0))&&(((i0.u0.p2==0)||(u1.p4==0))||(u4.p10==0)))||((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))&&((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))))) * (((((i0.u0.p0==1)||(u2.p5==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((((((((u1.p3==0)&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&((i0.u3.p8==0)||(u4.p10==0)))&&(u2.p5==0))&&(u4.p9==0))&&(((i0.u0.p2==0)||(u1.p4==0))||(u4.p10==0)))&&(((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))))&&(i0.u0.p0==1)))) * ((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))) + ((u2.p6==1)&&(u4.p9==1))) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) + (i0.u0.p0==1)) + (u1.p3==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + ((i0.u3.p8==1)&&(u4.p10==1))) + (u2.p5==1)) + ((u2.p6==1)&&(u4.p9==1))) + (u4.p9==1)) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) + !(AF(((((((((((((AF(AG(((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1)))) * E(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) U (((i0.u0.p0==1)||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))))) * (((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) * ((((((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))) * ((((((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) * ((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) * ((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) + ((i0.u3.p8==1)&&(u4.p10==1))) + (u4.p9==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + (u2.p5==1)) + (i0.u3.p7==1)) + (u4.p9==1)))))
=> equivalent forward existential formula: ([FwdG(Init,((((((((((((!(EX(!((((((((((u1.p3==0)&&((i0.u3.p8==0)||(u4.p10==0)))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(u2.p5==0))&&((u2.p6==0)||(u4.p9==0)))&&(i0.u3.p7==0))&&(u4.p9==0))&&(((i0.u0.p2==0)||(u1.p4==0))||(u4.p10==0)))||((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))&&((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))))))) * (((((i0.u0.p0==1)||(u2.p5==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((((((((u1.p3==0)&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&((i0.u3.p8==0)||(u4.p10==0)))&&(u2.p5==0))&&(u4.p9==0))&&(((i0.u0.p2==0)||(u1.p4==0))||(u4.p10==0)))&&(((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))))&&(i0.u0.p0==1)))) * ((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))) + ((u2.p6==1)&&(u4.p9==1))) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) + (i0.u0.p0==1)) + (u1.p3==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + ((i0.u3.p8==1)&&(u4.p10==1))) + (u2.p5==1)) + ((u2.p6==1)&&(u4.p9==1))) + (u4.p9==1)) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))] != FALSE + [FwdG(Init,!(((((((((((((!(EG(!(!(E(TRUE U !(((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1)))))))) * E(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) U (((i0.u0.p0==1)||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))))) * (((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) * ((((((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))) * ((((((((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) * ((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) * ((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) + ((i0.u3.p8==1)&&(u4.p10==1))) + (u4.p9==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + (u2.p5==1)) + (i0.u3.p7==1)) + (u4.p9==1))))] != FALSE)
(forward)formula 2,1,0.110928,5084,1,0,598,44,408,724,73,46,1987
FORMULA ShieldRVt-PT-001A-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(!(E((((((u1.p3==0)&&((u2.p6==0)||(u4.p9==0)))&&((i0.u0.p1==0)||(i0.u3.p7==0)))&&((((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))&&((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) U ((u2.p6==1)&&(u4.p9==1))))) + EF(((i0.u3.p8==1)&&(u4.p10==1))))
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(TRUE U ((i0.u3.p8==1)&&(u4.p10==1)))))),(((((u1.p3==0)&&((u2.p6==0)||(u4.p9==0)))&&((i0.u0.p1==0)||(i0.u3.p7==0)))&&((((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))&&((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) * ((u2.p6==1)&&(u4.p9==1)))] = FALSE
(forward)formula 3,1,0.11579,5348,1,0,614,44,436,738,73,46,2067
FORMULA ShieldRVt-PT-001A-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(((((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) + E(((((((((EX(TRUE) + (u1.p3==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + ((i0.u3.p8==1)&&(u4.p10==1))) + ((u2.p6==1)&&(u4.p9==1))) + (i0.u3.p7==1)) + (u4.p9==1)) + ((i0.u0.p1==1)&&(i0.u3.p7==1))) + (((u2.p5==0)&&((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))&&((((((i0.u0.p0==1)||(u1.p3==1))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) U AX((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1))))))
=> equivalent forward existential formula: ([(EY(Init) * ((((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))] != FALSE + [(FwdU(Init,((((((((EX(TRUE) + (u1.p3==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + ((i0.u3.p8==1)&&(u4.p10==1))) + ((u2.p6==1)&&(u4.p9==1))) + (i0.u3.p7==1)) + (u4.p9==1)) + ((i0.u0.p1==1)&&(i0.u3.p7==1))) + (((u2.p5==0)&&((((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))&&((((((i0.u0.p0==1)||(u1.p3==1))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))))) * !(EX(!((((u1.p3==1)||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))))))] != FALSE)
(forward)formula 4,1,0.127717,5348,1,0,665,44,489,821,74,48,2308
FORMULA ShieldRVt-PT-001A-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(A((((i0.u0.p0==1)||(u1.p3==1))||(i0.u3.p7==1)) U EG(AX((((u1.p3==0)&&(u2.p5==0))&&(u4.p9==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(EG(!(EX(!((((u1.p3==0)&&(u2.p5==0))&&(u4.p9==0))))))) U (!((((i0.u0.p0==1)||(u1.p3==1))||(i0.u3.p7==1))) * !(EG(!(EX(!((((u1.p3==0)&&(u2.p5==0))&&(u4.p9==0))))))))) + EG(!(EG(!(EX(!((((u1.p3==0)&&(u2.p5==0))&&(u4.p9==0)))))))))))] != FALSE
(forward)formula 5,0,0.1354,5348,1,0,678,44,501,834,74,48,2393
FORMULA ShieldRVt-PT-001A-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(EF(((((i0.u3.p7==1)||(u4.p9==1))||(((((((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))&&(((((i0.u3.p8==1)&&(u4.p10==1))||(u2.p5==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))))&&(((((((((i0.u0.p0==0)&&(u1.p3==0))&&((i0.u3.p8==0)||(u4.p10==0)))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(u2.p5==0))&&(u4.p9==0))&&(((i0.u0.p2==0)||(u1.p4==0))||(u4.p10==0)))&&((i0.u0.p1==0)||(i0.u3.p7==0)))||(((u1.p3==0)&&((u2.p6==0)||(u4.p9==0)))&&((i0.u0.p1==0)||(i0.u3.p7==0))))))) * E((((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)) U (!(EX((((((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) * ((((((((((AF((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))) + AG(((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(i0.u3.p7==1)))) + (u1.p3==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + (u2.p5==1)) + (i0.u3.p7==1)) + (u4.p9==1)) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) + (i0.u0.p0==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + ((i0.u0.p1==1)&&(i0.u3.p7==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((((i0.u3.p7==1)||(u4.p9==1))||(((((((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))&&(((((i0.u3.p8==1)&&(u4.p10==1))||(u2.p5==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))))&&(((((((((i0.u0.p0==0)&&(u1.p3==0))&&((i0.u3.p8==0)||(u4.p10==0)))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(u2.p5==0))&&(u4.p9==0))&&(((i0.u0.p2==0)||(u1.p4==0))||(u4.p10==0)))&&((i0.u0.p1==0)||(i0.u3.p7==0)))||(((u1.p3==0)&&((u2.p6==0)||(u4.p9==0)))&&((i0.u0.p1==0)||(i0.u3.p7==0))))))] = FALSE * [(Init * !(E((((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)) U (!(EX((((((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))) * ((((((((((!(EG(!((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))))) + !(E(TRUE U !(((((i0.u0.p0==1)||(u1.p3==1))||((i0.u3.p8==1)&&(u4.p10==1)))||(i0.u3.p7==1)))))) + (u1.p3==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + (u2.p5==1)) + (i0.u3.p7==1)) + (u4.p9==1)) + (((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) + (i0.u0.p0==1)) + (((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1))) + ((i0.u0.p1==1)&&(i0.u3.p7==1)))))))] = FALSE)
(forward)formula 6,0,0.171329,5348,1,0,709,45,562,878,74,49,2557
FORMULA ShieldRVt-PT-001A-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(((((i0.u0.p0==1)||(u1.p3==1))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))
=> equivalent forward existential formula: [(EY(Init) * ((((i0.u0.p0==1)||(u1.p3==1))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))] != FALSE
(forward)formula 7,0,0.173403,5348,1,0,711,45,563,882,74,49,2558
FORMULA ShieldRVt-PT-001A-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(EG((((u2.p5==1)||(i0.u3.p7==1))||(u4.p9==1)))) + A(AF((((!(E((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) U ((u1.p3==1)||((u2.p6==1)&&(u4.p9==1))))) + EF((((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1))))) + (u1.p3==1)) + ((u2.p6==1)&&(u4.p9==1)))) U (((((((((i0.u0.p0==0)&&(u1.p3==0))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(i0.u3.p7==0))&&((i0.u0.p1==0)||(i0.u3.p7==0))) + !(EG(((u4.p9==1)||((i0.u0.p1==1)&&(i0.u3.p7==1)))))) + !(AG(((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))))) + ((!(EX((((i0.u3.p8==1)&&(u4.p10==1))||(u4.p9==1)))) + (u1.p3==0)) * !(AX(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))) * (AF(((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(i0.u3.p7==1))) + EX(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((u2.p5==1)||(i0.u3.p7==1))||(u4.p9==1)))] != FALSE + [((Init * !(EG(!((((((((((i0.u0.p0==0)&&(u1.p3==0))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(i0.u3.p7==0))&&((i0.u0.p1==0)||(i0.u3.p7==0))) + !(EG(((u4.p9==1)||((i0.u0.p1==1)&&(i0.u3.p7==1)))))) + !(!(E(TRUE U !(((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))))))) + ((!(EX((((i0.u3.p8==1)&&(u4.p10==1))||(u4.p9==1)))) + (u1.p3==0)) * !(!(EX(!(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))))) * (!(EG(!(((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(i0.u3.p7==1))))) + EX(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))))))))) * !(E(!((((((((((i0.u0.p0==0)&&(u1.p3==0))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(i0.u3.p7==0))&&((i0.u0.p1==0)||(i0.u3.p7==0))) + !(EG(((u4.p9==1)||((i0.u0.p1==1)&&(i0.u3.p7==1)))))) + !(!(E(TRUE U !(((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))))))) + ((!(EX((((i0.u3.p8==1)&&(u4.p10==1))||(u4.p9==1)))) + (u1.p3==0)) * !(!(EX(!(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))))) * (!(EG(!(((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(i0.u3.p7==1))))) + EX(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1)))))) U (!(!(EG(!((((!(E((((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))) U ((u1.p3==1)||((u2.p6==1)&&(u4.p9==1))))) + E(TRUE U (((((u1.p3==1)||(u2.p5==1))||(i0.u3.p7==1))||(u4.p9==1))||((i0.u0.p1==1)&&(i0.u3.p7==1))))) + (u1.p3==1)) + ((u2.p6==1)&&(u4.p9==1))))))) * !((((((((((i0.u0.p0==0)&&(u1.p3==0))&&(((u1.p4==0)||(u2.p5==0))||(i0.u3.p8==0)))&&(i0.u3.p7==0))&&((i0.u0.p1==0)||(i0.u3.p7==0))) + !(EG(((u4.p9==1)||((i0.u0.p1==1)&&(i0.u3.p7==1)))))) + !(!(E(TRUE U !(((((i0.u0.p0==1)||(u1.p3==1))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))))))) + ((!(EX((((i0.u3.p8==1)&&(u4.p10==1))||(u4.p9==1)))) + (u1.p3==0)) * !(!(EX(!(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||((u2.p6==1)&&(u4.p9==1)))||(i0.u3.p7==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))))) * (!(EG(!(((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(i0.u3.p7==1))))) + EX(((((((u1.p3==1)||((i0.u3.p8==1)&&(u4.p10==1)))||(((u1.p4==1)&&(u2.p5==1))&&(i0.u3.p8==1)))||(u2.p5==1))||((u2.p6==1)&&(u4.p9==1)))||(u4.p9==1))))))))))] != FALSE)
(forward)formula 8,1,0.174647,5348,1,0,723,45,575,898,74,49,2616
FORMULA ShieldRVt-PT-001A-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 9,1,0.174763,5348,1,0,723,45,575,901,74,49,2616
FORMULA ShieldRVt-PT-001A-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AG(A((((u1.p3==1)||((u2.p6==1)&&(u4.p9==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1))) U ((((u1.p3==1)||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!((E(!(((((u1.p3==1)||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))) U (!((((u1.p3==1)||((u2.p6==1)&&(u4.p9==1)))||((i0.u0.p1==1)&&(i0.u3.p7==1)))) * !(((((u1.p3==1)||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1)))))) + EG(!(((((u1.p3==1)||(i0.u3.p7==1))||(u4.p9==1))||(((i0.u0.p2==1)&&(u1.p4==1))&&(u4.p10==1))))))))))))] = FALSE
(forward)formula 10,0,0.185535,5348,1,0,770,45,596,946,74,49,2791
FORMULA ShieldRVt-PT-001A-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621239239098

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-001A"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-001A, 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 r235-smll-162106564600178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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