Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038396500005.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 DES-PT-00a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396500005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K 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 DES-PT-00a-00
FORMULA_NAME DES-PT-00a-01
FORMULA_NAME DES-PT-00a-02
FORMULA_NAME DES-PT-00a-03
FORMULA_NAME DES-PT-00a-04
FORMULA_NAME DES-PT-00a-05
FORMULA_NAME DES-PT-00a-06
FORMULA_NAME DES-PT-00a-07
FORMULA_NAME DES-PT-00a-08
FORMULA_NAME DES-PT-00a-09
FORMULA_NAME DES-PT-00a-10
FORMULA_NAME DES-PT-00a-11
FORMULA_NAME DES-PT-00a-12
FORMULA_NAME DES-PT-00a-13
FORMULA_NAME DES-PT-00a-14
FORMULA_NAME DES-PT-00a-15

=== Now, execution of the tool begins

BK_START 1620458249188

Running Version 0
[2021-05-08 07:17:30] [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-08 07:17:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 07:17:30] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-08 07:17:30] [INFO ] Transformed 115 places.
[2021-05-08 07:17:30] [INFO ] Transformed 76 transitions.
[2021-05-08 07:17:30] [INFO ] Found NUPN structural information;
[2021-05-08 07:17:30] [INFO ] Parsed PT model containing 115 places and 76 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 07:17:31] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-00a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Applied a total of 0 rules in 19 ms. Remains 115 /115 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 115 cols
[2021-05-08 07:17:31] [INFO ] Computed 57 place invariants in 20 ms
[2021-05-08 07:17:31] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 62 rows 115 cols
[2021-05-08 07:17:31] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-08 07:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 07:17:31] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 115 cols
[2021-05-08 07:17:31] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-08 07:17:31] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 62/62 transitions.
[2021-05-08 07:17:31] [INFO ] Initial state reduction rules for LTL removed 6 formulas.
[2021-05-08 07:17:31] [INFO ] Flatten gal took : 34 ms
FORMULA DES-PT-00a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 07:17:31] [INFO ] Flatten gal took : 12 ms
[2021-05-08 07:17:31] [INFO ] Input system was already deterministic with 62 transitions.
Incomplete random walk after 100000 steps, including 2226 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 115 cols
[2021-05-08 07:17:32] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-08 07:17:32] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2021-05-08 07:17:32] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 6 ms returned sat
[2021-05-08 07:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 07:17:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-08 07:17:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 07:17:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2021-05-08 07:17:32] [INFO ] [Nat]Absence check using 35 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-08 07:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 07:17:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-08 07:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 07:17:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 07:17:32] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 6 ms.
[2021-05-08 07:17:32] [INFO ] Added : 53 causal constraints over 11 iterations in 157 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 11 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 15 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 114 cols
[2021-05-08 07:17:32] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-08 07:17:32] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 61 rows 114 cols
[2021-05-08 07:17:32] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-08 07:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 07:17:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 114 cols
[2021-05-08 07:17:32] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-08 07:17:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/115 places, 61/62 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-00a-00 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 (EQ s1 1) (EQ s3 1) (EQ s7 1) (EQ s8 1) (EQ s10 1) (EQ s12 1)), p0:(OR (EQ s46 0) (EQ s63 0)), p2:(AND (EQ s22 1) (EQ s27 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 3 ms.
FORMULA DES-PT-00a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-00 finished in 533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 12 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
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 8 place count 111 transition count 58
Applied a total of 8 rules in 24 ms. Remains 111 /115 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 111 cols
[2021-05-08 07:17:33] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Implicit Places using invariants in 68 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
[2021-05-08 07:17:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 110 cols
[2021-05-08 07:17:33] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 110/115 places, 58/62 transitions.
Applied a total of 0 rules in 15 ms. Remains 110 /110 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2021-05-08 07:17:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 58 rows 110 cols
[2021-05-08 07:17:33] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/115 places, 58/62 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-00a-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1)), p1:(OR (AND (NEQ s2 0) (NEQ s13 0)) (NEQ s5 1) (NEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-01 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((p0 U (p1||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 4 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 114 cols
[2021-05-08 07:17:33] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Implicit Places using invariants in 61 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
// Phase 1: matrix 61 rows 113 cols
[2021-05-08 07:17:33] [INFO ] Computed 56 place invariants in 2 ms
[2021-05-08 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 113/115 places, 61/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 113 cols
[2021-05-08 07:17:33] [INFO ] Computed 56 place invariants in 7 ms
[2021-05-08 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 113/115 places, 61/62 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-00a-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s2 1) (NEQ s14 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][false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-02 finished in 221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(X((p1 U X(p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 5 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 114 cols
[2021-05-08 07:17:33] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Implicit Places using invariants in 58 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
// Phase 1: matrix 61 rows 113 cols
[2021-05-08 07:17:33] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 113/115 places, 61/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 113 cols
[2021-05-08 07:17:33] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 113/115 places, 61/62 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-00a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 1}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s16 0) (NEQ s17 0)), p1:(AND (EQ s13 1) (EQ s87 1)), p2:(AND (EQ s29 1) (EQ s13 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DES-PT-00a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-03 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 59
Applied a total of 6 rules in 15 ms. Remains 112 /115 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 112 cols
[2021-05-08 07:17:33] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:17:34] [INFO ] Implicit Places using invariants in 62 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
[2021-05-08 07:17:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 59 rows 111 cols
[2021-05-08 07:17:34] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 111/115 places, 59/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2021-05-08 07:17:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 111 cols
[2021-05-08 07:17:34] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 111/115 places, 59/62 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-00a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s52 1) (EQ s69 1)), p1:(NEQ s5 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 8860 reset in 391 ms.
Product exploration explored 100000 steps with 8870 reset in 262 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8909 reset in 222 ms.
Product exploration explored 100000 steps with 8837 reset in 316 ms.
[2021-05-08 07:17:35] [INFO ] Flatten gal took : 13 ms
[2021-05-08 07:17:35] [INFO ] Flatten gal took : 13 ms
[2021-05-08 07:17:35] [INFO ] Time to serialize gal into /tmp/LTL15140270535702059331.gal : 3 ms
[2021-05-08 07:17:35] [INFO ] Time to serialize properties into /tmp/LTL18304876237958172758.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/LTL15140270535702059331.gal, -t, CGAL, -LTL, /tmp/LTL18304876237958172758.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/LTL15140270535702059331.gal -t CGAL -LTL /tmp/LTL18304876237958172758.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p5!=1)")))||("((p54==1)&&(p71==1))"))))
Formula 0 simplified : !F("((p54==1)&&(p71==1))" | GF"(p5!=1)")
Detected timeout of ITS tools.
[2021-05-08 07:17:50] [INFO ] Flatten gal took : 7 ms
[2021-05-08 07:17:50] [INFO ] Applying decomposition
[2021-05-08 07:17:50] [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/graph4152592064976817477.txt, -o, /tmp/graph4152592064976817477.bin, -w, /tmp/graph4152592064976817477.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/graph4152592064976817477.bin, -l, -1, -v, -w, /tmp/graph4152592064976817477.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 07:17:50] [INFO ] Decomposing Gal with order
[2021-05-08 07:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 07:17:50] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-08 07:17:50] [INFO ] Flatten gal took : 32 ms
[2021-05-08 07:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 07:17:50] [INFO ] Time to serialize gal into /tmp/LTL16869782875247593833.gal : 6 ms
[2021-05-08 07:17:50] [INFO ] Time to serialize properties into /tmp/LTL16959154283187345641.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/LTL16869782875247593833.gal, -t, CGAL, -LTL, /tmp/LTL16959154283187345641.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/LTL16869782875247593833.gal -t CGAL -LTL /tmp/LTL16959154283187345641.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i0.u2.p5!=1)")))||("((i11.u24.p54==1)&&(i11.u32.p71==1))"))))
Formula 0 simplified : !F("((i11.u24.p54==1)&&(i11.u32.p71==1))" | GF"(i0.u2.p5!=1)")
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t21, t22, i0.u2.t12, i1.u0.t10, i1.u6.t60, i1.u6.t11.t55, i2.t59, i2.t0, i2.u1.t9, i13.i0.t32, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/47/12/59
Computing Next relation with stutter on 2420 deadlock states
144 unique states visited
0 strongly connected components in search stack
147 transitions explored
75 items max in DFS search stack
214 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,2.15659,84000,1,0,157294,238,1515,194132,142,826,234115
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-00a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-00a-07 finished in 19269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 114 cols
[2021-05-08 07:17:53] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:17:53] [INFO ] Implicit Places using invariants in 65 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
// Phase 1: matrix 61 rows 113 cols
[2021-05-08 07:17:53] [INFO ] Computed 56 place invariants in 9 ms
[2021-05-08 07:17:53] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 113/115 places, 61/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 113 cols
[2021-05-08 07:17:53] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:53] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 113/115 places, 61/62 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DES-PT-00a-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s31 1) (EQ s94 1) (EQ s69 1) (EQ s85 1)), p0:(AND (EQ s69 1) (EQ s85 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-09 finished in 371 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p1)||p0) U (G((F(p1)||p2))||(G(p3)&&(F(p1)||p4)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
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 8 place count 111 transition count 58
Applied a total of 8 rules in 9 ms. Remains 111 /115 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 111 cols
[2021-05-08 07:17:53] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:17:53] [INFO ] Implicit Places using invariants in 136 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
[2021-05-08 07:17:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 110 cols
[2021-05-08 07:17:53] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:17:53] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 110/115 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2021-05-08 07:17:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 110 cols
[2021-05-08 07:17:53] [INFO ] Computed 56 place invariants in 6 ms
[2021-05-08 07:17:53] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/115 places, 58/62 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-00a-10 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3 p4 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) p0) (AND (NOT p1) p3 (NOT p4) p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) p3 p4 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3 p4 (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(OR (AND p2 (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p3 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={1} source=3 dest: 4}, { cond=(AND p2 (NOT p1) p3 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3 p4 p0), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p3 p4 p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3) p0) (AND (NOT p2) (NOT p1) (NOT p4) p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p2 (NOT p1) (NOT p3) p0) (AND p2 (NOT p1) (NOT p4) p0)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 (NOT p1) p3 p4 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3 p4 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(OR (AND p2 (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p1) (NOT p4) (NOT p0))), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (NEQ s21 0) (NEQ s23 0)), p2:(OR (NEQ s5 1) (NEQ s26 1)), p1:(NEQ s2 1), p0:(OR (NEQ s5 1) (NEQ s26 1)), p4:(OR (NEQ s5 1) (NEQ s26 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 7492 reset in 297 ms.
Product exploration explored 100000 steps with 7365 reset in 305 ms.
Knowledge obtained : [(NOT p3), p2, p1, p0, p4]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7283 reset in 264 ms.
Product exploration explored 100000 steps with 7272 reset in 296 ms.
[2021-05-08 07:17:55] [INFO ] Flatten gal took : 6 ms
[2021-05-08 07:17:55] [INFO ] Flatten gal took : 6 ms
[2021-05-08 07:17:55] [INFO ] Time to serialize gal into /tmp/LTL6163218179574433744.gal : 1 ms
[2021-05-08 07:17:55] [INFO ] Time to serialize properties into /tmp/LTL1611102908350650275.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/LTL6163218179574433744.gal, -t, CGAL, -LTL, /tmp/LTL1611102908350650275.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/LTL6163218179574433744.gal -t CGAL -LTL /tmp/LTL1611102908350650275.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((p6!=1)||(p28!=1))")||(F("(p2!=1)")))U((G(("((p6!=1)||(p28!=1))")||(F("(p2!=1)"))))||((G("((p23!=0)&&(p25!=0))"))&&(("((p6!=1)||(p28!=1))")||(F("(p2!=1)")))))))
Formula 0 simplified : !(("((p6!=1)||(p28!=1))" | F"(p2!=1)") U (G("((p6!=1)||(p28!=1))" | F"(p2!=1)") | (("((p6!=1)||(p28!=1))" | F"(p2!=1)") & G"((p23!=0)&&(p25!=0))")))
Detected timeout of ITS tools.
[2021-05-08 07:18:11] [INFO ] Flatten gal took : 5 ms
[2021-05-08 07:18:11] [INFO ] Applying decomposition
[2021-05-08 07:18:11] [INFO ] Flatten gal took : 5 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/graph5696034720863989335.txt, -o, /tmp/graph5696034720863989335.bin, -w, /tmp/graph5696034720863989335.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/graph5696034720863989335.bin, -l, -1, -v, -w, /tmp/graph5696034720863989335.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 07:18:11] [INFO ] Decomposing Gal with order
[2021-05-08 07:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 07:18:11] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-08 07:18:11] [INFO ] Flatten gal took : 11 ms
[2021-05-08 07:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 07:18:11] [INFO ] Time to serialize gal into /tmp/LTL14186009152972607756.gal : 3 ms
[2021-05-08 07:18:11] [INFO ] Time to serialize properties into /tmp/LTL12085990392365427997.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/LTL14186009152972607756.gal, -t, CGAL, -LTL, /tmp/LTL12085990392365427997.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/LTL14186009152972607756.gal -t CGAL -LTL /tmp/LTL12085990392365427997.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((("((i2.u2.p6!=1)||(i2.u11.p28!=1))")||(F("(i1.u0.p2!=1)")))U((G(("((i2.u2.p6!=1)||(i2.u11.p28!=1))")||(F("(i1.u0.p2!=1)"))))||((G("((i0.u7.p23!=0)&&(i0.u9.p25!=0))"))&&(("((i2.u2.p6!=1)||(i2.u11.p28!=1))")||(F("(i1.u0.p2!=1)")))))))
Formula 0 simplified : !(("((i2.u2.p6!=1)||(i2.u11.p28!=1))" | F"(i1.u0.p2!=1)") U (G("((i2.u2.p6!=1)||(i2.u11.p28!=1))" | F"(i1.u0.p2!=1)") | (("((i2.u2.p6!=1)||(i2.u11.p28!=1))" | F"(i1.u0.p2!=1)") & G"((i0.u7.p23!=0)&&(i0.u9.p25!=0))")))
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t21, i0.t59, i0.t0, i0.u1.t9, i1.u0.t10, i1.u6.t60, i1.u6.t11.t55, i2.u2.t8.t12, i3.t22, i12.i0.t32, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/46/12/58
Computing Next relation with stutter on 2420 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2949159065764734479
[2021-05-08 07:18:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2949159065764734479
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/ltsmin2949159065764734479]
Compilation finished in 531 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2949159065764734479]
Link finished in 44 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, ((<>((LTLAPp1==true))||(LTLAPp0==true)) U ([]((<>((LTLAPp1==true))||(LTLAPp2==true)))||([]((LTLAPp3==true))&&(<>((LTLAPp1==true))||(LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2949159065764734479]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-00a-10 finished in 47527 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 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
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 8 place count 111 transition count 58
Applied a total of 8 rules in 8 ms. Remains 111 /115 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 111 cols
[2021-05-08 07:18:41] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-08 07:18:41] [INFO ] Implicit Places using invariants in 57 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
[2021-05-08 07:18:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 58 rows 110 cols
[2021-05-08 07:18:41] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 110/115 places, 58/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2021-05-08 07:18:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 58 rows 110 cols
[2021-05-08 07:18:41] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/115 places, 58/62 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s25 1) (EQ s27 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 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-14 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&(G(!p1)||G((p2||(F(p3) U !p4)))))))], workingDir=/home/mcc/execution]
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 60
Applied a total of 4 rules in 6 ms. Remains 113 /115 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 113 cols
[2021-05-08 07:18:41] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-08 07:18:41] [INFO ] Implicit Places using invariants in 69 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
[2021-05-08 07:18:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 112 cols
[2021-05-08 07:18:41] [INFO ] Computed 56 place invariants in 0 ms
[2021-05-08 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 112/115 places, 60/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2021-05-08 07:18:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 112 cols
[2021-05-08 07:18:41] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-08 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 112/115 places, 60/62 transitions.
Stuttering acceptance computed with spot in 697 ms :[(OR (NOT p0) (AND p1 (NOT p2) p4)), (OR (AND (NOT p0) (NOT p2) p4) (AND p1 (NOT p2) p4)), (NOT p0), (AND p1 (NOT p2) p4), (OR (AND p1 (NOT p2) p4) (AND (NOT p0) p4)), (OR (AND p1 (NOT p2) p4) (AND (NOT p0) p1 p4)), (OR (AND p1 (NOT p2) (NOT p3) p4) (AND (NOT p0) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p3) p4) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) p4), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) p4) (AND p1 (NOT p2) p4)), (AND p1 (NOT p2) p4), (OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND p1 (NOT p2) (NOT p3) p4)), (AND p1 (NOT p2) (NOT p3) p4), (AND (NOT p0) p1 p4), (AND (NOT p0) (NOT p3) p1), (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p3) (NOT p2) p4)]
Running random walk in product with property : DES-PT-00a-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p4), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=0 dest: 7}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) p4), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p4), acceptance={} source=1 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=1 dest: 10}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p4), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2) p4), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)), acceptance={} source=4 dest: 9}, { cond=(OR (AND (NOT p0) (NOT p1) p4 (NOT p3)) (AND (NOT p0) p2 p4 (NOT p3))), acceptance={} source=4 dest: 10}, { cond=(AND p1 p2 p4), acceptance={0} source=4 dest: 11}, { cond=(AND (NOT p1) p2 p4), acceptance={} source=4 dest: 12}, { cond=(AND p1 p2 p4 (NOT p3)), acceptance={} source=4 dest: 13}, { cond=(AND (NOT p1) p2 p4 (NOT p3)), acceptance={} source=4 dest: 14}], [{ cond=(AND p1 (NOT p2) p4), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={1} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1 p2 p4), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p0) p1 p2 p4 (NOT p3)), acceptance={} source=5 dest: 10}, { cond=(AND p1 p2 p4), acceptance={0} source=5 dest: 11}, { cond=(AND (NOT p1) p2 p4), acceptance={} source=5 dest: 12}, { cond=(AND p1 p2 p4 (NOT p3)), acceptance={} source=5 dest: 13}, { cond=(AND (NOT p1) p2 p4 (NOT p3)), acceptance={} source=5 dest: 14}, { cond=(AND (NOT p0) (NOT p1) p2 p4), acceptance={} source=5 dest: 15}, { cond=(AND (NOT p0) (NOT p1) p2 p4 (NOT p3)), acceptance={} source=5 dest: 16}], [{ cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={1} source=6 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=6 dest: 10}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={0} source=6 dest: 13}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=6 dest: 14}], [{ cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={1} source=7 dest: 7}, { cond=(OR (AND (NOT p0) p1 p2 (NOT p3)) (AND (NOT p0) p1 (NOT p4) (NOT p3))), acceptance={} source=7 dest: 10}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={0} source=7 dest: 13}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=7 dest: 14}, { cond=(OR (AND (NOT p0) (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=7 dest: 16}], [{ cond=(NOT p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p4), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p4 (NOT p3)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) p4), acceptance={0, 1} source=9 dest: 9}, { cond=(AND (NOT p0) p4 (NOT p3)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND p1 (NOT p2) p4), acceptance={0, 1} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={1} source=11 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p4), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p1 p2 p4), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p1) p2 p4), acceptance={} source=11 dest: 12}, { cond=(AND p1 p2 p4 (NOT p3)), acceptance={} source=11 dest: 13}, { cond=(AND (NOT p1) p2 p4 (NOT p3)), acceptance={} source=11 dest: 14}, { cond=(AND (NOT p0) (NOT p1) p2 p4), acceptance={} source=11 dest: 17}, { cond=(AND (NOT p0) (NOT p1) p2 p4 (NOT p3)), acceptance={} source=11 dest: 18}], [{ cond=(AND p1 (NOT p2) p4), acceptance={0, 1} source=12 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4), acceptance={1} source=12 dest: 5}, { cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND p1 p2 p4), acceptance={0} source=12 dest: 11}, { cond=(AND (NOT p1) p2 p4), acceptance={} source=12 dest: 12}, { cond=(AND p1 p2 p4 (NOT p3)), acceptance={} source=12 dest: 13}, { cond=(AND (NOT p1) p2 p4 (NOT p3)), acceptance={} source=12 dest: 14}], [{ cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={0, 1} source=13 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={1} source=13 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={} source=13 dest: 10}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={0} source=13 dest: 13}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=13 dest: 14}, { cond=(OR (AND (NOT p0) (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=13 dest: 18}], [{ cond=(AND p1 (NOT p2) p4 (NOT p3)), acceptance={0, 1} source=14 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p3)), acceptance={1} source=14 dest: 7}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={0} source=14 dest: 13}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) p1 p4), acceptance={} source=15 dest: 9}, { cond=(AND (NOT p0) p1 p4 (NOT p3)), acceptance={} source=15 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p4), acceptance={} source=15 dest: 15}, { cond=(AND (NOT p0) (NOT p1) p4 (NOT p3)), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=16 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p0) (NOT p2) p4), acceptance={} source=17 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p4 (NOT p3)), acceptance={} source=17 dest: 10}, { cond=(AND (NOT p0) p2 p4), acceptance={} source=17 dest: 17}, { cond=(AND (NOT p0) p2 p4 (NOT p3)), acceptance={} source=17 dest: 18}], [{ cond=(AND (NOT p0) (NOT p2) p4 (NOT p3)), acceptance={} source=18 dest: 10}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=18 dest: 18}]], initial=0, aps=[p1:(NEQ s5 1), p0:(AND (EQ s90 1) (EQ s95 1)), p2:(AND (EQ s36 1) (EQ s105 1)), p4:(OR (NEQ s2 1) (NEQ s14 1)), p3:(OR (EQ s34 0) (EQ s39 0) (EQ s41 0) (EQ s43 0) (EQ s45 0) (EQ s47 0) (EQ s49 0) (EQ s51 0) (EQ s53 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 69 steps with 3 reset in 0 ms.
FORMULA DES-PT-00a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-15 finished in 951 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4538650775539754323
[2021-05-08 07:18:42] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2021-05-08 07:18:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 07:18:42] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2021-05-08 07:18:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 07:18:42] [INFO ] Applying decomposition
[2021-05-08 07:18:42] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2021-05-08 07:18:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 07:18:42] [INFO ] Flatten gal took : 6 ms
[2021-05-08 07:18:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4538650775539754323
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/ltsmin4538650775539754323]
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/graph18162684218079432262.txt, -o, /tmp/graph18162684218079432262.bin, -w, /tmp/graph18162684218079432262.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/graph18162684218079432262.bin, -l, -1, -v, -w, /tmp/graph18162684218079432262.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 07:18:42] [INFO ] Decomposing Gal with order
[2021-05-08 07:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 07:18:42] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-08 07:18:42] [INFO ] Flatten gal took : 11 ms
[2021-05-08 07:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2021-05-08 07:18:42] [INFO ] Time to serialize gal into /tmp/LTLFireability8342272890464991221.gal : 2 ms
[2021-05-08 07:18:42] [INFO ] Time to serialize properties into /tmp/LTLFireability4684478079156946070.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/LTLFireability8342272890464991221.gal, -t, CGAL, -LTL, /tmp/LTLFireability4684478079156946070.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/LTLFireability8342272890464991221.gal -t CGAL -LTL /tmp/LTLFireability4684478079156946070.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((!("((i2.u2.p6==1)&&(i2.u12.p28==1))"))||(F("(i0.u0.p2!=1)")))U(((G(!("((i1.u9.p23==0)||(i1.u10.p25==0))")))&&((!("((i2.u2.p6==1)&&(i2.u12.p28==1))"))||(F("(i0.u0.p2!=1)"))))||(G((!("((i2.u2.p6==1)&&(i2.u12.p28==1))"))||(F("(i0.u0.p2!=1)")))))))
Formula 0 simplified : !((!"((i2.u2.p6==1)&&(i2.u12.p28==1))" | F"(i0.u0.p2!=1)") U (((!"((i2.u2.p6==1)&&(i2.u12.p28==1))" | F"(i0.u0.p2!=1)") & G!"((i1.u9.p23==0)||(i1.u10.p25==0))") | G(!"((i2.u2.p6==1)&&(i2.u12.p28==1))" | F"(i0.u0.p2!=1)")))
Compilation finished in 405 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4538650775539754323]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((<>((LTLAPp1==true))||(LTLAPp0==true)) U ([]((<>((LTLAPp1==true))||(LTLAPp2==true)))||([]((LTLAPp3==true))&&(<>((LTLAPp1==true))||(LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4538650775539754323]
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t31, i0.t65, i0.u0.t10, i0.u6.t74, i1.t73, i1.t0, i1.u1.t9, i2.u2.t12, i3.t32, i12.t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/47/12/59
Computing Next relation with stutter on 2656 deadlock states
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((<>((LTLAPp1==true))||(LTLAPp0==true)) U ([]((<>((LTLAPp1==true))||(LTLAPp2==true)))||([]((LTLAPp3==true))&&(<>((LTLAPp1==true))||(LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4538650775539754323]
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((<>((LTLAPp1==true))||(LTLAPp0==true)) U ([]((<>((LTLAPp1==true))||(LTLAPp2==true)))||([]((LTLAPp3==true))&&(<>((LTLAPp1==true))||(LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4538650775539754323]
Detected timeout of ITS tools.
[2021-05-08 07:39:05] [INFO ] Applying decomposition
[2021-05-08 07:39:05] [INFO ] Flatten gal took : 12 ms
[2021-05-08 07:39:05] [INFO ] Decomposing Gal with order
[2021-05-08 07:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 07:39:05] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-08 07:39:05] [INFO ] Flatten gal took : 35 ms
[2021-05-08 07:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-08 07:39:09] [INFO ] Time to serialize gal into /tmp/LTLFireability9837262647222758060.gal : 3690 ms
[2021-05-08 07:39:09] [INFO ] Time to serialize properties into /tmp/LTLFireability2766820298579077608.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/LTLFireability9837262647222758060.gal, -t, CGAL, -LTL, /tmp/LTLFireability2766820298579077608.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/LTLFireability9837262647222758060.gal -t CGAL -LTL /tmp/LTLFireability2766820298579077608.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((!("((u3.p6==1)&&(u14.p28==1))"))||(F("(u1.p2!=1)")))U(((G(!("((u11.p23==0)||(u12.p25==0))")))&&((!("((u3.p6==1)&&(u14.p28==1))"))||(F("(u1.p2!=1)"))))||(G((!("((u3.p6==1)&&(u14.p28==1))"))||(F("(u1.p2!=1)")))))))
Formula 0 simplified : !((!"((u3.p6==1)&&(u14.p28==1))" | F"(u1.p2!=1)") U (((!"((u3.p6==1)&&(u14.p28==1))" | F"(u1.p2!=1)") & G!"((u11.p23==0)||(u12.p25==0))") | G(!"((u3.p6==1)&&(u14.p28==1))" | F"(u1.p2!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t31, t32, t40, t65, t73, u1.t10, u2.t9, u3.t12, u8.t74, i46.t4, i46.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/47/12/59
Computing Next relation with stutter on 2656 deadlock states
LTSmin run took 965844 ms.
FORMULA DES-PT-00a-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620459689513

--------------------
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="DES-PT-00a"
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 DES-PT-00a, 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 r064-tall-162038396500005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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