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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 51K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 243K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 133K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 503K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.9K May 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 11 18:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 11 18:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K 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 65K 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-Z4T4N02-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-15

=== Now, execution of the tool begins

BK_START 1621489150126

Running Version 0
[2021-05-20 05:39:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-20 05:39:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 05:39:12] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-20 05:39:12] [INFO ] Transformed 80 places.
[2021-05-20 05:39:12] [INFO ] Transformed 150 transitions.
[2021-05-20 05:39:12] [INFO ] Parsed PT model containing 80 places and 150 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 05:39:12] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2021-05-20 05:39:12] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-20 05:39:12] [INFO ] Implicit Places using invariants in 103 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:12] [INFO ] Computed 6 place invariants in 18 ms
[2021-05-20 05:39:12] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:12] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-20 05:39:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 79/80 places, 118/118 transitions.
[2021-05-20 05:39:12] [INFO ] Flatten gal took : 36 ms
[2021-05-20 05:39:12] [INFO ] Flatten gal took : 15 ms
[2021-05-20 05:39:13] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 26) seen :25
Running SMT prover for 1 properties.
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2021-05-20 05:39:13] [INFO ] Initial state test concluded for 1 properties.
FORMULA UtilityControlRoom-PT-Z4T4N02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 32 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:13] [INFO ] Implicit Places using invariants in 61 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
// Phase 1: matrix 118 rows 78 cols
[2021-05-20 05:39:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:13] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Starting structural reductions, iteration 1 : 78/79 places, 118/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 78 cols
[2021-05-20 05:39:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:13] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 2 iterations. Remains : 78/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-00 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:(OR (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) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1) (GEQ s49 1) (GEQ s48 1) (GEQ s51 1) (GEQ s50 1) (GEQ s53 1) (GEQ s52 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 7 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-00 finished in 500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((X((p2 U (p3||G(p2))))&&p1)||p0) U X((p4 U p5))))], workingDir=/home/mcc/execution]
Support contains 57 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:13] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:13] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-20 05:39:14] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 79 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:14] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p5), (NOT p5), (NOT p5), (AND (NOT p2) (NOT p3) (NOT p5)), true, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p5) p4), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p5) (NOT p4)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p5)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p5)) (AND p1 (NOT p5))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p5)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p5) p4 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p5) p4 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p5) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p5) (NOT p4) (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s66 1) (GEQ s65 1)), p1:(AND (OR (LT s55 1) (LT s69 1)) (OR (LT s60 1) (LT s70 1)) (OR (LT s54 1) (LT s69 1)) (OR (LT s56 1) (LT s69 1)) (OR (LT s61 1) (LT s70 1)) (OR (LT s57 1) (LT s69 1)) (OR (LT s58 1) (LT s70 1)) (OR (LT s59 1) (LT s70 1))), p5:(OR (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) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1) (GEQ s49 1) (GEQ s48 1) (GEQ s51 1) (GEQ s50 1) (GEQ s53 1) (GEQ s52 1)), p4:(OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s64 1))), p3:(AND (LT s66 1) (LT s65 1)), p2:(AND (OR (LT s55 1) (LT s69 1)) (OR (LT s60 1) (LT s70 1)) (OR (LT s54 1) (LT s69 1)) (OR (LT s56 1) (LT s69 1)) (OR (LT s61 1) (LT s70 1)) (OR (LT s57 1) (LT s69 1)) (OR (LT s58 1) (LT s70 1)) (OR (LT s59 1) (LT s70 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2709 steps with 942 reset in 38 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-01 finished in 452 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p1&&F(p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 21 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-20 05:39:14] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-20 05:39:14] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s40 1))), p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s14 1) (GEQ s15 1) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s40 1))), p2:(OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s40 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 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-02 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((!p1 U p2)||p0))))], workingDir=/home/mcc/execution]
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 17 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-20 05:39:14] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:14] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-20 05:39:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2021-05-20 05:39:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (GEQ s24 1) (GEQ s23 1)) (OR (AND (GEQ s0 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s22 1)))), p0:(OR (AND (GEQ s0 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s4 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17291 reset in 398 ms.
Product exploration explored 100000 steps with 17469 reset in 447 ms.
Knowledge obtained : [(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 17457 reset in 338 ms.
Product exploration explored 100000 steps with 17496 reset in 328 ms.
[2021-05-20 05:39:16] [INFO ] Flatten gal took : 8 ms
[2021-05-20 05:39:16] [INFO ] Flatten gal took : 17 ms
[2021-05-20 05:39:16] [INFO ] Time to serialize gal into /tmp/LTL13732782752781234755.gal : 3 ms
[2021-05-20 05:39:16] [INFO ] Time to serialize properties into /tmp/LTL4339865555771466290.ltl : 17 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/LTL13732782752781234755.gal, -t, CGAL, -LTL, /tmp/LTL4339865555771466290.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/LTL13732782752781234755.gal -t CGAL -LTL /tmp/LTL4339865555771466290.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(((((((((((((((((((((((((((((((((("((Finished_1>=1)||(Finished_0>=1))")U("(((Finished_1>=1)||(Finished_0>=1))&&((((((((((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))))"))||("(((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))"))||("(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))"))||("(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))"))||("(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))"))||("(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))")))))
Formula 0 simplified : !GF("(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))" | "(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))" | "(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))" | "(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1))" | "(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))" | ("((Finished_1>=1)||(Finished_0>=1))" U "(((Finished_1>=1)||(Finished_0>=1))&&((((((((((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1))))"))
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
ITS-tools command line returned an error code 134
[2021-05-20 05:39:16] [INFO ] Flatten gal took : 5 ms
[2021-05-20 05:39:16] [INFO ] Applying decomposition
[2021-05-20 05:39:16] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10705075278246045948.txt, -o, /tmp/graph10705075278246045948.bin, -w, /tmp/graph10705075278246045948.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10705075278246045948.bin, -l, -1, -v, -w, /tmp/graph10705075278246045948.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 05:39:16] [INFO ] Decomposing Gal with order
[2021-05-20 05:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 05:39:16] [INFO ] Removed a total of 88 redundant transitions.
[2021-05-20 05:39:16] [INFO ] Flatten gal took : 76 ms
[2021-05-20 05:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2021-05-20 05:39:16] [INFO ] Time to serialize gal into /tmp/LTL500904083770124124.gal : 2 ms
[2021-05-20 05:39:16] [INFO ] Time to serialize properties into /tmp/LTL5674694085250626944.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL500904083770124124.gal, -t, CGAL, -LTL, /tmp/LTL5674694085250626944.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL500904083770124124.gal -t CGAL -LTL /tmp/LTL5674694085250626944.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(((((((((((((((((((((((((((((((((("((i0.u9.Finished_1>=1)||(u8.Finished_0>=1))")U("(((i0.u9.Finished_1>=1)||(u8.Finished_0>=1))&&((((((((((((((((((((((((((((((((((u2.IdleTechs_0>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))||(((u0.IdleTechs_1>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))))"))||("(((u2.IdleTechs_0>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))"))||("(((u0.IdleTechs_1>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))"))||("(((u7.IdleTechs_2>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))"))||("(((i2.u4.IdleTechs_3>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))"))||("(((u2.IdleTechs_0>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))")))))
Formula 0 simplified : !GF("(((i2.u4.IdleTechs_3>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))" | "(((i2.u4.IdleTechs_3>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))" | "(((u0.IdleTechs_1>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))" | "(((u2.IdleTechs_0>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1))" | "(((u7.IdleTechs_2>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1))" | ("((i0.u9.Finished_1>=1)||(u8.Finished_0>=1))" U "(((i0.u9.Finished_1>=1)||(u8.Finished_0>=1))&&((((((((((((((((((((((((((((((((((u2.IdleTechs_0>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1))||(((u0.IdleTechs_1>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(u2.OpenRequests_0_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(i2.u4.OpenRequests_0_2>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i2.u5.OpenRequests_0_3>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(u0.OpenRequests_1_1>=1))&&(i2.u5.Idles>=1)))||(((u0.IdleTechs_1>=1)&&(i0.u1.OpenRequests_1_3>=1))&&(i2.u5.Idles>=1)))||(((u7.IdleTechs_2>=1)&&(i0.u6.OpenRequests_1_0>=1))&&(i2.u5.Idles>=1)))||(((i2.u4.IdleTechs_3>=1)&&(u7.OpenRequests_1_2>=1))&&(i2.u5.Idles>=1)))||(((u2.IdleTechs_0>=1)&&(i2.u3.OpenRequests_0_1>=1))&&(i2.u5.Idles>=1))))"))
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin4657424655459052636
[2021-05-20 05:39:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4657424655459052636
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4657424655459052636]
Compilation finished in 939 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4657424655459052636]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4657424655459052636]
LTSmin run took 798 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N02-03 finished in 4064 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Applied a total of 88 rules in 6 ms. Remains 39 /79 variables (removed 40) and now considering 70/118 (removed 48) transitions.
// Phase 1: matrix 70 rows 39 cols
[2021-05-20 05:39:18] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:18] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 70 rows 39 cols
[2021-05-20 05:39:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-20 05:39:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2021-05-20 05:39:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 39 cols
[2021-05-20 05:39:18] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/79 places, 70/118 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s24 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s24 1))), p1:(OR (GEQ s28 1) (GEQ s27 1))], nbAcceptance=2, 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 785 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-04 finished in 960 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(!p1)))], workingDir=/home/mcc/execution]
Support contains 23 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 45 transition count 76
Applied a total of 76 rules in 6 ms. Remains 45 /79 variables (removed 34) and now considering 76/118 (removed 42) transitions.
// Phase 1: matrix 76 rows 45 cols
[2021-05-20 05:39:19] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 76 rows 45 cols
[2021-05-20 05:39:19] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-20 05:39:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2021-05-20 05:39:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 45 cols
[2021-05-20 05:39:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-20 05:39:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/79 places, 76/118 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s11 1) (GEQ s30 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s30 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s30 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s30 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s30 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s30 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s30 1))), p1:(AND (OR (LT s21 1) (LT s35 1)) (OR (LT s26 1) (LT s36 1)) (OR (LT s20 1) (LT s35 1)) (OR (LT s22 1) (LT s35 1)) (OR (LT s27 1) (LT s36 1)) (OR (LT s23 1) (LT s35 1)) (OR (LT s24 1) (LT s36 1)) (OR (LT s25 1) (LT s36 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 45029 reset in 268 ms.
Product exploration explored 100000 steps with 44947 reset in 230 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 45002 reset in 219 ms.
Product exploration explored 100000 steps with 45089 reset in 215 ms.
[2021-05-20 05:39:20] [INFO ] Flatten gal took : 5 ms
[2021-05-20 05:39:20] [INFO ] Flatten gal took : 5 ms
[2021-05-20 05:39:20] [INFO ] Time to serialize gal into /tmp/LTL15888994065768969742.gal : 2 ms
[2021-05-20 05:39:20] [INFO ] Time to serialize properties into /tmp/LTL13352589763849831698.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/LTL15888994065768969742.gal, -t, CGAL, -LTL, /tmp/LTL13352589763849831698.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/LTL15888994065768969742.gal -t CGAL -LTL /tmp/LTL13352589763849831698.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))"))||(G("(((((((((StartSecuring_0_1>=1)&&(ClientsTimeout_0>=1))||((StartSecuring_1_2>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_0_2>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_3>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_3>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_0>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_1_1>=1)&&(ClientsTimeout_1>=1)))"))))
Formula 0 simplified : !(F"((((((((((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))&&(Idles>=1))||(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))&&(Idles>=1)))" | G"(((((((((StartSecuring_0_1>=1)&&(ClientsTimeout_0>=1))||((StartSecuring_1_2>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_0_2>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_3>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_0_3>=1)&&(ClientsTimeout_0>=1)))||((StartSecuring_1_0>=1)&&(ClientsTimeout_1>=1)))||((StartSecuring_1_1>=1)&&(ClientsTimeout_1>=1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.10368,19016,1,0,14,14351,29,3,1366,7031,31
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T4N02-05 finished in 1356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((((p0 U p1) U p2)&&F(p3))))], workingDir=/home/mcc/execution]
Support contains 49 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 79 transition count 110
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 110
Applied a total of 16 rules in 4 ms. Remains 71 /79 variables (removed 8) and now considering 110/118 (removed 8) transitions.
// Phase 1: matrix 110 rows 71 cols
[2021-05-20 05:39:21] [INFO ] Computed 6 place invariants in 23 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 110 rows 71 cols
[2021-05-20 05:39:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2021-05-20 05:39:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 71 cols
[2021-05-20 05:39:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:21] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/79 places, 110/118 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND (NOT p1) (NOT p3)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 p3), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(OR (GEQ s60 1) (GEQ s59 1)), p1:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s56 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s56 1))), p0:(OR (GEQ s4 1) (GEQ s5 1)), p3:(OR (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) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1) (GEQ s49 1) (GEQ s48 1) (GEQ s51 1) (GEQ s50 1) (GEQ s53 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 16581 reset in 348 ms.
Stack based approach found an accepted trace after 816 steps with 151 reset with depth 24 and stack size 24 in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-07 finished in 764 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 24 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 18 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 18 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 16 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 149 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 10 transition count 9
Applied a total of 151 rules in 20 ms. Remains 10 /79 variables (removed 69) and now considering 9/118 (removed 109) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-20 05:39:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants in 13 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-20 05:39:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-20 05:39:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 9/79 places, 9/118 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 6 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 6 transition count 6
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 4 transition count 5
Applied a total of 9 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 5/9 (removed 4) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-20 05:39:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants in 7 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 3/79 places, 5/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-20 05:39:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-20 05:39:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 2/79 places, 3/118 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-08 finished in 123 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0)&&G(p1)) U (F(G(p2))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 72 place count 47 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 41 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 38 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 38 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 32 transition count 42
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 32 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 28 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 28 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 24 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 24 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 24 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 20 transition count 22
Applied a total of 130 rules in 8 ms. Remains 20 /79 variables (removed 59) and now considering 22/118 (removed 96) transitions.
// Phase 1: matrix 22 rows 20 cols
[2021-05-20 05:39:21] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants in 22 ms returned [0, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
[2021-05-20 05:39:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 18 cols
[2021-05-20 05:39:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 18/79 places, 22/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 16 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 14 transition count 18
Applied a total of 8 rules in 2 ms. Remains 14 /18 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 14 cols
[2021-05-20 05:39:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 18 rows 14 cols
[2021-05-20 05:39:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-20 05:39:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/79 places, 18/118 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-09 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p3 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p3) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p2 p3 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=p2, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p3 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s1 1) (AND (GEQ s6 1) (GEQ s12 1))), p3:(GEQ s8 1), p1:(GEQ s1 1), p0:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 202 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-09 finished in 423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 24 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 18 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 18 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 16 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 149 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 10 transition count 9
Applied a total of 151 rules in 7 ms. Remains 10 /79 variables (removed 69) and now considering 9/118 (removed 109) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-20 05:39:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-20 05:39:22] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
[2021-05-20 05:39:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-20 05:39:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-20 05:39:22] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 9/79 places, 9/118 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 6 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 6 transition count 6
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 4 transition count 5
Applied a total of 9 rules in 1 ms. Remains 4 /9 variables (removed 5) and now considering 5/9 (removed 4) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-20 05:39:22] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-20 05:39:22] [INFO ] Implicit Places using invariants in 11 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 3/79 places, 5/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 6 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-20 05:39:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-20 05:39:22] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-20 05:39:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-20 05:39:22] [INFO ] Implicit Places using invariants and state equation in 5 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 2/79 places, 3/118 transitions.
Stuttering acceptance computed with spot in 528 ms :[true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s1 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 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-10 finished in 618 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2021-05-20 05:39:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:22] [INFO ] Implicit Places using invariants in 47 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
// Phase 1: matrix 94 rows 54 cols
[2021-05-20 05:39:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-20 05:39:23] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2021-05-20 05:39:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 94/94 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 54 transition count 102
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 102
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 23 place count 54 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 31 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 51 transition count 76
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 51 transition count 76
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 39 transition count 58
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 39 transition count 58
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 73 place count 27 transition count 40
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 85 place count 27 transition count 40
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 27 transition count 34
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 97 place count 21 transition count 28
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 21 transition count 28
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 21 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 21 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 20 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 20 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 113 rules in 8 ms. Remains 20 /54 variables (removed 34) and now considering 21/94 (removed 73) transitions.
[2021-05-20 05:39:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 20 cols
[2021-05-20 05:39:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:23] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/54 places, 21/94 transitions.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 263 ms.
[2021-05-20 05:39:24] [INFO ] Flatten gal took : 5 ms
[2021-05-20 05:39:24] [INFO ] Flatten gal took : 4 ms
[2021-05-20 05:39:24] [INFO ] Time to serialize gal into /tmp/LTL16200673144635925092.gal : 1 ms
[2021-05-20 05:39:24] [INFO ] Time to serialize properties into /tmp/LTL4889470592733041280.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/LTL16200673144635925092.gal, -t, CGAL, -LTL, /tmp/LTL4889470592733041280.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/LTL16200673144635925092.gal -t CGAL -LTL /tmp/LTL4889470592733041280.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Finished_1<1)"))))
Formula 0 simplified : !XF"(Finished_1<1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.107107,19396,1,0,6,18805,20,0,1407,6601,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T4N02-12 finished in 1560 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G((p0||F(p1))))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 56 transition count 95
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 56 transition count 95
Applied a total of 46 rules in 2 ms. Remains 56 /79 variables (removed 23) and now considering 95/118 (removed 23) transitions.
// Phase 1: matrix 95 rows 56 cols
[2021-05-20 05:39:24] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:24] [INFO ] Implicit Places using invariants in 30 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
// Phase 1: matrix 95 rows 55 cols
[2021-05-20 05:39:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 55/79 places, 95/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 55 cols
[2021-05-20 05:39:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/79 places, 95/118 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-13 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(GEQ s30 1), p0:(LT s43 1), p1:(AND (GEQ s31 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1298 reset in 127 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-13 finished in 408 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 37 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 37 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 33 transition count 50
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 33 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 29 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 29 transition count 42
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 26 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 26 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 26 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 24 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 23 transition count 30
Applied a total of 123 rules in 11 ms. Remains 23 /79 variables (removed 56) and now considering 30/118 (removed 88) transitions.
// Phase 1: matrix 30 rows 23 cols
[2021-05-20 05:39:24] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-20 05:39:24] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 30 rows 23 cols
[2021-05-20 05:39:24] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-20 05:39:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-20 05:39:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 23 cols
[2021-05-20 05:39:24] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-20 05:39:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/79 places, 30/118 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s13 1)), p1:(LT s14 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 112 reset in 110 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-14 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 56 transition count 95
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 56 transition count 95
Applied a total of 46 rules in 12 ms. Remains 56 /79 variables (removed 23) and now considering 95/118 (removed 23) transitions.
// Phase 1: matrix 95 rows 56 cols
[2021-05-20 05:39:25] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-20 05:39:25] [INFO ] Implicit Places using invariants in 37 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 95 rows 55 cols
[2021-05-20 05:39:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-20 05:39:25] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 55/79 places, 95/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 55 cols
[2021-05-20 05:39:25] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-20 05:39:25] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/79 places, 95/118 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, p0, (NOT p0), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s22 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 446 reset in 204 ms.
Stack based approach found an accepted trace after 96 steps with 1 reset with depth 95 and stack size 95 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-15 finished in 511 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621489166740

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

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