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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K 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.9K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 18K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:05 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 212K 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-R050C002-00
FORMULA_NAME ResAllocation-PT-R050C002-01
FORMULA_NAME ResAllocation-PT-R050C002-02
FORMULA_NAME ResAllocation-PT-R050C002-03
FORMULA_NAME ResAllocation-PT-R050C002-04
FORMULA_NAME ResAllocation-PT-R050C002-05
FORMULA_NAME ResAllocation-PT-R050C002-06
FORMULA_NAME ResAllocation-PT-R050C002-07
FORMULA_NAME ResAllocation-PT-R050C002-08
FORMULA_NAME ResAllocation-PT-R050C002-09
FORMULA_NAME ResAllocation-PT-R050C002-10
FORMULA_NAME ResAllocation-PT-R050C002-11
FORMULA_NAME ResAllocation-PT-R050C002-12
FORMULA_NAME ResAllocation-PT-R050C002-13
FORMULA_NAME ResAllocation-PT-R050C002-14
FORMULA_NAME ResAllocation-PT-R050C002-15

=== Now, execution of the tool begins

BK_START 1621266953020

Running Version 0
[2021-05-17 15:55:54] [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:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:55:54] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-17 15:55:54] [INFO ] Transformed 200 places.
[2021-05-17 15:55:54] [INFO ] Transformed 102 transitions.
[2021-05-17 15:55:54] [INFO ] Parsed PT model containing 200 places and 102 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:55:54] [INFO ] Initial state test concluded for 4 properties.
FORMULA ResAllocation-PT-R050C002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 17 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2021-05-17 15:55:55] [INFO ] Computed 100 place invariants in 10 ms
[2021-05-17 15:55:55] [INFO ] Implicit Places using invariants in 240 ms returned [101, 103, 105, 107, 109, 111, 115, 119, 121, 123, 125, 129, 131, 135, 139, 141, 143, 145, 147, 151, 153, 157, 161, 165, 167, 169, 171, 173, 179, 181, 185, 187, 189, 191, 193, 195, 199]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 268 ms to find 37 implicit places.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:55:55] [INFO ] Computed 63 place invariants in 9 ms
[2021-05-17 15:55:55] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 163/200 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:55:55] [INFO ] Computed 63 place invariants in 4 ms
[2021-05-17 15:55:55] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 2 iterations. Remains : 163/200 places, 102/102 transitions.
[2021-05-17 15:55:55] [INFO ] Initial state reduction rules for LTL removed 6 formulas.
[2021-05-17 15:55:55] [INFO ] Flatten gal took : 43 ms
FORMULA ResAllocation-PT-R050C002-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:55:55] [INFO ] Flatten gal took : 14 ms
[2021-05-17 15:55:55] [INFO ] Input system was already deterministic with 102 transitions.
Incomplete random walk after 100000 steps, including 150 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 18) seen :11
Running SMT prover for 7 properties.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:55:56] [INFO ] Computed 63 place invariants in 7 ms
[2021-05-17 15:55:56] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2021-05-17 15:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:56] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 15:55:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 15:55:56] [INFO ] Added : 49 causal constraints over 10 iterations in 147 ms. Result :sat
[2021-05-17 15:55:56] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2021-05-17 15:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:56] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-17 15:55:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 15:55:56] [INFO ] Added : 47 causal constraints over 10 iterations in 99 ms. Result :sat
[2021-05-17 15:55:56] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2021-05-17 15:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:56] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-17 15:55:56] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
[2021-05-17 15:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-17 15:55:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:55:56] [INFO ] [Nat]Absence check using 63 positive place invariants in 10 ms returned sat
[2021-05-17 15:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:56] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-17 15:55:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2021-05-17 15:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-17 15:55:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:55:57] [INFO ] Added : 83 causal constraints over 17 iterations in 175 ms. Result :sat
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2021-05-17 15:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-17 15:55:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:55:57] [INFO ] Added : 47 causal constraints over 10 iterations in 96 ms. Result :sat
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2021-05-17 15:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-17 15:55:57] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2021-05-17 15:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-17 15:55:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:55:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 8 ms returned sat
[2021-05-17 15:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:57] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-17 15:55:57] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-17 15:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-17 15:55:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 15:55:57] [INFO ] Added : 83 causal constraints over 17 iterations in 127 ms. Result :sat
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2021-05-17 15:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-17 15:55:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:55:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 10 ms returned sat
[2021-05-17 15:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:57] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-17 15:55:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 15:55:57] [INFO ] Added : 86 causal constraints over 18 iterations in 134 ms. Result :sat
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2021-05-17 15:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:57] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-17 15:55:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2021-05-17 15:55:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-17 15:55:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2021-05-17 15:55:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:55:58] [INFO ] [Nat]Absence check using 63 positive place invariants in 22 ms returned sat
[2021-05-17 15:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:55:58] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-17 15:55:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2021-05-17 15:55:58] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-17 15:55:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 51 ms
[2021-05-17 15:55:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 15:55:58] [INFO ] Added : 80 causal constraints over 16 iterations in 121 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(p0&&G((p1&&X(G((G(p3)||p2))))))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:55:58] [INFO ] Computed 63 place invariants in 1 ms
[2021-05-17 15:55:58] [INFO ] Implicit Places using invariants in 93 ms returned [116, 120, 130, 134, 137, 140, 147, 149, 153, 161]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 95 ms to find 10 implicit places.
// Phase 1: matrix 102 rows 153 cols
[2021-05-17 15:55:58] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-17 15:55:58] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 153/163 places, 102/102 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 153 cols
[2021-05-17 15:55:58] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-17 15:55:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 2 iterations. Remains : 153/163 places, 102/102 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND p1 (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p0) p2 (NOT p3)) (AND p1 (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ResAllocation-PT-R050C002-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0, 2, 3} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1, 2, 3} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 2, 3} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={2, 3} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={2, 3} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={0, 3} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={3} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0, 3} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0, 1, 3} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p0) p3)), acceptance={0, 1, 2, 3} source=2 dest: 0}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={0, 2, 3} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2, 3} source=2 dest: 1}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={0, 2, 3} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1, 2, 3} source=2 dest: 2}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={2, 3} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=3 dest: 0}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={0, 2} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={2, 3} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={0, 3} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 p3), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={3} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0, 3} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0, 1, 3} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0, 1, 2, 3} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0, 2, 3} source=4 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0, 1, 2, 3} source=4 dest: 1}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={0, 2, 3} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={1, 2, 3} source=4 dest: 2}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={2, 3} source=4 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1, 3} source=4 dest: 3}, { cond=(AND p1 p0 p2 p3), acceptance={0, 3} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p3), acceptance={1, 3} source=4 dest: 4}, { cond=(AND p1 p0 p2 p3), acceptance={3} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={0, 1, 3} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0, 3} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 2, 3} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1, 2, 3} source=5 dest: 0}, { cond=(AND p1 p0 (NOT p3)), acceptance={0, 2, 3} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p3)), acceptance={2, 3} source=5 dest: 2}, { cond=(AND p1 p0 p3), acceptance={0, 3} source=5 dest: 3}, { cond=(AND p1 p0 p3), acceptance={3} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={0, 3} source=5 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={0, 1, 3} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s37 1) (LT s121 1) (LT s122 1)), p0:(OR (LT s13 1) (LT s107 1) (LT s108 1)), p2:(OR (LT s17 1) (LT s110 1) (LT s111 1)), p3:(OR (LT s17 1) (LT s110 1) (LT s111 1))], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 150 reset in 604 ms.
Product exploration explored 100000 steps with 150 reset in 371 ms.
Knowledge obtained : [p1, p0, p2, p3]
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND p1 (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p0) p2 (NOT p3)) (AND p1 (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 150 reset in 457 ms.
Product exploration explored 100000 steps with 151 reset in 458 ms.
Applying partial POR strategy [true, true, true, true, true, true]
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND p1 (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p0) p2 (NOT p3)) (AND p1 (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 9 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 153/153 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 22 ms. Remains 153 /153 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-17 15:56:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 102 rows 153 cols
[2021-05-17 15:56:02] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-17 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 102/102 transitions.
Product exploration explored 100000 steps with 151 reset in 414 ms.
Product exploration explored 100000 steps with 150 reset in 395 ms.
[2021-05-17 15:56:03] [INFO ] Flatten gal took : 11 ms
[2021-05-17 15:56:03] [INFO ] Flatten gal took : 15 ms
[2021-05-17 15:56:03] [INFO ] Time to serialize gal into /tmp/LTL6279775558876315238.gal : 21 ms
[2021-05-17 15:56:03] [INFO ] Time to serialize properties into /tmp/LTL16914174805570632436.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/LTL6279775558876315238.gal, -t, CGAL, -LTL, /tmp/LTL16914174805570632436.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/LTL6279775558876315238.gal -t CGAL -LTL /tmp/LTL16914174805570632436.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(((r_0_6<1)||(r_1_6<1))||(p_1_7<1))")U((G("(((r_0_6<1)||(r_1_6<1))||(p_1_7<1))"))||((G(("(((r_0_18<1)||(r_1_18<1))||(p_1_19<1))")&&(X(G(("(((r_0_8<1)||(r_1_8<1))||(p_1_9<1))")||(G("(((r_0_8<1)||(r_1_8<1))||(p_1_9<1))")))))))&&("(((r_0_6<1)||(r_1_6<1))||(p_1_7<1))"))))))
Formula 0 simplified : !F("(((r_0_6<1)||(r_1_6<1))||(p_1_7<1))" U (G"(((r_0_6<1)||(r_1_6<1))||(p_1_7<1))" | ("(((r_0_6<1)||(r_1_6<1))||(p_1_7<1))" & G("(((r_0_18<1)||(r_1_18<1))||(p_1_19<1))" & XG("(((r_0_8<1)||(r_1_8<1))||(p_1_9<1))" | G"(((r_0_8<1)||(r_1_8<1))||(p_1_9<1))")))))
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2021-05-17 15:56:18] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:56:18] [INFO ] Applying decomposition
[2021-05-17 15:56:18] [INFO ] Flatten gal took : 6 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/graph1288443283756617442.txt, -o, /tmp/graph1288443283756617442.bin, -w, /tmp/graph1288443283756617442.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/graph1288443283756617442.bin, -l, -1, -v, -w, /tmp/graph1288443283756617442.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:56:18] [INFO ] Decomposing Gal with order
[2021-05-17 15:56:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:56:18] [INFO ] Flatten gal took : 49 ms
[2021-05-17 15:56:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:56:18] [INFO ] Time to serialize gal into /tmp/LTL13281522878365332956.gal : 4 ms
[2021-05-17 15:56:18] [INFO ] Time to serialize properties into /tmp/LTL13337995114589501046.ltl : 5 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/LTL13281522878365332956.gal, -t, CGAL, -LTL, /tmp/LTL13337995114589501046.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/LTL13281522878365332956.gal -t CGAL -LTL /tmp/LTL13337995114589501046.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(((i1.i0.u6.r_0_6<1)||(i1.i0.u50.r_1_6<1))||(i1.i0.u7.p_1_7<1))")U((G("(((i1.i0.u6.r_0_6<1)||(i1.i0.u50.r_1_6<1))||(i1.i0.u7.p_1_7<1))"))||((G(("(((i3.i0.u18.r_0_18<1)||(i3.i0.u52.r_1_18<1))||(i3.i1.u19.p_1_19<1))")&&(X(G(("(((i1.i0.u8.r_0_8<1)||(i1.i0.u51.r_1_8<1))||(i1.i1.u9.p_1_9<1))")||(G("(((i1.i0.u8.r_0_8<1)||(i1.i0.u51.r_1_8<1))||(i1.i1.u9.p_1_9<1))")))))))&&("(((i1.i0.u6.r_0_6<1)||(i1.i0.u50.r_1_6<1))||(i1.i0.u7.p_1_7<1))"))))))
Formula 0 simplified : !F("(((i1.i0.u6.r_0_6<1)||(i1.i0.u50.r_1_6<1))||(i1.i0.u7.p_1_7<1))" U (G"(((i1.i0.u6.r_0_6<1)||(i1.i0.u50.r_1_6<1))||(i1.i0.u7.p_1_7<1))" | ("(((i1.i0.u6.r_0_6<1)||(i1.i0.u50.r_1_6<1))||(i1.i0.u7.p_1_7<1))" & G("(((i3.i0.u18.r_0_18<1)||(i3.i0.u52.r_1_18<1))||(i3.i1.u19.p_1_19<1))" & XG("(((i1.i0.u8.r_0_8<1)||(i1.i0.u51.r_1_8<1))||(i1.i1.u9.p_1_9<1))" | G"(((i1.i0.u8.r_0_8<1)||(i1.i0.u51.r_1_8<1))||(i1.i1.u9.p_1_9<1))")))))
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
108 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.11313,63620,1,0,91528,53,1119,176800,87,77,100773
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResAllocation-PT-R050C002-00 finished in 21629 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&G(p1))) U (p2||(p3 U p1))))], workingDir=/home/mcc/execution]
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 100
Applied a total of 4 rules in 27 ms. Remains 161 /163 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 161 cols
[2021-05-17 15:56:19] [INFO ] Computed 63 place invariants in 1 ms
[2021-05-17 15:56:20] [INFO ] Implicit Places using invariants in 122 ms returned [105, 108, 114, 121, 128, 132, 135, 138, 145, 147, 151, 159]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 137 ms to find 12 implicit places.
[2021-05-17 15:56:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 149 cols
[2021-05-17 15:56:20] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-17 15:56:20] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 149/163 places, 100/102 transitions.
Applied a total of 0 rules in 14 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-17 15:56:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 149 cols
[2021-05-17 15:56:20] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-17 15:56:20] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/163 places, 100/102 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-01 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s33 1) (GEQ s115 1) (GEQ s116 1)), p1:(AND (GEQ s48 1) (GEQ s51 1)), p3:(AND (GEQ s38 1) (GEQ s41 1) (GEQ s88 1) (GEQ s91 1)), p0:(OR (LT s38 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 659 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R050C002-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-01 finished in 497 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 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:56:20] [INFO ] Computed 63 place invariants in 0 ms
[2021-05-17 15:56:20] [INFO ] Implicit Places using invariants in 225 ms returned [107, 110, 116, 120, 123, 130, 134, 137, 147, 149, 153, 161]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 228 ms to find 12 implicit places.
// Phase 1: matrix 102 rows 151 cols
[2021-05-17 15:56:20] [INFO ] Computed 51 place invariants in 0 ms
[2021-05-17 15:56:20] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 151/163 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 151 cols
[2021-05-17 15:56:20] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-17 15:56:20] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 151/163 places, 102/102 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-03 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:(AND (GEQ s63 1) (GEQ s132 1) (GEQ s133 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 0 ms.
FORMULA ResAllocation-PT-R050C002-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-03 finished in 555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 100
Applied a total of 4 rules in 14 ms. Remains 161 /163 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 161 cols
[2021-05-17 15:56:20] [INFO ] Computed 63 place invariants in 0 ms
[2021-05-17 15:56:21] [INFO ] Implicit Places using invariants in 148 ms returned [105, 108, 114, 118, 121, 128, 135, 138, 145, 147, 151, 159]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 149 ms to find 12 implicit places.
[2021-05-17 15:56:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 149 cols
[2021-05-17 15:56:21] [INFO ] Computed 51 place invariants in 0 ms
[2021-05-17 15:56:21] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 149/163 places, 100/102 transitions.
Applied a total of 0 rules in 13 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-17 15:56:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 149 cols
[2021-05-17 15:56:21] [INFO ] Computed 51 place invariants in 0 ms
[2021-05-17 15:56:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/163 places, 100/102 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s126 1) (GEQ s127 1)) (AND (GEQ s52 1) (GEQ s55 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 675 steps with 0 reset in 6 ms.
FORMULA ResAllocation-PT-R050C002-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-04 finished in 431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||X((p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:56:21] [INFO ] Computed 63 place invariants in 1 ms
[2021-05-17 15:56:21] [INFO ] Implicit Places using invariants in 105 ms returned [107, 110, 120, 123, 130, 134, 137, 140, 149, 153, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 106 ms to find 11 implicit places.
// Phase 1: matrix 102 rows 152 cols
[2021-05-17 15:56:21] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 15:56:21] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 152/163 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 152 cols
[2021-05-17 15:56:21] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 15:56:21] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/163 places, 102/102 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R050C002-05 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s27 1) (LT s114 1) (LT s115 1)), p1:(AND (GEQ s75 1) (GEQ s139 1) (GEQ s140 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, null][false, false, false]]
Product exploration explored 100000 steps with 1637 reset in 238 ms.
Product exploration explored 100000 steps with 1670 reset in 358 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1646 reset in 263 ms.
Product exploration explored 100000 steps with 1665 reset in 299 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 152 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 152/152 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-17 15:56:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 152 cols
[2021-05-17 15:56:23] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 15:56:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 102/102 transitions.
Product exploration explored 100000 steps with 1676 reset in 237 ms.
Product exploration explored 100000 steps with 1688 reset in 250 ms.
[2021-05-17 15:56:23] [INFO ] Flatten gal took : 17 ms
[2021-05-17 15:56:23] [INFO ] Flatten gal took : 14 ms
[2021-05-17 15:56:23] [INFO ] Time to serialize gal into /tmp/LTL2818214689560468491.gal : 3 ms
[2021-05-17 15:56:23] [INFO ] Time to serialize properties into /tmp/LTL17685048849809845720.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/LTL2818214689560468491.gal, -t, CGAL, -LTL, /tmp/LTL17685048849809845720.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/LTL2818214689560468491.gal -t CGAL -LTL /tmp/LTL17685048849809845720.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(("(((r_0_13<1)||(r_1_13<1))||(p_1_14<1))")&&(X("(((r_0_37>=1)&&(r_1_37>=1))&&(p_1_38>=1))"))))||("(((r_0_13>=1)&&(r_1_13>=1))&&(p_1_14>=1))"))))
Formula 0 simplified : !F("(((r_0_13>=1)&&(r_1_13>=1))&&(p_1_14>=1))" | X("(((r_0_13<1)||(r_1_13<1))||(p_1_14<1))" & X"(((r_0_37>=1)&&(r_1_37>=1))&&(p_1_38>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
576 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,5.79299,170244,1,0,2819,859869,242,3111,4709,1.26671e+06,6596
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R050C002-05 finished in 9545 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 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 100
Applied a total of 4 rules in 16 ms. Remains 161 /163 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 161 cols
[2021-05-17 15:56:30] [INFO ] Computed 63 place invariants in 2 ms
[2021-05-17 15:56:31] [INFO ] Implicit Places using invariants in 141 ms returned [105, 108, 114, 118, 121, 128, 132, 135, 138, 145, 147, 151, 159]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 142 ms to find 13 implicit places.
[2021-05-17 15:56:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 148 cols
[2021-05-17 15:56:31] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-17 15:56:31] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 148/163 places, 100/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-17 15:56:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 148 cols
[2021-05-17 15:56:31] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-17 15:56:31] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/163 places, 100/102 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-07 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:(AND (GEQ s72 1) (GEQ s75 1)), p1:(AND (GEQ s26 1) (GEQ s29 1) (GEQ s26 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 666 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R050C002-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-07 finished in 463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 163 cols
[2021-05-17 15:56:31] [INFO ] Computed 63 place invariants in 0 ms
[2021-05-17 15:56:31] [INFO ] Implicit Places using invariants in 106 ms returned [107, 110, 116, 120, 123, 134, 137, 140, 147, 149, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 108 ms to find 11 implicit places.
// Phase 1: matrix 102 rows 152 cols
[2021-05-17 15:56:31] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 15:56:31] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 152/163 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 152 cols
[2021-05-17 15:56:31] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 15:56:31] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/163 places, 102/102 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ResAllocation-PT-R050C002-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (OR (LT s74 1) (LT s77 1) (LT s49 1) (LT s125 1) (LT s126 1)) (OR (LT s74 1) (LT s77 1))), p0:(AND (GEQ s83 1) (GEQ s143 1) (GEQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 150 reset in 457 ms.
Product exploration explored 100000 steps with 151 reset in 316 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 150 reset in 273 ms.
Product exploration explored 100000 steps with 151 reset in 301 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 8 out of 152 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 152/152 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-17 15:56:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 152 cols
[2021-05-17 15:56:33] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 15:56:33] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 102/102 transitions.
Product exploration explored 100000 steps with 150 reset in 211 ms.
Product exploration explored 100000 steps with 150 reset in 226 ms.
[2021-05-17 15:56:34] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:56:34] [INFO ] Flatten gal took : 6 ms
[2021-05-17 15:56:34] [INFO ] Time to serialize gal into /tmp/LTL9172160847670184272.gal : 1 ms
[2021-05-17 15:56:34] [INFO ] Time to serialize properties into /tmp/LTL11218229369254662577.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/LTL9172160847670184272.gal, -t, CGAL, -LTL, /tmp/LTL11218229369254662577.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/LTL9172160847670184272.gal -t CGAL -LTL /tmp/LTL11218229369254662577.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(((r_0_41>=1)&&(r_1_41>=1))&&(p_1_42>=1))"))&&(X(G("((((((p_0_37<1)||(r_0_38<1))||(r_0_24<1))||(r_1_24<1))||(p_1_25<1))&&((p_0_37<1)||(r_0_38<1)))")))))
Formula 0 simplified : !(F"(((r_0_41>=1)&&(r_1_41>=1))&&(p_1_42>=1))" & XG"((((((p_0_37<1)||(r_0_38<1))||(r_0_24<1))||(r_1_24<1))||(p_1_25<1))&&((p_0_37<1)||(r_0_38<1)))")
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2021-05-17 15:56:49] [INFO ] Flatten gal took : 6 ms
[2021-05-17 15:56:49] [INFO ] Applying decomposition
[2021-05-17 15:56:49] [INFO ] Flatten gal took : 6 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/graph1322811161885119116.txt, -o, /tmp/graph1322811161885119116.bin, -w, /tmp/graph1322811161885119116.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/graph1322811161885119116.bin, -l, -1, -v, -w, /tmp/graph1322811161885119116.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:56:49] [INFO ] Decomposing Gal with order
[2021-05-17 15:56:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:56:49] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:56:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-17 15:56:49] [INFO ] Time to serialize gal into /tmp/LTL10032468651533740559.gal : 10 ms
[2021-05-17 15:56:49] [INFO ] Time to serialize properties into /tmp/LTL6664406471352031902.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/LTL10032468651533740559.gal, -t, CGAL, -LTL, /tmp/LTL6664406471352031902.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/LTL10032468651533740559.gal -t CGAL -LTL /tmp/LTL6664406471352031902.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(((i8.i0.u41.r_0_41>=1)&&(i8.i0.u51.r_1_41>=1))&&(i8.i1.u42.p_1_42>=1))"))&&(X(G("((((((i7.i1.u37.p_0_37<1)||(i7.i1.u38.r_0_38<1))||(i4.i1.u24.r_0_24<1))||(i4.i1.u50.r_1_24<1))||(i5.i0.u25.p_1_25<1))&&((i7.i1.u37.p_0_37<1)||(i7.i1.u38.r_0_38<1)))")))))
Formula 0 simplified : !(F"(((i8.i0.u41.r_0_41>=1)&&(i8.i0.u51.r_1_41>=1))&&(i8.i1.u42.p_1_42>=1))" & XG"((((((i7.i1.u37.p_0_37<1)||(i7.i1.u38.r_0_38<1))||(i4.i1.u24.r_0_24<1))||(i4.i1.u50.r_1_24<1))||(i5.i0.u25.p_1_25<1))&&((i7.i1.u37.p_0_37<1)||(i7.i1.u38.r_0_38<1)))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i1.u49.t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
91 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.955015,48308,1,0,68184,53,1031,80429,88,77,85811
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R050C002-13 finished in 18960 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 100
Applied a total of 4 rules in 7 ms. Remains 161 /163 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 161 cols
[2021-05-17 15:56:50] [INFO ] Computed 63 place invariants in 1 ms
[2021-05-17 15:56:50] [INFO ] Implicit Places using invariants in 160 ms returned [105, 108, 114, 118, 121, 128, 132, 135, 138, 145, 147, 151, 159]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 161 ms to find 13 implicit places.
[2021-05-17 15:56:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 100 rows 148 cols
[2021-05-17 15:56:50] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-17 15:56:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 148/163 places, 100/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-17 15:56:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 100 rows 148 cols
[2021-05-17 15:56:50] [INFO ] Computed 50 place invariants in 8 ms
[2021-05-17 15:56:50] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/163 places, 100/102 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-14 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 (GEQ s82 1) (GEQ s85 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]]
Stuttering criterion allowed to conclude after 651 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R050C002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-14 finished in 529 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 100
Applied a total of 4 rules in 5 ms. Remains 161 /163 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 161 cols
[2021-05-17 15:56:50] [INFO ] Computed 63 place invariants in 0 ms
[2021-05-17 15:56:50] [INFO ] Implicit Places using invariants in 88 ms returned [105, 108, 114, 118, 121, 128, 135, 138, 145, 147, 151, 159]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 89 ms to find 12 implicit places.
[2021-05-17 15:56:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 149 cols
[2021-05-17 15:56:50] [INFO ] Computed 51 place invariants in 0 ms
[2021-05-17 15:56:51] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 149/163 places, 100/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-17 15:56:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 149 cols
[2021-05-17 15:56:51] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-17 15:56:51] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/163 places, 100/102 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R050C002-15 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:(OR (LT s68 1) (LT s71 1)), p0:(OR (LT s55 1) (LT s126 1) (LT s127 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 150 reset in 244 ms.
Product exploration explored 100000 steps with 150 reset in 238 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 150 reset in 254 ms.
Product exploration explored 100000 steps with 151 reset in 287 ms.
[2021-05-17 15:56:52] [INFO ] Flatten gal took : 6 ms
[2021-05-17 15:56:52] [INFO ] Flatten gal took : 5 ms
[2021-05-17 15:56:52] [INFO ] Time to serialize gal into /tmp/LTL10174825554564602015.gal : 1 ms
[2021-05-17 15:56:52] [INFO ] Time to serialize properties into /tmp/LTL15087999787977799225.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/LTL10174825554564602015.gal, -t, CGAL, -LTL, /tmp/LTL15087999787977799225.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/LTL10174825554564602015.gal -t CGAL -LTL /tmp/LTL15087999787977799225.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((r_0_27<1)||(r_1_27<1))||(p_1_28<1))")||(G("((p_0_34<1)||(r_0_35<1))"))))))
Formula 0 simplified : !GF("(((r_0_27<1)||(r_1_27<1))||(p_1_28<1))" | G"((p_0_34<1)||(r_0_35<1))")
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/98/2/100
Computing Next relation with stutter on 49 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
45 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.460657,28572,1,0,213,78087,228,106,4800,50390,217
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R050C002-15 finished in 2101 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621267013417

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

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