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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
526.012 32596.00 48306.00 271.60 FFFTFFFTFFFFFFFF 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-162132108500533.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-Z2T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108500533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 86K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 371K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 114K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 465K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 8.2K May 12 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K May 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 70K 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-Z2T3N06-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-15

=== Now, execution of the tool begins

BK_START 1621482386224

Running Version 0
[2021-05-20 03:46:27] [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 03:46:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 03:46:27] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-20 03:46:27] [INFO ] Transformed 106 places.
[2021-05-20 03:46:27] [INFO ] Transformed 162 transitions.
[2021-05-20 03:46:27] [INFO ] Parsed PT model containing 106 places and 162 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 03:46:27] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Support contains 68 out of 106 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 129
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 129
Applied a total of 18 rules in 15 ms. Remains 97 /106 variables (removed 9) and now considering 129/138 (removed 9) transitions.
// Phase 1: matrix 129 rows 97 cols
[2021-05-20 03:46:28] [INFO ] Computed 15 place invariants in 13 ms
[2021-05-20 03:46:28] [INFO ] Implicit Places using invariants in 145 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
// Phase 1: matrix 129 rows 96 cols
[2021-05-20 03:46:28] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-20 03:46:28] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Starting structural reductions, iteration 1 : 96/106 places, 129/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 96 cols
[2021-05-20 03:46:28] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-20 03:46:28] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 2 iterations. Remains : 96/106 places, 129/138 transitions.
[2021-05-20 03:46:28] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-20 03:46:28] [INFO ] Flatten gal took : 36 ms
FORMULA UtilityControlRoom-PT-Z2T3N06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 03:46:28] [INFO ] Flatten gal took : 15 ms
[2021-05-20 03:46:28] [INFO ] Input system was already deterministic with 129 transitions.
Finished random walk after 294 steps, including 0 resets, run visited all 20 properties in 8 ms. (steps per millisecond=36 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 6 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:28] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-20 03:46:28] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:28] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 03:46:28] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:28] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 03:46:29] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (LT s68 1) (LT s67 1) (LT s64 1) (LT s63 1) (LT s66 1) (LT s65 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 23 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-00 finished in 482 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p1)&&p0)) U p2))], workingDir=/home/mcc/execution]
Support contains 33 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 8 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:29] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:29] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-01 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s52 1) (GEQ s79 1)) (AND (GEQ s47 1) (GEQ s76 1)) (AND (GEQ s48 1) (GEQ s77 1)) (AND (GEQ s46 1) (GEQ s76 1)) (AND (GEQ s51 1) (GEQ s78 1)) (AND (GEQ s49 1) (GEQ s77 1)) (AND (GEQ s55 1) (GEQ s80 1)) (AND (GEQ s53 1) (GEQ s79 1)) (AND (GEQ s54 1) (GEQ s80 1)) (AND (GEQ s45 1) (GEQ s75 1)) (AND (GEQ s50 1) (GEQ s78 1)) (AND (GEQ s44 1) (GEQ s75 1))), p0:(AND (OR (LT s0 1) (LT s10 1) (LT s62 1)) (OR (LT s1 1) (LT s17 1) (LT s62 1)) (OR (LT s0 1) (LT s16 1) (LT s62 1)) (OR (LT s0 1) (LT s14 1) (LT s62 1)) (OR (LT s0 1) (LT s12 1) (LT s62 1)) (OR (LT s1 1) (LT s19 1) (LT s62 1)) (OR (LT s1 1) (LT s9 1) (LT s62 1)) (OR (LT s0 1) (LT s18 1) (LT s62 1)) (OR (LT s0 1) (LT s8 1) (LT s62 1)) (OR (LT s1 1) (LT s15 1) (LT s62 1)) (OR (LT s1 1) (LT s13 1) (LT s62 1)) (OR (LT s1 1) (LT s11 1) (LT s62 1))), p1:(AND (OR (LT s0 1) (LT s10 1) (LT s62 1)) (OR (LT s1 1) (LT s17 1) (LT s62 1)) (OR (LT s0 1) (LT s16 1) (LT s62 1)) (OR (LT s0 1) (LT s14 1) (LT s62 1)) (OR (LT s0 1) (LT s12 1) (LT s62 1)) (OR (LT s1 1) (LT s19 1) (LT s62 1)) (OR (LT s1 1) (LT s9 1) (LT s62 1)) (OR (LT s0 1) (LT s18 1) (LT s62 1)) (OR (LT s0 1) (LT s8 1) (LT s62 1)) (OR (LT s1 1) (LT s15 1) (LT s62 1)) (OR (LT s1 1) (LT s13 1) (LT s62 1)) (OR (LT s1 1) (LT s11 1) (LT s62 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-01 finished in 233 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 21 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 4 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:29] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-20 03:46:29] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 03:46:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) p0), p0, (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s68 1) (LT s67 1) (LT s64 1) (LT s63 1) (LT s66 1) (LT s65 1)), p1:(OR (AND (GEQ s0 1) (GEQ s10 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-02 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 15 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 96 transition count 123
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 90 transition count 120
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 15 place count 90 transition count 108
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 39 place count 78 transition count 108
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 69 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 69 transition count 90
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 78 place count 63 transition count 84
Applied a total of 78 rules in 24 ms. Remains 63 /96 variables (removed 33) and now considering 84/129 (removed 45) transitions.
// Phase 1: matrix 84 rows 63 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:29] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 84 rows 63 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-20 03:46:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 63 cols
[2021-05-20 03:46:29] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:29] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/96 places, 84/129 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s10 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s2 1) (GEQ s32 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s32 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40617 reset in 358 ms.
Product exploration explored 100000 steps with 40590 reset in 303 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40556 reset in 246 ms.
Product exploration explored 100000 steps with 40548 reset in 258 ms.
[2021-05-20 03:46:31] [INFO ] Flatten gal took : 7 ms
[2021-05-20 03:46:31] [INFO ] Flatten gal took : 6 ms
[2021-05-20 03:46:31] [INFO ] Time to serialize gal into /tmp/LTL12764077373081860991.gal : 4 ms
[2021-05-20 03:46:31] [INFO ] Time to serialize properties into /tmp/LTL12200245917761635558.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12764077373081860991.gal, -t, CGAL, -LTL, /tmp/LTL12200245917761635558.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/LTL12764077373081860991.gal -t CGAL -LTL /tmp/LTL12200245917761635558.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))")))
Formula 0 simplified : !F"((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
11 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.122631,20544,1,0,37,27841,20,8,1680,8807,73
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N06-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T3N06-03 finished in 1609 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1)&&G((p1||X(X(!p2)))))))], workingDir=/home/mcc/execution]
Support contains 33 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 3 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:31] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:31] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:31] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:31] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:31] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-20 03:46:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 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)), p1:(AND (LT s70 1) (LT s69 1) (LT s72 1) (LT s71 1) (LT s74 1) (LT s73 1)), p2:(OR (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4996 reset in 252 ms.
Product exploration explored 100000 steps with 5009 reset in 259 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 5080 reset in 245 ms.
Product exploration explored 100000 steps with 5063 reset in 258 ms.
Applying partial POR strategy [false, false, true, false, false, false, true, false]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Support contains 33 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-20 03:46:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:33] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:33] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Product exploration explored 100000 steps with 5035 reset in 361 ms.
Product exploration explored 100000 steps with 5010 reset in 309 ms.
[2021-05-20 03:46:34] [INFO ] Flatten gal took : 8 ms
[2021-05-20 03:46:34] [INFO ] Flatten gal took : 7 ms
[2021-05-20 03:46:34] [INFO ] Time to serialize gal into /tmp/LTL18103157034772457879.gal : 2 ms
[2021-05-20 03:46:34] [INFO ] Time to serialize properties into /tmp/LTL15188740863047901919.ltl : 14 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/LTL18103157034772457879.gal, -t, CGAL, -LTL, /tmp/LTL15188740863047901919.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/LTL18103157034772457879.gal -t CGAL -LTL /tmp/LTL15188740863047901919.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((F("((((((ClientsWaiting_1<1)&&(ClientsWaiting_0<1))&&(ClientsWaiting_3<1))&&(ClientsWaiting_2<1))&&(ClientsWaiting_5<1))&&(ClientsWaiting_4<1))"))&&(G(("((((((ClientsWaiting_1<1)&&(ClientsWaiting_0<1))&&(ClientsWaiting_3<1))&&(ClientsWaiting_2<1))&&(ClientsWaiting_5<1))&&(ClientsWaiting_4<1))")||(X(X("((((((((((((((((((((((((((IdleTechs_0<1)||(OpenRequests_4_0<1))||(Idles<1))&&(((IdleTechs_0<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_4_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_0<1))||(Idles<1)))"))))))&&("((((((((((((Assigned_0_0>=1)||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))||(Assigned_3_0>=1))||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))"))))
Formula 0 simplified : !F("((((((((((((Assigned_0_0>=1)||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))||(Assigned_3_0>=1))||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))" & F"((((((ClientsWaiting_1<1)&&(ClientsWaiting_0<1))&&(ClientsWaiting_3<1))&&(ClientsWaiting_2<1))&&(ClientsWaiting_5<1))&&(ClientsWaiting_4<1))" & G("((((((ClientsWaiting_1<1)&&(ClientsWaiting_0<1))&&(ClientsWaiting_3<1))&&(ClientsWaiting_2<1))&&(ClientsWaiting_5<1))&&(ClientsWaiting_4<1))" | XX"((((((((((((((((((((((((((IdleTechs_0<1)||(OpenRequests_4_0<1))||(Idles<1))&&(((IdleTechs_0<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_4_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_0<1))||(Idles<1)))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
27 unique states visited
27 strongly connected components in search stack
27 transitions explored
27 items max in DFS search stack
652 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,6.54091,221168,1,0,165,1.04593e+06,45,51,2629,1.0809e+06,415
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N06-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z2T3N06-04 finished in 10573 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F((!p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 27 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 96 transition count 123
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 90 transition count 120
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 15 place count 90 transition count 108
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 39 place count 78 transition count 108
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 69 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 69 transition count 90
Applied a total of 66 rules in 11 ms. Remains 69 /96 variables (removed 27) and now considering 90/129 (removed 39) transitions.
// Phase 1: matrix 90 rows 69 cols
[2021-05-20 03:46:41] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:42] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 90 rows 69 cols
[2021-05-20 03:46:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:42] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2021-05-20 03:46:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 69 cols
[2021-05-20 03:46:42] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/96 places, 90/129 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (OR (LT s0 1) (LT s10 1) (LT s38 1)) (OR (LT s1 1) (LT s17 1) (LT s38 1)) (OR (LT s0 1) (LT s16 1) (LT s38 1)) (OR (LT s0 1) (LT s14 1) (LT s38 1)) (OR (LT s0 1) (LT s12 1) (LT s38 1)) (OR (LT s1 1) (LT s19 1) (LT s38 1)) (OR (LT s1 1) (LT s9 1) (LT s38 1)) (OR (LT s0 1) (LT s18 1) (LT s38 1)) (OR (LT s0 1) (LT s8 1) (LT s38 1)) (OR (LT s1 1) (LT s15 1) (LT s38 1)) (OR (LT s1 1) (LT s13 1) (LT s38 1)) (OR (LT s1 1) (LT s11 1) (LT s38 1))), p2:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p1:(AND (LT s46 1) (LT s45 1) (LT s48 1) (LT s47 1) (LT s50 1) (LT s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-05 finished in 226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 54 place count 69 transition count 102
Applied a total of 54 rules in 10 ms. Remains 69 /96 variables (removed 27) and now considering 102/129 (removed 27) transitions.
// Phase 1: matrix 102 rows 69 cols
[2021-05-20 03:46:42] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:42] [INFO ] Implicit Places using invariants in 36 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
[2021-05-20 03:46:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 68 cols
[2021-05-20 03:46:42] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-20 03:46:42] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 68/96 places, 102/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-20 03:46:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 68 cols
[2021-05-20 03:46:42] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-20 03:46:42] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 68/96 places, 102/129 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-06 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 4 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:42] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:42] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:42] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-20 03:46:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-07 automaton TGBA [mat=[[{ cond=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:(AND (LT s70 1) (LT s69 1) (LT s72 1) (LT s71 1) (LT s74 1) (LT s73 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 24468 reset in 124 ms.
Product exploration explored 100000 steps with 24444 reset in 138 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 24471 reset in 126 ms.
Product exploration explored 100000 steps with 24442 reset in 138 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 111 ms :[p0, p0, p0, p0]
Support contains 6 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 138
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 93 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 0 with 36 rules applied. Total rules applied 48 place count 93 transition count 144
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 60 place count 93 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 92 transition count 120
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 92 transition count 120
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 80 place count 74 transition count 90
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 74 transition count 90
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 62 transition count 78
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 62 transition count 78
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 134 place count 62 transition count 66
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 134 rules in 13 ms. Remains 62 /93 variables (removed 31) and now considering 66/126 (removed 60) transitions.
[2021-05-20 03:46:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 66 rows 62 cols
[2021-05-20 03:46:43] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/93 places, 66/126 transitions.
Product exploration explored 100000 steps with 24542 reset in 288 ms.
Product exploration explored 100000 steps with 24549 reset in 274 ms.
[2021-05-20 03:46:44] [INFO ] Flatten gal took : 8 ms
[2021-05-20 03:46:44] [INFO ] Flatten gal took : 7 ms
[2021-05-20 03:46:44] [INFO ] Time to serialize gal into /tmp/LTL7606822228720466600.gal : 1 ms
[2021-05-20 03:46:44] [INFO ] Time to serialize properties into /tmp/LTL1127681610707913162.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7606822228720466600.gal, -t, CGAL, -LTL, /tmp/LTL1127681610707913162.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/LTL7606822228720466600.gal -t CGAL -LTL /tmp/LTL1127681610707913162.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((((ClientsWaiting_1>=1)||(ClientsWaiting_0>=1))||(ClientsWaiting_3>=1))||(ClientsWaiting_2>=1))||(ClientsWaiting_5>=1))||(ClientsWaiting_4>=1))"))))))
Formula 0 simplified : !XXXF"((((((ClientsWaiting_1>=1)||(ClientsWaiting_0>=1))||(ClientsWaiting_3>=1))||(ClientsWaiting_2>=1))||(ClientsWaiting_5>=1))||(ClientsWaiting_4>=1))"
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
126 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.27629,55764,1,0,41,265223,20,8,2362,54020,82
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N06-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z2T3N06-07 finished in 3157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 96 transition count 123
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 90 transition count 120
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 90 transition count 109
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 79 transition count 109
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 99 place count 48 transition count 78
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 108 place count 48 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 47 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 47 transition count 57
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 42 transition count 47
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 42 transition count 47
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 37 transition count 42
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 37 transition count 42
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 135 place count 37 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 141 place count 34 transition count 34
Applied a total of 141 rules in 11 ms. Remains 34 /96 variables (removed 62) and now considering 34/129 (removed 95) transitions.
// Phase 1: matrix 34 rows 34 cols
[2021-05-20 03:46:45] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:45] [INFO ] Implicit Places using invariants in 36 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
[2021-05-20 03:46:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 33 cols
[2021-05-20 03:46:45] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-20 03:46:45] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 33/96 places, 34/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2021-05-20 03:46:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 33 cols
[2021-05-20 03:46:45] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-20 03:46:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 33/96 places, 34/129 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s1 1) (OR (LT s18 1) (LT s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-09 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 2 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:45] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:45] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:45] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s59 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-10 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 127
Applied a total of 4 rules in 2 ms. Remains 94 /96 variables (removed 2) and now considering 127/129 (removed 2) transitions.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:46] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:46] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/96 places, 127/129 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-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: 1}]], initial=2, aps=[p0:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 436 reset in 147 ms.
Stack based approach found an accepted trace after 4830 steps with 14 reset with depth 510 and stack size 510 in 8 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-11 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 2 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:46] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 03:46:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:46] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s7 1), p2:(GEQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 11146 reset in 158 ms.
Product exploration explored 100000 steps with 11130 reset in 170 ms.
Knowledge obtained : [(NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10928 reset in 158 ms.
Product exploration explored 100000 steps with 11072 reset in 175 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 138
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 93 transition count 138
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 0 with 34 rules applied. Total rules applied 46 place count 93 transition count 143
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 58 place count 93 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 92 transition count 119
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 92 transition count 119
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 78 place count 74 transition count 89
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 96 place count 74 transition count 89
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 108 place count 62 transition count 77
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 120 place count 62 transition count 77
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 131 place count 62 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 136 place count 62 transition count 66
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 136 rules in 17 ms. Remains 62 /93 variables (removed 31) and now considering 66/126 (removed 60) transitions.
[2021-05-20 03:46:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 62 cols
[2021-05-20 03:46:47] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/93 places, 66/126 transitions.
Product exploration explored 100000 steps with 11315 reset in 364 ms.
Stack based approach found an accepted trace after 15 steps with 3 reset with depth 4 and stack size 3 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-12 finished in 1512 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 96 transition count 124
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 91 transition count 121
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 13 place count 91 transition count 109
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 37 place count 79 transition count 109
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 103 place count 46 transition count 76
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 46 transition count 67
Applied a total of 112 rules in 12 ms. Remains 46 /96 variables (removed 50) and now considering 67/129 (removed 62) transitions.
// Phase 1: matrix 67 rows 46 cols
[2021-05-20 03:46:48] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:48] [INFO ] Implicit Places using invariants in 29 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
[2021-05-20 03:46:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 45 cols
[2021-05-20 03:46:48] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-20 03:46:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 45/96 places, 67/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2021-05-20 03:46:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 45 cols
[2021-05-20 03:46:48] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-20 03:46:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/96 places, 67/129 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s35 1), p1:(GEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 112 steps with 0 reset with depth 113 and stack size 113 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-13 finished in 389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (p1 U G((p2||X(p2)||F(p3))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 127
Applied a total of 4 rules in 1 ms. Remains 94 /96 variables (removed 2) and now considering 127/129 (removed 2) transitions.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 03:46:48] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:48] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 03:46:48] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 03:46:48] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:48] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/96 places, 127/129 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) p1), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 12}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 13}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p3) p1), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(NOT p3), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=12 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p3) p0), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(GEQ s64 1), p1:(LT s35 1), p2:(LT s7 1), p3:(OR (LT s0 1) (LT s9 1) (LT s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 149 reset in 155 ms.
Product exploration explored 100000 steps with 124 reset in 172 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2), p3]
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) p1), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 156 reset in 155 ms.
Product exploration explored 100000 steps with 141 reset in 170 ms.
Applying partial POR strategy [false, false, true, false, false, true, false, false, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) p1), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Support contains 6 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 94/94 places, 127/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 94 transition count 126
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 94 transition count 138
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 94 transition count 138
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 35 place count 94 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 46 place count 94 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 94 transition count 132
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 47 rules in 9 ms. Remains 94 /94 variables (removed 0) and now considering 132/127 (removed -5) transitions.
[2021-05-20 03:46:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 132 rows 94 cols
[2021-05-20 03:46:50] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:50] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 132/127 transitions.
Product exploration explored 100000 steps with 126 reset in 156 ms.
Product exploration explored 100000 steps with 135 reset in 175 ms.
[2021-05-20 03:46:51] [INFO ] Flatten gal took : 7 ms
[2021-05-20 03:46:51] [INFO ] Flatten gal took : 7 ms
[2021-05-20 03:46:51] [INFO ] Time to serialize gal into /tmp/LTL17589984696960959180.gal : 2 ms
[2021-05-20 03:46:51] [INFO ] Time to serialize properties into /tmp/LTL4126006518884322518.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17589984696960959180.gal, -t, CGAL, -LTL, /tmp/LTL4126006518884322518.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/LTL17589984696960959180.gal -t CGAL -LTL /tmp/LTL4126006518884322518.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(Finished_0>=1)"))U(("(MovetoZ_1_0_1<1)")U(G((("(Clients_5<1)")||(X("(Clients_5<1)")))||(F("(((IdleTechs_0<1)||(OpenRequests_0_1<1))||(Idles<1))")))))))
Formula 0 simplified : !(G"(Finished_0>=1)" U ("(MovetoZ_1_0_1<1)" U G("(Clients_5<1)" | X"(Clients_5<1)" | F"(((IdleTechs_0<1)||(OpenRequests_0_1<1))||(Idles<1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
574 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.76299,173680,1,0,71,849623,65,24,2561,792519,181
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N06-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T3N06-14 finished in 9291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 126
Applied a total of 6 rules in 2 ms. Remains 93 /96 variables (removed 3) and now considering 126/129 (removed 3) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:57] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:57] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:57] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 03:46:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 03:46:57] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 03:46:57] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/96 places, 126/129 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LT s27 1), p0:(OR (LT s1 1) (LT s17 1) (LT s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-15 finished in 281 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621482418820

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

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