Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307352800020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-COL-Z2T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352800020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.9K Apr 29 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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-COL-Z2T3N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653116203388

Running Version 202205111006
[2022-05-21 06:56:45] [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]
[2022-05-21 06:56:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:56:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 06:56:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 06:56:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1472 ms
[2022-05-21 06:56:47] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 106 PT places and 162.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 06:56:47] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 11 ms.
[2022-05-21 06:56:47] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 122 steps, including 0 resets, run visited all 15 properties in 42 ms. (steps per millisecond=2 )
[2022-05-21 06:56:47] [INFO ] Flatten gal took : 37 ms
[2022-05-21 06:56:47] [INFO ] Flatten gal took : 8 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 06:56:48] [INFO ] Unfolded HLPN to a Petri net with 106 places and 162 transitions 510 arcs in 31 ms.
[2022-05-21 06:56:48] [INFO ] Unfolded 15 HLPN properties in 0 ms.
[2022-05-21 06:56:48] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 06:56:48] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 06:56:48] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 06:56:48] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 06:56:48] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Support contains 93 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 15 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2022-05-21 06:56:48] [INFO ] Computed 15 place invariants in 33 ms
[2022-05-21 06:56:48] [INFO ] Implicit Places using invariants in 340 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 409 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/106 places, 138/138 transitions.
Support contains 93 out of 105 places after structural reductions.
[2022-05-21 06:56:48] [INFO ] Flatten gal took : 43 ms
[2022-05-21 06:56:48] [INFO ] Flatten gal took : 49 ms
[2022-05-21 06:56:48] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 575 steps, including 0 resets, run visited all 17 properties in 27 ms. (steps per millisecond=21 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((F(p1)||X(p0)||p2))))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 15 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:49] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-21 06:56:49] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:49] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-21 06:56:49] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:49] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 06:56:49] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (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, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20251 reset in 484 ms.
Product exploration explored 100000 steps with 20548 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:56:52] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-21 06:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:56:52] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-21 06:56:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:56:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 06:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:56:52] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-21 06:56:52] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-21 06:56:52] [INFO ] Added : 66 causal constraints over 14 iterations in 316 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1) (NOT p0))
Support contains 24 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:52] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 06:56:53] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:53] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 06:56:53] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:53] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 06:56:53] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:56:54] [INFO ] Computed 14 place invariants in 16 ms
[2022-05-21 06:56:54] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-21 06:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:56:54] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-21 06:56:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:56:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-21 06:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:56:54] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-21 06:56:54] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-21 06:56:55] [INFO ] Added : 66 causal constraints over 14 iterations in 279 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 20175 reset in 383 ms.
Product exploration explored 100000 steps with 20726 reset in 389 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 24 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 93 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 92 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 92 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 86 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 80 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 80 transition count 84
Applied a total of 38 rules in 39 ms. Remains 80 /93 variables (removed 13) and now considering 84/126 (removed 42) transitions.
[2022-05-21 06:56:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 80 cols
[2022-05-21 06:56:56] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 06:56:56] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/93 places, 84/126 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/93 places, 84/126 transitions.
Product exploration explored 100000 steps with 19834 reset in 794 ms.
Product exploration explored 100000 steps with 20161 reset in 465 ms.
Built C files in :
/tmp/ltsmin5602145096975440147
[2022-05-21 06:56:58] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5602145096975440147
Running compilation step : cd /tmp/ltsmin5602145096975440147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 555 ms.
Running link step : cd /tmp/ltsmin5602145096975440147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5602145096975440147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased328510452087057109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:57:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:57:13] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:57:13] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:13] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:57:13] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:13] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Built C files in :
/tmp/ltsmin8252019533437461744
[2022-05-21 06:57:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8252019533437461744
Running compilation step : cd /tmp/ltsmin8252019533437461744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 353 ms.
Running link step : cd /tmp/ltsmin8252019533437461744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8252019533437461744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5607338873718258443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 06:57:28] [INFO ] Flatten gal took : 14 ms
[2022-05-21 06:57:28] [INFO ] Flatten gal took : 12 ms
[2022-05-21 06:57:28] [INFO ] Time to serialize gal into /tmp/LTL1206681002782741235.gal : 4 ms
[2022-05-21 06:57:28] [INFO ] Time to serialize properties into /tmp/LTL5285135065793115952.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1206681002782741235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5285135065793115952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1206681...266
Read 1 LTL properties
Checking formula 0 : !(((X("((((ControlRoomDispatch_1>=1)||(ControlRoomDispatch_0>=1))||((ControlRoomDispatch_3>=1)||(ControlRoomDispatch_2>=1)))||((Contro...865
Formula 0 simplified : !(X"((((ControlRoomDispatch_1>=1)||(ControlRoomDispatch_0>=1))||((ControlRoomDispatch_3>=1)||(ControlRoomDispatch_2>=1)))||((Control...851
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
172 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.76358,70064,1,0,85,298294,34,11,2525,204650,191
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 finished in 41421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(F(p1))||p0)))))'
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 19 ms. Remains 87 /105 variables (removed 18) and now considering 120/138 (removed 18) transitions.
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:30] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:30] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:30] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:57:30] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-05-21 06:57:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:31] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:31] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/105 places, 120/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/105 places, 120/138 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), 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) (AN...], 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 10799 reset in 754 ms.
Product exploration explored 100000 steps with 10761 reset in 421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:33] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:57:33] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-21 06:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:57:33] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-21 06:57:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:57:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 06:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:57:34] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-05-21 06:57:34] [INFO ] Computed and/alt/rep : 102/156/102 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-21 06:57:34] [INFO ] Added : 85 causal constraints over 20 iterations in 375 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 27 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 120/120 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:34] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:34] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-21 06:57:34] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2022-05-21 06:57:34] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:57:34] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:36] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-05-21 06:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:57:36] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-21 06:57:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:57:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 06:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:57:36] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-05-21 06:57:36] [INFO ] Computed and/alt/rep : 102/156/102 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-21 06:57:37] [INFO ] Added : 85 causal constraints over 20 iterations in 377 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10843 reset in 565 ms.
Product exploration explored 100000 steps with 10725 reset in 390 ms.
Built C files in :
/tmp/ltsmin18145182396554817402
[2022-05-21 06:57:38] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2022-05-21 06:57:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 06:57:38] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2022-05-21 06:57:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 06:57:38] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2022-05-21 06:57:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 06:57:38] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18145182396554817402
Running compilation step : cd /tmp/ltsmin18145182396554817402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin18145182396554817402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18145182396554817402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3172281011320566780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 27 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 120/120 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:53] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:53] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-05-21 06:57:53] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 120 rows 87 cols
[2022-05-21 06:57:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:57:53] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin18439678822928745141
[2022-05-21 06:57:53] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2022-05-21 06:57:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 06:57:53] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2022-05-21 06:57:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 06:57:53] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2022-05-21 06:57:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 06:57:53] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18439678822928745141
Running compilation step : cd /tmp/ltsmin18439678822928745141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 526 ms.
Running link step : cd /tmp/ltsmin18439678822928745141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18439678822928745141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1954644048138160010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 06:58:08] [INFO ] Flatten gal took : 18 ms
[2022-05-21 06:58:08] [INFO ] Flatten gal took : 16 ms
[2022-05-21 06:58:08] [INFO ] Time to serialize gal into /tmp/LTL15765097068011640984.gal : 5 ms
[2022-05-21 06:58:08] [INFO ] Time to serialize properties into /tmp/LTL7555162476199305434.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15765097068011640984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7555162476199305434.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1576509...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G((((((G(F("(((((((IdleTechs_0>=1)&&(OpenRequests_2>=1))&&(Idles_0>=1))||(((IdleTechs_1>=1)&&(OpenRequests_9>=1))&&(Idles_0>=1)...1709
Formula 0 simplified : !GFG("(((((((IdleTechs_0>=1)&&(OpenRequests_6>=1))&&(Idles_0>=1))||(((IdleTechs_0>=1)&&(OpenRequests_4>=1))&&(Idles_0>=1)))||((((Idl...1684
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
102 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.08012,42040,1,0,14,135473,62,5,2486,94245,39
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 finished in 39304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 126
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 72 place count 69 transition count 102
Applied a total of 72 rules in 15 ms. Remains 69 /105 variables (removed 36) and now considering 102/138 (removed 36) transitions.
// Phase 1: matrix 102 rows 69 cols
[2022-05-21 06:58:10] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:10] [INFO ] Implicit Places using invariants in 96 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/105 places, 102/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/105 places, 102/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 106 in 7 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(!(p0 U (!X(p1)&&p2))))))'
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 8 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:10] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:10] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:10] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 06:58:10] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:10] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 06:58:11] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s44 1) (GEQ s69 1)) (AND (GEQ s54 1) (GEQ s74 1)) (AND (GEQ s45 1) (GEQ s69 1)) (AND (GEQ s50 1) (GEQ s72 1)) (AND (GEQ s49 1) (GEQ s71 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 501 ms.
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p1))
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 finished in 1874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 126
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 72 place count 69 transition count 102
Applied a total of 72 rules in 31 ms. Remains 69 /105 variables (removed 36) and now considering 102/138 (removed 36) transitions.
// Phase 1: matrix 102 rows 69 cols
[2022-05-21 06:58:12] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-21 06:58:12] [INFO ] Implicit Places using invariants in 117 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/105 places, 102/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/105 places, 102/138 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 302 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 56 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!F(p0) U p1)) U p2))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 06:58:12] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:13] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:13] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 06:58:13] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:13] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), true, p0, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(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) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 19 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 finished in 629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 21 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 6 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:13] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:13] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:13] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 06:58:13] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:14] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21638 reset in 504 ms.
Product exploration explored 100000 steps with 21558 reset in 479 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:15] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 06:58:16] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-21 06:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:58:16] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2022-05-21 06:58:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:58:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-21 06:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:58:16] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-21 06:58:16] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-21 06:58:16] [INFO ] Added : 102 causal constraints over 21 iterations in 308 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 15 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:16] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:16] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:16] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:17] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:17] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:17] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-21 06:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:58:17] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-21 06:58:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:58:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 06:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:58:18] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-21 06:58:18] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 06:58:18] [INFO ] Added : 102 causal constraints over 21 iterations in 360 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21638 reset in 428 ms.
Product exploration explored 100000 steps with 21587 reset in 475 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 15 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 138
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 93 transition count 138
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 138
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 93 transition count 126
Deduced a syphon composed of 24 places in 1 ms
Applied a total of 36 rules in 23 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-21 06:58:20] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:20] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:20] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 126/126 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Product exploration explored 100000 steps with 21596 reset in 491 ms.
Product exploration explored 100000 steps with 21628 reset in 664 ms.
Built C files in :
/tmp/ltsmin14782870265946281097
[2022-05-21 06:58:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14782870265946281097
Running compilation step : cd /tmp/ltsmin14782870265946281097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 344 ms.
Running link step : cd /tmp/ltsmin14782870265946281097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14782870265946281097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased469477973747768229.hoa' '--buchi-type=spotba'
LTSmin run took 595 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 finished in 8750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(G(G(p0))))&&G(F(X(p1)))))))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 72 place count 69 transition count 102
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 68 transition count 78
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 67 transition count 78
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 93 place count 61 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 99 place count 61 transition count 66
Applied a total of 99 rules in 15 ms. Remains 61 /105 variables (removed 44) and now considering 66/138 (removed 72) transitions.
// Phase 1: matrix 66 rows 61 cols
[2022-05-21 06:58:22] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-21 06:58:22] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 66 rows 61 cols
[2022-05-21 06:58:22] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-21 06:58:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-05-21 06:58:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 61 cols
[2022-05-21 06:58:22] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-21 06:58:22] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/105 places, 66/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/105 places, 66/138 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s50 1) (LT s49 1) (LT s52 1) (LT s51 1) (LT s54 1) (LT s53 1)), p1:(AND (LT s19 1) (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1) (LT ...], 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 3081 reset in 171 ms.
Stack based approach found an accepted trace after 759 steps with 22 reset with depth 53 and stack size 53 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 finished in 495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 15 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 06:58:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:22] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:22] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:23] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 06:58:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:23] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 06:58:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:23] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 06:58:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:23] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, 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...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 finished in 1284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U !X(p2))&&F(p3)))'
Support contains 60 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 06:58:24] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:24] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 06:58:24] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:24] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 06:58:24] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:24] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p3) p2), p2, (NOT p0), (NOT p3), p2, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s56 1) (GEQ s81 1)) (AND (GEQ s66 1) (GEQ s86 1)) (AND (GEQ s57 1) (GEQ s81 1)) (AND (GEQ s62 1) (GEQ s84 1)) (AND (GEQ s61 1) (GEQ s83 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 693 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3 (NOT p2)), (X (NOT p2)), (X p0), (X p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT p2))), true, (X (X p0)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 12 factoid took 194 ms. Reduced automaton from 6 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 finished in 1895 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(X(G(!p0)))))'
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 3 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:26] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:26] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:26] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:26] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:26] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 automaton TGBA Formula[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}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s73 1)), p0:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 finished in 1070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 06:58:27] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 06:58:27] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:27] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:27] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:27] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:27] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U (p0 U (!X(p1)||p2))))))'
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 3 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:28] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:28] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:28] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:28] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:28] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:28] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (NOT (OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s73 1))) (OR (GEQ s68 1) (GEQ s67 1) (GEQ s64 1) (GEQ s63 1) (GEQ s66 1)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 460 ms.
Product exploration explored 100000 steps with 25000 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 269 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 312 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 27 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:31] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:31] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:31] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:31] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:31] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:31] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 323 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 441 ms.
Product exploration explored 100000 steps with 25000 reset in 435 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 441 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 27 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 138
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 93 transition count 138
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 138
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 93 transition count 126
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 36 rules in 21 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-21 06:58:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:35] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 126/126 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Product exploration explored 100000 steps with 25000 reset in 594 ms.
Product exploration explored 100000 steps with 25000 reset in 620 ms.
Built C files in :
/tmp/ltsmin10324617228967775381
[2022-05-21 06:58:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10324617228967775381
Running compilation step : cd /tmp/ltsmin10324617228967775381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin10324617228967775381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10324617228967775381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15112636039938198847.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 finished in 8764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((!p1 U (F(!p2)||G(!p1))))&&p0))))'
Support contains 21 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 06:58:36] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:36] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:36] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 06:58:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 06:58:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 06:58:37] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (AND p2 p1), p2]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s57 1) (LT s56 1) (LT s59 1) (LT s58 1) (LT s61 1) (LT s60 1)), p2:(OR (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 finished in 629 ms.
All properties solved by simple procedures.
Total runtime 111717 ms.

BK_STOP 1653116317591

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-COL-Z2T3N06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z2T3N06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-165307352800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T3N06.tgz
mv UtilityControlRoom-COL-Z2T3N06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;