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-158961390900778.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 QuasiCertifProtocol-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390900778
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.8K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K 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 QuasiCertifProtocol-PT-02-00
FORMULA_NAME QuasiCertifProtocol-PT-02-01
FORMULA_NAME QuasiCertifProtocol-PT-02-02
FORMULA_NAME QuasiCertifProtocol-PT-02-03
FORMULA_NAME QuasiCertifProtocol-PT-02-04
FORMULA_NAME QuasiCertifProtocol-PT-02-05
FORMULA_NAME QuasiCertifProtocol-PT-02-06
FORMULA_NAME QuasiCertifProtocol-PT-02-07
FORMULA_NAME QuasiCertifProtocol-PT-02-08
FORMULA_NAME QuasiCertifProtocol-PT-02-09
FORMULA_NAME QuasiCertifProtocol-PT-02-10
FORMULA_NAME QuasiCertifProtocol-PT-02-11
FORMULA_NAME QuasiCertifProtocol-PT-02-12
FORMULA_NAME QuasiCertifProtocol-PT-02-13
FORMULA_NAME QuasiCertifProtocol-PT-02-14
FORMULA_NAME QuasiCertifProtocol-PT-02-15

=== Now, execution of the tool begins

BK_START 1589857609702

[2020-05-19 03:06:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-19 03:06:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:06:51] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-05-19 03:06:51] [INFO ] Transformed 86 places.
[2020-05-19 03:06:51] [INFO ] Transformed 56 transitions.
[2020-05-19 03:06:51] [INFO ] Parsed PT model containing 86 places and 56 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16420 resets, run finished after 183 ms. (steps per millisecond=546 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 03:06:51] [INFO ] Computed 31 place invariants in 6 ms
[2020-05-19 03:06:51] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-05-19 03:06:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 16 ms returned sat
[2020-05-19 03:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:51] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-05-19 03:06:52] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:52] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:52] [INFO ] Added : 16 causal constraints over 4 iterations in 25 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:06:52] [INFO ] Added : 16 causal constraints over 4 iterations in 22 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:52] [INFO ] Added : 16 causal constraints over 4 iterations in 23 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:52] [INFO ] Added : 23 causal constraints over 5 iterations in 27 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:06:52] [INFO ] Added : 22 causal constraints over 5 iterations in 25 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2020-05-19 03:06:52] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:52] [INFO ] Added : 17 causal constraints over 4 iterations in 21 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 03:06:52] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 17 ms returned sat
[2020-05-19 03:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:52] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:06:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:52] [INFO ] Added : 23 causal constraints over 5 iterations in 36 ms. Result :sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:06:53] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:53] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 03:06:53] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:06:53] [INFO ] Added : 22 causal constraints over 5 iterations in 26 ms. Result :sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 03:06:53] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2020-05-19 03:06:53] [INFO ] Added : 24 causal constraints over 5 iterations in 29 ms. Result :sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:06:53] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:06:53] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:06:53] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 03:06:53] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:06:53] [INFO ] Added : 23 causal constraints over 5 iterations in 24 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-19 03:06:53] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 03:06:53] [INFO ] Flatten gal took : 31 ms
FORMULA QuasiCertifProtocol-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 03:06:53] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 03:06:53] [INFO ] Applying decomposition
[2020-05-19 03:06:53] [INFO ] Flatten gal took : 9 ms
[2020-05-19 03:06:53] [INFO ] Input system was already deterministic with 56 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph202642910660854226.txt, -o, /tmp/graph202642910660854226.bin, -w, /tmp/graph202642910660854226.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/graph202642910660854226.bin, -l, -1, -v, -w, /tmp/graph202642910660854226.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 03:06:53] [INFO ] Computed 31 place invariants in 3 ms
inv : malicious_reservoir + CstopAbort + SstopAbort = 1
inv : n9_2_1 + CstopOK_1 - SstopOK_2 = 0
inv : n9_0_2 + CstopOK_2 - SstopOK_0 = 0
inv : n7_0_2 - n7_0_1 - n8_1_1 + n8_1_2 = 0
inv : n9_1_0 + CstopOK_0 - SstopOK_1 = 0
inv : n9_1_2 + CstopOK_2 - SstopOK_1 = 0
inv : n8_0_2 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : s6_0 + s6_1 + s6_2 + SstopAbort + s5_0 + s5_1 + s5_2 + s4_0 + s4_2 + s4_1 + s3_1 + s3_0 + s2_0 + s3_2 + s2_2 + s2_1 + Sstart_1 + Sstart_0 + Sstart_2 + SstopOK_1 + SstopOK_0 + SstopOK_2 = 3
inv : c1_0 + c1_1 + c1_2 + CstopAbort + CstopOK_0 + CstopOK_1 + CstopOK_2 - n8_0_0 + 3*Cstart_2 - 2*n8_1_1 + n8_0_1 + 2*n8_1_2 = 3
inv : n9_2_2 + CstopOK_2 - SstopOK_2 = 0
inv : n7_2_0 - n7_2_2 + n8_0_0 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : n8_2_0 - n8_0_0 - n8_1_1 + n8_0_1 + n8_1_2 - n8_2_2 = 0
inv : n4_1 - n3_0 + n3_1 - n4_0 = 0
inv : n9_0_1 + CstopOK_1 - SstopOK_0 = 0
inv : n9_0_0 + CstopOK_0 - SstopOK_0 = 0
inv : Cstart_0 + n8_0_0 - Cstart_2 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : n8_2_1 - n8_1_1 + n8_1_2 - n8_2_2 = 0
inv : n7_1_1 - n7_1_2 + n8_1_1 - n8_1_2 = 0
inv : n9_2_0 + CstopOK_0 - SstopOK_2 = 0
inv : -n5_1 + n5_2 + n6_2 - n6_1 = 0
inv : n8_1_0 - n8_0_0 - n8_1_1 + n8_0_1 = 0
inv : -n1_2 + n2_0 - n2_2 + n1_0 = 0
inv : n7_2_1 - n7_2_2 + n8_1_1 - n8_1_2 = 0
inv : Cstart_1 - Cstart_2 + n8_1_1 - n8_1_2 = 0
inv : n7_1_0 - n7_1_2 + n8_0_0 + n8_1_1 - n8_0_1 - n8_1_2 = 0
inv : n5_0 - n5_1 + n6_0 - n6_1 = 0
inv : -n1_2 + n2_1 - n2_2 + n1_1 = 0
inv : n4_2 - n3_0 + n3_2 - n4_0 = 0
inv : a5 + a3 + AstopAbort + a2 + a4 + a1 + AstopOK + Astart = 1
inv : n9_1_1 + CstopOK_1 - SstopOK_1 = 0
inv : n7_0_0 - n7_0_1 + n8_0_0 - n8_0_1 = 0
Total of 31 invariants.
[2020-05-19 03:06:53] [INFO ] Computed 31 place invariants in 5 ms
[2020-05-19 03:06:53] [INFO ] Decomposing Gal with order
[2020-05-19 03:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 03:06:53] [INFO ] Removed a total of 22 redundant transitions.
[2020-05-19 03:06:53] [INFO ] Flatten gal took : 32 ms
[2020-05-19 03:06:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 5 ms.
[2020-05-19 03:06:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-19 03:06:53] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((X((G((F("((((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))||((u4.malicious_reservoir>=1)&&(i5.u16.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(i3.i0.u8.s2_2>=1)))"))||(G("((((u4.malicious_reservoir>=1)&&(i2.u6.s4_2>=1))||((u4.malicious_reservoir>=1)&&(i0.u5.s4_0>=1)))||((u4.malicious_reservoir>=1)&&(i6.u7.s4_1>=1)))"))))&&(G("((((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))||((u4.malicious_reservoir>=1)&&(i5.u16.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(i3.i0.u8.s2_2>=1)))")))))
Formula 0 simplified : !X(G(F"((((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))||((u4.malicious_reservoir>=1)&&(i5.u16.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(i3.i0.u8.s2_2>=1)))" | G"((((u4.malicious_reservoir>=1)&&(i2.u6.s4_2>=1))||((u4.malicious_reservoir>=1)&&(i0.u5.s4_0>=1)))||((u4.malicious_reservoir>=1)&&(i6.u7.s4_1>=1)))") & G"((((u4.malicious_reservoir>=1)&&(u4.s2_1>=1))||((u4.malicious_reservoir>=1)&&(i5.u16.s2_0>=1)))||((u4.malicious_reservoir>=1)&&(i3.i0.u8.s2_2>=1)))")
[2020-05-19 03:06:53] [INFO ] Proved 86 variables to be positive in 157 ms
[2020-05-19 03:06:53] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2020-05-19 03:06:53] [INFO ] Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:06:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:06:53] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2020-05-19 03:06:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions malS6_1, malS6_0, malC1_0, malS3_2, malS4_2, malS3_0, malS1_2, malS2_0, u4.malS3_1, u4.malS1_1, u4.malS2_1, i7.i0.u9.malA5, i7.i0.u9.malA3, i7.i0.u9.malA1, i7.i0.u9.malA2, i7.i0.u9.malA4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/16/46
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.112077,20796,1,0,7690,1008,1187,11660,337,3664,22598
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("((((i7.i0.u9.a5>=1)&&(i7.i1.u18.n6_0>=1))&&(i7.i1.u22.n6_2>=1))&&(i7.i1.u19.n6_1>=1))"))U(X(F("(i7.i0.u9.a5>=1)")))))
Formula 1 simplified : !(G"((((i7.i0.u9.a5>=1)&&(i7.i1.u18.n6_0>=1))&&(i7.i1.u22.n6_2>=1))&&(i7.i1.u19.n6_1>=1))" U XF"(i7.i0.u9.a5>=1)")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.117511,21252,1,0,7986,1008,1235,12015,339,3674,23917
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G("(i7.i0.u9.a2>=1)"))U(X(X(("(i7.i0.u9.a3>=1)")U("(i7.i0.u9.a2>=1)")))))))
Formula 2 simplified : !F(G"(i7.i0.u9.a2>=1)" U XX("(i7.i0.u9.a3>=1)" U "(i7.i0.u9.a2>=1)"))
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.118947,21252,1,0,8048,1008,1254,12074,340,3674,24180
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((G(F("(((i0.u5.s4_0>=1)||(i2.u6.s4_2>=1))||(i6.u7.s4_1>=1))")))U(F(("(i7.i0.u9.a2>=1)")U("(((i0.u5.s4_0>=1)||(i2.u6.s4_2>=1))||(i6.u7.s4_1>=1))"))))U(G((!(G("((((u4.malicious_reservoir>=1)&&(i2.u6.s4_2>=1))||((u4.malicious_reservoir>=1)&&(i0.u5.s4_0>=1)))||((u4.malicious_reservoir>=1)&&(i6.u7.s4_1>=1)))")))U("(((i0.u5.s4_0>=1)||(i2.u6.s4_2>=1))||(i6.u7.s4_1>=1))")))))
Formula 3 simplified : !((GF"(((i0.u5.s4_0>=1)||(i2.u6.s4_2>=1))||(i6.u7.s4_1>=1))" U F("(i7.i0.u9.a2>=1)" U "(((i0.u5.s4_0>=1)||(i2.u6.s4_2>=1))||(i6.u7.s4_1>=1))")) U G(!G"((((u4.malicious_reservoir>=1)&&(i2.u6.s4_2>=1))||((u4.malicious_reservoir>=1)&&(i0.u5.s4_0>=1)))||((u4.malicious_reservoir>=1)&&(i6.u7.s4_1>=1)))" U "(((i0.u5.s4_0>=1)||(i2.u6.s4_2>=1))||(i6.u7.s4_1>=1))"))
Computing Next relation with stutter on 47 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.14789,22908,1,0,9040,1009,1302,13646,340,3681,29858
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(F(((((F((!(F("(i7.i0.u9.a5>=1)")))&&("(i7.i0.u9.a5>=1)")))U("(i7.i0.u9.a5>=1)"))||("((((i2.u6.s5_2>=1)&&(i2.u3.n8_2_0>=1))&&(i2.u3.n8_2_1>=1))&&(i2.u3.n8_2_2>=1))"))||("((((i6.u7.s5_1>=1)&&(i6.u2.n8_1_0>=1))&&(i6.u2.n8_1_1>=1))&&(i6.u2.n8_1_2>=1))"))||("((((i0.u5.s5_0>=1)&&(i0.u1.n8_0_0>=1))&&(i0.u1.n8_0_2>=1))&&(i0.u1.n8_0_1>=1))"))))))
Formula 4 simplified : !F!F("((((i0.u5.s5_0>=1)&&(i0.u1.n8_0_0>=1))&&(i0.u1.n8_0_2>=1))&&(i0.u1.n8_0_1>=1))" | "((((i2.u6.s5_2>=1)&&(i2.u3.n8_2_0>=1))&&(i2.u3.n8_2_1>=1))&&(i2.u3.n8_2_2>=1))" | "((((i6.u7.s5_1>=1)&&(i6.u2.n8_1_0>=1))&&(i6.u2.n8_1_1>=1))&&(i6.u2.n8_1_2>=1))" | (F("(i7.i0.u9.a5>=1)" & !F"(i7.i0.u9.a5>=1)") U "(i7.i0.u9.a5>=1)"))
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.185407,24660,1,0,12553,1010,1431,16982,352,3682,41478
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G("((((i7.i0.u9.a5>=1)&&(i7.i1.u18.n6_0>=1))&&(i7.i1.u22.n6_2>=1))&&(i7.i1.u19.n6_1>=1))"))||(F("((((i5.u16.Sstart_0>=1)&&(i5.u16.n1_0>=1))||((u4.Sstart_1>=1)&&(i3.i1.u14.n1_1>=1)))||((i3.i1.u15.Sstart_2>=1)&&(i3.i1.u13.n1_2>=1)))"))))
Formula 5 simplified : !(G"((((i7.i0.u9.a5>=1)&&(i7.i1.u18.n6_0>=1))&&(i7.i1.u22.n6_2>=1))&&(i7.i1.u19.n6_1>=1))" | F"((((i5.u16.Sstart_0>=1)&&(i5.u16.n1_0>=1))||((u4.Sstart_1>=1)&&(i3.i1.u14.n1_1>=1)))||((i3.i1.u15.Sstart_2>=1)&&(i3.i1.u13.n1_2>=1)))")
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.187525,24908,1,0,12564,1010,1520,17006,353,3682,41648
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G(F((!(("((((i2.u6.n7_2_1>=1)&&(i6.u7.n7_1_1>=1))&&(i0.u5.n7_0_1>=1))&&(i6.u2.Cstart_1>=1))")U("(i7.i0.u9.a1>=1)")))U("(i7.i0.u9.a1>=1)")))))))
Formula 6 simplified : !FXGF(!("((((i2.u6.n7_2_1>=1)&&(i6.u7.n7_1_1>=1))&&(i0.u5.n7_0_1>=1))&&(i6.u2.Cstart_1>=1))" U "(i7.i0.u9.a1>=1)") U "(i7.i0.u9.a1>=1)")
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.190213,24908,1,0,12681,1010,1537,17118,354,3682,42171
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(G(X(G(F(G("(i7.i0.u9.a3<1)")))))))))
Formula 7 simplified : !FXGXGFG"(i7.i0.u9.a3<1)"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.209401,25412,1,0,13815,1011,1559,18274,355,3685,45365
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((!(G("(i7.i0.u9.a4>=1)")))U("(i0.u1.s6_0>=1)"))||(G("((u4.malicious_reservoir>=1)&&(i0.u5.s4_0>=1))"))))
Formula 8 simplified : !((!G"(i7.i0.u9.a4>=1)" U "(i0.u1.s6_0>=1)") | G"((u4.malicious_reservoir>=1)&&(i0.u5.s4_0>=1))")
Computing Next relation with stutter on 47 deadlock states
31 unique states visited
29 strongly connected components in search stack
39 transitions explored
29 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.235341,26380,1,0,15158,1011,1646,20024,356,3685,51041
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X((G(X(F(X(F((X("((u4.malicious_reservoir>=1)&&(i4.u0.c1_2>=1))"))&&("(i7.i0.u9.a3>=1)")))))))||("(i7.i0.u9.a2>=1)")))))
Formula 9 simplified : !XX("(i7.i0.u9.a2>=1)" | GXFXF("(i7.i0.u9.a3>=1)" & X"((u4.malicious_reservoir>=1)&&(i4.u0.c1_2>=1))"))
Computing Next relation with stutter on 47 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.238384,26840,1,0,15217,1012,1646,20080,356,3686,51208
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((G(X((G("(i6.u2.s6_1>=1)"))U(X(X("((u4.malicious_reservoir>=1)&&(i5.u21.s3_0>=1))"))))))||(F("(i6.u2.s6_1>=1)")))))
Formula 10 simplified : !X(GX(G"(i6.u2.s6_1>=1)" U XX"((u4.malicious_reservoir>=1)&&(i5.u21.s3_0>=1))") | F"(i6.u2.s6_1>=1)")
Computing Next relation with stutter on 47 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.253518,27060,1,0,16051,1012,1705,20993,356,3686,54136
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(X(F((X(G((F("((u4.malicious_reservoir>=1)&&(i4.u0.c1_0>=1))"))&&(X("((i3.i1.u15.Sstart_2>=1)&&(i3.i1.u13.n1_2>=1))")))))||("(i7.i0.u9.a2>=1)"))))))
Formula 11 simplified : XF("(i7.i0.u9.a2>=1)" | XG(F"((u4.malicious_reservoir>=1)&&(i4.u0.c1_0>=1))" & X"((i3.i1.u15.Sstart_2>=1)&&(i3.i1.u13.n1_2>=1))"))
Computing Next relation with stutter on 47 deadlock states
12 unique states visited
9 strongly connected components in search stack
13 transitions explored
10 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.257018,27304,1,0,16144,1012,1746,21072,356,3686,54720
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(G("(i7.i0.u9.a2>=1)")))))
Formula 12 simplified : !GXG"(i7.i0.u9.a2>=1)"
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.258018,27304,1,0,16144,1012,1753,21072,356,3686,54730
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-19 03:06:54] [INFO ] Built C files in 538ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589857614390

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="LTLFireability"
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 QuasiCertifProtocol-PT-02, examination is LTLFireability"
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-158961390900778"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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