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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
479.951 47134.00 45324.00 4643.80 FTTFFTFTTFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108600573.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-Z2T4N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108600573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 46K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 216K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 375K 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 51K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 9.8K May 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 11 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 11 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 70K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-15

=== Now, execution of the tool begins

BK_START 1621484089087

Running Version 0
[2021-05-20 04:14:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-20 04:14:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 04:14:57] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-20 04:14:57] [INFO ] Transformed 106 places.
[2021-05-20 04:14:57] [INFO ] Transformed 162 transitions.
[2021-05-20 04:14:57] [INFO ] Parsed PT model containing 106 places and 162 transitions in 2940 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 04:14:57] [INFO ] Reduced 6 identical enabling conditions.
[2021-05-20 04:14:57] [INFO ] Reduced 6 identical enabling conditions.
[2021-05-20 04:14:57] [INFO ] Initial state test concluded for 6 properties.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N06-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 106 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2021-05-20 04:14:57] [INFO ] Computed 15 place invariants in 14 ms
[2021-05-20 04:14:57] [INFO ] Implicit Places using invariants in 127 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2021-05-20 04:14:57] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-20 04:14:57] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Starting structural reductions, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2021-05-20 04:14:57] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:14:57] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 2 iterations. Remains : 105/106 places, 138/138 transitions.
[2021-05-20 04:14:58] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-20 04:14:58] [INFO ] Flatten gal took : 37 ms
FORMULA UtilityControlRoom-PT-Z2T4N06-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 04:14:58] [INFO ] Flatten gal took : 14 ms
[2021-05-20 04:14:58] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 277 steps, including 0 resets, run visited all 26 properties in 8 ms. (steps per millisecond=34 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 87 transition count 120
Applied a total of 36 rules in 27 ms. Remains 87 /105 variables (removed 18) and now considering 120/138 (removed 18) transitions.
// Phase 1: matrix 120 rows 87 cols
[2021-05-20 04:14:58] [INFO ] Computed 14 place invariants in 14 ms
[2021-05-20 04:14:58] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2021-05-20 04:14:58] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-20 04:14:58] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2021-05-20 04:14:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2021-05-20 04:14:58] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-20 04:14:58] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/105 places, 120/138 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s14 1) (GEQ s15 1) (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s56 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 12369 reset in 378 ms.
Product exploration explored 100000 steps with 12425 reset in 322 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12492 reset in 298 ms.
Product exploration explored 100000 steps with 12454 reset in 277 ms.
[2021-05-20 04:15:00] [INFO ] Flatten gal took : 10 ms
[2021-05-20 04:15:00] [INFO ] Flatten gal took : 8 ms
[2021-05-20 04:15:00] [INFO ] Time to serialize gal into /tmp/LTL10761743668412071963.gal : 4 ms
[2021-05-20 04:15:00] [INFO ] Time to serialize properties into /tmp/LTL8818107594572465825.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10761743668412071963.gal, -t, CGAL, -LTL, /tmp/LTL8818107594572465825.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/LTL10761743668412071963.gal -t CGAL -LTL /tmp/LTL8818107594572465825.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((((((((((Assigned_0_0>=1)||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))||(Assigned_3_0>=1))||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))"))))
Formula 0 simplified : !GF"((((((((((((((((((((((((Assigned_0_0>=1)||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))||(Assigned_3_0>=1))||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
387 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,3.88962,136892,1,0,55,654887,24,1,2425,514564,139
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N06-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T4N06-02 finished in 6343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X((G(p0) U X(p1))))))], workingDir=/home/mcc/execution]
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 4 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:04] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:04] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:04] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:15:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:04] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-20 04:15:04] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-04 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s17 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s19 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s62 1))), p1:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6522 reset in 373 ms.
Product exploration explored 100000 steps with 6440 reset in 361 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6443 reset in 345 ms.
Product exploration explored 100000 steps with 6381 reset in 360 ms.
[2021-05-20 04:15:06] [INFO ] Flatten gal took : 8 ms
[2021-05-20 04:15:06] [INFO ] Flatten gal took : 8 ms
[2021-05-20 04:15:06] [INFO ] Time to serialize gal into /tmp/LTL14468022784461277176.gal : 5 ms
[2021-05-20 04:15:06] [INFO ] Time to serialize properties into /tmp/LTL7644239146161739121.ltl : 11 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/LTL14468022784461277176.gal, -t, CGAL, -LTL, /tmp/LTL7644239146161739121.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/LTL14468022784461277176.gal -t CGAL -LTL /tmp/LTL7644239146161739121.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X((G("((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))"))U(X("((((((((((((Assigned_0_0>=1)||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))||(Assigned_3_0>=1))||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))"))))&&("((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))"))))
Formula 0 simplified : !F("((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))" & X(G"((((((((((((((((((((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))&&(Idles>=1)))||(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))&&(Idles>=1)))||(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))&&(Idles>=1)))" U X"((((((((((((Assigned_0_0>=1)||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))||(Assigned_3_0>=1))||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
35 unique states visited
19 strongly connected components in search stack
35 transitions explored
33 items max in DFS search stack
562 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.6414,192264,1,0,212,982269,27,62,2501,838184,513
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N06-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T4N06-04 finished in 8512 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((X(F(((X(F(p3))&&p2)||G(F(p3)))))||p1))))], workingDir=/home/mcc/execution]
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 4 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:13] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:13] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:13] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-20 04:15:13] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:13] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-20 04:15:13] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-05 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p1:(OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s73 1)), p2:(AND (LT s70 1) (LT s69 1) (LT s72 1) (LT s71 1) (LT s74 1) (LT s73 1)), p3:(AND (OR (LT s52 1) (LT s79 1)) (OR (LT s47 1) (LT s76 1)) (OR (LT s48 1) (LT s77 1)) (OR (LT s46 1) (LT s76 1)) (OR (LT s51 1) (LT s78 1)) (OR (LT s49 1) (LT s77 1)) (OR (LT s55 1) (LT s80 1)) (OR (LT s53 1) (LT s79 1)) (OR (LT s54 1) (LT s80 1)) (OR (LT s45 1) (LT s75 1)) (OR (LT s50 1) (LT s78 1)) (OR (LT s44 1) (LT s75 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 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Knowledge obtained : [p0, (NOT p1), p2, p3]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3))]
Support contains 30 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 93/93 places, 126/126 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 93 transition count 132
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 92 transition count 108
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 92 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 86 transition count 102
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 86 transition count 102
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 56 rules in 11 ms. Remains 86 /93 variables (removed 7) and now considering 102/126 (removed 24) transitions.
[2021-05-20 04:15:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 86 cols
[2021-05-20 04:15:14] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:14] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/93 places, 102/126 transitions.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
[2021-05-20 04:15:15] [INFO ] Flatten gal took : 7 ms
[2021-05-20 04:15:15] [INFO ] Flatten gal took : 7 ms
[2021-05-20 04:15:15] [INFO ] Time to serialize gal into /tmp/LTL9413640697285047479.gal : 2 ms
[2021-05-20 04:15:15] [INFO ] Time to serialize properties into /tmp/LTL11250791788107824505.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/LTL9413640697285047479.gal, -t, CGAL, -LTL, /tmp/LTL11250791788107824505.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/LTL9413640697285047479.gal -t CGAL -LTL /tmp/LTL11250791788107824505.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((((((Clients_0>=1)||(Clients_1>=1))||(Clients_2>=1))||(Clients_3>=1))||(Clients_4>=1))||(Clients_5>=1))"))||(F(("((((((ClientsWaiting_1>=1)||(ClientsWaiting_0>=1))||(ClientsWaiting_3>=1))||(ClientsWaiting_2>=1))||(ClientsWaiting_5>=1))||(ClientsWaiting_4>=1))")||(X(F((("((((((ClientsWaiting_1<1)&&(ClientsWaiting_0<1))&&(ClientsWaiting_3<1))&&(ClientsWaiting_2<1))&&(ClientsWaiting_5<1))&&(ClientsWaiting_4<1))")&&(X(F("(((((((((((((StartSecuring_4_0<1)||(ClientsTimeout_4<1))&&((StartSecuring_1_1<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_5_1<1)||(ClientsTimeout_5<1)))&&((StartSecuring_4_1<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_0<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))"))))||(G(F("(((((((((((((StartSecuring_4_0<1)||(ClientsTimeout_4<1))&&((StartSecuring_1_1<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_5_1<1)||(ClientsTimeout_5<1)))&&((StartSecuring_4_1<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_0<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))"))))))))))
Formula 0 simplified : !(G"((((((Clients_0>=1)||(Clients_1>=1))||(Clients_2>=1))||(Clients_3>=1))||(Clients_4>=1))||(Clients_5>=1))" | F("((((((ClientsWaiting_1>=1)||(ClientsWaiting_0>=1))||(ClientsWaiting_3>=1))||(ClientsWaiting_2>=1))||(ClientsWaiting_5>=1))||(ClientsWaiting_4>=1))" | XF(("((((((ClientsWaiting_1<1)&&(ClientsWaiting_0<1))&&(ClientsWaiting_3<1))&&(ClientsWaiting_2<1))&&(ClientsWaiting_5<1))&&(ClientsWaiting_4<1))" & XF"(((((((((((((StartSecuring_4_0<1)||(ClientsTimeout_4<1))&&((StartSecuring_1_1<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_5_1<1)||(ClientsTimeout_5<1)))&&((StartSecuring_4_1<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_0<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<1)))") | GF"(((((((((((((StartSecuring_4_0<1)||(ClientsTimeout_4<1))&&((StartSecuring_1_1<1)||(ClientsTimeout_1<1)))&&((StartSecuring_2_0<1)||(ClientsTimeout_2<1)))&&((StartSecuring_1_0<1)||(ClientsTimeout_1<1)))&&((StartSecuring_3_1<1)||(ClientsTimeout_3<1)))&&((StartSecuring_2_1<1)||(ClientsTimeout_2<1)))&&((StartSecuring_5_1<1)||(ClientsTimeout_5<1)))&&((StartSecuring_4_1<1)||(ClientsTimeout_4<1)))&&((StartSecuring_5_0<1)||(ClientsTimeout_5<1)))&&((StartSecuring_0_1<1)||(ClientsTimeout_0<1)))&&((StartSecuring_3_0<1)||(ClientsTimeout_3<1)))&&((StartSecuring_0_0<1)||(ClientsTimeout_0<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
122 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.23872,56352,1,0,6,262779,36,0,2404,36095,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N06-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T4N06-05 finished in 3373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G((F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 68 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 62 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 56 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 56 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 50 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 50 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 128 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 44 transition count 42
Applied a total of 140 rules in 13 ms. Remains 44 /105 variables (removed 61) and now considering 42/138 (removed 96) transitions.
// Phase 1: matrix 42 rows 44 cols
[2021-05-20 04:15:16] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:16] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 42 rows 44 cols
[2021-05-20 04:15:16] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-20 04:15:16] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-05-20 04:15:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 44 cols
[2021-05-20 04:15:16] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:16] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/105 places, 42/138 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s25 1) (GEQ s24 1) (GEQ s21 1) (GEQ s20 1) (GEQ s23 1) (GEQ s22 1)), p1:(AND (LT s27 1) (LT s26 1) (LT s29 1) (LT s28 1) (LT s31 1) (LT s30 1)), p2:(OR (GEQ s27 1) (GEQ s26 1) (GEQ s29 1) (GEQ s28 1) (GEQ s31 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-06 finished in 227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2021-05-20 04:15:16] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:15:16] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2021-05-20 04:15:16] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-20 04:15:16] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2021-05-20 04:15:16] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:16] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1) (LT s49 1) (LT s48 1) (LT s51 1) (LT s50 1) (LT s53 1) (LT s52 1) (LT s55 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 24 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 150
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 105 transition count 150
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 36 place count 105 transition count 156
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 36 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 156/138 (removed -18) transitions.
[2021-05-20 04:15:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 156 rows 105 cols
[2021-05-20 04:15:17] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:15:17] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 156/138 transitions.
Product exploration explored 100000 steps with 33333 reset in 466 ms.
Product exploration explored 100000 steps with 33333 reset in 472 ms.
[2021-05-20 04:15:18] [INFO ] Flatten gal took : 7 ms
[2021-05-20 04:15:18] [INFO ] Flatten gal took : 8 ms
[2021-05-20 04:15:18] [INFO ] Time to serialize gal into /tmp/LTL3305441918299502809.gal : 2 ms
[2021-05-20 04:15:18] [INFO ] Time to serialize properties into /tmp/LTL12001799289012570093.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3305441918299502809.gal, -t, CGAL, -LTL, /tmp/LTL12001799289012570093.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/LTL3305441918299502809.gal -t CGAL -LTL /tmp/LTL12001799289012570093.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((((((((((((((((((((((((MovetoZ_0_0_0<1)&&(MovetoZ_0_0_1<1))&&(MovetoZ_0_1_0<1))&&(MovetoZ_0_1_1<1))&&(MovetoZ_1_0_0<1))&&(MovetoZ_1_0_1<1))&&(MovetoZ_1_1_1<1))&&(MovetoZ_1_1_0<1))&&(MovetoZ_2_0_1<1))&&(MovetoZ_2_0_0<1))&&(MovetoZ_2_1_1<1))&&(MovetoZ_2_1_0<1))&&(MovetoZ_3_0_1<1))&&(MovetoZ_3_0_0<1))&&(MovetoZ_3_1_1<1))&&(MovetoZ_3_1_0<1))&&(MovetoZ_4_0_1<1))&&(MovetoZ_4_0_0<1))&&(MovetoZ_4_1_1<1))&&(MovetoZ_4_1_0<1))&&(MovetoZ_5_0_1<1))&&(MovetoZ_5_0_0<1))&&(MovetoZ_5_1_1<1))&&(MovetoZ_5_1_0<1))")))))
Formula 0 simplified : !XXF"((((((((((((((((((((((((MovetoZ_0_0_0<1)&&(MovetoZ_0_0_1<1))&&(MovetoZ_0_1_0<1))&&(MovetoZ_0_1_1<1))&&(MovetoZ_1_0_0<1))&&(MovetoZ_1_0_1<1))&&(MovetoZ_1_1_1<1))&&(MovetoZ_1_1_0<1))&&(MovetoZ_2_0_1<1))&&(MovetoZ_2_0_0<1))&&(MovetoZ_2_1_1<1))&&(MovetoZ_2_1_0<1))&&(MovetoZ_3_0_1<1))&&(MovetoZ_3_0_0<1))&&(MovetoZ_3_1_1<1))&&(MovetoZ_3_1_0<1))&&(MovetoZ_4_0_1<1))&&(MovetoZ_4_0_0<1))&&(MovetoZ_4_1_1<1))&&(MovetoZ_4_1_0<1))&&(MovetoZ_5_0_1<1))&&(MovetoZ_5_0_0<1))&&(MovetoZ_5_1_1<1))&&(MovetoZ_5_1_0<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
138 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.40422,68936,1,0,7,348911,20,0,2652,47412,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N06-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T4N06-07 finished in 3699 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p0))||(p1 U X(p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 94 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 94 transition count 127
Applied a total of 22 rules in 4 ms. Remains 94 /105 variables (removed 11) and now considering 127/138 (removed 11) transitions.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 04:15:21] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:22] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 04:15:22] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-20 04:15:22] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 04:15:22] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-20 04:15:22] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/105 places, 127/138 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s16 1) (GEQ s63 1)), p1:(GEQ s41 1), p0:(LT s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Knowledge obtained : [(NOT p2), (NOT p1), p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 94/94 places, 127/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 94 transition count 126
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 94 transition count 137
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 13 place count 94 transition count 137
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 34 place count 94 transition count 142
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 44 place count 94 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 94 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 45 rules in 12 ms. Remains 94 /94 variables (removed 0) and now considering 132/127 (removed -5) transitions.
[2021-05-20 04:15:23] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 132 rows 94 cols
[2021-05-20 04:15:23] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:23] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 132/127 transitions.
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Product exploration explored 100000 steps with 50000 reset in 503 ms.
[2021-05-20 04:15:24] [INFO ] Flatten gal took : 7 ms
[2021-05-20 04:15:24] [INFO ] Flatten gal took : 7 ms
[2021-05-20 04:15:24] [INFO ] Time to serialize gal into /tmp/LTL14789462174008118234.gal : 1 ms
[2021-05-20 04:15:24] [INFO ] Time to serialize properties into /tmp/LTL2370648209985666759.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/LTL14789462174008118234.gal, -t, CGAL, -LTL, /tmp/LTL2370648209985666759.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/LTL14789462174008118234.gal -t CGAL -LTL /tmp/LTL2370648209985666759.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((X(F("(Assigned_3_0<1)")))||(("(MovetoZ_4_0_1>=1)")U(X("(MovetoZ_4_0_1>=1)"))))||(G("(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))")))))
Formula 0 simplified : !F(XF"(Assigned_3_0<1)" | ("(MovetoZ_4_0_1>=1)" U X"(MovetoZ_4_0_1>=1)") | G"(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=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
131 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.32818,58980,1,0,6,283447,36,0,2387,39485,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N06-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z2T4N06-08 finished in 5354 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(F(p0) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 116
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 55 place count 83 transition count 105
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 55 place count 83 transition count 95
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 75 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 72 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 72 transition count 94
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 125 place count 48 transition count 70
Applied a total of 125 rules in 10 ms. Remains 48 /105 variables (removed 57) and now considering 70/138 (removed 68) transitions.
// Phase 1: matrix 70 rows 48 cols
[2021-05-20 04:15:25] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:25] [INFO ] Implicit Places using invariants in 29 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
[2021-05-20 04:15:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 47 cols
[2021-05-20 04:15:25] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-20 04:15:25] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 47/105 places, 70/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2021-05-20 04:15:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 47 cols
[2021-05-20 04:15:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-20 04:15:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/105 places, 70/138 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s29 1), p1:(AND (GEQ s33 1) (GEQ s43 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 2221 reset in 179 ms.
Stack based approach found an accepted trace after 47 steps with 1 reset with depth 27 and stack size 27 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-09 finished in 423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G((p1||(G(p2)&&F(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 2 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:26] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s66 1), p1:(GEQ s63 1), p0:(LT s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-10 finished in 300 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 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 2 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:26] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s30 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 1121 reset in 159 ms.
Stack based approach found an accepted trace after 17486 steps with 190 reset with depth 86 and stack size 86 in 51 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-11 finished in 437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 104 place count 59 transition count 80
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 2 with 2 rules applied. Total rules applied 106 place count 58 transition count 79
Applied a total of 106 rules in 8 ms. Remains 58 /105 variables (removed 47) and now considering 79/138 (removed 59) transitions.
// Phase 1: matrix 79 rows 58 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:26] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 79 rows 58 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:26] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-20 04:15:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 79 rows 58 cols
[2021-05-20 04:15:26] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/105 places, 79/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s32 1), p0:(OR (GEQ s6 1) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s33 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9870 reset in 196 ms.
Stack based approach found an accepted trace after 2157 steps with 220 reset with depth 10 and stack size 10 in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-12 finished in 388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 105 transition count 115
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 58 place count 82 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 82 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 70 transition count 91
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 104 place count 59 transition count 80
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 2 with 2 rules applied. Total rules applied 106 place count 58 transition count 79
Applied a total of 106 rules in 8 ms. Remains 58 /105 variables (removed 47) and now considering 79/138 (removed 59) transitions.
// Phase 1: matrix 79 rows 58 cols
[2021-05-20 04:15:27] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:27] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 79 rows 58 cols
[2021-05-20 04:15:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:27] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2021-05-20 04:15:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 79 rows 58 cols
[2021-05-20 04:15:27] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-20 04:15:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/105 places, 79/138 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s8 1) (LT s33 1)), p0:(GEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 559 reset in 185 ms.
Stack based approach found an accepted trace after 7439 steps with 39 reset with depth 397 and stack size 396 in 14 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-13 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||G(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 94 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 94 transition count 127
Applied a total of 22 rules in 2 ms. Remains 94 /105 variables (removed 11) and now considering 127/138 (removed 11) transitions.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 04:15:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:27] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 04:15:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-20 04:15:27] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 94 cols
[2021-05-20 04:15:27] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-20 04:15:27] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/105 places, 127/138 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s35 1), p0:(AND (GEQ s1 1) (GEQ s17 1) (GEQ s63 1)), p1:(OR (LT s0 1) (LT s9 1) (LT s63 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 116 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-15 finished in 253 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621484136221

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

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