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-171701122800083.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-COL-Z4T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122800083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.3K Apr 13 05:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 05:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 06:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 13 06:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 06:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 06:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K 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-COL-Z4T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717173980735

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-COL-Z4T4N08
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 16:46:23] [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 16:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:46:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 16:46:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 16:46:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 836 ms
[2024-05-31 16:46:24] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 16:46:24] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-31 16:46:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 77 steps, including 0 resets, run visited all 9 properties in 14 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-31 16:46:24] [INFO ] Flatten gal took : 23 ms
[2024-05-31 16:46:24] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-31 16:46:24] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 40 ms.
[2024-05-31 16:46:24] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 16:46:24] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 269 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 18 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 16:46:24] [INFO ] Computed 19 invariants in 39 ms
[2024-05-31 16:46:25] [INFO ] Implicit Places using invariants in 431 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 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 6 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 460 ms. Remains : 301/302 places, 472/472 transitions.
Support contains 269 out of 301 places after structural reductions.
[2024-05-31 16:46:25] [INFO ] Flatten gal took : 78 ms
[2024-05-31 16:46:25] [INFO ] Flatten gal took : 88 ms
[2024-05-31 16:46:25] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 68 steps, including 0 resets, run visited all 17 properties in 11 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(X(F(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 38 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 16:46:26] [INFO ] Computed 18 invariants in 4 ms
[2024-05-31 16:46:26] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-31 16:46:26] [INFO ] Invariant cache hit.
[2024-05-31 16:46:27] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-31 16:46:27] [INFO ] Invariant cache hit.
[2024-05-31 16:46:27] [INFO ] Dead Transitions using invariants and state equation in 321 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 816 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 264 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(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, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23624 reset in 594 ms.
Product exploration explored 100000 steps with 23554 reset in 489 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 16:46:29] [INFO ] Invariant cache hit.
[2024-05-31 16:46:30] [INFO ] [Real]Absence check using 18 positive place invariants in 32 ms returned sat
[2024-05-31 16:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:46:30] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-31 16:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:46:31] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-31 16:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:46:31] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-05-31 16:46:31] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-31 16:46:33] [INFO ] Added : 368 causal constraints over 74 iterations in 2409 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 37 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-31 16:46:33] [INFO ] Invariant cache hit.
[2024-05-31 16:46:33] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 16:46:33] [INFO ] Invariant cache hit.
[2024-05-31 16:46:34] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-31 16:46:34] [INFO ] Invariant cache hit.
[2024-05-31 16:46:34] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 205/205 places, 376/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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 16:46:35] [INFO ] Invariant cache hit.
[2024-05-31 16:46:35] [INFO ] [Real]Absence check using 18 positive place invariants in 18 ms returned sat
[2024-05-31 16:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:46:36] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-05-31 16:46:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:46:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-31 16:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:46:36] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-05-31 16:46:36] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-31 16:46:39] [INFO ] Added : 368 causal constraints over 74 iterations in 2270 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23609 reset in 530 ms.
Product exploration explored 100000 steps with 23662 reset in 387 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 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 408
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 408
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 205 transition count 376
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 96 rules in 63 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-31 16:46:40] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 16:46:40] [INFO ] Computed 18 invariants in 5 ms
[2024-05-31 16:46:40] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 376/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 205/205 places, 376/376 transitions.
Built C files in :
/tmp/ltsmin12021691719299951757
[2024-05-31 16:46:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12021691719299951757
Running compilation step : cd /tmp/ltsmin12021691719299951757;'/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 1165 ms.
Running link step : cd /tmp/ltsmin12021691719299951757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12021691719299951757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16931414058014692643.hoa' '--buchi-type=spotba'
LTSmin run took 11382 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 finished in 27135 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) U (p1 U p2)))'
Support contains 205 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
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 16 place count 293 transition count 464
Applied a total of 16 rules in 23 ms. Remains 293 /301 variables (removed 8) and now considering 464/472 (removed 8) transitions.
// Phase 1: matrix 464 rows 293 cols
[2024-05-31 16:46:53] [INFO ] Computed 18 invariants in 9 ms
[2024-05-31 16:46:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 16:46:53] [INFO ] Invariant cache hit.
[2024-05-31 16:46:53] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-31 16:46:54] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 16:46:54] [INFO ] Invariant cache hit.
[2024-05-31 16:46:54] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/301 places, 464/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 868 ms. Remains : 293/301 places, 464/472 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s4 1) (GEQ s236 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s236 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s236 1)) (AND (GEQ s3 1) (GEQ s...], nbAcceptance=0, 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 21168 reset in 1091 ms.
Product exploration explored 100000 steps with 21230 reset in 1187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 319 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 390 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p0)]
[2024-05-31 16:46:57] [INFO ] Invariant cache hit.
[2024-05-31 16:46:58] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-31 16:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:46:59] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-05-31 16:46:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:46:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-31 16:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:00] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-31 16:47:00] [INFO ] Computed and/alt/rep : 424/640/424 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-31 16:47:03] [INFO ] Added : 424 causal constraints over 85 iterations in 2939 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 205 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 464/464 transitions.
Applied a total of 0 rules in 12 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-31 16:47:03] [INFO ] Invariant cache hit.
[2024-05-31 16:47:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 16:47:03] [INFO ] Invariant cache hit.
[2024-05-31 16:47:03] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-31 16:47:03] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 16:47:03] [INFO ] Invariant cache hit.
[2024-05-31 16:47:03] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 773 ms. Remains : 293/293 places, 464/464 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 319 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 393 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p0)]
[2024-05-31 16:47:04] [INFO ] Invariant cache hit.
[2024-05-31 16:47:05] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2024-05-31 16:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:06] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-05-31 16:47:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-31 16:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:07] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2024-05-31 16:47:07] [INFO ] Computed and/alt/rep : 424/640/424 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-31 16:47:10] [INFO ] Added : 424 causal constraints over 85 iterations in 3047 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 21124 reset in 1104 ms.
Product exploration explored 100000 steps with 21145 reset in 1141 ms.
Built C files in :
/tmp/ltsmin7673059754991933699
[2024-05-31 16:47:12] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-31 16:47:12] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:12] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-31 16:47:12] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:12] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-31 16:47:12] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:12] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7673059754991933699
Running compilation step : cd /tmp/ltsmin7673059754991933699;'/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 1619 ms.
Running link step : cd /tmp/ltsmin7673059754991933699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7673059754991933699;'/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/stateBased11064661988207423905.hoa' '--buchi-type=spotba'
LTSmin run took 3681 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 finished in 24370 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((G(p0)||(X(p0)&&G((X(p2)&&p1)))))))'
Support contains 16 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
Applied a total of 526 rules in 32 ms. Remains 66 /301 variables (removed 235) and now considering 64/472 (removed 408) transitions.
// Phase 1: matrix 64 rows 66 cols
[2024-05-31 16:47:18] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 16:47:18] [INFO ] Implicit Places using invariants in 49 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/301 places, 64/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 65/301 places, 64/472 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LT s33 1) (LT s34 1) (LT s39 1) (LT s40 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s38 1)), p0:(AND (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1) (LT ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 27102 reset in 474 ms.
Product exploration explored 100000 steps with 27088 reset in 401 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 p0 p2), (X (AND p1 (NOT p0) p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 19 factoid took 760 ms. Reduced automaton from 5 states, 30 edges and 3 AP (stutter insensitive) to 6 states, 36 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 64 rows 65 cols
[2024-05-31 16:47:21] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 16:47:21] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 (NOT p0) p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 23 factoid took 1966 ms. Reduced automaton from 6 states, 36 edges and 3 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Support contains 16 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 16:47:23] [INFO ] Invariant cache hit.
[2024-05-31 16:47:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 16:47:23] [INFO ] Invariant cache hit.
[2024-05-31 16:47:23] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-31 16:47:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 16:47:23] [INFO ] Invariant cache hit.
[2024-05-31 16:47:23] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 65/65 places, 64/64 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 p2 p0), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Finished random walk after 35 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Product exploration explored 100000 steps with 20904 reset in 274 ms.
Product exploration explored 100000 steps with 20954 reset in 299 ms.
Built C files in :
/tmp/ltsmin12733566455625247917
[2024-05-31 16:47:25] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-31 16:47:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:25] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-31 16:47:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:26] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-31 16:47:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12733566455625247917
Running compilation step : cd /tmp/ltsmin12733566455625247917;'/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 218 ms.
Running link step : cd /tmp/ltsmin12733566455625247917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12733566455625247917;'/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/stateBased8581083219842425176.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 finished in 8378 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)))'
Support contains 16 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 1 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 27 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 16:47:26] [INFO ] Computed 17 invariants in 0 ms
[2024-05-31 16:47:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 16:47:26] [INFO ] Invariant cache hit.
[2024-05-31 16:47:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-31 16:47:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 16:47:26] [INFO ] Invariant cache hit.
[2024-05-31 16:47:26] [INFO ] Dead Transitions using invariants and state equation in 51 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 206 ms. Remains : 49/301 places, 48/472 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s39 1) (LT s40 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s38 1) (LT s33 1) (LT s34 1) (OR (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 1169 steps with 0 reset with depth 1170 and stack size 1170 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 finished in 475 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((F(p0)||X(G(!p1))))&&F(G(p2)))))'
Support contains 173 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2024-05-31 16:47:26] [INFO ] Computed 18 invariants in 4 ms
[2024-05-31 16:47:26] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 16:47:26] [INFO ] Invariant cache hit.
[2024-05-31 16:47:27] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-31 16:47:27] [INFO ] Invariant cache hit.
[2024-05-31 16:47:27] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s78 1) (GEQ s147 1) (GEQ s82 1) (GEQ s151 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 931 ms.
Product exploration explored 100000 steps with 0 reset in 1031 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F p2), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
[2024-05-31 16:47:31] [INFO ] Invariant cache hit.
[2024-05-31 16:47:31] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-31 16:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:31] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-31 16:47:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:32] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 16:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:32] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-05-31 16:47:32] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-31 16:47:34] [INFO ] Added : 240 causal constraints over 48 iterations in 1553 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 173 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2024-05-31 16:47:34] [INFO ] Invariant cache hit.
[2024-05-31 16:47:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 16:47:34] [INFO ] Invariant cache hit.
[2024-05-31 16:47:34] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-31 16:47:34] [INFO ] Invariant cache hit.
[2024-05-31 16:47:34] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 301/301 places, 472/472 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p2), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
[2024-05-31 16:47:36] [INFO ] Invariant cache hit.
[2024-05-31 16:47:36] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-31 16:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:36] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-31 16:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-31 16:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:37] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-31 16:47:37] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 16:47:39] [INFO ] Added : 240 causal constraints over 48 iterations in 1551 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 937 ms.
Product exploration explored 100000 steps with 0 reset in 991 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Support contains 173 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 504
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 301 transition count 504
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 16 ms. Remains 301 /301 variables (removed 0) and now considering 504/472 (removed -32) transitions.
[2024-05-31 16:47:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 504 rows 301 cols
[2024-05-31 16:47:41] [INFO ] Computed 18 invariants in 9 ms
[2024-05-31 16:47:42] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/301 places, 504/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 301/301 places, 504/472 transitions.
Built C files in :
/tmp/ltsmin5466888494116594347
[2024-05-31 16:47:42] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5466888494116594347
Running compilation step : cd /tmp/ltsmin5466888494116594347;'/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 1262 ms.
Running link step : cd /tmp/ltsmin5466888494116594347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5466888494116594347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5549704580089961767.hoa' '--buchi-type=spotba'
LTSmin run took 246 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 finished in 16757 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((G(p1)||G(!p1)||p0))))'
Support contains 16 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 12 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 16:47:43] [INFO ] Computed 18 invariants in 5 ms
[2024-05-31 16:47:43] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 16:47:43] [INFO ] Invariant cache hit.
[2024-05-31 16:47:44] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-31 16:47:44] [INFO ] Invariant cache hit.
[2024-05-31 16:47:44] [INFO ] Dead Transitions using invariants and state equation in 350 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 864 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 74 ms :[false, false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1)), p0:(OR (GEQ s144 1) (GEQ s145 1) (GEQ s146 1) (GEQ s147 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 finished in 1635 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(G(p1))))'
Support contains 85 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 7 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 16:47:45] [INFO ] Invariant cache hit.
[2024-05-31 16:47:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 16:47:45] [INFO ] Invariant cache hit.
[2024-05-31 16:47:45] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-31 16:47:45] [INFO ] Invariant cache hit.
[2024-05-31 16:47:45] [INFO ] Dead Transitions using invariants and state equation in 307 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 554 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 finished in 701 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((X(G(p1))||p0))&&F(G(p2))))'
Support contains 45 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 7 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 16:47:45] [INFO ] Invariant cache hit.
[2024-05-31 16:47:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 16:47:46] [INFO ] Invariant cache hit.
[2024-05-31 16:47:46] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-31 16:47:46] [INFO ] Invariant cache hit.
[2024-05-31 16:47:46] [INFO ] Dead Transitions using invariants and state equation in 351 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 677 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s163 1) (GEQ s164 1) (GEQ s159 1) (GEQ s160 1) (GEQ s161 1) (GEQ s162 1) (GEQ s157 1) (GEQ s158 1)), p2:(AND (OR (LT s1 1) (LT s19 1) (LT s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1688 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 finished in 2520 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 U X(p1))&&(G(!p2)||X(G(p3))))))'
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 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 16:47:48] [INFO ] Invariant cache hit.
[2024-05-31 16:47:48] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 16:47:48] [INFO ] Invariant cache hit.
[2024-05-31 16:47:48] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-31 16:47:48] [INFO ] Invariant cache hit.
[2024-05-31 16:47:49] [INFO ] Dead Transitions using invariants and state equation in 247 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 717 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (NOT p3), (NOT p1), (AND (NOT p3) p2), true, p2]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (LT s144 1) (LT s145 1) (LT s146 1) (LT s147 1) (LT s143 1) (LT s142 1) (LT s141 1) (LT s140 1)), p2:(AND (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 1 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 finished in 1043 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)))'
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 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 16:47:49] [INFO ] Invariant cache hit.
[2024-05-31 16:47:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 16:47:49] [INFO ] Invariant cache hit.
[2024-05-31 16:47:49] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-31 16:47:49] [INFO ] Invariant cache hit.
[2024-05-31 16:47:50] [INFO ] Dead Transitions using invariants and state equation in 239 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 570 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-11 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' '!(X(G((X(F(p0))||(X(p1)&&(p1 U X(!p2)))))))'
Support contains 85 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 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 16:47:50] [INFO ] Invariant cache hit.
[2024-05-31 16:47:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 16:47:50] [INFO ] Invariant cache hit.
[2024-05-31 16:47:50] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-31 16:47:50] [INFO ] Invariant cache hit.
[2024-05-31 16:47:50] [INFO ] Dead Transitions using invariants and state equation in 338 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 610 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s137 1) (GEQ s164 1)) (AND (GEQ s122 1) (GEQ s160 1)) (AND (GEQ s112 1) (GEQ s158 1)) (AND (GEQ s117 1) (GEQ s159 1)) (AND (GEQ s113 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10016 reset in 394 ms.
Product exploration explored 100000 steps with 10061 reset in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Finished random walk after 618 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=123 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Support contains 85 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
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
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 173 transition count 312
Applied a total of 96 rules in 15 ms. Remains 173 /205 variables (removed 32) and now considering 312/376 (removed 64) transitions.
// Phase 1: matrix 312 rows 173 cols
[2024-05-31 16:47:53] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 16:47:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 16:47:53] [INFO ] Invariant cache hit.
[2024-05-31 16:47:53] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-31 16:47:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:47:53] [INFO ] Invariant cache hit.
[2024-05-31 16:47:53] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/205 places, 312/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 173/205 places, 312/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 : [(AND p0 (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Product exploration explored 100000 steps with 15879 reset in 395 ms.
Product exploration explored 100000 steps with 15968 reset in 404 ms.
Built C files in :
/tmp/ltsmin5695597437833175792
[2024-05-31 16:47:55] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-05-31 16:47:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:55] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-05-31 16:47:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:55] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-05-31 16:47:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:47:55] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5695597437833175792
Running compilation step : cd /tmp/ltsmin5695597437833175792;'/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 1183 ms.
Running link step : cd /tmp/ltsmin5695597437833175792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5695597437833175792;'/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/stateBased13283713090127483256.hoa' '--buchi-type=spotba'
LTSmin run took 1085 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 finished in 7856 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)&&(!p1 U (p2||G(!p1))))))'
Support contains 109 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 3 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 16:47:58] [INFO ] Computed 18 invariants in 4 ms
[2024-05-31 16:47:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 16:47:58] [INFO ] Invariant cache hit.
[2024-05-31 16:47:58] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-31 16:47:58] [INFO ] Invariant cache hit.
[2024-05-31 16:47:58] [INFO ] Dead Transitions using invariants and state equation in 337 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 611 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR p0 (AND p1 (NOT p2))), p0, (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s137 1) (GEQ s164 1)) (AND (GEQ s122 1) (GEQ s160 1)) (AND (GEQ s112 1) (GEQ s158 1)) (AND (GEQ s117 1) (GEQ s159 1)) (AND (GEQ s113 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 finished in 774 ms.
All properties solved by simple procedures.
Total runtime 95563 ms.

BK_STOP 1717174080011

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

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