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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 64K 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 ResAllocation-PT-R015C002-00
FORMULA_NAME ResAllocation-PT-R015C002-01
FORMULA_NAME ResAllocation-PT-R015C002-02
FORMULA_NAME ResAllocation-PT-R015C002-03
FORMULA_NAME ResAllocation-PT-R015C002-04
FORMULA_NAME ResAllocation-PT-R015C002-05
FORMULA_NAME ResAllocation-PT-R015C002-06
FORMULA_NAME ResAllocation-PT-R015C002-07
FORMULA_NAME ResAllocation-PT-R015C002-08
FORMULA_NAME ResAllocation-PT-R015C002-09
FORMULA_NAME ResAllocation-PT-R015C002-10
FORMULA_NAME ResAllocation-PT-R015C002-11
FORMULA_NAME ResAllocation-PT-R015C002-12
FORMULA_NAME ResAllocation-PT-R015C002-13
FORMULA_NAME ResAllocation-PT-R015C002-14
FORMULA_NAME ResAllocation-PT-R015C002-15

=== Now, execution of the tool begins

BK_START 1621266822556

Running Version 0
[2021-05-17 15:53:44] [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 15:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:53:44] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-17 15:53:44] [INFO ] Transformed 60 places.
[2021-05-17 15:53:44] [INFO ] Transformed 32 transitions.
[2021-05-17 15:53:44] [INFO ] Parsed PT model containing 60 places and 32 transitions in 77 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 15:53:44] [INFO ] Initial state test concluded for 1 properties.
Support contains 48 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 15 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2021-05-17 15:53:44] [INFO ] Computed 30 place invariants in 7 ms
[2021-05-17 15:53:44] [INFO ] Implicit Places using invariants in 127 ms returned [39, 53, 55, 59]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 163 ms to find 4 implicit places.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:44] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-17 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 56/60 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:44] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-17 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 56/60 places, 32/32 transitions.
[2021-05-17 15:53:44] [INFO ] Flatten gal took : 22 ms
[2021-05-17 15:53:44] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:53:44] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 100000 steps, including 1463 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 29) seen :20
Running SMT prover for 9 properties.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:45] [INFO ] Computed 26 place invariants in 2 ms
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 15:53:45] [INFO ] Added : 14 causal constraints over 3 iterations in 50 ms. Result :sat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 15:53:45] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
[2021-05-17 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-17 15:53:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:53:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 15:53:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2021-05-17 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 15:53:45] [INFO ] Added : 26 causal constraints over 6 iterations in 33 ms. Result :sat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 15:53:45] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2021-05-17 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-17 15:53:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:53:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 15:53:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2021-05-17 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 15:53:45] [INFO ] Added : 28 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 15:53:45] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 15:53:45] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 2 ms returned unsat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned unsat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 15:53:45] [INFO ] Added : 25 causal constraints over 5 iterations in 36 ms. Result :sat
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 15:53:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:53:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2021-05-17 15:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:53:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-17 15:53:45] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-17 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-17 15:53:45] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 15:53:45] [INFO ] Added : 26 causal constraints over 6 iterations in 26 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 30
Applied a total of 5 rules in 10 ms. Remains 53 /56 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2021-05-17 15:53:45] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 15:53:45] [INFO ] Implicit Places using invariants in 32 ms returned [32, 34, 39, 41, 43, 45, 47, 51]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 33 ms to find 8 implicit places.
[2021-05-17 15:53:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 45 cols
[2021-05-17 15:53:45] [INFO ] Computed 17 place invariants in 6 ms
[2021-05-17 15:53:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 45/56 places, 30/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 45 cols
[2021-05-17 15:53:45] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/56 places, 30/32 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s3 1) (LT s30 1) (LT s31 1)), p0:(AND (GEQ s11 1) (GEQ s35 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1463 reset in 210 ms.
Entered a terminal (fully accepting) state of product in 68266 steps with 1000 reset in 106 ms.
FORMULA ResAllocation-PT-R015C002-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-00 finished in 622 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 30
Applied a total of 5 rules in 9 ms. Remains 53 /56 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2021-05-17 15:53:46] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:46] [INFO ] Implicit Places using invariants in 49 ms returned [30, 32, 34, 37, 39, 41, 43, 45, 47, 51]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 51 ms to find 10 implicit places.
[2021-05-17 15:53:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:46] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-17 15:53:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 43/56 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:46] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-17 15:53:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/56 places, 30/32 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R015C002-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s14 1) (GEQ s17 1)), p0:(AND (GEQ s24 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-01 finished in 389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:46] [INFO ] Computed 26 place invariants in 6 ms
[2021-05-17 15:53:46] [INFO ] Implicit Places using invariants in 50 ms returned [31, 33, 35, 37, 40, 42, 44, 46, 48, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 51 ms to find 10 implicit places.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:46] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 15:53:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 46/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:46] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 15:53:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 46/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s21 1) (LT s41 1) (LT s42 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-02 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:47] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-17 15:53:47] [INFO ] Implicit Places using invariants in 55 ms returned [31, 33, 35, 37, 40, 42, 44, 46, 48, 50, 54]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 56 ms to find 11 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:47] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 45/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:47] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s18 1) (GEQ s21 1)), p0:(AND (GEQ s0 1) (GEQ s3 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-03 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((p0 U p1) U (G((p0 U p1))||(G(p2)&&(p0 U p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:47] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-17 15:53:47] [INFO ] Implicit Places using invariants in 46 ms returned [31, 33, 35, 37, 40, 42, 44, 46, 48, 50, 54]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 47 ms to find 11 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:47] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 45/56 places, 32/32 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:47] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s3 1)), p1:(GEQ s30 1), p0:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-04 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:47] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-17 15:53:47] [INFO ] Implicit Places using invariants in 40 ms returned [31, 33, 35, 37, 40, 42, 44, 46, 48, 50, 54]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 41 ms to find 11 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:47] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 45/56 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:47] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-17 15:53:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 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]]
Product exploration explored 100000 steps with 30817 reset in 216 ms.
Product exploration explored 100000 steps with 31158 reset in 166 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31125 reset in 137 ms.
Product exploration explored 100000 steps with 31182 reset in 206 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 45 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 45/45 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:53:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:48] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 32/32 transitions.
Product exploration explored 100000 steps with 31237 reset in 381 ms.
Product exploration explored 100000 steps with 31005 reset in 276 ms.
[2021-05-17 15:53:49] [INFO ] Flatten gal took : 5 ms
[2021-05-17 15:53:49] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:53:49] [INFO ] Time to serialize gal into /tmp/LTL16952016776102147504.gal : 3 ms
[2021-05-17 15:53:49] [INFO ] Time to serialize properties into /tmp/LTL8129435334459838140.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/LTL16952016776102147504.gal, -t, CGAL, -LTL, /tmp/LTL8129435334459838140.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/LTL16952016776102147504.gal -t CGAL -LTL /tmp/LTL8129435334459838140.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(r_0_0<1)"))))
Formula 0 simplified : !XF"(r_0_0<1)"
Reverse transition relation is NOT exact ! Due to transitions t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
23 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.259365,24280,1,0,602,46548,90,352,1382,63820,1124
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R015C002-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R015C002-05 finished in 2283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 30
Applied a total of 5 rules in 9 ms. Remains 53 /56 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2021-05-17 15:53:50] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:50] [INFO ] Implicit Places using invariants in 57 ms returned [30, 32, 34, 37, 39, 41, 43, 45, 47, 51]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 59 ms to find 10 implicit places.
[2021-05-17 15:53:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:50] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 43/56 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:50] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/56 places, 30/32 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s20 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2183 steps with 32 reset in 6 ms.
FORMULA ResAllocation-PT-R015C002-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-06 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G((p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:50] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-17 15:53:50] [INFO ] Implicit Places using invariants in 36 ms returned [33, 35, 40, 42, 44, 46, 48, 50, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 37 ms to find 9 implicit places.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:50] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 15:53:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 47/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:50] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R015C002-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s23 1)), p1:(AND (GEQ s1 1) (GEQ s31 1) (GEQ s32 1)), p2:(AND (GEQ s7 1) (GEQ s35 1) (GEQ s36 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-07 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||((p1||F(p2)) U (((p1||F(p2))&&X(!p3))||G((p1||F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:50] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-17 15:53:50] [INFO ] Implicit Places using invariants in 51 ms returned [31, 33, 37, 40, 42, 44, 46, 48, 50, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 52 ms to find 10 implicit places.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:50] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 15:53:50] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 46/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:50] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 15:53:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 46/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p3 (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p1) (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p3)]
Running random walk in product with property : ResAllocation-PT-R015C002-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p3))), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LT s1 1), p2:(OR (LT s5 1) (LT s33 1) (LT s34 1)), p3:(AND (GEQ s14 1) (GEQ s17 1)), p0:(OR (AND (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s26 1) (GEQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Knowledge obtained : [(NOT p1), p2, (NOT p3), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p3 (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p1) (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p3)]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p3 (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p1) (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p3)]
Support contains 8 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 46/46 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:53:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:51] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 15:53:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 32/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
[2021-05-17 15:53:52] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:53:52] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:53:52] [INFO ] Time to serialize gal into /tmp/LTL6832259365638115103.gal : 1 ms
[2021-05-17 15:53:52] [INFO ] Time to serialize properties into /tmp/LTL12253913284791925673.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/LTL6832259365638115103.gal, -t, CGAL, -LTL, /tmp/LTL12253913284791925673.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/LTL6832259365638115103.gal -t CGAL -LTL /tmp/LTL12253913284791925673.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X("(((p_0_7>=1)&&(r_0_8>=1))||((p_0_13>=1)&&(r_0_14>=1)))")))||((("(r_0_0<1)")||(F("(((r_0_2<1)||(r_1_2<1))||(p_1_3<1))")))U(((("(r_0_0<1)")||(F("(((r_0_2<1)||(r_1_2<1))||(p_1_3<1))")))&&(X("((p_0_7<1)||(r_0_8<1))")))||(G(("(r_0_0<1)")||(F("(((r_0_2<1)||(r_1_2<1))||(p_1_3<1))"))))))))
Formula 0 simplified : !(XX"(((p_0_7>=1)&&(r_0_8>=1))||((p_0_13>=1)&&(r_0_14>=1)))" | (("(r_0_0<1)" | F"(((r_0_2<1)||(r_1_2<1))||(p_1_3<1))") U ((("(r_0_0<1)" | F"(((r_0_2<1)||(r_1_2<1))||(p_1_3<1))") & X"((p_0_7<1)||(r_0_8<1))") | G("(r_0_0<1)" | F"(((r_0_2<1)||(r_1_2<1))||(p_1_3<1))"))))
Reverse transition relation is NOT exact ! Due to transitions t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
5 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.071812,18864,1,0,79,6372,96,37,1424,4164,79
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R015C002-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-08 finished in 2004 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 30
Applied a total of 5 rules in 8 ms. Remains 53 /56 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2021-05-17 15:53:52] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:52] [INFO ] Implicit Places using invariants in 55 ms returned [30, 32, 34, 37, 39, 41, 43, 45, 47, 51]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 58 ms to find 10 implicit places.
[2021-05-17 15:53:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:52] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-17 15:53:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 43/56 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:52] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:52] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/56 places, 30/32 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s13 1)), p0:(AND (GEQ s10 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-09 finished in 466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 30
Applied a total of 5 rules in 5 ms. Remains 53 /56 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2021-05-17 15:53:52] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-17 15:53:52] [INFO ] Implicit Places using invariants in 47 ms returned [30, 32, 34, 37, 39, 41, 43, 45, 47, 51]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 47 ms to find 10 implicit places.
[2021-05-17 15:53:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:52] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 43/56 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:52] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/56 places, 30/32 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), 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:(OR (LT s4 1) (LT s7 1)), p1:(OR (LT s2 1) (LT s5 1))], nbAcceptance=1, 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 1727 reset in 138 ms.
Product exploration explored 100000 steps with 1707 reset in 162 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1722 reset in 130 ms.
Product exploration explored 100000 steps with 1727 reset in 182 ms.
[2021-05-17 15:53:53] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:53:53] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:53:53] [INFO ] Time to serialize gal into /tmp/LTL14183845565745487902.gal : 1 ms
[2021-05-17 15:53:53] [INFO ] Time to serialize properties into /tmp/LTL11401460705619785286.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/LTL14183845565745487902.gal, -t, CGAL, -LTL, /tmp/LTL11401460705619785286.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/LTL14183845565745487902.gal -t CGAL -LTL /tmp/LTL11401460705619785286.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p_0_2<1)||(r_0_3<1))"))&&(F(G("((p_0_1<1)||(r_0_2<1))"))))))
Formula 0 simplified : !G(F"((p_0_2<1)||(r_0_3<1))" & FG"((p_0_1<1)||(r_0_2<1))")
Reverse transition relation is NOT exact ! Due to transitions t14.t15, t17.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/28/2/30
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
36 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.378224,28912,1,0,678,72524,103,635,1374,97452,1543
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-10 finished in 1436 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X((!p0 U (p1||G(!p0))))&&F(!p2))||X((G(p3)||G(p4)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:54] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-17 15:53:54] [INFO ] Implicit Places using invariants in 47 ms returned [31, 33, 35, 37, 40, 42, 44, 46, 48, 50, 54]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 48 ms to find 11 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:54] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 45/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:54] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (AND p2 (NOT p3) (NOT p4)), (AND (NOT p1) p0 (NOT p4) (NOT p3)), p2, (AND p2 (NOT p4)), (AND p2 (NOT p3)), true, (NOT p3), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p1) p0), (AND (NOT p4) (NOT p1) p0), (AND (NOT p3) (NOT p1) p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-11 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p3 p4), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p4)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3) p4), acceptance={} source=1 dest: 4}, { cond=(AND p2 p3 (NOT p4)), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 p4 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p4) (NOT p1) p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) p4 (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND p3 p4 (NOT p1) p0), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p3) p4 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND p3 (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p4), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p3), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(NOT p4), acceptance={} source=8 dest: 6}, { cond=p4, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=9 dest: 6}, { cond=(AND p3 (NOT p4)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) p4), acceptance={} source=9 dest: 8}, { cond=(AND p3 p4), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=11 dest: 6}, { cond=(AND p4 (NOT p1) p0), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p4 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=12 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=12 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s13 1)), p3:(OR (LT s26 1) (LT s29 1)), p4:(OR (NOT (AND (GEQ s24 1) (GEQ s27 1))) (AND (OR (LT s24 1) (LT s27 1)) (OR (LT s26 1) (LT s29 1)))), p1:(AND (OR (LT s24 1) (LT s27 1)) (OR (LT s26 1) (LT s29 1))), p0:(AND (GEQ s24 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Knowledge obtained : [(NOT p2), p3, p4, p1, (NOT p0)]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (AND p2 (NOT p3) (NOT p4)), (AND (NOT p1) p0 (NOT p4) (NOT p3)), p2, (AND p2 (NOT p4)), (AND p2 (NOT p3)), true, (NOT p3), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p1) p0), (AND (NOT p4) (NOT p1) p0), (AND (NOT p3) (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 393 ms :[(OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (AND p2 (NOT p3) (NOT p4)), (AND (NOT p1) p0 (NOT p4) (NOT p3)), p2, (AND p2 (NOT p4)), (AND p2 (NOT p3)), true, (NOT p3), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p1) p0), (AND (NOT p4) (NOT p1) p0), (AND (NOT p3) (NOT p1) p0)]
Support contains 6 out of 45 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 45/45 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:53:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:56] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 32/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 380 ms.
Product exploration explored 100000 steps with 50000 reset in 385 ms.
[2021-05-17 15:53:57] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:53:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:53:57] [INFO ] Time to serialize gal into /tmp/LTL12193208174756844297.gal : 2 ms
[2021-05-17 15:53:57] [INFO ] Time to serialize properties into /tmp/LTL6927413834238296556.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/LTL12193208174756844297.gal, -t, CGAL, -LTL, /tmp/LTL6927413834238296556.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/LTL12193208174756844297.gal -t CGAL -LTL /tmp/LTL6927413834238296556.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X((G("((p_0_13<1)||(r_0_14<1))"))||(G("(((p_0_12<1)||(r_0_13<1))||(((p_0_12<1)||(r_0_13<1))&&((p_0_13<1)||(r_0_14<1))))"))))||((X(("((p_0_12<1)||(r_0_13<1))")U(("(((p_0_12<1)||(r_0_13<1))&&((p_0_13<1)||(r_0_14<1)))")||(G("((p_0_12<1)||(r_0_13<1))")))))&&(F("((p_0_5<1)||(r_0_6<1))")))))
Formula 0 simplified : !(X(G"((p_0_13<1)||(r_0_14<1))" | G"(((p_0_12<1)||(r_0_13<1))||(((p_0_12<1)||(r_0_13<1))&&((p_0_13<1)||(r_0_14<1))))") | (X("((p_0_12<1)||(r_0_13<1))" U ("(((p_0_12<1)||(r_0_13<1))&&((p_0_13<1)||(r_0_14<1)))" | G"((p_0_12<1)||(r_0_13<1))")) & F"((p_0_5<1)||(r_0_6<1))"))
Reverse transition relation is NOT exact ! Due to transitions t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.046286,19724,1,0,79,6253,129,37,1430,4080,92
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R015C002-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-11 finished in 3254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((p1&&(p2||(p0 U X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:57] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-17 15:53:57] [INFO ] Implicit Places using invariants in 45 ms returned [31, 33, 35, 37, 40, 42, 44, 48, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 46 ms to find 9 implicit places.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:57] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 47/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:57] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ResAllocation-PT-R015C002-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s30 1), p0:(AND (GEQ s17 1) (GEQ s39 1) (GEQ s40 1)), p2:(GEQ s28 1), p3:(OR (LT s21 1) (LT s42 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-12 finished in 276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||F(G(p1))) U (G(!p1)&&p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 30
Applied a total of 5 rules in 4 ms. Remains 53 /56 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2021-05-17 15:53:57] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-17 15:53:57] [INFO ] Implicit Places using invariants in 36 ms returned [30, 32, 34, 37, 39, 41, 43, 47, 51]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 37 ms to find 9 implicit places.
[2021-05-17 15:53:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2021-05-17 15:53:57] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 15:53:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 44/56 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2021-05-17 15:53:57] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 15:53:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 44/56 places, 30/32 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p2) p1), (NOT p1), p1, false]
Running random walk in product with property : ResAllocation-PT-R015C002-13 automaton TGBA [mat=[[{ cond=(OR (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s3 1)), p1:(OR (LT s19 1) (LT s38 1) (LT s39 1)), p0:(AND (GEQ s8 1) (GEQ s11 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 1458 reset in 107 ms.
Product exploration explored 100000 steps with 1461 reset in 119 ms.
Knowledge obtained : [(NOT p2), p1, (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) p1), (NOT p1), p1, false]
Product exploration explored 100000 steps with 1457 reset in 136 ms.
Product exploration explored 100000 steps with 1463 reset in 154 ms.
[2021-05-17 15:53:58] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:53:58] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:53:58] [INFO ] Time to serialize gal into /tmp/LTL7382425507861296321.gal : 7 ms
[2021-05-17 15:53:58] [INFO ] Time to serialize properties into /tmp/LTL10946810764264964868.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/LTL7382425507861296321.gal, -t, CGAL, -LTL, /tmp/LTL10946810764264964868.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/LTL7382425507861296321.gal -t CGAL -LTL /tmp/LTL10946810764264964868.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((F(G("(((r_0_9<1)||(r_1_9<1))||(p_1_10<1))")))||("((p_0_4>=1)&&(r_0_5>=1))"))U(("((p_0_0>=1)&&(r_0_1>=1))")&&(G("(((r_0_9>=1)&&(r_1_9>=1))&&(p_1_10>=1))")))))
Formula 0 simplified : !(("((p_0_4>=1)&&(r_0_5>=1))" | FG"(((r_0_9<1)||(r_1_9<1))||(p_1_10<1))") U ("((p_0_0>=1)&&(r_0_1>=1))" & G"(((r_0_9>=1)&&(r_1_9>=1))&&(p_1_10>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t14.t15, t17.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/28/2/30
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
32 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.349214,29392,1,0,534,61779,95,547,1353,90465,1157
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-13 finished in 1384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G((p0||F(!p1))))&&F(!p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:59] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-17 15:53:59] [INFO ] Implicit Places using invariants in 28 ms returned [31, 33, 37, 40, 42, 46, 48, 50, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 29 ms to find 9 implicit places.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:59] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 47/56 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:59] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR p2 (AND (NOT p0) p1)), (OR p2 (AND (NOT p0) p1)), p2, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s28 1), p0:(AND (GEQ s15 1) (GEQ s39 1) (GEQ s40 1)), p1:(OR (LT s5 1) (LT s33 1) (LT s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-14 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&(F(p1)||X(((F(p0)&&F(p2))||G(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 56 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 56/56 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 56 /56 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 56 cols
[2021-05-17 15:53:59] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-17 15:53:59] [INFO ] Implicit Places using invariants in 28 ms returned [31, 33, 35, 37, 40, 42, 44, 46, 50]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 29 ms to find 9 implicit places.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:59] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 15:53:59] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 47/56 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:59] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/56 places, 32/32 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R015C002-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s19 1) (LT s40 1) (LT s41 1)), p1:(AND (GEQ s27 1) (GEQ s45 1) (GEQ s46 1)), p2:(OR (LT s2 1) (LT s5 1))], 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]]
Stuttering criterion allowed to conclude after 562 steps with 57 reset in 2 ms.
FORMULA ResAllocation-PT-R015C002-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-15 finished in 247 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621266839945

--------------------
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="ResAllocation-PT-R015C002"
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 ResAllocation-PT-R015C002, 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-162089416400797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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