Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r461-smll-171701122900143.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is UtilityControlRoom-PT-Z4T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122900143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 35K Apr 13 05:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 05:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 13 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 385K Apr 13 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 76K Apr 13 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 368K Apr 13 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 142K Apr 13 06:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 541K Apr 13 06:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717185012339

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 19:50:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 19:50:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:50:14] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-31 19:50:15] [INFO ] Transformed 302 places.
[2024-05-31 19:50:15] [INFO ] Transformed 600 transitions.
[2024-05-31 19:50:15] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-31 19:50:15] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 19:50:15] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 19:50:15] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 19:50:15] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 237 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 41 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-05-31 19:50:15] [INFO ] Computed 19 invariants in 27 ms
[2024-05-31 19:50:15] [INFO ] Implicit Places using invariants in 363 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 456 ms. Remains : 301/302 places, 472/472 transitions.
Support contains 237 out of 301 places after structural reductions.
[2024-05-31 19:50:16] [INFO ] Flatten gal took : 109 ms
[2024-05-31 19:50:16] [INFO ] Flatten gal took : 82 ms
[2024-05-31 19:50:16] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 472 rows 301 cols
[2024-05-31 19:50:17] [INFO ] Computed 18 invariants in 12 ms
[2024-05-31 19:50:17] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-31 19:50:17] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1 U p2))))'
Support contains 56 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 37 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 19:50:17] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 19:50:17] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 19:50:17] [INFO ] Invariant cache hit.
[2024-05-31 19:50:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-31 19:50:18] [INFO ] Invariant cache hit.
[2024-05-31 19:50:18] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 781 ms. Remains : 205/301 places, 376/472 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s149 1) (GEQ s150 1) (GEQ s155 1) (GEQ s156 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1) (AND (GEQ s108 1) (GEQ s165 1)) (AND (GEQ s...], 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 3 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-00 finished in 1221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U (p0 U p1))||F(p0)))'
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 301 transition count 440
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 269 transition count 440
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 261 transition count 432
Applied a total of 80 rules in 46 ms. Remains 261 /301 variables (removed 40) and now considering 432/472 (removed 40) transitions.
// Phase 1: matrix 432 rows 261 cols
[2024-05-31 19:50:18] [INFO ] Computed 18 invariants in 6 ms
[2024-05-31 19:50:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-31 19:50:18] [INFO ] Invariant cache hit.
[2024-05-31 19:50:19] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-31 19:50:19] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-31 19:50:19] [INFO ] Invariant cache hit.
[2024-05-31 19:50:19] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/301 places, 432/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 765 ms. Remains : 261/301 places, 432/472 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s123 1) (GEQ s184 1) (GEQ s127 1) (GEQ s188 1) (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s70 1) (GEQ s139 1) (GEQ s74 1) (GEQ s143 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 44552 reset in 1616 ms.
Product exploration explored 100000 steps with 44652 reset in 1430 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-31 19:50:23] [INFO ] Invariant cache hit.
[2024-05-31 19:50:24] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2024-05-31 19:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 19:50:24] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-31 19:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:50:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-31 19:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 19:50:26] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2024-05-31 19:50:26] [INFO ] Computed and/alt/rep : 392/736/392 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-31 19:50:28] [INFO ] Added : 268 causal constraints over 54 iterations in 1801 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 37 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 432/432 transitions.
Applied a total of 0 rules in 12 ms. Remains 261 /261 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-31 19:50:28] [INFO ] Invariant cache hit.
[2024-05-31 19:50:28] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 19:50:28] [INFO ] Invariant cache hit.
[2024-05-31 19:50:28] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-31 19:50:28] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 19:50:28] [INFO ] Invariant cache hit.
[2024-05-31 19:50:28] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 261/261 places, 432/432 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 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-31 19:50:29] [INFO ] Invariant cache hit.
[2024-05-31 19:50:30] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-31 19:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 19:50:31] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2024-05-31 19:50:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:50:32] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 19:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 19:50:32] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-05-31 19:50:32] [INFO ] Computed and/alt/rep : 392/736/392 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-31 19:50:34] [INFO ] Added : 268 causal constraints over 54 iterations in 1744 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 44637 reset in 1156 ms.
Product exploration explored 100000 steps with 44602 reset in 1243 ms.
Built C files in :
/tmp/ltsmin11580506078149310633
[2024-05-31 19:50:36] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2024-05-31 19:50:36] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 19:50:36] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2024-05-31 19:50:36] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 19:50:37] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2024-05-31 19:50:37] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 19:50:37] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11580506078149310633
Running compilation step : cd /tmp/ltsmin11580506078149310633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1625 ms.
Running link step : cd /tmp/ltsmin11580506078149310633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin11580506078149310633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6737999297116235313.hoa' '--buchi-type=spotba'
LTSmin run took 8574 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-01 finished in 28586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p1))&&p0))||G(p2)))'
Support contains 48 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 10 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 19:50:47] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 19:50:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 19:50:47] [INFO ] Invariant cache hit.
[2024-05-31 19:50:47] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-31 19:50:47] [INFO ] Invariant cache hit.
[2024-05-31 19:50:48] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 6}, { cond=(NOT p0), acceptance={0} source=4 dest: 7}], [{ cond=p0, acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s108 1) (LT s165 1)) (OR (LT s113 1) (LT s166 1)) (OR (LT s123 1) (LT s168 1)) (OR (LT s133 1) (LT s171 1)) (OR (LT s128 1) (LT s170 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1299 ms.
Product exploration explored 100000 steps with 33333 reset in 1284 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 p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 225 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-02 finished in 3836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 301 transition count 440
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 269 transition count 440
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 261 transition count 432
Applied a total of 80 rules in 24 ms. Remains 261 /301 variables (removed 40) and now considering 432/472 (removed 40) transitions.
// Phase 1: matrix 432 rows 261 cols
[2024-05-31 19:50:51] [INFO ] Computed 18 invariants in 4 ms
[2024-05-31 19:50:51] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 19:50:51] [INFO ] Invariant cache hit.
[2024-05-31 19:50:51] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-31 19:50:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 19:50:51] [INFO ] Invariant cache hit.
[2024-05-31 19:50:51] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/301 places, 432/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 740 ms. Remains : 261/301 places, 432/472 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s123 1) (GEQ s184 1) (GEQ s127 1) (GEQ s188 1) (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s70 1) (GEQ s139 1) (GEQ s74 1) (GEQ s143 1) (GEQ s...], 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 8660 reset in 1904 ms.
Stack based approach found an accepted trace after 71990 steps with 6157 reset with depth 32 and stack size 32 in 1318 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-03 finished in 4065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 37 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 8 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 19:50:55] [INFO ] Computed 18 invariants in 6 ms
[2024-05-31 19:50:55] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 19:50:55] [INFO ] Invariant cache hit.
[2024-05-31 19:50:55] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-31 19:50:55] [INFO ] Invariant cache hit.
[2024-05-31 19:50:55] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s12 1) (GEQ s148 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s148 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-PT-Z4T3N08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-04 finished in 686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(!p1)&&X(G(p2)))))'
Support contains 53 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 19:50:55] [INFO ] Invariant cache hit.
[2024-05-31 19:50:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 19:50:56] [INFO ] Invariant cache hit.
[2024-05-31 19:50:56] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-31 19:50:56] [INFO ] Invariant cache hit.
[2024-05-31 19:50:56] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (LT s163 1) (LT s164 1) (LT s159 1) (LT s160 1) (LT s161 1) (LT s162 1) (LT s157 1) (LT s158 1)), p1:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s148 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, 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-PT-Z4T3N08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-05 finished in 748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 8 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 559 place count 49 transition count 48
Applied a total of 559 rules in 36 ms. Remains 49 /301 variables (removed 252) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 49 cols
[2024-05-31 19:50:56] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 19:50:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 19:50:56] [INFO ] Invariant cache hit.
[2024-05-31 19:50:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-31 19:50:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 19:50:56] [INFO ] Invariant cache hit.
[2024-05-31 19:50:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/301 places, 48/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 49/301 places, 48/472 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1) (LT s27 1) (LT s26 1) (LT s25 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 154 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 (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-06 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 354 place count 139 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 139 transition count 216
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 372 place count 123 transition count 200
Iterating global reduction 2 with 16 rules applied. Total rules applied 388 place count 123 transition count 200
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 404 place count 107 transition count 168
Iterating global reduction 2 with 16 rules applied. Total rules applied 420 place count 107 transition count 168
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 435 place count 92 transition count 138
Iterating global reduction 2 with 15 rules applied. Total rules applied 450 place count 92 transition count 138
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 465 place count 92 transition count 123
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 491 place count 79 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 493 place count 78 transition count 109
Applied a total of 493 rules in 35 ms. Remains 78 /301 variables (removed 223) and now considering 109/472 (removed 363) transitions.
// Phase 1: matrix 109 rows 78 cols
[2024-05-31 19:50:57] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 19:50:57] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 19:50:57] [INFO ] Invariant cache hit.
[2024-05-31 19:50:57] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-31 19:50:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 19:50:57] [INFO ] Invariant cache hit.
[2024-05-31 19:50:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/301 places, 109/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 78/301 places, 109/472 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s19 1) (LT s44 1) (LT s42 1)), p0:(GEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2289 reset in 303 ms.
Product exploration explored 100000 steps with 2212 reset in 314 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1106 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=138 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-31 19:50:58] [INFO ] Invariant cache hit.
[2024-05-31 19:50:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 19:50:58] [INFO ] Invariant cache hit.
[2024-05-31 19:50:58] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 19:50:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 19:50:58] [INFO ] Invariant cache hit.
[2024-05-31 19:50:59] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 78/78 places, 109/109 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1499 steps, including 0 resets, run visited all 2 properties in 27 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2290 reset in 297 ms.
Stack based approach found an accepted trace after 99686 steps with 2210 reset with depth 60 and stack size 60 in 320 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-08 finished in 3004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X((X(p1)||p0)) U p1))))))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 9 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 19:51:00] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 19:51:00] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-31 19:51:00] [INFO ] Invariant cache hit.
[2024-05-31 19:51:00] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-31 19:51:00] [INFO ] Invariant cache hit.
[2024-05-31 19:51:01] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s6 1), p0:(OR (GEQ s6 1) (GEQ s147 1))], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-11 finished in 985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 19:51:01] [INFO ] Invariant cache hit.
[2024-05-31 19:51:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 19:51:01] [INFO ] Invariant cache hit.
[2024-05-31 19:51:01] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-31 19:51:01] [INFO ] Invariant cache hit.
[2024-05-31 19:51:01] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-12 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 (GEQ s2 1) (GEQ s12 1) (GEQ s148 1) (GEQ s0 1) (GEQ s18 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][false, false]]
Product exploration explored 100000 steps with 28 reset in 351 ms.
Product exploration explored 100000 steps with 26 reset in 393 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2398 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=171 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-31 19:51:03] [INFO ] Invariant cache hit.
[2024-05-31 19:51:03] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-31 19:51:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 19:51:03] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-31 19:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:51:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-31 19:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 19:51:04] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-31 19:51:04] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 19:51:06] [INFO ] Added : 368 causal constraints over 74 iterations in 1998 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 344
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 173 transition count 344
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 172 place count 119 transition count 290
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 204 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 118 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 118 transition count 226
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 214 place count 110 transition count 210
Iterating global reduction 1 with 8 rules applied. Total rules applied 222 place count 110 transition count 210
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 230 place count 102 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 238 place count 102 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 246 place count 102 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 250 place count 100 transition count 176
Applied a total of 250 rules in 22 ms. Remains 100 /205 variables (removed 105) and now considering 176/376 (removed 200) transitions.
// Phase 1: matrix 176 rows 100 cols
[2024-05-31 19:51:06] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 19:51:06] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 19:51:06] [INFO ] Invariant cache hit.
[2024-05-31 19:51:06] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-31 19:51:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 19:51:06] [INFO ] Invariant cache hit.
[2024-05-31 19:51:06] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/205 places, 176/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 387 ms. Remains : 100/205 places, 176/376 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 p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-31 19:51:06] [INFO ] Invariant cache hit.
[2024-05-31 19:51:06] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 19:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 19:51:07] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-31 19:51:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:51:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-31 19:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 19:51:07] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-31 19:51:07] [INFO ] Computed and/alt/rep : 150/376/150 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 19:51:07] [INFO ] Added : 73 causal constraints over 15 iterations in 243 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 145 reset in 347 ms.
Stack based approach found an accepted trace after 158 steps with 0 reset with depth 159 and stack size 159 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-12 finished in 6656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 207 transition count 378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 207 transition count 378
Applied a total of 188 rules in 5 ms. Remains 207 /301 variables (removed 94) and now considering 378/472 (removed 94) transitions.
// Phase 1: matrix 378 rows 207 cols
[2024-05-31 19:51:07] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 19:51:08] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 19:51:08] [INFO ] Invariant cache hit.
[2024-05-31 19:51:08] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-31 19:51:08] [INFO ] Invariant cache hit.
[2024-05-31 19:51:08] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/301 places, 378/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 207/301 places, 378/472 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s93 1), p1:(LT s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 59 reset in 351 ms.
Product exploration explored 100000 steps with 63 reset in 381 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :2
Finished Best-First random walk after 4928 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=547 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-31 19:51:10] [INFO ] Invariant cache hit.
[2024-05-31 19:51:10] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-13 finished in 2584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 301 transition count 345
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 286 place count 174 transition count 313
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 286 place count 174 transition count 281
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 350 place count 142 transition count 281
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 352 place count 140 transition count 217
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 140 transition count 217
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 370 place count 124 transition count 201
Iterating global reduction 2 with 16 rules applied. Total rules applied 386 place count 124 transition count 201
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 402 place count 108 transition count 169
Iterating global reduction 2 with 16 rules applied. Total rules applied 418 place count 108 transition count 169
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 433 place count 93 transition count 139
Iterating global reduction 2 with 15 rules applied. Total rules applied 448 place count 93 transition count 139
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 463 place count 93 transition count 124
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 525 place count 62 transition count 93
Applied a total of 525 rules in 32 ms. Remains 62 /301 variables (removed 239) and now considering 93/472 (removed 379) transitions.
// Phase 1: matrix 93 rows 62 cols
[2024-05-31 19:51:10] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 19:51:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 19:51:10] [INFO ] Invariant cache hit.
[2024-05-31 19:51:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-31 19:51:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 19:51:10] [INFO ] Invariant cache hit.
[2024-05-31 19:51:10] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/301 places, 93/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 62/301 places, 93/472 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-14 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:(GEQ s7 1), p1:(GEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 566 reset in 325 ms.
Stack based approach found an accepted trace after 482 steps with 4 reset with depth 39 and stack size 39 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-14 finished in 678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 66 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 58 transition count 56
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 572 place count 43 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 586 place count 36 transition count 34
Applied a total of 586 rules in 26 ms. Remains 36 /301 variables (removed 265) and now considering 34/472 (removed 438) transitions.
// Phase 1: matrix 34 rows 36 cols
[2024-05-31 19:51:11] [INFO ] Computed 18 invariants in 0 ms
[2024-05-31 19:51:11] [INFO ] Implicit Places using invariants in 48 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/301 places, 34/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 35/301 places, 34/472 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2395 reset in 196 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-15 finished in 357 ms.
All properties solved by simple procedures.
Total runtime 56783 ms.

BK_STOP 1717185072831

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is UtilityControlRoom-PT-Z4T3N08, 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 r461-smll-171701122900143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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