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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 38K Apr 13 05:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 13 05:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 13 05:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 13 05:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 129K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 110K Apr 13 05:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 507K Apr 13 05:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121K Apr 13 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 13 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 319K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717187881787

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 20:38:04] [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 20:38:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:38:04] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-05-31 20:38:04] [INFO ] Transformed 376 places.
[2024-05-31 20:38:04] [INFO ] Transformed 750 transitions.
[2024-05-31 20:38:04] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-31 20:38:04] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 335 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 125 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-05-31 20:38:05] [INFO ] Computed 23 invariants in 70 ms
[2024-05-31 20:38:06] [INFO ] Implicit Places using invariants in 666 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 759 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 9 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 909 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2024-05-31 20:38:07] [INFO ] Flatten gal took : 186 ms
[2024-05-31 20:38:07] [INFO ] Flatten gal took : 107 ms
[2024-05-31 20:38:07] [INFO ] Input system was already deterministic with 590 transitions.
Finished random walk after 706 steps, including 0 resets, run visited all 21 properties in 313 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 1 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(X(F(((G(p0) U !p1)||G(!p0)))))||F(p2)))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 35 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 20:38:09] [INFO ] Computed 22 invariants in 23 ms
[2024-05-31 20:38:09] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-31 20:38:09] [INFO ] Invariant cache hit.
[2024-05-31 20:38:09] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2024-05-31 20:38:09] [INFO ] Invariant cache hit.
[2024-05-31 20:38:10] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1401 ms. Remains : 255/375 places, 470/590 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 522 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11091 reset in 1901 ms.
Product exploration explored 100000 steps with 11264 reset in 1481 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 p2)), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 17 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 20:38:15] [INFO ] Invariant cache hit.
[2024-05-31 20:38:15] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 20:38:15] [INFO ] Invariant cache hit.
[2024-05-31 20:38:15] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-05-31 20:38:15] [INFO ] Invariant cache hit.
[2024-05-31 20:38:16] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1385 ms. Remains : 255/255 places, 470/470 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 p2) (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Product exploration explored 100000 steps with 11144 reset in 1373 ms.
Product exploration explored 100000 steps with 11128 reset in 1812 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 127 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 43 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 20:38:21] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-31 20:38:21] [INFO ] Invariant cache hit.
[2024-05-31 20:38:21] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin9417960435763732268
[2024-05-31 20:38:21] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9417960435763732268
Running compilation step : cd /tmp/ltsmin9417960435763732268;'/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 1534 ms.
Running link step : cd /tmp/ltsmin9417960435763732268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9417960435763732268;'/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/stateBased1500470667385179618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-05-31 20:38:37] [INFO ] Invariant cache hit.
[2024-05-31 20:38:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 20:38:37] [INFO ] Invariant cache hit.
[2024-05-31 20:38:37] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-31 20:38:37] [INFO ] Invariant cache hit.
[2024-05-31 20:38:38] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1058 ms. Remains : 255/255 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin14921957562730722161
[2024-05-31 20:38:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14921957562730722161
Running compilation step : cd /tmp/ltsmin14921957562730722161;'/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 1369 ms.
Running link step : cd /tmp/ltsmin14921957562730722161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14921957562730722161;'/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/stateBased769271332464002834.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 20:38:53] [INFO ] Flatten gal took : 40 ms
[2024-05-31 20:38:53] [INFO ] Flatten gal took : 49 ms
[2024-05-31 20:38:53] [INFO ] Time to serialize gal into /tmp/LTL17234178480960959198.gal : 20 ms
[2024-05-31 20:38:53] [INFO ] Time to serialize properties into /tmp/LTL7607116551969947141.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17234178480960959198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10625865564649383395.hoa' '-atoms' '/tmp/LTL7607116551969947141.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7607116551969947141.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10625865564649383395.hoa
Detected timeout of ITS tools.
[2024-05-31 20:39:08] [INFO ] Flatten gal took : 44 ms
[2024-05-31 20:39:08] [INFO ] Flatten gal took : 47 ms
[2024-05-31 20:39:08] [INFO ] Time to serialize gal into /tmp/LTL556793716426666533.gal : 24 ms
[2024-05-31 20:39:08] [INFO ] Time to serialize properties into /tmp/LTL15174452824471498249.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL556793716426666533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15174452824471498249.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((IdleTechs_2>=1)&&(OpenRequests_6_2>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)...19596
Formula 0 simplified : XXG((F!"(((((((((((IdleTechs_2>=1)&&(OpenRequests_6_2>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(...19577
Detected timeout of ITS tools.
[2024-05-31 20:39:23] [INFO ] Flatten gal took : 45 ms
[2024-05-31 20:39:23] [INFO ] Applying decomposition
[2024-05-31 20:39:24] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14103596366324300210.txt' '-o' '/tmp/graph14103596366324300210.bin' '-w' '/tmp/graph14103596366324300210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14103596366324300210.bin' '-l' '-1' '-v' '-w' '/tmp/graph14103596366324300210.weights' '-q' '0' '-e' '0.001'
[2024-05-31 20:39:24] [INFO ] Decomposing Gal with order
[2024-05-31 20:39:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 20:39:24] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-31 20:39:24] [INFO ] Flatten gal took : 271 ms
[2024-05-31 20:39:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 55 ms.
[2024-05-31 20:39:24] [INFO ] Time to serialize gal into /tmp/LTL15220148038534155706.gal : 13 ms
[2024-05-31 20:39:24] [INFO ] Time to serialize properties into /tmp/LTL18273759246675960493.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15220148038534155706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18273759246675960493.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X(F(((G("(((((((((((i7.i0.u9.IdleTechs_2>=1)&&(i0.u18.OpenRequests_6_2>=1))&&(i2.i0.u33.Idles>=1))||(((i4.u40.IdleTechs_0>=1)&&(...28572
Formula 0 simplified : XXG((F!"(((((((((((i7.i0.u9.IdleTechs_2>=1)&&(i0.u18.OpenRequests_6_2>=1))&&(i2.i0.u33.Idles>=1))||(((i4.u40.IdleTechs_0>=1)&&(i2.i0...28553
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1387 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.9828,377788,1,0,696450,727,3858,525712,138,3031,1040622
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 91159 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))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 17 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-05-31 20:39:40] [INFO ] Invariant cache hit.
[2024-05-31 20:39:40] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-31 20:39:40] [INFO ] Invariant cache hit.
[2024-05-31 20:39:41] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2024-05-31 20:39:41] [INFO ] Invariant cache hit.
[2024-05-31 20:39:41] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1579 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(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) (LT s12 1) (LT s13 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 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 finished in 1793 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(X(X(X(F(!p1))))))||G(F(!p1)))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-05-31 20:39:41] [INFO ] Computed 22 invariants in 10 ms
[2024-05-31 20:39:42] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-31 20:39:42] [INFO ] Invariant cache hit.
[2024-05-31 20:39:42] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-31 20:39:43] [INFO ] Invariant cache hit.
[2024-05-31 20:39:43] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1776 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 276 ms :[p1, p1, p1, p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s258 1) (GEQ s326 1)) (AND (GEQ s278 1) (GEQ s331 1)) (AND (GEQ s283 1) (GEQ s332 1)) (AND (GEQ s282 1) (GEQ s332 1)) (AND (GEQ s262...], 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 20000 reset in 863 ms.
Product exploration explored 100000 steps with 20000 reset in 596 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 p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, p1, p1, p1, p1]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 309 ms :[p1, p1, p1, p1, p1]
Support contains 50 out of 375 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-31 20:39:46] [INFO ] Invariant cache hit.
[2024-05-31 20:39:46] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-31 20:39:46] [INFO ] Invariant cache hit.
[2024-05-31 20:39:47] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2024-05-31 20:39:47] [INFO ] Invariant cache hit.
[2024-05-31 20:39:48] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1648 ms. Remains : 375/375 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p1, p1, p1, p1, p1]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 289 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 280 ms :[p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 20000 reset in 542 ms.
Product exploration explored 100000 steps with 20000 reset in 561 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, p1, p1]
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 590
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 200 place count 375 transition count 550
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 323 place count 252 transition count 310
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 123 rules applied. Total rules applied 446 place count 252 transition count 310
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 222 transition count 280
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 222 transition count 280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 536 place count 222 transition count 310
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 536 rules in 123 ms. Remains 222 /375 variables (removed 153) and now considering 310/590 (removed 280) transitions.
[2024-05-31 20:39:51] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2024-05-31 20:39:51] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 20:39:51] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/375 places, 310/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 773 ms. Remains : 222/375 places, 310/590 transitions.
Built C files in :
/tmp/ltsmin2989826434084713450
[2024-05-31 20:39:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2989826434084713450
Running compilation step : cd /tmp/ltsmin2989826434084713450;'/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 1368 ms.
Running link step : cd /tmp/ltsmin2989826434084713450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2989826434084713450;'/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/stateBased15444272969110550816.hoa' '--buchi-type=spotba'
LTSmin run took 2753 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 14322 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)||G(!p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 696 place count 62 transition count 60
Applied a total of 696 rules in 67 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-31 20:39:56] [INFO ] Computed 22 invariants in 0 ms
[2024-05-31 20:39:56] [INFO ] Implicit Places using invariants in 92 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/375 places, 60/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 62 ms :[false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 401 ms.
Stack based approach found an accepted trace after 1024 steps with 0 reset with depth 1025 and stack size 1024 in 7 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 finished in 653 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(X(G((X(p0) U !p1)))) U G(p2))))'
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 9 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-05-31 20:39:56] [INFO ] Computed 22 invariants in 8 ms
[2024-05-31 20:39:57] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-31 20:39:57] [INFO ] Invariant cache hit.
[2024-05-31 20:39:57] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-05-31 20:39:57] [INFO ] Invariant cache hit.
[2024-05-31 20:39:58] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s40 1) (GEQ s304 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s304 1)) (AND (GEQ s1 1) (GEQ s43 1) (GEQ s304 1)) (AND (GEQ s2 1) (GEQ ...], 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 1695 reset in 732 ms.
Product exploration explored 100000 steps with 1690 reset in 746 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) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), p1, p1]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 548 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-05-31 20:40:01] [INFO ] Invariant cache hit.
[2024-05-31 20:40:04] [INFO ] [Real]Absence check using 22 positive place invariants in 41 ms returned sat
[2024-05-31 20:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:05] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-05-31 20:40:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-05-31 20:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:07] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-31 20:40:07] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 62 ms.
[2024-05-31 20:40:12] [INFO ] Added : 356 causal constraints over 72 iterations in 4236 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:12] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:12] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:13] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1182 ms. Remains : 375/375 places, 590/590 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) p1 (NOT p0)), (X (NOT p2)), true, (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), p1, p1]
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), true, (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-05-31 20:40:14] [INFO ] Invariant cache hit.
[2024-05-31 20:40:17] [INFO ] [Real]Absence check using 22 positive place invariants in 35 ms returned sat
[2024-05-31 20:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:17] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2024-05-31 20:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 28 ms returned sat
[2024-05-31 20:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:20] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2024-05-31 20:40:20] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-31 20:40:25] [INFO ] Added : 356 causal constraints over 72 iterations in 4147 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1686 reset in 724 ms.
Product exploration explored 100000 steps with 1658 reset in 739 ms.
Built C files in :
/tmp/ltsmin15188747524620012748
[2024-05-31 20:40:26] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15188747524620012748
Running compilation step : cd /tmp/ltsmin15188747524620012748;'/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 1642 ms.
Running link step : cd /tmp/ltsmin15188747524620012748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15188747524620012748;'/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/stateBased2821412342378120504.hoa' '--buchi-type=spotba'
LTSmin run took 284 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 finished in 32010 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((G(!p1)||p0))) U p1)))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 10 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 20:40:28] [INFO ] Computed 22 invariants in 8 ms
[2024-05-31 20:40:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 20:40:29] [INFO ] Invariant cache hit.
[2024-05-31 20:40:29] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-31 20:40:29] [INFO ] Invariant cache hit.
[2024-05-31 20:40:29] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s187 1) (GEQ s188 1) (GEQ s190 1) (GEQ s189 1) (GEQ s185 1) (GEQ s186 1) (GEQ s192 1) (GEQ s191 1) (GEQ s194 1) (GEQ s193 1)), p0:(OR (AND (GE...], 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 2356 reset in 794 ms.
Product exploration explored 100000 steps with 2350 reset in 508 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 p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Finished random walk after 52 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-05-31 20:40:32] [INFO ] Invariant cache hit.
[2024-05-31 20:40:34] [INFO ] [Real]Absence check using 22 positive place invariants in 40 ms returned sat
[2024-05-31 20:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:35] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2024-05-31 20:40:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:37] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-05-31 20:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:37] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-31 20:40:37] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-31 20:40:41] [INFO ] Added : 372 causal constraints over 75 iterations in 3898 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-31 20:40:41] [INFO ] Invariant cache hit.
[2024-05-31 20:40:42] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-05-31 20:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:42] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-31 20:40:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-05-31 20:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:43] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-05-31 20:40:43] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-31 20:40:47] [INFO ] Added : 372 causal constraints over 75 iterations in 3947 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 175 transition count 390
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 200 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 220 place count 165 transition count 340
Applied a total of 220 rules in 37 ms. Remains 165 /255 variables (removed 90) and now considering 340/470 (removed 130) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-05-31 20:40:47] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 20:40:47] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 20:40:47] [INFO ] Invariant cache hit.
[2024-05-31 20:40:47] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-31 20:40:48] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 20:40:48] [INFO ] Invariant cache hit.
[2024-05-31 20:40:48] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/255 places, 340/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 842 ms. Remains : 165/255 places, 340/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Finished random walk after 35 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 472 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-05-31 20:40:50] [INFO ] Invariant cache hit.
[2024-05-31 20:40:52] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-05-31 20:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:52] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2024-05-31 20:40:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-05-31 20:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:54] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-31 20:40:54] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-31 20:40:56] [INFO ] Added : 166 causal constraints over 34 iterations in 1376 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-31 20:40:56] [INFO ] Invariant cache hit.
[2024-05-31 20:40:56] [INFO ] [Real]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-05-31 20:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:56] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-31 20:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-05-31 20:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 20:40:57] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-31 20:40:57] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-31 20:40:58] [INFO ] Added : 79 causal constraints over 17 iterations in 645 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 3602 reset in 1752 ms.
Product exploration explored 100000 steps with 3604 reset in 1359 ms.
Built C files in :
/tmp/ltsmin14137421244028257587
[2024-05-31 20:41:01] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2024-05-31 20:41:01] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:41:01] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2024-05-31 20:41:01] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:41:01] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2024-05-31 20:41:01] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:41:01] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14137421244028257587
Running compilation step : cd /tmp/ltsmin14137421244028257587;'/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 1396 ms.
Running link step : cd /tmp/ltsmin14137421244028257587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14137421244028257587;'/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/stateBased3924741120603751547.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 55 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2024-05-31 20:41:16] [INFO ] Invariant cache hit.
[2024-05-31 20:41:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 20:41:16] [INFO ] Invariant cache hit.
[2024-05-31 20:41:16] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-31 20:41:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 20:41:16] [INFO ] Invariant cache hit.
[2024-05-31 20:41:17] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 165/165 places, 340/340 transitions.
Built C files in :
/tmp/ltsmin16871096986959847464
[2024-05-31 20:41:17] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2024-05-31 20:41:17] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:41:17] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2024-05-31 20:41:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:41:17] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2024-05-31 20:41:17] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:41:17] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16871096986959847464
Running compilation step : cd /tmp/ltsmin16871096986959847464;'/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 1308 ms.
Running link step : cd /tmp/ltsmin16871096986959847464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16871096986959847464;'/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/stateBased8178245668386363686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 20:41:32] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:41:32] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:41:32] [INFO ] Time to serialize gal into /tmp/LTL6266832023488963187.gal : 3 ms
[2024-05-31 20:41:32] [INFO ] Time to serialize properties into /tmp/LTL10158293502142931172.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6266832023488963187.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15954583521765445731.hoa' '-atoms' '/tmp/LTL10158293502142931172.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10158293502142931172.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15954583521765445731.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 20:41:47] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:41:47] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:41:47] [INFO ] Time to serialize gal into /tmp/LTL3019776487461922691.gal : 3 ms
[2024-05-31 20:41:47] [INFO ] Time to serialize properties into /tmp/LTL17514177444259688016.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3019776487461922691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17514177444259688016.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F(((((((((G(!("(((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))...9894
Formula 0 simplified : X(G(F"(((((Finished_2>=1)||(Finished_3>=1))||((Finished_5>=1)||(Finished_4>=1)))||(((Finished_0>=1)||(Finished_1>=1))||((Finished_7>...9870
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 20:42:02] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:42:02] [INFO ] Applying decomposition
[2024-05-31 20:42:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph657874553290993852.txt' '-o' '/tmp/graph657874553290993852.bin' '-w' '/tmp/graph657874553290993852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph657874553290993852.bin' '-l' '-1' '-v' '-w' '/tmp/graph657874553290993852.weights' '-q' '0' '-e' '0.001'
[2024-05-31 20:42:02] [INFO ] Decomposing Gal with order
[2024-05-31 20:42:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 20:42:02] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-31 20:42:02] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:42:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 6 ms.
[2024-05-31 20:42:02] [INFO ] Time to serialize gal into /tmp/LTL13444952915090715479.gal : 3 ms
[2024-05-31 20:42:02] [INFO ] Time to serialize properties into /tmp/LTL14016409693205214398.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13444952915090715479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14016409693205214398.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G(F(((((((((G(!("(((((i4.u41.Finished_2>=1)||(i3.u44.Finished_3>=1))||((i7.u45.Finished_5>=1)||(i5.u42.Finished_4>=1)))||(((i6.u...13314
Formula 0 simplified : X(G(F"(((((i4.u41.Finished_2>=1)||(i3.u44.Finished_3>=1))||((i7.u45.Finished_5>=1)||(i5.u42.Finished_4>=1)))||(((i6.u43.Finished_0>=...13290
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17511932102502700859
[2024-05-31 20:42:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17511932102502700859
Running compilation step : cd /tmp/ltsmin17511932102502700859;'/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 1048 ms.
Running link step : cd /tmp/ltsmin17511932102502700859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17511932102502700859;'/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' '--ltl' 'X(([](<>(([](!(LTLAPp1==true))||(LTLAPp0==true)))) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 finished in 123869 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)&&X(G(p1)))))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 20:42:32] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 20:42:32] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 20:42:32] [INFO ] Invariant cache hit.
[2024-05-31 20:42:33] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-31 20:42:33] [INFO ] Invariant cache hit.
[2024-05-31 20:42:33] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s40 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s43 1) (GEQ s184 1)) (AND (GEQ s2 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 finished in 1003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 714 place count 53 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 732 place count 44 transition count 42
Applied a total of 732 rules in 39 ms. Remains 44 /375 variables (removed 331) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-05-31 20:42:33] [INFO ] Computed 22 invariants in 0 ms
[2024-05-31 20:42:33] [INFO ] Implicit Places using invariants in 133 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/375 places, 42/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1925 reset in 408 ms.
Stack based approach found an accepted trace after 106 steps with 1 reset with depth 70 and stack size 70 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 656 place count 82 transition count 71
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 674 place count 73 transition count 71
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 715 place count 52 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 733 place count 43 transition count 42
Applied a total of 733 rules in 42 ms. Remains 43 /375 variables (removed 332) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-05-31 20:42:34] [INFO ] Computed 21 invariants in 0 ms
[2024-05-31 20:42:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 20:42:34] [INFO ] Invariant cache hit.
[2024-05-31 20:42:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-31 20:42:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 20:42:34] [INFO ] Invariant cache hit.
[2024-05-31 20:42:34] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/375 places, 42/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6347 reset in 401 ms.
Stack based approach found an accepted trace after 68 steps with 4 reset with depth 9 and stack size 9 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 finished in 729 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 1 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 656 place count 82 transition count 71
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 674 place count 73 transition count 71
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 715 place count 52 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 733 place count 43 transition count 42
Applied a total of 733 rules in 41 ms. Remains 43 /375 variables (removed 332) and now considering 42/590 (removed 548) transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-05-31 20:42:35] [INFO ] Computed 21 invariants in 1 ms
[2024-05-31 20:42:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 20:42:35] [INFO ] Invariant cache hit.
[2024-05-31 20:42:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-31 20:42:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 20:42:35] [INFO ] Invariant cache hit.
[2024-05-31 20:42:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/375 places, 42/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 43/375 places, 42/590 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s20 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 7604 reset in 360 ms.
Stack based approach found an accepted trace after 33 steps with 3 reset with depth 5 and stack size 5 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 finished in 742 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(p0) U p1)&&G(p2))))'
Support contains 6 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 8 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-05-31 20:42:35] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 20:42:36] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-31 20:42:36] [INFO ] Invariant cache hit.
[2024-05-31 20:42:36] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-31 20:42:36] [INFO ] Invariant cache hit.
[2024-05-31 20:42:37] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1260 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(AND (GEQ s2 1) (GEQ s28 1) (GEQ s184 1)), p1:(AND (GEQ s0 1) (GEQ s46 1) (GEQ s184 1)), p0:(GEQ s183 1)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 finished in 1634 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((((!p1&&G(p2)) U ((!p1&&G(p2)&&X(G(p3)))||G((!p1&&G(p2)))))||p0))))'
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 256 transition count 471
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 256 transition count 471
Applied a total of 238 rules in 9 ms. Remains 256 /375 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 256 cols
[2024-05-31 20:42:37] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 20:42:37] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-31 20:42:37] [INFO ] Invariant cache hit.
[2024-05-31 20:42:38] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2024-05-31 20:42:38] [INFO ] Invariant cache hit.
[2024-05-31 20:42:38] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/375 places, 471/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 256/375 places, 471/590 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3) (AND (NOT p0) p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (AND p1 (NOT p3)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 p3 p0), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (AND p1 (NOT p0)) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p2 (NOT p1) p3) (AND p2 p3 p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(LT s197 1), p0:(OR (LT s3 1) (LT s27 1) (LT s185 1)), p1:(AND (GEQ s3 1) (GEQ s27 1) (GEQ s185 1)), p3:(LT s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1602 steps with 0 reset in 12 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 finished in 1493 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((G(!p1)||p0))) U p1)))'
[2024-05-31 20:42:39] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4106556568579516553
[2024-05-31 20:42:39] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2024-05-31 20:42:39] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:42:39] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2024-05-31 20:42:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:42:39] [INFO ] Applying decomposition
[2024-05-31 20:42:39] [INFO ] Flatten gal took : 67 ms
[2024-05-31 20:42:39] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2024-05-31 20:42:39] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 20:42:39] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4106556568579516553
Running compilation step : cd /tmp/ltsmin4106556568579516553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph826145063847609796.txt' '-o' '/tmp/graph826145063847609796.bin' '-w' '/tmp/graph826145063847609796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph826145063847609796.bin' '-l' '-1' '-v' '-w' '/tmp/graph826145063847609796.weights' '-q' '0' '-e' '0.001'
[2024-05-31 20:42:39] [INFO ] Decomposing Gal with order
[2024-05-31 20:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 20:42:39] [INFO ] Removed a total of 572 redundant transitions.
[2024-05-31 20:42:39] [INFO ] Flatten gal took : 137 ms
[2024-05-31 20:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 36 ms.
[2024-05-31 20:42:39] [INFO ] Time to serialize gal into /tmp/LTLFireability11230761824283716265.gal : 6 ms
[2024-05-31 20:42:39] [INFO ] Time to serialize properties into /tmp/LTLFireability9429889677819650074.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11230761824283716265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9429889677819650074.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F(("((((((((((i2.u46.IdleTechs_2>=1)&&(i4.u32.OpenRequests_6_2>=1))&&(i9.i0.u30.Idles>=1))||(((i1.u33.IdleTechs_0>=1)&&(i10.u1...14040
Formula 0 simplified : X(G(F"(((((i6.u60.Finished_2>=1)||(i10.u2.Finished_3>=1))||((i7.u3.Finished_5>=1)||(i2.u61.Finished_4>=1)))||(((i9.i1.u0.Finished_0>...14028
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 2709 ms.
Running link step : cd /tmp/ltsmin4106556568579516553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4106556568579516553;'/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' '--ltl' 'X(([](<>(([](!(LTLAPp1==true))||(LTLAPp0==true)))) U (LTLAPp1==true)))' '--buchi-type=spotba'
46 unique states visited
0 strongly connected components in search stack
87 transitions explored
45 items max in DFS search stack
23522 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,235.352,2081836,1,0,3.38277e+06,9809,4250,6.00236e+06,408,90961,4631842
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 849830 ms.

BK_STOP 1717188735414

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is UtilityControlRoom-PT-Z4T3N10, 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-171701123000148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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