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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:03 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 360K 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-R003C050-00
FORMULA_NAME ResAllocation-PT-R003C050-01
FORMULA_NAME ResAllocation-PT-R003C050-02
FORMULA_NAME ResAllocation-PT-R003C050-03
FORMULA_NAME ResAllocation-PT-R003C050-04
FORMULA_NAME ResAllocation-PT-R003C050-05
FORMULA_NAME ResAllocation-PT-R003C050-06
FORMULA_NAME ResAllocation-PT-R003C050-07
FORMULA_NAME ResAllocation-PT-R003C050-08
FORMULA_NAME ResAllocation-PT-R003C050-09
FORMULA_NAME ResAllocation-PT-R003C050-10
FORMULA_NAME ResAllocation-PT-R003C050-11
FORMULA_NAME ResAllocation-PT-R003C050-12
FORMULA_NAME ResAllocation-PT-R003C050-13
FORMULA_NAME ResAllocation-PT-R003C050-14
FORMULA_NAME ResAllocation-PT-R003C050-15

=== Now, execution of the tool begins

BK_START 1621265820338

Running Version 0
[2021-05-17 15:37:01] [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:37:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:37:02] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-05-17 15:37:02] [INFO ] Transformed 300 places.
[2021-05-17 15:37:02] [INFO ] Transformed 200 transitions.
[2021-05-17 15:37:02] [INFO ] Parsed PT model containing 300 places and 200 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:37:02] [INFO ] Initial state test concluded for 4 properties.
FORMULA ResAllocation-PT-R003C050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 25 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2021-05-17 15:37:02] [INFO ] Computed 150 place invariants in 13 ms
[2021-05-17 15:37:02] [INFO ] Implicit Places using invariants in 237 ms returned [295, 297, 299]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 258 ms to find 3 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:02] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:02] [INFO ] Dead Transitions using invariants and state equation in 216 ms returned []
Starting structural reductions, iteration 1 : 297/300 places, 200/200 transitions.
Applied a total of 0 rules in 12 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:02] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:02] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 2 iterations. Remains : 297/300 places, 200/200 transitions.
[2021-05-17 15:37:03] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 15:37:03] [INFO ] Flatten gal took : 48 ms
FORMULA ResAllocation-PT-R003C050-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:37:03] [INFO ] Flatten gal took : 20 ms
[2021-05-17 15:37:03] [INFO ] Input system was already deterministic with 200 transitions.
Finished random walk after 17409 steps, including 164 resets, run visited all 21 properties in 110 ms. (steps per millisecond=158 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 249 transition count 152
Applied a total of 96 rules in 38 ms. Remains 249 /297 variables (removed 48) and now considering 152/200 (removed 48) transitions.
// Phase 1: matrix 152 rows 249 cols
[2021-05-17 15:37:03] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:03] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 152 rows 249 cols
[2021-05-17 15:37:03] [INFO ] Computed 147 place invariants in 4 ms
[2021-05-17 15:37:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2021-05-17 15:37:03] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 152 rows 249 cols
[2021-05-17 15:37:03] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:03] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 249/297 places, 152/200 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 4 ms.
FORMULA ResAllocation-PT-R003C050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-00 finished in 767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 94 place count 250 transition count 153
Applied a total of 94 rules in 28 ms. Remains 250 /297 variables (removed 47) and now considering 153/200 (removed 47) transitions.
// Phase 1: matrix 153 rows 250 cols
[2021-05-17 15:37:04] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:04] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 153 rows 250 cols
[2021-05-17 15:37:04] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:04] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2021-05-17 15:37:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 153 rows 250 cols
[2021-05-17 15:37:04] [INFO ] Computed 147 place invariants in 0 ms
[2021-05-17 15:37:04] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/297 places, 153/200 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LT s115 1), p0:(AND (GEQ s156 1) (GEQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 982 reset in 631 ms.
Stack based approach found an accepted trace after 12356 steps with 120 reset with depth 107 and stack size 107 in 96 ms.
FORMULA ResAllocation-PT-R003C050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-01 finished in 1345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X((X(p1)&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:05] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:05] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:05] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:05] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:05] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:06] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s25 1)), p2:(GEQ s268 1), p1:(AND (GEQ s149 1) (GEQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 1 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-03 finished in 982 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:06] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:06] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:06] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:06] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:06] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:07] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-05 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:(GEQ s66 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 2 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-05 finished in 802 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)||F(p1)) U p2))], workingDir=/home/mcc/execution]
Support contains 7 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:07] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:07] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:07] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:07] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:07] [INFO ] Computed 147 place invariants in 3 ms
[2021-05-17 15:37:07] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-06 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s181 1) (GEQ s187 1) (GEQ s188 1)), p1:(OR (LT s93 1) (LT s96 1) (LT s99 1)), p0:(GEQ s100 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-06 finished in 773 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 248 transition count 151
Applied a total of 98 rules in 24 ms. Remains 248 /297 variables (removed 49) and now considering 151/200 (removed 49) transitions.
// Phase 1: matrix 151 rows 248 cols
[2021-05-17 15:37:08] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:08] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 151 rows 248 cols
[2021-05-17 15:37:08] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:08] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2021-05-17 15:37:08] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 151 rows 248 cols
[2021-05-17 15:37:08] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:08] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 248/297 places, 151/200 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s178 1) (LT s181 1) (LT s184 1) (LT s121 1) (LT s126 1) (LT s127 1)) (OR (LT s178 1) (LT s181 1) (LT s184 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1485 reset in 841 ms.
Stack based approach found an accepted trace after 50463 steps with 743 reset with depth 14 and stack size 14 in 315 ms.
FORMULA ResAllocation-PT-R003C050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-07 finished in 1733 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:09] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:09] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:09] [INFO ] Computed 147 place invariants in 5 ms
[2021-05-17 15:37:10] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:10] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:10] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ResAllocation-PT-R003C050-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s171 1) (GEQ s177 1) (GEQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 ResAllocation-PT-R003C050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-09 finished in 661 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 247 transition count 150
Applied a total of 100 rules in 21 ms. Remains 247 /297 variables (removed 50) and now considering 150/200 (removed 50) transitions.
// Phase 1: matrix 150 rows 247 cols
[2021-05-17 15:37:10] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:10] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 150 rows 247 cols
[2021-05-17 15:37:10] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:10] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2021-05-17 15:37:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 150 rows 247 cols
[2021-05-17 15:37:10] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:11] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 247/297 places, 150/200 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s47 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-10 finished in 612 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:11] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:11] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:11] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:11] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:11] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:11] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ResAllocation-PT-R003C050-11 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s235 1) (GEQ s241 1)), p1:(AND (GEQ s7 1) (GEQ s13 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 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-11 finished in 853 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 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:11] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:12] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:12] [INFO ] Computed 147 place invariants in 6 ms
[2021-05-17 15:37:12] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:12] [INFO ] Computed 147 place invariants in 0 ms
[2021-05-17 15:37:12] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s162 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 50000 reset in 724 ms.
Product exploration explored 100000 steps with 50000 reset in 605 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 297 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 297 transition count 200
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 49 rules in 47 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2021-05-17 15:37:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:15] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:15] [INFO ] Dead Transitions using invariants and state equation in 181 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Product exploration explored 100000 steps with 50000 reset in 2540 ms.
Product exploration explored 100000 steps with 50000 reset in 1918 ms.
[2021-05-17 15:37:19] [INFO ] Flatten gal took : 16 ms
[2021-05-17 15:37:19] [INFO ] Flatten gal took : 15 ms
[2021-05-17 15:37:19] [INFO ] Time to serialize gal into /tmp/LTL3399345616428813091.gal : 7 ms
[2021-05-17 15:37:19] [INFO ] Time to serialize properties into /tmp/LTL4454243542281228868.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/LTL3399345616428813091.gal, -t, CGAL, -LTL, /tmp/LTL4454243542281228868.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/LTL3399345616428813091.gal -t CGAL -LTL /tmp/LTL4454243542281228868.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p_27_0<1)"))))
Formula 0 simplified : !XF"(p_27_0<1)"
Detected timeout of ITS tools.
[2021-05-17 15:37:35] [INFO ] Flatten gal took : 15 ms
[2021-05-17 15:37:35] [INFO ] Applying decomposition
[2021-05-17 15:37:35] [INFO ] Flatten gal took : 13 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/graph4229897967445054236.txt, -o, /tmp/graph4229897967445054236.bin, -w, /tmp/graph4229897967445054236.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/graph4229897967445054236.bin, -l, -1, -v, -w, /tmp/graph4229897967445054236.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:37:35] [INFO ] Decomposing Gal with order
[2021-05-17 15:37:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:37:35] [INFO ] Flatten gal took : 43 ms
[2021-05-17 15:37:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 15:37:35] [INFO ] Time to serialize gal into /tmp/LTL3574730099845822945.gal : 6 ms
[2021-05-17 15:37:35] [INFO ] Time to serialize properties into /tmp/LTL6837929759095343805.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/LTL3574730099845822945.gal, -t, CGAL, -LTL, /tmp/LTL6837929759095343805.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/LTL3574730099845822945.gal -t CGAL -LTL /tmp/LTL6837929759095343805.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i5.i2.u56.p_27_0<1)"))))
Formula 0 simplified : !XF"(i5.i2.u56.p_27_0<1)"
Reverse transition relation is NOT exact ! Due to transitions t19, t36, t51, t68, t91, t115, t116, t124, t148, t180, i0.t11, i0.i0.u2.t3, i0.i2.t4, i0.i2.t12, i1.t20, i1.u13.t27, i1.u15.t28, i1.u16.t35, i2.i0.t43, i2.i1.u21.t44, i3.t67, i3.t60, i3.t59, i3.t52, i4.i0.t76, i4.i1.t75, i4.i1.t83, i5.t100, i5.i0.t84, i5.i0.t92, i5.i1.t99, i5.i1.t107, i5.i2.t108, i6.i0.t123, i6.i0.t131, i7.t140, i7.i0.t132, i7.i1.t139, i7.i1.t147, i8.i0.t156, i8.i1.t155, i8.i1.t163, i9.i0.t164, i9.i1.t171, i9.i1.t179, i9.i2.t172, i10.t188, i10.i1.t187, i10.i1.t195, i10.i2.u116.t196, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/150/50/200
Computing Next relation with stutter on 1.22154e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
154 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,1.5803,91796,1,0,138370,1621,3617,484824,503,6155,135384
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C050-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResAllocation-PT-R003C050-12 finished in 25267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G((p0||X(p1)))||X(p2))))], workingDir=/home/mcc/execution]
Support contains 8 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 11 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:37] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:37] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:37] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:37] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:37] [INFO ] Computed 147 place invariants in 4 ms
[2021-05-17 15:37:37] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : ResAllocation-PT-R003C050-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s39 1) (GEQ s45 1) (GEQ s46 1)), p1:(OR (LT s55 1) (LT s61 1)), p2:(OR (LT s159 1) (LT s165 1) (LT s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 26 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-13 finished in 795 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:37] [INFO ] Computed 147 place invariants in 2 ms
[2021-05-17 15:37:38] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:38] [INFO ] Computed 147 place invariants in 1 ms
[2021-05-17 15:37:38] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 297 cols
[2021-05-17 15:37:38] [INFO ] Computed 147 place invariants in 9 ms
[2021-05-17 15:37:38] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R003C050-14 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s59 1) (LT s62 1) (LT s65 1)) (OR (LT s65 1) (LT s71 1))), p0:(OR (LT s273 1) (LT s276 1) (LT s279 1) (AND (OR (LT s59 1) (LT s62 1) (LT s65 1)) (OR (LT s65 1) (LT s71 1)))), p2:(OR (LT s273 1) (LT s276 1) (LT s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 946 reset in 695 ms.
Product exploration explored 100000 steps with 948 reset in 549 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 944 reset in 681 ms.
Product exploration explored 100000 steps with 947 reset in 540 ms.
[2021-05-17 15:37:41] [INFO ] Flatten gal took : 27 ms
[2021-05-17 15:37:41] [INFO ] Flatten gal took : 22 ms
[2021-05-17 15:37:41] [INFO ] Time to serialize gal into /tmp/LTL11624386987009344752.gal : 3 ms
[2021-05-17 15:37:41] [INFO ] Time to serialize properties into /tmp/LTL4637412396300265114.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/LTL11624386987009344752.gal, -t, CGAL, -LTL, /tmp/LTL4637412396300265114.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/LTL11624386987009344752.gal -t CGAL -LTL /tmp/LTL4637412396300265114.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((r_45_1<1)||(p_46_0<1))||(r_46_1<1))||((((r_9_2<1)||(p_10_1<1))||(r_10_2<1))&&((r_10_2<1)||(r_11_2<1))))")&&((X("(((r_45_1<1)||(p_46_0<1))||(r_46_1<1))"))||("((((r_9_2<1)||(p_10_1<1))||(r_10_2<1))&&((r_10_2<1)||(r_11_2<1)))"))))))
Formula 0 simplified : !FG("((((r_45_1<1)||(p_46_0<1))||(r_46_1<1))||((((r_9_2<1)||(p_10_1<1))||(r_10_2<1))&&((r_10_2<1)||(r_11_2<1))))" & ("((((r_9_2<1)||(p_10_1<1))||(r_10_2<1))&&((r_10_2<1)||(r_11_2<1)))" | X"(((r_45_1<1)||(p_46_0<1))||(r_46_1<1))"))
Detected timeout of ITS tools.
[2021-05-17 15:37:56] [INFO ] Flatten gal took : 26 ms
[2021-05-17 15:37:56] [INFO ] Applying decomposition
[2021-05-17 15:37:56] [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/graph10689763178742012968.txt, -o, /tmp/graph10689763178742012968.bin, -w, /tmp/graph10689763178742012968.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/graph10689763178742012968.bin, -l, -1, -v, -w, /tmp/graph10689763178742012968.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:37:56] [INFO ] Decomposing Gal with order
[2021-05-17 15:37:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:37:56] [INFO ] Flatten gal took : 27 ms
[2021-05-17 15:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:37:56] [INFO ] Time to serialize gal into /tmp/LTL5246838057916451572.gal : 7 ms
[2021-05-17 15:37:56] [INFO ] Time to serialize properties into /tmp/LTL3146591670708850869.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/LTL5246838057916451572.gal, -t, CGAL, -LTL, /tmp/LTL3146591670708850869.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/LTL5246838057916451572.gal -t CGAL -LTL /tmp/LTL3146591670708850869.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((i8.u101.r_45_1<1)||(i8.u103.p_46_0<1))||(i8.u104.r_46_1<1))||((((i2.i0.i0.u23.r_9_2<1)||(i2.i0.i0.u25.p_10_1<1))||(i2.i0.i0.u26.r_10_2<1))&&((i2.i0.i0.u26.r_10_2<1)||(i2.i0.i0.u28.r_11_2<1))))")&&((X("(((i8.u101.r_45_1<1)||(i8.u103.p_46_0<1))||(i8.u104.r_46_1<1))"))||("((((i2.i0.i0.u23.r_9_2<1)||(i2.i0.i0.u25.p_10_1<1))||(i2.i0.i0.u26.r_10_2<1))&&((i2.i0.i0.u26.r_10_2<1)||(i2.i0.i0.u28.r_11_2<1)))"))))))
Formula 0 simplified : !FG("((((i8.u101.r_45_1<1)||(i8.u103.p_46_0<1))||(i8.u104.r_46_1<1))||((((i2.i0.i0.u23.r_9_2<1)||(i2.i0.i0.u25.p_10_1<1))||(i2.i0.i0.u26.r_10_2<1))&&((i2.i0.i0.u26.r_10_2<1)||(i2.i0.i0.u28.r_11_2<1))))" & ("((((i2.i0.i0.u23.r_9_2<1)||(i2.i0.i0.u25.p_10_1<1))||(i2.i0.i0.u26.r_10_2<1))&&((i2.i0.i0.u26.r_10_2<1)||(i2.i0.i0.u28.r_11_2<1)))" | X"(((i8.u101.r_45_1<1)||(i8.u103.p_46_0<1))||(i8.u104.r_46_1<1))"))
Reverse transition relation is NOT exact ! Due to transitions t44, t75, t99, t140, t180, i0.t11, i0.i0.i0.t12, i0.i0.i0.t4, i0.i0.i1.u2.t3, i0.i1.i0.t19, i0.i1.i0.u16.t27, i0.i1.i1.t20, i1.t35, i1.t28, i1.u21.t36, i2.t59, i2.i0.i0.t43, i2.i0.i0.u28.t51, i2.i0.i1.t60, i2.i0.i1.t52, i2.i1.i0.t67, i2.i1.i1.t68, i3.t92, i3.t91, i3.t84, i3.t83, i3.t76, i4.t116, i4.i0.i0.t108, i4.i0.i0.t100, i4.i0.i1.t107, i4.i1.i0.t123, i4.i1.i0.t115, i4.i1.i1.t124, i5.t139, i5.t132, i5.t131, i6.t155, i6.t148, i6.t147, i6.u87.t156, i7.t172, i7.t171, i7.t164, i7.t163, i8.t195, i8.t188, i8.t187, i8.t179, i8.u109.t196, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/150/50/200
Computing Next relation with stutter on 1.22154e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12947107290399626293
[2021-05-17 15:38:11] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12947107290399626293
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/ltsmin12947107290399626293]
Compilation finished in 957 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12947107290399626293]
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)&&(X((LTLAPp1==true))||(LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12947107290399626293]
LTSmin run took 521 ms.
FORMULA ResAllocation-PT-R003C050-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R003C050-14 finished in 35300 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621265893436

--------------------
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-R003C050"
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-R003C050, 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-162089416300765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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