fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r311-tall-162132108700629
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T4N04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
655.119 56573.00 73452.00 934.30 FFFFFFFTFFFFTTFF normal

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.r311-tall-162132108700629.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 UtilityControlRoom-PT-Z4T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108700629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 160K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 726K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 830K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 9.4K May 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 128K May 12 08:13 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 UtilityControlRoom-PT-Z4T4N04-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-15

=== Now, execution of the tool begins

BK_START 1621489880830

Running Version 0
[2021-05-20 05:51:22] [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-20 05:51:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 05:51:22] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-20 05:51:22] [INFO ] Transformed 154 places.
[2021-05-20 05:51:22] [INFO ] Transformed 300 transitions.
[2021-05-20 05:51:22] [INFO ] Parsed PT model containing 154 places and 300 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 05:51:22] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N04-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 134 out of 154 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 30 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2021-05-20 05:51:23] [INFO ] Computed 11 place invariants in 15 ms
[2021-05-20 05:51:23] [INFO ] Implicit Places using invariants in 168 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
// Phase 1: matrix 236 rows 153 cols
[2021-05-20 05:51:23] [INFO ] Computed 10 place invariants in 13 ms
[2021-05-20 05:51:23] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Starting structural reductions, iteration 1 : 153/154 places, 236/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2021-05-20 05:51:23] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-20 05:51:23] [INFO ] Dead Transitions using invariants and state equation in 195 ms returned []
Finished structural reductions, in 2 iterations. Remains : 153/154 places, 236/236 transitions.
[2021-05-20 05:51:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-20 05:51:23] [INFO ] Flatten gal took : 48 ms
FORMULA UtilityControlRoom-PT-Z4T4N04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 05:51:24] [INFO ] Flatten gal took : 30 ms
[2021-05-20 05:51:24] [INFO ] Input system was already deterministic with 236 transitions.
Finished random walk after 2181 steps, including 0 resets, run visited all 25 properties in 21 ms. (steps per millisecond=103 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 85 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2021-05-20 05:51:24] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-20 05:51:24] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 236 rows 153 cols
[2021-05-20 05:51:24] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-20 05:51:24] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 236 rows 153 cols
[2021-05-20 05:51:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:24] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-00 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ s86 1) (GEQ s88 1) (GEQ s90 1) (GEQ s92 1) (GEQ s94 1) (GEQ s96 1) (GEQ s98 1) (GEQ s100 1) (GEQ s102 1) (GEQ s41 1) (GEQ s43 1) (GEQ s45 1) (GEQ s47 1) (GEQ s49 1) (GEQ s51 1) (GEQ s53 1) (GEQ s55 1) (GEQ s57 1) (GEQ s59 1) (GEQ s61 1) (GEQ s63 1) (GEQ s65 1) (GEQ s67 1) (GEQ s69 1) (GEQ s71 1) (GEQ s73 1) (GEQ s75 1) (GEQ s77 1) (GEQ s79 1) (GEQ s81 1) (GEQ s83 1) (GEQ s85 1) (GEQ s87 1) (GEQ s89 1) (GEQ s91 1) (GEQ s93 1) (GEQ s95 1) (GEQ s97 1) (GEQ s99 1) (GEQ s101 1) (GEQ s103 1) (GEQ s40 1) (GEQ s42 1) (GEQ s44 1) (GEQ s46 1) (GEQ s48 1) (GEQ s50 1) (GEQ s52 1) (GEQ s54 1) (GEQ s56 1) (GEQ s58 1) (GEQ s60 1) (GEQ s62 1)), p1:(OR (AND (GEQ s0 1) (GEQ s13 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s124 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s124 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s124 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s124 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-00 finished in 672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (X((G(p0) U (p2&&G(p0))))||p1)))], workingDir=/home/mcc/execution]
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 10 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:24] [INFO ] Implicit Places using invariants in 61 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
// Phase 1: matrix 188 rows 104 cols
[2021-05-20 05:51:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-20 05:51:25] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2021-05-20 05:51:25] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-20 05:51:25] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(OR (GEQ s78 1) (GEQ s79 1) (GEQ s76 1) (GEQ s77 1)), p0:(OR (AND (GEQ s61 1) (GEQ s85 1)) (AND (GEQ s68 1) (GEQ s87 1)) (AND (GEQ s71 1) (GEQ s87 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s66 1) (GEQ s86 1)) (AND (GEQ s70 1) (GEQ s87 1)) (AND (GEQ s59 1) (GEQ s84 1)) (AND (GEQ s62 1) (GEQ s85 1)) (AND (GEQ s67 1) (GEQ s86 1)) (AND (GEQ s57 1) (GEQ s84 1)) (AND (GEQ s65 1) (GEQ s86 1)) (AND (GEQ s69 1) (GEQ s87 1)) (AND (GEQ s64 1) (GEQ s86 1)) (AND (GEQ s60 1) (GEQ s85 1)) (AND (GEQ s58 1) (GEQ s84 1)) (AND (GEQ s56 1) (GEQ s84 1))), p2:(OR (GEQ s78 1) (GEQ s79 1) (GEQ s76 1) (GEQ s77 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-01 finished in 404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G(!p0))||F(p1))))], workingDir=/home/mcc/execution]
Support contains 25 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 7 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:25] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:25] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:25] [INFO ] Computed 10 place invariants in 17 ms
[2021-05-20 05:51:25] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s1 1) (LT s17 1) (LT s76 1)) (OR (LT s0 1) (LT s20 1) (LT s76 1)) (OR (LT s3 1) (LT s19 1) (LT s76 1)) (OR (LT s2 1) (LT s14 1) (LT s76 1)) (OR (LT s0 1) (LT s12 1) (LT s76 1)) (OR (LT s3 1) (LT s11 1) (LT s76 1)) (OR (LT s0 1) (LT s8 1) (LT s76 1)) (OR (LT s2 1) (LT s22 1) (LT s76 1)) (OR (LT s3 1) (LT s15 1) (LT s76 1)) (OR (LT s2 1) (LT s18 1) (LT s76 1)) (OR (LT s1 1) (LT s21 1) (LT s76 1)) (OR (LT s0 1) (LT s16 1) (LT s76 1)) (OR (LT s2 1) (LT s10 1) (LT s76 1)) (OR (LT s3 1) (LT s23 1) (LT s76 1)) (OR (LT s1 1) (LT s9 1) (LT s76 1)) (OR (LT s1 1) (LT s13 1) (LT s76 1))), p0:(OR (GEQ s79 1) (GEQ s80 1) (GEQ s77 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10594 reset in 399 ms.
Product exploration explored 100000 steps with 10544 reset in 403 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 10613 reset in 335 ms.
Product exploration explored 100000 steps with 10641 reset in 275 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Support contains 25 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 105 transition count 204
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 204
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 105 transition count 204
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 48 place count 105 transition count 188
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 105 transition count 188
Deduced a syphon composed of 36 places in 1 ms
Applied a total of 52 rules in 26 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2021-05-20 05:51:27] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:27] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 188/188 transitions.
Product exploration explored 100000 steps with 10429 reset in 578 ms.
Product exploration explored 100000 steps with 10385 reset in 397 ms.
[2021-05-20 05:51:28] [INFO ] Flatten gal took : 13 ms
[2021-05-20 05:51:28] [INFO ] Flatten gal took : 12 ms
[2021-05-20 05:51:28] [INFO ] Time to serialize gal into /tmp/LTL17853355720294601508.gal : 13 ms
[2021-05-20 05:51:28] [INFO ] Time to serialize properties into /tmp/LTL18136857857393652179.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/LTL17853355720294601508.gal, -t, CGAL, -LTL, /tmp/LTL18136857857393652179.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/LTL17853355720294601508.gal -t CGAL -LTL /tmp/LTL18136857857393652179.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(G("((((Finished_2<1)&&(Finished_3<1))&&(Finished_0<1))&&(Finished_1<1))")))||(F("((((((((((((((((((IdleTechs_1<1)||(OpenRequests_2_1<1))||(Idles<1))&&(((IdleTechs_0<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_2_3<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_1_2<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_0_3<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_3_2<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_1_3<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_2_2<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_0_2<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_3_3<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_1<1))||(Idles<1)))")))))
Formula 0 simplified : !G(XG"((((Finished_2<1)&&(Finished_3<1))&&(Finished_0<1))&&(Finished_1<1))" | F"((((((((((((((((((IdleTechs_1<1)||(OpenRequests_2_1<1))||(Idles<1))&&(((IdleTechs_0<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_2_3<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_1_2<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_0_3<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_3_2<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_1_3<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_2_2<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_2<1)||(OpenRequests_0_2<1))||(Idles<1)))&&(((IdleTechs_3<1)||(OpenRequests_3_3<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_1<1))||(Idles<1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
519 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.21393,159232,1,0,19,623155,29,6,3236,732110,54
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N04-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T4N04-02 finished in 9144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&F(G((p0 U p1)))))))], workingDir=/home/mcc/execution]
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 5 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:34] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:34] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:51:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:34] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s13 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s20 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s21 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s22 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s23 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s20 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s21 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s21 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s23 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s76 1))), p1:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-03 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U (G(!p0)||(F(G(!p2))&&p1))))], workingDir=/home/mcc/execution]
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 101 transition count 184
Applied a total of 104 rules in 34 ms. Remains 101 /153 variables (removed 52) and now considering 184/236 (removed 52) transitions.
// Phase 1: matrix 184 rows 101 cols
[2021-05-20 05:51:34] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-20 05:51:34] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 184 rows 101 cols
[2021-05-20 05:51:34] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-20 05:51:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2021-05-20 05:51:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 184 rows 101 cols
[2021-05-20 05:51:35] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:51:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/153 places, 184/236 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), true, p2, (AND p2 p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s9 1) (LT s72 1)) (OR (LT s2 1) (LT s12 1) (LT s72 1)) (OR (LT s0 1) (LT s8 1) (LT s72 1)) (OR (LT s1 1) (LT s16 1) (LT s72 1)) (OR (LT s1 1) (LT s6 1) (LT s72 1)) (OR (LT s3 1) (LT s9 1) (LT s72 1)) (OR (LT s0 1) (LT s19 1) (LT s72 1)) (OR (LT s3 1) (LT s11 1) (LT s72 1)) (OR (LT s0 1) (LT s17 1) (LT s72 1)) (OR (LT s1 1) (LT s7 1) (LT s72 1)) (OR (LT s2 1) (LT s4 1) (LT s72 1)) (OR (LT s3 1) (LT s18 1) (LT s72 1)) (OR (LT s0 1) (LT s10 1) (LT s72 1)) (OR (LT s3 1) (LT s19 1) (LT s72 1)) (OR (LT s1 1) (LT s15 1) (LT s72 1)) (OR (LT s2 1) (LT s13 1) (LT s72 1)) (OR (LT s0 1) (LT s18 1) (LT s72 1)) (OR (LT s3 1) (LT s10 1) (LT s72 1)) (OR (LT s0 1) (LT s11 1) (LT s72 1)) (OR (LT s2 1) (LT s15 1) (LT s72 1)) (OR (LT s3 1) (LT s12 1) (LT s72 1)) (OR (LT s2 1) (LT s5 1) (LT s72 1)) (OR (LT s1 1) (LT s18 1) (LT s72 1)) (OR (LT s3 1) (LT s13 1) (LT s72 1)) (OR (LT s2 1) (LT s16 1) (LT s72 1)) (OR (LT s1 1) (LT s8 1) (LT s72 1)) (OR (LT s2 1) (LT s14 1) (LT s72 1)) (OR (LT s1 1) (LT s17 1) (LT s72 1)) (OR (LT s0 1) (LT s12 1) (LT s72 1)) (OR (LT s2 1) (LT s7 1) (LT s72 1)) (OR (LT s2 1) (LT s6 1) (LT s72 1)) (OR (LT s3 1) (LT s4 1) (LT s72 1)) (OR (LT s1 1) (LT s9 1) (LT s72 1)) (OR (LT s3 1) (LT s5 1) (LT s72 1)) (OR (LT s3 1) (LT s15 1) (LT s72 1)) (OR (LT s2 1) (LT s8 1) (LT s72 1)) (OR (LT s1 1) (LT s10 1) (LT s72 1)) (OR (LT s0 1) (LT s13 1) (LT s72 1)) (OR (LT s0 1) (LT s4 1) (LT s72 1)) (OR (LT s2 1) (LT s18 1) (LT s72 1)) (OR (LT s2 1) (LT s9 1) (LT s72 1)) (OR (LT s0 1) (LT s5 1) (LT s72 1)) (OR (LT s1 1) (LT s19 1) (LT s72 1)) (OR (LT s3 1) (LT s14 1) (LT s72 1)) (OR (LT s0 1) (LT s14 1) (LT s72 1)) (OR (LT s1 1) (LT s11 1) (LT s72 1)) (OR (LT s3 1) (LT s6 1) (LT s72 1)) (OR (LT s2 1) (LT s17 1) (LT s72 1)) (OR (LT s1 1) (LT s13 1) (LT s72 1)) (OR (LT s0 1) (LT s16 1) (LT s72 1)) (OR (LT s0 1) (LT s6 1) (LT s72 1)) (OR (LT s2 1) (LT s10 1) (LT s72 1)) (OR (LT s3 1) (LT s17 1) (LT s72 1)) (OR (LT s1 1) (LT s4 1) (LT s72 1)) (OR (LT s0 1) (LT s15 1) (LT s72 1)) (OR (LT s3 1) (LT s7 1) (LT s72 1)) (OR (LT s1 1) (LT s12 1) (LT s72 1)) (OR (LT s1 1) (LT s14 1) (LT s72 1)) (OR (LT s0 1) (LT s7 1) (LT s72 1)) (OR (LT s2 1) (LT s11 1) (LT s72 1)) (OR (LT s3 1) (LT s16 1) (LT s72 1)) (OR (LT s1 1) (LT s5 1) (LT s72 1)) (OR (LT s2 1) (LT s19 1) (LT s72 1)) (OR (LT s3 1) (LT s8 1) (LT s72 1))), p0:(OR (AND (GEQ s0 1) (GEQ s9 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s4 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s18 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s5 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s4 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s5 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s17 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s72 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s72 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s72 1)) (AND (GEQ s2 1) (GEQ s19 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s72 1))), p2:(OR (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s35 1) (GEQ s34 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Stack based approach found an accepted trace after 921 steps with 0 reset with depth 922 and stack size 922 in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-04 finished in 600 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||(X(!p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 88 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2021-05-20 05:51:35] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-20 05:51:35] [INFO ] Implicit Places using invariants in 72 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
// Phase 1: matrix 236 rows 152 cols
[2021-05-20 05:51:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-20 05:51:35] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 152/153 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 152 cols
[2021-05-20 05:51:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-20 05:51:35] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1)), p1:(AND (LT s64 1) (LT s66 1) (LT s68 1) (LT s70 1) (LT s72 1) (LT s74 1) (LT s76 1) (LT s78 1) (LT s80 1) (LT s82 1) (LT s84 1) (LT s86 1) (LT s88 1) (LT s90 1) (LT s92 1) (LT s94 1) (LT s96 1) (LT s98 1) (LT s100 1) (LT s102 1) (LT s41 1) (LT s43 1) (LT s45 1) (LT s47 1) (LT s49 1) (LT s51 1) (LT s53 1) (LT s55 1) (LT s57 1) (LT s59 1) (LT s61 1) (LT s63 1) (LT s65 1) (LT s67 1) (LT s69 1) (LT s71 1) (LT s73 1) (LT s75 1) (LT s77 1) (LT s79 1) (LT s81 1) (LT s83 1) (LT s85 1) (LT s87 1) (LT s89 1) (LT s91 1) (LT s93 1) (LT s95 1) (LT s97 1) (LT s99 1) (LT s101 1) (LT s103 1) (LT s40 1) (LT s42 1) (LT s44 1) (LT s46 1) (LT s48 1) (LT s50 1) (LT s52 1) (LT s54 1) (LT s56 1) (LT s58 1) (LT s60 1) (LT s62 1) (OR (LT s109 1) (LT s133 1)) (OR (LT s116 1) (LT s135 1)) (OR (LT s119 1) (LT s135 1)) (OR (LT s111 1) (LT s133 1)) (OR (LT s114 1) (LT s134 1)) (OR (LT s118 1) (LT s135 1)) (OR (LT s107 1) (LT s132 1)) (OR (LT s110 1) (LT s133 1)) (OR (LT s115 1) (LT s134 1)) (OR (LT s105 1) (LT s132 1)) (OR (LT s113 1) (LT s134 1)) (OR (LT s117 1) (LT s135 1)) (OR (LT s112 1) (LT s134 1)) (OR (LT s108 1) (LT s133 1)) (OR (LT s106 1) (LT s132 1)) (OR (LT s104 1) (LT s132 1))), p2:(OR (AND (GEQ s109 1) (GEQ s133 1)) (AND (GEQ s116 1) (GEQ s135 1)) (AND (GEQ s119 1) (GEQ s135 1)) (AND (GEQ s111 1) (GEQ s133 1)) (AND (GEQ s114 1) (GEQ s134 1)) (AND (GEQ s118 1) (GEQ s135 1)) (AND (GEQ s107 1) (GEQ s132 1)) (AND (GEQ s110 1) (GEQ s133 1)) (AND (GEQ s115 1) (GEQ s134 1)) (AND (GEQ s105 1) (GEQ s132 1)) (AND (GEQ s113 1) (GEQ s134 1)) (AND (GEQ s117 1) (GEQ s135 1)) (AND (GEQ s112 1) (GEQ s134 1)) (AND (GEQ s108 1) (GEQ s133 1)) (AND (GEQ s106 1) (GEQ s132 1)) (AND (GEQ s104 1) (GEQ s132 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 363 ms.
Product exploration explored 100000 steps with 25000 reset in 377 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 25000 reset in 365 ms.
Product exploration explored 100000 steps with 25000 reset in 376 ms.
[2021-05-20 05:51:37] [INFO ] Flatten gal took : 12 ms
[2021-05-20 05:51:37] [INFO ] Flatten gal took : 12 ms
[2021-05-20 05:51:37] [INFO ] Time to serialize gal into /tmp/LTL1233498586004436467.gal : 1 ms
[2021-05-20 05:51:37] [INFO ] Time to serialize properties into /tmp/LTL10022226431114060072.ltl : 2 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/LTL1233498586004436467.gal, -t, CGAL, -LTL, /tmp/LTL10022226431114060072.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/LTL1233498586004436467.gal -t CGAL -LTL /tmp/LTL10022226431114060072.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((((Clients_0<1)&&(Clients_1<1))&&(Clients_2<1))&&(Clients_3<1))")||(((((((((((((((((("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((MovetoZ_1_2_0<1)&&(MovetoZ_1_2_2<1))&&(MovetoZ_1_3_0<1))&&(MovetoZ_1_3_2<1))&&(MovetoZ_2_0_0<1))&&(MovetoZ_2_0_2<1))&&(MovetoZ_2_1_0<1))&&(MovetoZ_2_1_2<1))&&(MovetoZ_2_2_0<1))&&(MovetoZ_2_2_2<1))&&(MovetoZ_2_3_0<1))&&(MovetoZ_2_3_2<1))&&(MovetoZ_3_0_0<1))&&(MovetoZ_3_0_2<1))&&(MovetoZ_3_1_0<1))&&(MovetoZ_3_1_2<1))&&(MovetoZ_3_2_0<1))&&(MovetoZ_3_2_2<1))&&(MovetoZ_3_3_0<1))&&(MovetoZ_3_3_2<1))&&(MovetoZ_0_0_1<1))&&(MovetoZ_0_0_3<1))&&(MovetoZ_0_1_1<1))&&(MovetoZ_0_1_3<1))&&(MovetoZ_0_2_1<1))&&(MovetoZ_0_2_3<1))&&(MovetoZ_0_3_1<1))&&(MovetoZ_0_3_3<1))&&(MovetoZ_1_0_1<1))&&(MovetoZ_1_0_3<1))&&(MovetoZ_1_1_1<1))&&(MovetoZ_1_1_3<1))&&(MovetoZ_1_2_1<1))&&(MovetoZ_1_2_3<1))&&(MovetoZ_1_3_1<1))&&(MovetoZ_1_3_3<1))&&(MovetoZ_2_0_1<1))&&(MovetoZ_2_0_3<1))&&(MovetoZ_2_1_1<1))&&(MovetoZ_2_1_3<1))&&(MovetoZ_2_2_1<1))&&(MovetoZ_2_2_3<1))&&(MovetoZ_2_3_1<1))&&(MovetoZ_2_3_3<1))&&(MovetoZ_3_0_1<1))&&(MovetoZ_3_0_3<1))&&(MovetoZ_3_1_1<1))&&(MovetoZ_3_1_3<1))&&(MovetoZ_3_2_1<1))&&(MovetoZ_3_2_3<1))&&(MovetoZ_3_3_1<1))&&(MovetoZ_3_3_3<1))&&(MovetoZ_0_0_0<1))&&(MovetoZ_0_0_2<1))&&(MovetoZ_0_1_0<1))&&(MovetoZ_0_1_2<1))&&(MovetoZ_0_2_0<1))&&(MovetoZ_0_2_2<1))&&(MovetoZ_0_3_0<1))&&(MovetoZ_0_3_2<1))&&(MovetoZ_1_0_0<1))&&(MovetoZ_1_0_2<1))&&(MovetoZ_1_1_0<1))&&(MovetoZ_1_1_2<1))")&&(X("(((((((((((((((((StartSecuring_1_1<1)||(ClientsTimeout_1<1))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_3_3<1)||(ClientsTimeout_3<1)))&&((StartSecuring_1_3<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_2<1)||(ClientsTimeout_2<1)))&&((StartSecuring_3_2<1)||(ClientsTimeout_3<1)))&&((StartSecuring_0_3<1)||(ClientsTimeout_0<1)))&&((StartSecuring_1_2<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_3<1)||(ClientsTimeout_2<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_0_2<1)||(ClientsTimeout_0<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))")))&&("((StartSecuring_1_1<1)||(ClientsTimeout_1<1))"))&&("((StartSecuring_3_0<1)||(ClientsTimeout_3<1))"))&&("((StartSecuring_3_3<1)||(ClientsTimeout_3<1))"))&&("((StartSecuring_1_3<1)||(ClientsTimeout_1<1))"))&&("((StartSecuring_2_2<1)||(ClientsTimeout_2<1))"))&&("((StartSecuring_3_2<1)||(ClientsTimeout_3<1))"))&&("((StartSecuring_0_3<1)||(ClientsTimeout_0<1))"))&&("((StartSecuring_1_2<1)||(ClientsTimeout_1<1))"))&&("((StartSecuring_2_3<1)||(ClientsTimeout_2<1))"))&&("((StartSecuring_0_1<1)||(ClientsTimeout_0<1))"))&&("((StartSecuring_2_1<1)||(ClientsTimeout_2<1))"))&&("((StartSecuring_3_1<1)||(ClientsTimeout_3<1))"))&&("((StartSecuring_2_0<1)||(ClientsTimeout_2<1))"))&&("((StartSecuring_1_0<1)||(ClientsTimeout_1<1))"))&&("((StartSecuring_0_2<1)||(ClientsTimeout_0<1))"))&&("((StartSecuring_0_0<1)||(ClientsTimeout_0<1))")))))))
Formula 0 simplified : !XXF("((((Clients_0<1)&&(Clients_1<1))&&(Clients_2<1))&&(Clients_3<1))" | ("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((MovetoZ_1_2_0<1)&&(MovetoZ_1_2_2<1))&&(MovetoZ_1_3_0<1))&&(MovetoZ_1_3_2<1))&&(MovetoZ_2_0_0<1))&&(MovetoZ_2_0_2<1))&&(MovetoZ_2_1_0<1))&&(MovetoZ_2_1_2<1))&&(MovetoZ_2_2_0<1))&&(MovetoZ_2_2_2<1))&&(MovetoZ_2_3_0<1))&&(MovetoZ_2_3_2<1))&&(MovetoZ_3_0_0<1))&&(MovetoZ_3_0_2<1))&&(MovetoZ_3_1_0<1))&&(MovetoZ_3_1_2<1))&&(MovetoZ_3_2_0<1))&&(MovetoZ_3_2_2<1))&&(MovetoZ_3_3_0<1))&&(MovetoZ_3_3_2<1))&&(MovetoZ_0_0_1<1))&&(MovetoZ_0_0_3<1))&&(MovetoZ_0_1_1<1))&&(MovetoZ_0_1_3<1))&&(MovetoZ_0_2_1<1))&&(MovetoZ_0_2_3<1))&&(MovetoZ_0_3_1<1))&&(MovetoZ_0_3_3<1))&&(MovetoZ_1_0_1<1))&&(MovetoZ_1_0_3<1))&&(MovetoZ_1_1_1<1))&&(MovetoZ_1_1_3<1))&&(MovetoZ_1_2_1<1))&&(MovetoZ_1_2_3<1))&&(MovetoZ_1_3_1<1))&&(MovetoZ_1_3_3<1))&&(MovetoZ_2_0_1<1))&&(MovetoZ_2_0_3<1))&&(MovetoZ_2_1_1<1))&&(MovetoZ_2_1_3<1))&&(MovetoZ_2_2_1<1))&&(MovetoZ_2_2_3<1))&&(MovetoZ_2_3_1<1))&&(MovetoZ_2_3_3<1))&&(MovetoZ_3_0_1<1))&&(MovetoZ_3_0_3<1))&&(MovetoZ_3_1_1<1))&&(MovetoZ_3_1_3<1))&&(MovetoZ_3_2_1<1))&&(MovetoZ_3_2_3<1))&&(MovetoZ_3_3_1<1))&&(MovetoZ_3_3_3<1))&&(MovetoZ_0_0_0<1))&&(MovetoZ_0_0_2<1))&&(MovetoZ_0_1_0<1))&&(MovetoZ_0_1_2<1))&&(MovetoZ_0_2_0<1))&&(MovetoZ_0_2_2<1))&&(MovetoZ_0_3_0<1))&&(MovetoZ_0_3_2<1))&&(MovetoZ_1_0_0<1))&&(MovetoZ_1_0_2<1))&&(MovetoZ_1_1_0<1))&&(MovetoZ_1_1_2<1))" & "((StartSecuring_0_0<1)||(ClientsTimeout_0<1))" & "((StartSecuring_0_1<1)||(ClientsTimeout_0<1))" & "((StartSecuring_0_2<1)||(ClientsTimeout_0<1))" & "((StartSecuring_0_3<1)||(ClientsTimeout_0<1))" & "((StartSecuring_1_0<1)||(ClientsTimeout_1<1))" & "((StartSecuring_1_1<1)||(ClientsTimeout_1<1))" & "((StartSecuring_1_2<1)||(ClientsTimeout_1<1))" & "((StartSecuring_1_3<1)||(ClientsTimeout_1<1))" & "((StartSecuring_2_0<1)||(ClientsTimeout_2<1))" & "((StartSecuring_2_1<1)||(ClientsTimeout_2<1))" & "((StartSecuring_2_2<1)||(ClientsTimeout_2<1))" & "((StartSecuring_2_3<1)||(ClientsTimeout_2<1))" & "((StartSecuring_3_0<1)||(ClientsTimeout_3<1))" & "((StartSecuring_3_1<1)||(ClientsTimeout_3<1))" & "((StartSecuring_3_2<1)||(ClientsTimeout_3<1))" & "((StartSecuring_3_3<1)||(ClientsTimeout_3<1))" & X"(((((((((((((((((StartSecuring_1_1<1)||(ClientsTimeout_1<1))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_3_3<1)||(ClientsTimeout_3<1)))&&((StartSecuring_1_3<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_2<1)||(ClientsTimeout_2<1)))&&((StartSecuring_3_2<1)||(ClientsTimeout_3<1)))&&((StartSecuring_0_3<1)||(ClientsTimeout_0<1)))&&((StartSecuring_1_2<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_3<1)||(ClientsTimeout_2<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_0_2<1)||(ClientsTimeout_0<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))"))
Detected timeout of ITS tools.
[2021-05-20 05:51:52] [INFO ] Flatten gal took : 12 ms
[2021-05-20 05:51:52] [INFO ] Applying decomposition
[2021-05-20 05:51:52] [INFO ] Flatten gal took : 11 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/graph14530827406650286579.txt, -o, /tmp/graph14530827406650286579.bin, -w, /tmp/graph14530827406650286579.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/graph14530827406650286579.bin, -l, -1, -v, -w, /tmp/graph14530827406650286579.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 05:51:52] [INFO ] Decomposing Gal with order
[2021-05-20 05:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 05:51:52] [INFO ] Removed a total of 140 redundant transitions.
[2021-05-20 05:51:52] [INFO ] Flatten gal took : 127 ms
[2021-05-20 05:51:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 12 ms.
[2021-05-20 05:51:52] [INFO ] Time to serialize gal into /tmp/LTL14291215821672574919.gal : 3 ms
[2021-05-20 05:51:52] [INFO ] Time to serialize properties into /tmp/LTL4838787270248674301.ltl : 2 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/LTL14291215821672574919.gal, -t, CGAL, -LTL, /tmp/LTL4838787270248674301.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/LTL14291215821672574919.gal -t CGAL -LTL /tmp/LTL4838787270248674301.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((((i9.u24.Clients_0<1)&&(i12.u0.Clients_1<1))&&(i8.u25.Clients_2<1))&&(i10.u1.Clients_3<1))")||(((((((((((((((((("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i2.u6.MovetoZ_1_2_0<1)&&(i12.u8.MovetoZ_1_2_2<1))&&(i2.u6.MovetoZ_1_3_0<1))&&(i12.u8.MovetoZ_1_3_2<1))&&(i5.u10.MovetoZ_2_0_0<1))&&(i5.u12.MovetoZ_2_0_2<1))&&(i5.u10.MovetoZ_2_1_0<1))&&(i5.u12.MovetoZ_2_1_2<1))&&(i5.u10.MovetoZ_2_2_0<1))&&(i5.u12.MovetoZ_2_2_2<1))&&(i5.u10.MovetoZ_2_3_0<1))&&(i5.u12.MovetoZ_2_3_2<1))&&(i10.u14.MovetoZ_3_0_0<1))&&(i13.u16.MovetoZ_3_0_2<1))&&(i10.u14.MovetoZ_3_1_0<1))&&(i13.u16.MovetoZ_3_1_2<1))&&(i10.u14.MovetoZ_3_2_0<1))&&(i13.u16.MovetoZ_3_2_2<1))&&(i10.u14.MovetoZ_3_3_0<1))&&(i13.u16.MovetoZ_3_3_2<1))&&(i0.u3.MovetoZ_0_0_1<1))&&(u5.MovetoZ_0_0_3<1))&&(i0.u3.MovetoZ_0_1_1<1))&&(u5.MovetoZ_0_1_3<1))&&(i0.u3.MovetoZ_0_2_1<1))&&(u5.MovetoZ_0_2_3<1))&&(i0.u3.MovetoZ_0_3_1<1))&&(u5.MovetoZ_0_3_3<1))&&(i12.u7.MovetoZ_1_0_1<1))&&(i3.u9.MovetoZ_1_0_3<1))&&(i12.u7.MovetoZ_1_1_1<1))&&(i3.u9.MovetoZ_1_1_3<1))&&(i12.u7.MovetoZ_1_2_1<1))&&(i3.u9.MovetoZ_1_2_3<1))&&(i12.u7.MovetoZ_1_3_1<1))&&(i3.u9.MovetoZ_1_3_3<1))&&(u11.MovetoZ_2_0_1<1))&&(u13.MovetoZ_2_0_3<1))&&(u11.MovetoZ_2_1_1<1))&&(u13.MovetoZ_2_1_3<1))&&(u11.MovetoZ_2_2_1<1))&&(u13.MovetoZ_2_2_3<1))&&(u11.MovetoZ_2_3_1<1))&&(u13.MovetoZ_2_3_3<1))&&(i4.u15.MovetoZ_3_0_1<1))&&(i10.u17.MovetoZ_3_0_3<1))&&(i4.u15.MovetoZ_3_1_1<1))&&(i10.u17.MovetoZ_3_1_3<1))&&(i4.u15.MovetoZ_3_2_1<1))&&(i10.u17.MovetoZ_3_2_3<1))&&(i4.u15.MovetoZ_3_3_1<1))&&(i10.u17.MovetoZ_3_3_3<1))&&(i0.u2.MovetoZ_0_0_0<1))&&(u4.MovetoZ_0_0_2<1))&&(i0.u2.MovetoZ_0_1_0<1))&&(u4.MovetoZ_0_1_2<1))&&(i0.u2.MovetoZ_0_2_0<1))&&(u4.MovetoZ_0_2_2<1))&&(i0.u2.MovetoZ_0_3_0<1))&&(u4.MovetoZ_0_3_2<1))&&(i2.u6.MovetoZ_1_0_0<1))&&(i12.u8.MovetoZ_1_0_2<1))&&(i2.u6.MovetoZ_1_1_0<1))&&(i12.u8.MovetoZ_1_1_2<1))")&&(X("(((((((((((((((((i12.u34.StartSecuring_1_1<1)||(i12.u26.ClientsTimeout_1<1))&&((i10.u38.StartSecuring_3_0<1)||(i10.u29.ClientsTimeout_3<1)))&&((i10.u23.StartSecuring_3_3<1)||(i10.u29.ClientsTimeout_3<1)))&&((i3.u36.StartSecuring_1_3<1)||(i12.u26.ClientsTimeout_1<1)))&&((i8.u37.StartSecuring_2_2<1)||(i8.u27.ClientsTimeout_2<1)))&&((i13.u39.StartSecuring_3_2<1)||(i10.u29.ClientsTimeout_3<1)))&&((i9.u33.StartSecuring_0_3<1)||(i9.u28.ClientsTimeout_0<1)))&&((i12.u35.StartSecuring_1_2<1)||(i12.u26.ClientsTimeout_1<1)))&&((i8.u21.StartSecuring_2_3<1)||(i8.u27.ClientsTimeout_2<1)))&&((i9.u31.StartSecuring_0_1<1)||(i9.u28.ClientsTimeout_0<1)))&&((i8.u20.StartSecuring_2_1<1)||(i8.u27.ClientsTimeout_2<1)))&&((i4.u22.StartSecuring_3_1<1)||(i10.u29.ClientsTimeout_3<1)))&&((i8.u19.StartSecuring_2_0<1)||(i8.u27.ClientsTimeout_2<1)))&&((i2.u18.StartSecuring_1_0<1)||(i12.u26.ClientsTimeout_1<1)))&&((i9.u32.StartSecuring_0_2<1)||(i9.u28.ClientsTimeout_0<1)))&&((i9.u30.StartSecuring_0_0<1)||(i9.u28.ClientsTimeout_0<1)))")))&&("((i12.u34.StartSecuring_1_1<1)||(i12.u26.ClientsTimeout_1<1))"))&&("((i10.u38.StartSecuring_3_0<1)||(i10.u29.ClientsTimeout_3<1))"))&&("((i10.u23.StartSecuring_3_3<1)||(i10.u29.ClientsTimeout_3<1))"))&&("((i3.u36.StartSecuring_1_3<1)||(i12.u26.ClientsTimeout_1<1))"))&&("((i8.u37.StartSecuring_2_2<1)||(i8.u27.ClientsTimeout_2<1))"))&&("((i13.u39.StartSecuring_3_2<1)||(i10.u29.ClientsTimeout_3<1))"))&&("((i9.u33.StartSecuring_0_3<1)||(i9.u28.ClientsTimeout_0<1))"))&&("((i12.u35.StartSecuring_1_2<1)||(i12.u26.ClientsTimeout_1<1))"))&&("((i8.u21.StartSecuring_2_3<1)||(i8.u27.ClientsTimeout_2<1))"))&&("((i9.u31.StartSecuring_0_1<1)||(i9.u28.ClientsTimeout_0<1))"))&&("((i8.u20.StartSecuring_2_1<1)||(i8.u27.ClientsTimeout_2<1))"))&&("((i4.u22.StartSecuring_3_1<1)||(i10.u29.ClientsTimeout_3<1))"))&&("((i8.u19.StartSecuring_2_0<1)||(i8.u27.ClientsTimeout_2<1))"))&&("((i2.u18.StartSecuring_1_0<1)||(i12.u26.ClientsTimeout_1<1))"))&&("((i9.u32.StartSecuring_0_2<1)||(i9.u28.ClientsTimeout_0<1))"))&&("((i9.u30.StartSecuring_0_0<1)||(i9.u28.ClientsTimeout_0<1))")))))))
Formula 0 simplified : !XXF("((((i9.u24.Clients_0<1)&&(i12.u0.Clients_1<1))&&(i8.u25.Clients_2<1))&&(i10.u1.Clients_3<1))" | ("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i2.u6.MovetoZ_1_2_0<1)&&(i12.u8.MovetoZ_1_2_2<1))&&(i2.u6.MovetoZ_1_3_0<1))&&(i12.u8.MovetoZ_1_3_2<1))&&(i5.u10.MovetoZ_2_0_0<1))&&(i5.u12.MovetoZ_2_0_2<1))&&(i5.u10.MovetoZ_2_1_0<1))&&(i5.u12.MovetoZ_2_1_2<1))&&(i5.u10.MovetoZ_2_2_0<1))&&(i5.u12.MovetoZ_2_2_2<1))&&(i5.u10.MovetoZ_2_3_0<1))&&(i5.u12.MovetoZ_2_3_2<1))&&(i10.u14.MovetoZ_3_0_0<1))&&(i13.u16.MovetoZ_3_0_2<1))&&(i10.u14.MovetoZ_3_1_0<1))&&(i13.u16.MovetoZ_3_1_2<1))&&(i10.u14.MovetoZ_3_2_0<1))&&(i13.u16.MovetoZ_3_2_2<1))&&(i10.u14.MovetoZ_3_3_0<1))&&(i13.u16.MovetoZ_3_3_2<1))&&(i0.u3.MovetoZ_0_0_1<1))&&(u5.MovetoZ_0_0_3<1))&&(i0.u3.MovetoZ_0_1_1<1))&&(u5.MovetoZ_0_1_3<1))&&(i0.u3.MovetoZ_0_2_1<1))&&(u5.MovetoZ_0_2_3<1))&&(i0.u3.MovetoZ_0_3_1<1))&&(u5.MovetoZ_0_3_3<1))&&(i12.u7.MovetoZ_1_0_1<1))&&(i3.u9.MovetoZ_1_0_3<1))&&(i12.u7.MovetoZ_1_1_1<1))&&(i3.u9.MovetoZ_1_1_3<1))&&(i12.u7.MovetoZ_1_2_1<1))&&(i3.u9.MovetoZ_1_2_3<1))&&(i12.u7.MovetoZ_1_3_1<1))&&(i3.u9.MovetoZ_1_3_3<1))&&(u11.MovetoZ_2_0_1<1))&&(u13.MovetoZ_2_0_3<1))&&(u11.MovetoZ_2_1_1<1))&&(u13.MovetoZ_2_1_3<1))&&(u11.MovetoZ_2_2_1<1))&&(u13.MovetoZ_2_2_3<1))&&(u11.MovetoZ_2_3_1<1))&&(u13.MovetoZ_2_3_3<1))&&(i4.u15.MovetoZ_3_0_1<1))&&(i10.u17.MovetoZ_3_0_3<1))&&(i4.u15.MovetoZ_3_1_1<1))&&(i10.u17.MovetoZ_3_1_3<1))&&(i4.u15.MovetoZ_3_2_1<1))&&(i10.u17.MovetoZ_3_2_3<1))&&(i4.u15.MovetoZ_3_3_1<1))&&(i10.u17.MovetoZ_3_3_3<1))&&(i0.u2.MovetoZ_0_0_0<1))&&(u4.MovetoZ_0_0_2<1))&&(i0.u2.MovetoZ_0_1_0<1))&&(u4.MovetoZ_0_1_2<1))&&(i0.u2.MovetoZ_0_2_0<1))&&(u4.MovetoZ_0_2_2<1))&&(i0.u2.MovetoZ_0_3_0<1))&&(u4.MovetoZ_0_3_2<1))&&(i2.u6.MovetoZ_1_0_0<1))&&(i12.u8.MovetoZ_1_0_2<1))&&(i2.u6.MovetoZ_1_1_0<1))&&(i12.u8.MovetoZ_1_1_2<1))" & "((i2.u18.StartSecuring_1_0<1)||(i12.u26.ClientsTimeout_1<1))" & "((i3.u36.StartSecuring_1_3<1)||(i12.u26.ClientsTimeout_1<1))" & "((i4.u22.StartSecuring_3_1<1)||(i10.u29.ClientsTimeout_3<1))" & "((i8.u19.StartSecuring_2_0<1)||(i8.u27.ClientsTimeout_2<1))" & "((i8.u20.StartSecuring_2_1<1)||(i8.u27.ClientsTimeout_2<1))" & "((i8.u21.StartSecuring_2_3<1)||(i8.u27.ClientsTimeout_2<1))" & "((i8.u37.StartSecuring_2_2<1)||(i8.u27.ClientsTimeout_2<1))" & "((i9.u30.StartSecuring_0_0<1)||(i9.u28.ClientsTimeout_0<1))" & "((i9.u31.StartSecuring_0_1<1)||(i9.u28.ClientsTimeout_0<1))" & "((i9.u32.StartSecuring_0_2<1)||(i9.u28.ClientsTimeout_0<1))" & "((i9.u33.StartSecuring_0_3<1)||(i9.u28.ClientsTimeout_0<1))" & "((i10.u23.StartSecuring_3_3<1)||(i10.u29.ClientsTimeout_3<1))" & "((i10.u38.StartSecuring_3_0<1)||(i10.u29.ClientsTimeout_3<1))" & "((i12.u34.StartSecuring_1_1<1)||(i12.u26.ClientsTimeout_1<1))" & "((i12.u35.StartSecuring_1_2<1)||(i12.u26.ClientsTimeout_1<1))" & "((i13.u39.StartSecuring_3_2<1)||(i10.u29.ClientsTimeout_3<1))" & X"(((((((((((((((((i12.u34.StartSecuring_1_1<1)||(i12.u26.ClientsTimeout_1<1))&&((i10.u38.StartSecuring_3_0<1)||(i10.u29.ClientsTimeout_3<1)))&&((i10.u23.StartSecuring_3_3<1)||(i10.u29.ClientsTimeout_3<1)))&&((i3.u36.StartSecuring_1_3<1)||(i12.u26.ClientsTimeout_1<1)))&&((i8.u37.StartSecuring_2_2<1)||(i8.u27.ClientsTimeout_2<1)))&&((i13.u39.StartSecuring_3_2<1)||(i10.u29.ClientsTimeout_3<1)))&&((i9.u33.StartSecuring_0_3<1)||(i9.u28.ClientsTimeout_0<1)))&&((i12.u35.StartSecuring_1_2<1)||(i12.u26.ClientsTimeout_1<1)))&&((i8.u21.StartSecuring_2_3<1)||(i8.u27.ClientsTimeout_2<1)))&&((i9.u31.StartSecuring_0_1<1)||(i9.u28.ClientsTimeout_0<1)))&&((i8.u20.StartSecuring_2_1<1)||(i8.u27.ClientsTimeout_2<1)))&&((i4.u22.StartSecuring_3_1<1)||(i10.u29.ClientsTimeout_3<1)))&&((i8.u19.StartSecuring_2_0<1)||(i8.u27.ClientsTimeout_2<1)))&&((i2.u18.StartSecuring_1_0<1)||(i12.u26.ClientsTimeout_1<1)))&&((i9.u32.StartSecuring_0_2<1)||(i9.u28.ClientsTimeout_0<1)))&&((i9.u30.StartSecuring_0_0<1)||(i9.u28.ClientsTimeout_0<1)))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8638757909737829427
[2021-05-20 05:52:08] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8638757909737829427
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/ltsmin8638757909737829427]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin8638757909737829427] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin8638757909737829427] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property UtilityControlRoom-PT-Z4T4N04-07 finished in 33575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&F(p1)) U X(X(X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 106 transition count 189
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 106 transition count 189
Applied a total of 94 rules in 3 ms. Remains 106 /153 variables (removed 47) and now considering 189/236 (removed 47) transitions.
// Phase 1: matrix 189 rows 106 cols
[2021-05-20 05:52:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:09] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 189 rows 106 cols
[2021-05-20 05:52:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:09] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 106 cols
[2021-05-20 05:52:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:09] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 106/153 places, 189/236 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=6, aps=[p1:(GEQ s83 1), p2:(OR (LT s3 1) (LT s8 1) (LT s77 1)), p0:(OR (GEQ s38 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 680 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-08 finished in 496 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 153 transition count 176
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 135 place count 93 transition count 161
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 135 place count 93 transition count 147
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 163 place count 79 transition count 147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 76 transition count 144
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 76 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 171 place count 74 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 74 transition count 112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 181 place count 66 transition count 104
Iterating global reduction 2 with 8 rules applied. Total rules applied 189 place count 66 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 197 place count 58 transition count 88
Iterating global reduction 2 with 8 rules applied. Total rules applied 205 place count 58 transition count 88
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 213 place count 50 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 221 place count 50 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 229 place count 50 transition count 64
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 259 place count 35 transition count 49
Applied a total of 259 rules in 14 ms. Remains 35 /153 variables (removed 118) and now considering 49/236 (removed 187) transitions.
// Phase 1: matrix 49 rows 35 cols
[2021-05-20 05:52:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:09] [INFO ] Implicit Places using invariants in 36 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
[2021-05-20 05:52:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 49 rows 34 cols
[2021-05-20 05:52:09] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-20 05:52:09] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 34/153 places, 49/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2021-05-20 05:52:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 49 rows 34 cols
[2021-05-20 05:52:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-20 05:52:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 34/153 places, 49/236 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-09 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LT s17 1) (GEQ s24 1) (GEQ s32 1)), p1:(AND (GEQ s24 1) (GEQ s32 1)), p0:(LT s25 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 6385 reset in 178 ms.
Stack based approach found an accepted trace after 389 steps with 28 reset with depth 3 and stack size 3 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-09 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 3 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:10] [INFO ] Implicit Places using invariants in 69 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
// Phase 1: matrix 188 rows 104 cols
[2021-05-20 05:52:10] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-20 05:52:10] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Starting structural reductions, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2021-05-20 05:52:10] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-20 05:52:10] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-10 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-10 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 3 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:10] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:10] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:10] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:10] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:10] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s23 1) (LT s76 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 24503 reset in 134 ms.
Product exploration explored 100000 steps with 24490 reset in 148 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24515 reset in 124 ms.
Product exploration explored 100000 steps with 24486 reset in 130 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 105 transition count 204
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 204
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 0 with 31 rules applied. Total rules applied 47 place count 105 transition count 213
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 63 place count 105 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 103 transition count 165
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 103 transition count 165
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 91 place count 79 transition count 125
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 115 place count 79 transition count 125
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 130 place count 64 transition count 103
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 145 place count 64 transition count 103
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 158 place count 64 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 64 transition count 90
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 159 rules in 14 ms. Remains 64 /105 variables (removed 41) and now considering 90/188 (removed 98) transitions.
[2021-05-20 05:52:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 64 cols
[2021-05-20 05:52:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/105 places, 90/188 transitions.
Product exploration explored 100000 steps with 24123 reset in 259 ms.
Stack based approach found an accepted trace after 38332 steps with 9238 reset with depth 8 and stack size 5 in 116 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-11 finished in 1550 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 153 transition count 173
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 142 place count 90 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 142 place count 90 transition count 141
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 174 place count 74 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 73 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 73 transition count 125
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 69 transition count 121
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 69 transition count 121
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 65 transition count 113
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 65 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 195 place count 62 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 198 place count 62 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 201 place count 62 transition count 101
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 223 place count 51 transition count 90
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 3 with 2 rules applied. Total rules applied 225 place count 50 transition count 89
Applied a total of 225 rules in 16 ms. Remains 50 /153 variables (removed 103) and now considering 89/236 (removed 147) transitions.
// Phase 1: matrix 89 rows 50 cols
[2021-05-20 05:52:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:11] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 89 rows 50 cols
[2021-05-20 05:52:11] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-20 05:52:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2021-05-20 05:52:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 89 rows 50 cols
[2021-05-20 05:52:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/153 places, 89/236 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-13 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 s38 1) (LT s31 1)), p0:(OR (LT s0 1) (LT s16 1) (LT s33 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 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 219 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 207 ms.
[2021-05-20 05:52:12] [INFO ] Flatten gal took : 5 ms
[2021-05-20 05:52:12] [INFO ] Flatten gal took : 6 ms
[2021-05-20 05:52:12] [INFO ] Time to serialize gal into /tmp/LTL4529902455252817583.gal : 1 ms
[2021-05-20 05:52:12] [INFO ] Time to serialize properties into /tmp/LTL75670700242760175.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/LTL4529902455252817583.gal, -t, CGAL, -LTL, /tmp/LTL75670700242760175.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/LTL4529902455252817583.gal -t CGAL -LTL /tmp/LTL75670700242760175.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((IdleTechs_0<1)||(OpenRequests_3_1<1))||(Idles<1))")))||(G("((ClientsWaiting_0<1)||(MovetoZ_3_3_2<1))")))))
Formula 0 simplified : !F(GF"(((IdleTechs_0<1)||(OpenRequests_3_1<1))||(Idles<1))" | G"((ClientsWaiting_0<1)||(MovetoZ_3_3_2<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
9 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.116122,20576,1,0,5,21608,22,0,1532,11338,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N04-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T4N04-13 finished in 1266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 153 transition count 173
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 142 place count 90 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 142 place count 90 transition count 141
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 174 place count 74 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 73 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 73 transition count 125
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 69 transition count 121
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 69 transition count 121
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 65 transition count 113
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 65 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 195 place count 62 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 198 place count 62 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 201 place count 62 transition count 101
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 223 place count 51 transition count 90
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 3 with 2 rules applied. Total rules applied 225 place count 50 transition count 89
Applied a total of 225 rules in 13 ms. Remains 50 /153 variables (removed 103) and now considering 89/236 (removed 147) transitions.
// Phase 1: matrix 89 rows 50 cols
[2021-05-20 05:52:13] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:13] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 89 rows 50 cols
[2021-05-20 05:52:13] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-20 05:52:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-05-20 05:52:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 89 rows 50 cols
[2021-05-20 05:52:13] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-20 05:52:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/153 places, 89/236 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-14 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:(AND (GEQ s1 1) (GEQ s14 1) (GEQ s33 1)), p0:(GEQ s31 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 420 reset in 197 ms.
Stack based approach found an accepted trace after 171 steps with 0 reset with depth 172 and stack size 172 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-14 finished in 404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&(G(p1)||X(F((F(p3)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 2 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:13] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:13] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:13] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-20 05:52:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 105 cols
[2021-05-20 05:52:13] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-20 05:52:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s31 1), p0:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s76 1)), p2:(AND (GEQ s1 1) (GEQ s21 1) (GEQ s76 1)), p3:(OR (LT s1 1) (LT s21 1) (LT s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 436 reset in 175 ms.
Stack based approach found an accepted trace after 6107 steps with 31 reset with depth 330 and stack size 330 in 12 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-15 finished in 570 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15307083877415795930
[2021-05-20 05:52:14] [INFO ] Applying decomposition
[2021-05-20 05:52:14] [INFO ] Computing symmetric may disable matrix : 236 transitions.
[2021-05-20 05:52:14] [INFO ] Flatten gal took : 13 ms
[2021-05-20 05:52:14] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-20 05:52:14] [INFO ] Computing symmetric may enable matrix : 236 transitions.
[2021-05-20 05:52:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph12038100418057444783.txt, -o, /tmp/graph12038100418057444783.bin, -w, /tmp/graph12038100418057444783.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/graph12038100418057444783.bin, -l, -1, -v, -w, /tmp/graph12038100418057444783.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 05:52:14] [INFO ] Decomposing Gal with order
[2021-05-20 05:52:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 05:52:14] [INFO ] Computing Do-Not-Accords matrix : 236 transitions.
[2021-05-20 05:52:14] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-20 05:52:14] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15307083877415795930
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/ltsmin15307083877415795930]
[2021-05-20 05:52:14] [INFO ] Removed a total of 215 redundant transitions.
[2021-05-20 05:52:14] [INFO ] Flatten gal took : 34 ms
[2021-05-20 05:52:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 13 ms.
[2021-05-20 05:52:14] [INFO ] Time to serialize gal into /tmp/LTLFireability7088486844848365673.gal : 19 ms
[2021-05-20 05:52:14] [INFO ] Time to serialize properties into /tmp/LTLFireability4830295620770366337.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/LTLFireability7088486844848365673.gal, -t, CGAL, -LTL, /tmp/LTLFireability4830295620770366337.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/LTLFireability7088486844848365673.gal -t CGAL -LTL /tmp/LTLFireability4830295620770366337.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((((i2.i1.u23.Clients_0>=1)||(i5.u24.Clients_1>=1))||(i3.u25.Clients_2>=1))||(i4.u0.Clients_3>=1))"))||((!("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i5.u3.MovetoZ_1_2_0>=1)||(u14.MovetoZ_1_2_2>=1))||(i5.u3.MovetoZ_1_3_0>=1))||(u14.MovetoZ_1_3_2>=1))||(i3.u18.MovetoZ_2_0_0>=1))||(u20.MovetoZ_2_0_2>=1))||(i3.u18.MovetoZ_2_1_0>=1))||(u20.MovetoZ_2_1_2>=1))||(i3.u18.MovetoZ_2_2_0>=1))||(u20.MovetoZ_2_2_2>=1))||(i3.u18.MovetoZ_2_3_0>=1))||(u20.MovetoZ_2_3_2>=1))||(i10.u8.MovetoZ_3_0_0>=1))||(i10.u10.MovetoZ_3_0_2>=1))||(i10.u8.MovetoZ_3_1_0>=1))||(i10.u10.MovetoZ_3_1_2>=1))||(i10.u8.MovetoZ_3_2_0>=1))||(i10.u10.MovetoZ_3_2_2>=1))||(i10.u8.MovetoZ_3_3_0>=1))||(i10.u10.MovetoZ_3_3_2>=1))||(i2.i0.u12.MovetoZ_0_0_1>=1))||(i7.u13.MovetoZ_0_0_3>=1))||(i2.i0.u12.MovetoZ_0_1_1>=1))||(i7.u13.MovetoZ_0_1_3>=1))||(i2.i0.u12.MovetoZ_0_2_1>=1))||(i7.u13.MovetoZ_0_2_3>=1))||(i2.i0.u12.MovetoZ_0_3_1>=1))||(i7.u13.MovetoZ_0_3_3>=1))||(u4.MovetoZ_1_0_1>=1))||(i5.u5.MovetoZ_1_0_3>=1))||(u4.MovetoZ_1_1_1>=1))||(i5.u5.MovetoZ_1_1_3>=1))||(u4.MovetoZ_1_2_1>=1))||(i5.u5.MovetoZ_1_2_3>=1))||(u4.MovetoZ_1_3_1>=1))||(i5.u5.MovetoZ_1_3_3>=1))||(i3.u6.MovetoZ_2_0_1>=1))||(u7.MovetoZ_2_0_3>=1))||(i3.u6.MovetoZ_2_1_1>=1))||(u7.MovetoZ_2_1_3>=1))||(i3.u6.MovetoZ_2_2_1>=1))||(u7.MovetoZ_2_2_3>=1))||(i3.u6.MovetoZ_2_3_1>=1))||(u7.MovetoZ_2_3_3>=1))||(i10.u9.MovetoZ_3_0_1>=1))||(i4.u11.MovetoZ_3_0_3>=1))||(i10.u9.MovetoZ_3_1_1>=1))||(i4.u11.MovetoZ_3_1_3>=1))||(i10.u9.MovetoZ_3_2_1>=1))||(i4.u11.MovetoZ_3_2_3>=1))||(i10.u9.MovetoZ_3_3_1>=1))||(i4.u11.MovetoZ_3_3_3>=1))||(i2.i1.u1.MovetoZ_0_0_0>=1))||(i6.u2.MovetoZ_0_0_2>=1))||(i2.i1.u1.MovetoZ_0_1_0>=1))||(i6.u2.MovetoZ_0_1_2>=1))||(i2.i1.u1.MovetoZ_0_2_0>=1))||(i6.u2.MovetoZ_0_2_2>=1))||(i2.i1.u1.MovetoZ_0_3_0>=1))||(i6.u2.MovetoZ_0_3_2>=1))||(i5.u3.MovetoZ_1_0_0>=1))||(u14.MovetoZ_1_0_2>=1))||(i5.u3.MovetoZ_1_1_0>=1))||(u14.MovetoZ_1_1_2>=1))||((i5.u32.StartSecuring_1_1>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i4.u35.StartSecuring_3_0>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i4.u37.StartSecuring_3_3>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i5.u33.StartSecuring_1_3>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u34.StartSecuring_2_2>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u22.StartSecuring_3_2>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i7.u31.StartSecuring_0_3>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i5.u17.StartSecuring_1_2>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u21.StartSecuring_2_3>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i2.i0.u16.StartSecuring_0_1>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i3.u19.StartSecuring_2_1>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u36.StartSecuring_3_1>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i3.u27.StartSecuring_2_0>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i5.u29.StartSecuring_1_0>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i6.u30.StartSecuring_0_2>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i2.i1.u15.StartSecuring_0_0>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))"))&&(X(!("(((((((((((((((((i5.u32.StartSecuring_1_1>=1)&&(i5.u29.ClientsTimeout_1>=1))||((i4.u35.StartSecuring_3_0>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i4.u37.StartSecuring_3_3>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i5.u33.StartSecuring_1_3>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u34.StartSecuring_2_2>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u22.StartSecuring_3_2>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i7.u31.StartSecuring_0_3>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i5.u17.StartSecuring_1_2>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u21.StartSecuring_2_3>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i2.i0.u16.StartSecuring_0_1>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i3.u19.StartSecuring_2_1>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u36.StartSecuring_3_1>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i3.u27.StartSecuring_2_0>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i5.u29.StartSecuring_1_0>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i6.u30.StartSecuring_0_2>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i2.i1.u15.StartSecuring_0_0>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))")))))))))
Formula 0 simplified : !XXF(!"((((i2.i1.u23.Clients_0>=1)||(i5.u24.Clients_1>=1))||(i3.u25.Clients_2>=1))||(i4.u0.Clients_3>=1))" | (!"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i5.u3.MovetoZ_1_2_0>=1)||(u14.MovetoZ_1_2_2>=1))||(i5.u3.MovetoZ_1_3_0>=1))||(u14.MovetoZ_1_3_2>=1))||(i3.u18.MovetoZ_2_0_0>=1))||(u20.MovetoZ_2_0_2>=1))||(i3.u18.MovetoZ_2_1_0>=1))||(u20.MovetoZ_2_1_2>=1))||(i3.u18.MovetoZ_2_2_0>=1))||(u20.MovetoZ_2_2_2>=1))||(i3.u18.MovetoZ_2_3_0>=1))||(u20.MovetoZ_2_3_2>=1))||(i10.u8.MovetoZ_3_0_0>=1))||(i10.u10.MovetoZ_3_0_2>=1))||(i10.u8.MovetoZ_3_1_0>=1))||(i10.u10.MovetoZ_3_1_2>=1))||(i10.u8.MovetoZ_3_2_0>=1))||(i10.u10.MovetoZ_3_2_2>=1))||(i10.u8.MovetoZ_3_3_0>=1))||(i10.u10.MovetoZ_3_3_2>=1))||(i2.i0.u12.MovetoZ_0_0_1>=1))||(i7.u13.MovetoZ_0_0_3>=1))||(i2.i0.u12.MovetoZ_0_1_1>=1))||(i7.u13.MovetoZ_0_1_3>=1))||(i2.i0.u12.MovetoZ_0_2_1>=1))||(i7.u13.MovetoZ_0_2_3>=1))||(i2.i0.u12.MovetoZ_0_3_1>=1))||(i7.u13.MovetoZ_0_3_3>=1))||(u4.MovetoZ_1_0_1>=1))||(i5.u5.MovetoZ_1_0_3>=1))||(u4.MovetoZ_1_1_1>=1))||(i5.u5.MovetoZ_1_1_3>=1))||(u4.MovetoZ_1_2_1>=1))||(i5.u5.MovetoZ_1_2_3>=1))||(u4.MovetoZ_1_3_1>=1))||(i5.u5.MovetoZ_1_3_3>=1))||(i3.u6.MovetoZ_2_0_1>=1))||(u7.MovetoZ_2_0_3>=1))||(i3.u6.MovetoZ_2_1_1>=1))||(u7.MovetoZ_2_1_3>=1))||(i3.u6.MovetoZ_2_2_1>=1))||(u7.MovetoZ_2_2_3>=1))||(i3.u6.MovetoZ_2_3_1>=1))||(u7.MovetoZ_2_3_3>=1))||(i10.u9.MovetoZ_3_0_1>=1))||(i4.u11.MovetoZ_3_0_3>=1))||(i10.u9.MovetoZ_3_1_1>=1))||(i4.u11.MovetoZ_3_1_3>=1))||(i10.u9.MovetoZ_3_2_1>=1))||(i4.u11.MovetoZ_3_2_3>=1))||(i10.u9.MovetoZ_3_3_1>=1))||(i4.u11.MovetoZ_3_3_3>=1))||(i2.i1.u1.MovetoZ_0_0_0>=1))||(i6.u2.MovetoZ_0_0_2>=1))||(i2.i1.u1.MovetoZ_0_1_0>=1))||(i6.u2.MovetoZ_0_1_2>=1))||(i2.i1.u1.MovetoZ_0_2_0>=1))||(i6.u2.MovetoZ_0_2_2>=1))||(i2.i1.u1.MovetoZ_0_3_0>=1))||(i6.u2.MovetoZ_0_3_2>=1))||(i5.u3.MovetoZ_1_0_0>=1))||(u14.MovetoZ_1_0_2>=1))||(i5.u3.MovetoZ_1_1_0>=1))||(u14.MovetoZ_1_1_2>=1))||((i5.u32.StartSecuring_1_1>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i4.u35.StartSecuring_3_0>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i4.u37.StartSecuring_3_3>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i5.u33.StartSecuring_1_3>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u34.StartSecuring_2_2>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u22.StartSecuring_3_2>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i7.u31.StartSecuring_0_3>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i5.u17.StartSecuring_1_2>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u21.StartSecuring_2_3>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i2.i0.u16.StartSecuring_0_1>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i3.u19.StartSecuring_2_1>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u36.StartSecuring_3_1>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i3.u27.StartSecuring_2_0>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i5.u29.StartSecuring_1_0>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i6.u30.StartSecuring_0_2>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i2.i1.u15.StartSecuring_0_0>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))" & X!"(((((((((((((((((i5.u32.StartSecuring_1_1>=1)&&(i5.u29.ClientsTimeout_1>=1))||((i4.u35.StartSecuring_3_0>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i4.u37.StartSecuring_3_3>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i5.u33.StartSecuring_1_3>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u34.StartSecuring_2_2>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u22.StartSecuring_3_2>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i7.u31.StartSecuring_0_3>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i5.u17.StartSecuring_1_2>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i3.u21.StartSecuring_2_3>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i2.i0.u16.StartSecuring_0_1>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i3.u19.StartSecuring_2_1>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i4.u36.StartSecuring_3_1>=1)&&(i4.u28.ClientsTimeout_3>=1)))||((i3.u27.StartSecuring_2_0>=1)&&(i3.u27.ClientsTimeout_2>=1)))||((i5.u29.StartSecuring_1_0>=1)&&(i5.u29.ClientsTimeout_1>=1)))||((i6.u30.StartSecuring_0_2>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))||((i2.i1.u15.StartSecuring_0_0>=1)&&(i2.i1.u26.ClientsTimeout_0>=1)))"))
Compilation finished in 1137 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15307083877415795930]
Link finished in 40 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, X(X(<>(((LTLAPp0==true)||(X(!(LTLAPp2==true))&&(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15307083877415795930]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
122 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.24788,53920,1,0,87472,932,1909,95438,266,7443,63743
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N04-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621489937403

--------------------
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="UtilityControlRoom-PT-Z4T4N04"
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 UtilityControlRoom-PT-Z4T4N04, 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 r311-tall-162132108700629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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