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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 60K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 430K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 22 08:13 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 153K 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 QuasiCertifProtocol-PT-06-00
FORMULA_NAME QuasiCertifProtocol-PT-06-01
FORMULA_NAME QuasiCertifProtocol-PT-06-02
FORMULA_NAME QuasiCertifProtocol-PT-06-03
FORMULA_NAME QuasiCertifProtocol-PT-06-04
FORMULA_NAME QuasiCertifProtocol-PT-06-05
FORMULA_NAME QuasiCertifProtocol-PT-06-06
FORMULA_NAME QuasiCertifProtocol-PT-06-07
FORMULA_NAME QuasiCertifProtocol-PT-06-08
FORMULA_NAME QuasiCertifProtocol-PT-06-09
FORMULA_NAME QuasiCertifProtocol-PT-06-10
FORMULA_NAME QuasiCertifProtocol-PT-06-11
FORMULA_NAME QuasiCertifProtocol-PT-06-12
FORMULA_NAME QuasiCertifProtocol-PT-06-13
FORMULA_NAME QuasiCertifProtocol-PT-06-14
FORMULA_NAME QuasiCertifProtocol-PT-06-15

=== Now, execution of the tool begins

BK_START 1621234371140

Running Version 0
[2021-05-17 06:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 06:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:52:53] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-17 06:52:53] [INFO ] Transformed 270 places.
[2021-05-17 06:52:53] [INFO ] Transformed 116 transitions.
[2021-05-17 06:52:53] [INFO ] Parsed PT model containing 270 places and 116 transitions in 95 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:52:53] [INFO ] Initial state test concluded for 1 properties.
Support contains 80 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 21 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2021-05-17 06:52:53] [INFO ] Computed 138 place invariants in 37 ms
[2021-05-17 06:52:53] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2021-05-17 06:52:53] [INFO ] Computed 138 place invariants in 10 ms
[2021-05-17 06:52:53] [INFO ] Implicit Places using invariants and state equation in 306 ms returned [147, 148, 149, 150, 154, 160]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 682 ms to find 6 implicit places.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:53] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:52:53] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 246/270 places, 116/116 transitions.
Applied a total of 0 rules in 20 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:53] [INFO ] Computed 132 place invariants in 6 ms
[2021-05-17 06:52:54] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 2 iterations. Remains : 246/270 places, 116/116 transitions.
[2021-05-17 06:52:54] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 06:52:54] [INFO ] Flatten gal took : 52 ms
FORMULA QuasiCertifProtocol-PT-06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:52:54] [INFO ] Flatten gal took : 25 ms
[2021-05-17 06:52:54] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 100000 steps, including 9836 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 17) seen :7
Running SMT prover for 10 properties.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:54] [INFO ] Computed 132 place invariants in 10 ms
[2021-05-17 06:52:54] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 29 ms returned sat
[2021-05-17 06:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 06:52:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:55] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2021-05-17 06:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:55] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 06:52:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:52:55] [INFO ] Added : 53 causal constraints over 11 iterations in 178 ms. Result :sat
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 27 ms returned sat
[2021-05-17 06:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using state equation in 62 ms returned unsat
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 20 ms returned sat
[2021-05-17 06:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 06:52:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 06:52:55] [INFO ] Added : 18 causal constraints over 4 iterations in 76 ms. Result :sat
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 20 ms returned sat
[2021-05-17 06:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-17 06:52:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:52:55] [INFO ] Added : 17 causal constraints over 4 iterations in 61 ms. Result :sat
[2021-05-17 06:52:55] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2021-05-17 06:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 06:52:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:52:56] [INFO ] Added : 17 causal constraints over 4 iterations in 53 ms. Result :sat
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 19 ms returned sat
[2021-05-17 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 06:52:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 06:52:56] [INFO ] Added : 19 causal constraints over 4 iterations in 58 ms. Result :sat
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2021-05-17 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2021-05-17 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-17 06:52:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 06:52:56] [INFO ] Added : 48 causal constraints over 10 iterations in 197 ms. Result :sat
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2021-05-17 06:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:56] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-17 06:52:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 06:52:56] [INFO ] Added : 47 causal constraints over 10 iterations in 142 ms. Result :sat
[2021-05-17 06:52:57] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 25 ms returned sat
[2021-05-17 06:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:57] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 06:52:57] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 06:52:57] [INFO ] Added : 48 causal constraints over 10 iterations in 140 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-17 06:52:57] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-PT-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 15 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 114
Applied a total of 4 rules in 31 ms. Remains 244 /246 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:52:57] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:52:57] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:52:57] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:52:57] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 434 ms to find 1 implicit places.
[2021-05-17 06:52:57] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:52:57] [INFO ] Computed 132 place invariants in 8 ms
[2021-05-17 06:52:58] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Starting structural reductions, iteration 1 : 243/246 places, 114/116 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-17 06:52:58] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:52:58] [INFO ] Computed 132 place invariants in 15 ms
[2021-05-17 06:52:58] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 2 iterations. Remains : 243/246 places, 114/116 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s55 1) (OR (LT s45 1) (LT s189 1)) (OR (LT s46 1) (LT s188 1)) (OR (LT s48 1) (LT s213 1)) (OR (LT s44 1) (LT s217 1)) (OR (LT s43 1) (LT s216 1)) (OR (LT s49 1) (LT s214 1)) (OR (LT s50 1) (LT s215 1))), p0:(GEQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-00 finished in 1044 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 15 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 25 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:58] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:52:58] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:58] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:52:58] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 447 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:58] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:52:58] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:58] [INFO ] Computed 132 place invariants in 6 ms
[2021-05-17 06:52:59] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s14 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1)), p1:(AND (GEQ s57 1) (GEQ s208 1) (GEQ s209 1) (GEQ s210 1) (GEQ s211 1) (GEQ s212 1) (GEQ s213 1) (GEQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-01 finished in 856 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:59] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:52:59] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:59] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:52:59] [INFO ] Implicit Places using invariants and state equation in 303 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 480 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:59] [INFO ] Computed 132 place invariants in 11 ms
[2021-05-17 06:52:59] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:59] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:52:59] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-02 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:(GEQ s52 1)], 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 QuasiCertifProtocol-PT-06-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-02 finished in 843 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 14 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:00] [INFO ] Computed 132 place invariants in 6 ms
[2021-05-17 06:53:00] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:00] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:53:00] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 544 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:00] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:53:00] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:00] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:53:00] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-04 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:(OR (AND (GEQ s45 1) (GEQ s191 1)) (AND (GEQ s46 1) (GEQ s190 1)) (AND (GEQ s48 1) (GEQ s215 1)) (AND (GEQ s44 1) (GEQ s219 1)) (AND (GEQ s43 1) (GEQ s218 1)) (AND (GEQ s49 1) (GEQ s216 1)) (AND (GEQ s50 1) (GEQ s217 1)))], 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 0 ms.
FORMULA QuasiCertifProtocol-PT-06-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-04 finished in 853 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 22 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 244 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 244 transition count 114
Applied a total of 3 rules in 21 ms. Remains 244 /246 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:53:00] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:53:01] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:53:01] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:53:01] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [153, 190, 191, 215, 216, 217, 218, 219]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 436 ms to find 8 implicit places.
[2021-05-17 06:53:01] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:53:01] [INFO ] Computed 126 place invariants in 9 ms
[2021-05-17 06:53:01] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Starting structural reductions, iteration 1 : 236/246 places, 114/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-17 06:53:01] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:53:01] [INFO ] Computed 126 place invariants in 14 ms
[2021-05-17 06:53:01] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 2 iterations. Remains : 236/246 places, 114/116 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s42 1) (GEQ s226 1)) (AND (GEQ s36 1) (GEQ s202 1)) (AND (GEQ s38 1) (GEQ s204 1)) (AND (GEQ s35 1) (GEQ s203 1)) (AND (GEQ s40 1) (GEQ s224 1)) (AND (GEQ s41 1) (GEQ s201 1)) (AND (GEQ s39 1) (GEQ s227 1))), p0:(AND (GEQ s52 1) (GEQ s218 1) (GEQ s219 1) (GEQ s220 1) (GEQ s221 1) (GEQ s222 1) (GEQ s223 1) (GEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-05 finished in 827 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 15 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:01] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:53:01] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:01] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:53:02] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 365 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:02] [INFO ] Computed 132 place invariants in 15 ms
[2021-05-17 06:53:02] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:02] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:53:02] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-06-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s34 1)) (AND (GEQ s0 1) (GEQ s37 1)) (AND (GEQ s0 1) (GEQ s31 1)) (AND (GEQ s0 1) (GEQ s33 1)) (AND (GEQ s0 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s27 1)) (AND (GEQ s0 1) (GEQ s28 1))), p1:(OR (AND (GEQ s34 1) (GEQ s223 1)) (AND (GEQ s33 1) (GEQ s222 1)) (AND (GEQ s31 1) (GEQ s220 1)) (AND (GEQ s32 1) (GEQ s221 1)) (AND (GEQ s37 1) (GEQ s239 1)) (AND (GEQ s28 1) (GEQ s225 1)) (AND (GEQ s27 1) (GEQ s224 1)))], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-06 finished in 1137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||G(((p1&&F(!p0))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 244 transition count 114
Applied a total of 2 rules in 12 ms. Remains 244 /246 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:53:02] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:53:03] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:53:03] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:53:03] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [153, 190, 191, 215, 216, 217, 218, 219]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 386 ms to find 8 implicit places.
[2021-05-17 06:53:03] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:53:03] [INFO ] Computed 126 place invariants in 7 ms
[2021-05-17 06:53:03] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 236/246 places, 114/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-17 06:53:03] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:53:03] [INFO ] Computed 126 place invariants in 8 ms
[2021-05-17 06:53:03] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Finished structural reductions, in 2 iterations. Remains : 236/246 places, 114/116 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) p0), p0, true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-08 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s51 1), p1:(LT s10 1)], 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, null][true, true, true, true]]
Product exploration explored 100000 steps with 10244 reset in 301 ms.
Product exploration explored 100000 steps with 10253 reset in 180 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (NOT p0), p1]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) p0), p0, true, (NOT p1)]
Product exploration explored 100000 steps with 10252 reset in 207 ms.
Product exploration explored 100000 steps with 10258 reset in 226 ms.
[2021-05-17 06:53:05] [INFO ] Flatten gal took : 19 ms
[2021-05-17 06:53:05] [INFO ] Flatten gal took : 15 ms
[2021-05-17 06:53:05] [INFO ] Time to serialize gal into /tmp/LTL5236376420548965380.gal : 7 ms
[2021-05-17 06:53:05] [INFO ] Time to serialize properties into /tmp/LTL3679396179623066162.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/LTL5236376420548965380.gal, -t, CGAL, -LTL, /tmp/LTL3679396179623066162.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/LTL5236376420548965380.gal -t CGAL -LTL /tmp/LTL3679396179623066162.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(a4<1)"))||(G((("(s6_2<1)")&&(F("(a4<1)")))||(G("(s6_2<1)"))))))
Formula 0 simplified : !(G"(a4<1)" | G(("(s6_2<1)" & F"(a4<1)") | G"(s6_2<1)"))
Detected timeout of ITS tools.
[2021-05-17 06:53:20] [INFO ] Flatten gal took : 29 ms
[2021-05-17 06:53:20] [INFO ] Applying decomposition
[2021-05-17 06:53:20] [INFO ] Flatten gal took : 21 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/graph18113763925852648125.txt, -o, /tmp/graph18113763925852648125.bin, -w, /tmp/graph18113763925852648125.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/graph18113763925852648125.bin, -l, -1, -v, -w, /tmp/graph18113763925852648125.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:53:20] [INFO ] Decomposing Gal with order
[2021-05-17 06:53:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:53:20] [INFO ] Removed a total of 76 redundant transitions.
[2021-05-17 06:53:20] [INFO ] Flatten gal took : 100 ms
[2021-05-17 06:53:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 24 ms.
[2021-05-17 06:53:20] [INFO ] Time to serialize gal into /tmp/LTL14273004707686132462.gal : 6 ms
[2021-05-17 06:53:20] [INFO ] Time to serialize properties into /tmp/LTL6253373171937660466.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/LTL14273004707686132462.gal, -t, CGAL, -LTL, /tmp/LTL6253373171937660466.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14273004707686132462.gal -t CGAL -LTL /tmp/LTL6253373171937660466.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i9.u18.a4<1)"))||(G((("(u3.s6_2<1)")&&(F("(i9.u18.a4<1)")))||(G("(u3.s6_2<1)"))))))
Formula 0 simplified : !(G"(i9.u18.a4<1)" | G(("(u3.s6_2<1)" & F"(i9.u18.a4<1)") | G"(u3.s6_2<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17702041408372648435
[2021-05-17 06:53:35] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17702041408372648435
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17702041408372648435]
Compilation finished in 995 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17702041408372648435]
Link finished in 87 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||[]((((LTLAPp1==true)&&<>((LTLAPp0==true)))||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17702041408372648435]
LTSmin run took 2954 ms.
FORMULA QuasiCertifProtocol-PT-06-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-08 finished in 36739 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:39] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:53:39] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:39] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:53:40] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 426 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:40] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:40] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s57 1) (GEQ s208 1) (GEQ s209 1) (GEQ s210 1) (GEQ s211 1) (GEQ s212 1) (GEQ s213 1) (GEQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-10 finished in 740 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:40] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:53:40] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:53:40] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:53:40] [INFO ] Implicit Places using invariants and state equation in 273 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 469 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:40] [INFO ] Computed 132 place invariants in 11 ms
[2021-05-17 06:53:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:53:40] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:53:41] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-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:(LT s51 1)], 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]]
Product exploration explored 100000 steps with 9837 reset in 230 ms.
Entered a terminal (fully accepting) state of product in 37881 steps with 3721 reset in 57 ms.
FORMULA QuasiCertifProtocol-PT-06-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-12 finished in 1099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&G((!p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Reduce places removed 1 places and 1 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 244 transition count 114
Applied a total of 3 rules in 70 ms. Remains 244 /246 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:53:41] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:53:41] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 114 rows 244 cols
[2021-05-17 06:53:41] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:53:42] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [153, 190, 191, 215, 216, 217, 218, 219]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 498 ms to find 8 implicit places.
[2021-05-17 06:53:42] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:53:42] [INFO ] Computed 126 place invariants in 8 ms
[2021-05-17 06:53:42] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Starting structural reductions, iteration 1 : 236/246 places, 114/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-17 06:53:42] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:53:42] [INFO ] Computed 126 place invariants in 10 ms
[2021-05-17 06:53:42] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 2 iterations. Remains : 236/246 places, 114/116 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-14 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s0 1) (LT s3 1)), p1:(LT s10 1), p0:(LT s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10236 reset in 194 ms.
Product exploration explored 100000 steps with 10256 reset in 184 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p2)), (F (G p1)), (F (G p0)), p2, p1, p0]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 10247 reset in 181 ms.
Product exploration explored 100000 steps with 10246 reset in 191 ms.
[2021-05-17 06:53:43] [INFO ] Flatten gal took : 10 ms
[2021-05-17 06:53:43] [INFO ] Flatten gal took : 10 ms
[2021-05-17 06:53:43] [INFO ] Time to serialize gal into /tmp/LTL88991657234761106.gal : 2 ms
[2021-05-17 06:53:43] [INFO ] Time to serialize properties into /tmp/LTL17713324713107347149.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/LTL88991657234761106.gal, -t, CGAL, -LTL, /tmp/LTL17713324713107347149.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/LTL88991657234761106.gal -t CGAL -LTL /tmp/LTL17713324713107347149.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((F("(a5<1)"))&&(G(("(s6_2>=1)")U("((malicious_reservoir<1)||(c1_2<1))"))))))
Formula 0 simplified : !F(F"(a5<1)" & G("(s6_2>=1)" U "((malicious_reservoir<1)||(c1_2<1))"))
Detected timeout of ITS tools.
[2021-05-17 06:53:58] [INFO ] Flatten gal took : 10 ms
[2021-05-17 06:53:58] [INFO ] Applying decomposition
[2021-05-17 06:53:58] [INFO ] Flatten gal took : 9 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/graph790971303236814292.txt, -o, /tmp/graph790971303236814292.bin, -w, /tmp/graph790971303236814292.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/graph790971303236814292.bin, -l, -1, -v, -w, /tmp/graph790971303236814292.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:53:58] [INFO ] Decomposing Gal with order
[2021-05-17 06:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:53:59] [INFO ] Removed a total of 83 redundant transitions.
[2021-05-17 06:53:59] [INFO ] Flatten gal took : 18 ms
[2021-05-17 06:53:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 6 ms.
[2021-05-17 06:53:59] [INFO ] Time to serialize gal into /tmp/LTL9114139683580452687.gal : 3 ms
[2021-05-17 06:53:59] [INFO ] Time to serialize properties into /tmp/LTL1562252933076722622.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/LTL9114139683580452687.gal, -t, CGAL, -LTL, /tmp/LTL1562252933076722622.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9114139683580452687.gal -t CGAL -LTL /tmp/LTL1562252933076722622.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((F("(i9.u17.a5<1)"))&&(G(("(u2.s6_2>=1)")U("((u0.malicious_reservoir<1)||(i14.i1.u13.c1_2<1))"))))))
Formula 0 simplified : !F(F"(i9.u17.a5<1)" & G("(u2.s6_2>=1)" U "((u0.malicious_reservoir<1)||(i14.i1.u13.c1_2<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5212918060798009938
[2021-05-17 06:54:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5212918060798009938
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5212918060798009938]
Compilation finished in 848 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5212918060798009938]
Link finished in 70 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((<>((LTLAPp0==true))&&[](((LTLAPp1==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212918060798009938]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-06-14 finished in 47622 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(G(p0)) U !p1)||X(X(!p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:54:29] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:54:29] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:54:29] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:54:29] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 415 ms to find 1 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:54:29] [INFO ] Computed 132 place invariants in 12 ms
[2021-05-17 06:54:29] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 245/246 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:54:29] [INFO ] Computed 132 place invariants in 6 ms
[2021-05-17 06:54:29] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/246 places, 116/116 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (AND p2 (NOT p0)), (AND p1 p2), (NOT p0), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-06-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s47 1), p2:(GEQ s57 1), p0:(OR (LT s0 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2931 steps with 582 reset in 15 ms.
FORMULA QuasiCertifProtocol-PT-06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-15 finished in 1011 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13063758266491895312
[2021-05-17 06:54:30] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2021-05-17 06:54:30] [INFO ] Applying decomposition
[2021-05-17 06:54:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:54:30] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2021-05-17 06:54:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:54:30] [INFO ] Flatten gal took : 9 ms
[2021-05-17 06:54:30] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2021-05-17 06:54:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:54:30] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13063758266491895312
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13063758266491895312]
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/graph13479476473926508705.txt, -o, /tmp/graph13479476473926508705.bin, -w, /tmp/graph13479476473926508705.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/graph13479476473926508705.bin, -l, -1, -v, -w, /tmp/graph13479476473926508705.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:54:30] [INFO ] Decomposing Gal with order
[2021-05-17 06:54:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:54:30] [INFO ] Removed a total of 69 redundant transitions.
[2021-05-17 06:54:30] [INFO ] Flatten gal took : 17 ms
[2021-05-17 06:54:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 4 ms.
[2021-05-17 06:54:30] [INFO ] Time to serialize gal into /tmp/LTLFireability4258631287537764333.gal : 2 ms
[2021-05-17 06:54:30] [INFO ] Time to serialize properties into /tmp/LTLFireability7416091597660740813.ltl : 0 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/LTLFireability4258631287537764333.gal, -t, CGAL, -LTL, /tmp/LTLFireability7416091597660740813.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability4258631287537764333.gal -t CGAL -LTL /tmp/LTLFireability7416091597660740813.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((F("(i10.u22.a5<1)"))&&(G(("(u4.s6_2>=1)")U("((u0.malicious_reservoir<1)||(i11.i0.u14.c1_2<1))"))))))
Formula 0 simplified : !F(F"(i10.u22.a5<1)" & G("(u4.s6_2>=1)" U "((u0.malicious_reservoir<1)||(i11.i0.u14.c1_2<1))"))
Compilation finished in 946 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13063758266491895312]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>((<>((LTLAPp0==true))&&[]((!(LTLAPp1==true) U (LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063758266491895312]
LTSmin run took 106531 ms.
FORMULA QuasiCertifProtocol-PT-06-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621234577903

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="QuasiCertifProtocol-PT-06"
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"
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 QuasiCertifProtocol-PT-06, 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 r178-tajo-162089415200077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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