fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701122800068
Last Updated
July 7, 2024

About the Execution of 2023-gold for UtilityControlRoom-COL-Z4T4N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
875.207 35845.00 74106.00 694.80 TTFTFTTFTFTFFFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 11K Apr 13 05:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 05:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 05:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 05:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 05:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 05:48 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-Z4T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717173426377

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-Z4T4N02
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 16:37:09] [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:37:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:37:09] [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:37:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 16:37:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 726 ms
[2024-05-31 16:37:09] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 80 PT places and 150.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 111 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 16:37:10] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-31 16:37:10] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 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 300 steps, including 0 resets, run visited all 10 properties in 37 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-31 16:37:10] [INFO ] Flatten gal took : 22 ms
[2024-05-31 16:37:10] [INFO ] Flatten gal took : 5 ms
Domain [Cli(2), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
[2024-05-31 16:37:10] [INFO ] Unfolded HLPN to a Petri net with 80 places and 150 transitions 482 arcs in 19 ms.
[2024-05-31 16:37:10] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2024-05-31 16:37:10] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 16:37:10] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 71 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-05-31 16:37:10] [INFO ] Computed 7 invariants in 21 ms
[2024-05-31 16:37:10] [INFO ] Implicit Places using invariants in 230 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 256 ms. Remains : 79/80 places, 118/118 transitions.
Support contains 71 out of 79 places after structural reductions.
[2024-05-31 16:37:10] [INFO ] Flatten gal took : 30 ms
[2024-05-31 16:37:10] [INFO ] Flatten gal took : 23 ms
[2024-05-31 16:37:10] [INFO ] Input system was already deterministic with 118 transitions.
Finished random walk after 73 steps, including 0 resets, run visited all 13 properties in 8 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((G(p1)||p0))||F(p2)))))'
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-05-31 16:37:11] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 16:37:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 16:37:11] [INFO ] Invariant cache hit.
[2024-05-31 16:37:11] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-31 16:37:11] [INFO ] Invariant cache hit.
[2024-05-31 16:37:11] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 79/79 places, 118/118 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 334 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (LT s22 1) (LT s23 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1) (LT s32 1) (LT s33 1) (LT s34 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][false, false, false, false]]
Product exploration explored 100000 steps with 7068 reset in 681 ms.
Product exploration explored 100000 steps with 6902 reset in 572 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 116
Applied a total of 4 rules in 19 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-05-31 16:37:14] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 16:37:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 16:37:14] [INFO ] Invariant cache hit.
[2024-05-31 16:37:14] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-31 16:37:14] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 16:37:14] [INFO ] Invariant cache hit.
[2024-05-31 16:37:14] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/79 places, 116/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 77/79 places, 116/118 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 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 424 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 481 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 7911 reset in 505 ms.
Product exploration explored 100000 steps with 7850 reset in 477 ms.
Built C files in :
/tmp/ltsmin6805472137504383161
[2024-05-31 16:37:17] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-31 16:37:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:37:17] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-31 16:37:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:37:17] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-31 16:37:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:37:17] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6805472137504383161
Running compilation step : cd /tmp/ltsmin6805472137504383161;'/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 550 ms.
Running link step : cd /tmp/ltsmin6805472137504383161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6805472137504383161;'/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/stateBased310468188495661167.hoa' '--buchi-type=spotba'
LTSmin run took 3810 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 finished in 10502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(!p1))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-31 16:37:21] [INFO ] Computed 6 invariants in 2 ms
[2024-05-31 16:37:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 16:37:21] [INFO ] Invariant cache hit.
[2024-05-31 16:37:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-31 16:37:21] [INFO ] Invariant cache hit.
[2024-05-31 16:37:22] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s4 1) (LT s5 1)), p1:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((X(G(!p2))||p1)))))'
Support contains 33 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-31 16:37:22] [INFO ] Invariant cache hit.
[2024-05-31 16:37:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 16:37:22] [INFO ] Invariant cache hit.
[2024-05-31 16:37:22] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-31 16:37:22] [INFO ] Invariant cache hit.
[2024-05-31 16:37:22] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2, true, (AND p2 (NOT p0)), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=6 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=2, aps=[p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s14 1) (GEQ s15 1) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s40 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-31 16:37:22] [INFO ] Invariant cache hit.
[2024-05-31 16:37:22] [INFO ] Implicit Places using invariants in 94 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19217 reset in 126 ms.
Product exploration explored 100000 steps with 19518 reset in 195 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 p0)), (X (X (NOT 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 128 ms :[p0, p0, 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 p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 139 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 111 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2024-05-31 16:37:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 16:37:24] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 16:37:24] [INFO ] Invariant cache hit.
[2024-05-31 16:37:24] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-31 16:37:24] [INFO ] Invariant cache hit.
[2024-05-31 16:37:24] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 54/54 places, 94/94 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 p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 120 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 109 ms :[p0, p0, 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 p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 144 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 106 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 19518 reset in 174 ms.
Product exploration explored 100000 steps with 19180 reset in 151 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 54 transition count 102
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 102
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 26 place count 54 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 51 transition count 76
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 51 transition count 76
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 58 place count 33 transition count 46
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 33 transition count 46
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 21 transition count 34
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 21 transition count 34
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 21 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 112 rules in 18 ms. Remains 21 /54 variables (removed 33) and now considering 22/94 (removed 72) transitions.
[2024-05-31 16:37:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2024-05-31 16:37:25] [INFO ] Computed 5 invariants in 0 ms
[2024-05-31 16:37:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/54 places, 22/94 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 21/54 places, 22/94 transitions.
Built C files in :
/tmp/ltsmin6452076546521370006
[2024-05-31 16:37:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6452076546521370006
Running compilation step : cd /tmp/ltsmin6452076546521370006;'/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 244 ms.
Running link step : cd /tmp/ltsmin6452076546521370006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6452076546521370006;'/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/stateBased17134870285871298660.hoa' '--buchi-type=spotba'
LTSmin run took 1127 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 finished in 4404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p1)||p0)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-31 16:37:27] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 16:37:27] [INFO ] Implicit Places using invariants in 69 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s43 1) (GEQ s42 1)), p1:(AND (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 finished in 450 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 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 13 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2024-05-31 16:37:27] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 16:37:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 16:37:27] [INFO ] Invariant cache hit.
[2024-05-31 16:37:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-31 16:37:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:37:27] [INFO ] Invariant cache hit.
[2024-05-31 16:37:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s11 1...], 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 469 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 24 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 18 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 18 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 18 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 13 transition count 12
Applied a total of 145 rules in 15 ms. Remains 13 /79 variables (removed 66) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-31 16:37:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 16:37:28] [INFO ] Implicit Places using invariants in 35 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/79 places, 12/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 10
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-31 16:37:28] [INFO ] Computed 4 invariants in 0 ms
[2024-05-31 16:37:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 16:37:28] [INFO ] Invariant cache hit.
[2024-05-31 16:37:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/79 places, 10/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 10/79 places, 10/118 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s5 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(!p1))))))'
Support contains 18 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-31 16:37:28] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 16:37:28] [INFO ] Implicit Places using invariants in 75 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s20 1) (LT s21 1) (LT s14 1) (LT s15 1)), p1:(OR (AND (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s36 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1)&&X(G(p2))))))'
Support contains 57 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-05-31 16:37:29] [INFO ] Computed 6 invariants in 2 ms
[2024-05-31 16:37:29] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 16:37:29] [INFO ] Invariant cache hit.
[2024-05-31 16:37:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-31 16:37:29] [INFO ] Invariant cache hit.
[2024-05-31 16:37:29] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s64 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s64 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s13 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 29387 reset in 409 ms.
Product exploration explored 100000 steps with 29339 reset in 430 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p0)]
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-31 16:37:30] [INFO ] Invariant cache hit.
[2024-05-31 16:37:31] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 16:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:31] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 16:37:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:37:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 16:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:31] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-31 16:37:31] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 16:37:31] [INFO ] Added : 59 causal constraints over 12 iterations in 180 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 13 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 17 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-31 16:37:31] [INFO ] Invariant cache hit.
[2024-05-31 16:37:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 16:37:31] [INFO ] Invariant cache hit.
[2024-05-31 16:37:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-31 16:37:31] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 16:37:31] [INFO ] Invariant cache hit.
[2024-05-31 16:37:31] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 79/79 places, 118/118 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-31 16:37:32] [INFO ] Invariant cache hit.
[2024-05-31 16:37:32] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 16:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:32] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 16:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:37:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 16:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:32] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-31 16:37:32] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 16:37:32] [INFO ] Added : 59 causal constraints over 12 iterations in 150 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29335 reset in 344 ms.
Product exploration explored 100000 steps with 29332 reset in 351 ms.
Built C files in :
/tmp/ltsmin5012007366813345521
[2024-05-31 16:37:33] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2024-05-31 16:37:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:37:33] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2024-05-31 16:37:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:37:33] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2024-05-31 16:37:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:37:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5012007366813345521
Running compilation step : cd /tmp/ltsmin5012007366813345521;'/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 373 ms.
Running link step : cd /tmp/ltsmin5012007366813345521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5012007366813345521;'/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/stateBased13505618887275306622.hoa' '--buchi-type=spotba'
LTSmin run took 181 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 finished in 5272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (p1&&X(G(!p0))))))'
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-31 16:37:34] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 16:37:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 16:37:34] [INFO ] Invariant cache hit.
[2024-05-31 16:37:34] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-31 16:37:34] [INFO ] Invariant cache hit.
[2024-05-31 16:37:34] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s11 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, 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 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 finished in 351 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)) U G(p1))))'
Support contains 10 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 5 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-31 16:37:34] [INFO ] Invariant cache hit.
[2024-05-31 16:37:34] [INFO ] Implicit Places using invariants in 64 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s43 1) (GEQ s42 1)), p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s20 1) (LT s21 1) (LT s14 1) (LT s15 1))], 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 9074 reset in 194 ms.
Stack based approach found an accepted trace after 3524 steps with 307 reset with depth 21 and stack size 21 in 9 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p1)||p0)))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-31 16:37:35] [INFO ] Invariant cache hit.
[2024-05-31 16:37:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 16:37:35] [INFO ] Invariant cache hit.
[2024-05-31 16:37:35] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 16:37:35] [INFO ] Invariant cache hit.
[2024-05-31 16:37:35] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s0 1) (GEQ s13 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7234 reset in 216 ms.
Product exploration explored 100000 steps with 7235 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-31 16:37:36] [INFO ] Invariant cache hit.
[2024-05-31 16:37:37] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 16:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:37] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 16:37:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:37:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 16:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:37] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 16:37:37] [INFO ] Computed and/alt/rep : 92/154/92 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 16:37:37] [INFO ] Added : 47 causal constraints over 10 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-31 16:37:37] [INFO ] Invariant cache hit.
[2024-05-31 16:37:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 16:37:37] [INFO ] Invariant cache hit.
[2024-05-31 16:37:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-31 16:37:37] [INFO ] Invariant cache hit.
[2024-05-31 16:37:37] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 55/55 places, 94/94 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-31 16:37:38] [INFO ] Invariant cache hit.
[2024-05-31 16:37:38] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 16:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:38] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 16:37:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:37:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 16:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:37:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-31 16:37:38] [INFO ] Computed and/alt/rep : 92/154/92 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 16:37:38] [INFO ] Added : 47 causal constraints over 10 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7243 reset in 178 ms.
Product exploration explored 100000 steps with 7215 reset in 193 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 55 transition count 102
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 55 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 55 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 24 rules in 9 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-31 16:37:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2024-05-31 16:37:39] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 16:37:39] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/55 places, 94/94 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 55/55 places, 94/94 transitions.
Built C files in :
/tmp/ltsmin5856330351443925817
[2024-05-31 16:37:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5856330351443925817
Running compilation step : cd /tmp/ltsmin5856330351443925817;'/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 289 ms.
Running link step : cd /tmp/ltsmin5856330351443925817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5856330351443925817;'/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/stateBased7089233502631522299.hoa' '--buchi-type=spotba'
LTSmin run took 985 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 finished in 5884 ms.
All properties solved by simple procedures.
Total runtime 32046 ms.

BK_STOP 1717173462222

--------------------
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-Z4T4N02"
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-Z4T4N02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r461-smll-171701122800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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