Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038144000532.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 CSRepetitions-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038144000532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 174K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 26K May 5 16:51 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 CSRepetitions-PT-02-00
FORMULA_NAME CSRepetitions-PT-02-01
FORMULA_NAME CSRepetitions-PT-02-02
FORMULA_NAME CSRepetitions-PT-02-03
FORMULA_NAME CSRepetitions-PT-02-04
FORMULA_NAME CSRepetitions-PT-02-05
FORMULA_NAME CSRepetitions-PT-02-06
FORMULA_NAME CSRepetitions-PT-02-07
FORMULA_NAME CSRepetitions-PT-02-08
FORMULA_NAME CSRepetitions-PT-02-09
FORMULA_NAME CSRepetitions-PT-02-10
FORMULA_NAME CSRepetitions-PT-02-11
FORMULA_NAME CSRepetitions-PT-02-12
FORMULA_NAME CSRepetitions-PT-02-13
FORMULA_NAME CSRepetitions-PT-02-14
FORMULA_NAME CSRepetitions-PT-02-15

=== Now, execution of the tool begins

BK_START 1620552047258

Running Version 0
[2021-05-09 09:20:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-09 09:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:20:48] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-09 09:20:48] [INFO ] Transformed 23 places.
[2021-05-09 09:20:48] [INFO ] Transformed 28 transitions.
[2021-05-09 09:20:48] [INFO ] Parsed PT model containing 23 places and 28 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 09:20:48] [INFO ] Initial state test concluded for 6 properties.
FORMULA CSRepetitions-PT-02-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:49] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-09 09:20:49] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:49] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
[2021-05-09 09:20:49] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 09:20:49] [INFO ] Flatten gal took : 20 ms
FORMULA CSRepetitions-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 09:20:49] [INFO ] Flatten gal took : 6 ms
[2021-05-09 09:20:49] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 100000 steps, including 5589 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 21) seen :19
Running SMT prover for 2 properties.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:49] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 09:20:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-09 09:20:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 16 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 9 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:49] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:49] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:49] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-09 09:20:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-02-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 2 (ADD s3 s6 s21 s22)), p1:(LEQ (ADD s1 s2 s5 s7 s11 s13 s15 s18) (ADD s9 s10 s12 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-02 finished in 506 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U ((p1&&X(p0))||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:50] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 09:20:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-PT-02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s9 s10 s12 s14) (ADD s8 s17)), p1:(LEQ (ADD s3 s6 s21 s22) (ADD s8 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-03 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F((p0||(p1 U (p2||G(p1))))))||(F((p0||(p1 U (p2||G(p1)))))&&X(G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 16 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:50] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s9 s10 s12 s14) (ADD s3 s6 s21 s22)), p2:(AND (LEQ (ADD s9 s10 s12 s14) (ADD s3 s6 s21 s22)) (GT (ADD s3 s6 s21 s22) (ADD s1 s2 s5 s7 s11 s13 s15 s18))), p1:(GT (ADD s3 s6 s21 s22) (ADD s1 s2 s5 s7 s11 s13 s15 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 16 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2021-05-09 09:20:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:51] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
[2021-05-09 09:20:52] [INFO ] Flatten gal took : 4 ms
[2021-05-09 09:20:52] [INFO ] Flatten gal took : 4 ms
[2021-05-09 09:20:52] [INFO ] Time to serialize gal into /tmp/LTL13567054357607158258.gal : 2 ms
[2021-05-09 09:20:52] [INFO ] Time to serialize properties into /tmp/LTL10133942281575698714.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13567054357607158258.gal, -t, CGAL, -LTL, /tmp/LTL10133942281575698714.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13567054357607158258.gal -t CGAL -LTL /tmp/LTL10133942281575698714.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F(("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))")||(("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))")U(("(((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))&&((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)))")||(G("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))")))))))||((F(("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))")||(("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))")U(("(((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))&&((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)))")||(G("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))"))))))&&(X(G("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)>(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))"))))))))
Formula 0 simplified : !XF(GF("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))" | ("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))" U ("(((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))&&((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)))" | G"((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))"))) | (F("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))" | ("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))" U ("(((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))&&((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)))" | G"((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2))"))) & XG"((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)>(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t6, t8, t12, t13, t14, t16, t17, t19, t21, t23, t24, t26, t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 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.129006,20572,1,0,86,16103,89,36,1001,16512,81
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CSRepetitions-PT-02-05 finished in 2037 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(X(p0)&&((!p0&&F(p1))||G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:52] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:52] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:52] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
[2021-05-09 09:20:52] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : CSRepetitions-PT-02-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=2, aps=[p1:(LEQ 3 (ADD s3 s6 s21 s22)), p0:(LEQ (ADD s8 s17) s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-06 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(G(p0)) U p1))))], workingDir=/home/mcc/execution]
Support contains 14 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:53] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:53] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 09:20:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-09 09:20:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 (ADD s8 s17)), p0:(LEQ (ADD s9 s10 s12 s14) (ADD s1 s2 s5 s7 s11 s13 s15 s18))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5669 reset in 322 ms.
Stack based approach found an accepted trace after 1815 steps with 97 reset with depth 21 and stack size 21 in 5 ms.
FORMULA CSRepetitions-PT-02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-07 finished in 543 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 26
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 17 transition count 24
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 17 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 15 transition count 22
Applied a total of 14 rules in 8 ms. Remains 15 /23 variables (removed 8) and now considering 22/28 (removed 6) transitions.
[2021-05-09 09:20:53] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2021-05-09 09:20:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 09:20:53] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 09:20:53] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2021-05-09 09:20:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 09:20:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 09:20:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-09 09:20:53] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 09:20:53] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2021-05-09 09:20:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 09:20:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/23 places, 22/28 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-02-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s2 s13), p1:(LEQ s14 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-08 finished in 207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 20 transition count 26
Applied a total of 5 rules in 3 ms. Remains 20 /23 variables (removed 3) and now considering 26/28 (removed 2) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-09 09:20:53] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 09:20:53] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-09 09:20:53] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 09:20:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-09 09:20:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-09 09:20:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-09 09:20:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 09:20:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 26/28 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s14 s11) (LEQ 2 s7)), p1:(OR (LEQ s12 s8) (LEQ 2 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5781 reset in 176 ms.
Stack based approach found an accepted trace after 53714 steps with 3117 reset with depth 12 and stack size 12 in 161 ms.
FORMULA CSRepetitions-PT-02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-09 finished in 500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||G((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:54] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:54] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s1 s17), p0:(OR (LEQ 1 s14) (GT s1 s17)), p2:(GT s20 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 3 reset in 0 ms.
FORMULA CSRepetitions-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-10 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:54] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:54] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:54] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s8 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-12 finished in 221 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620552055138

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="CSRepetitions-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 CSRepetitions-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038144000532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;