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.r219-smll-171649597700013.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 HexagonalGrid-PT-226, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597700013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 112K May 18 16:42 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 HexagonalGrid-PT-226-LTLFireability-00
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-01
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-02
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-03
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-04
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-05
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-06
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-07
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-08
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-09
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-10
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-11
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-12
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-13
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-14
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716625748912

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=HexagonalGrid-PT-226
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 08:29:11] [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-25 08:29:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:29:11] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-25 08:29:11] [INFO ] Transformed 169 places.
[2024-05-25 08:29:11] [INFO ] Transformed 270 transitions.
[2024-05-25 08:29:11] [INFO ] Parsed PT model containing 169 places and 270 transitions and 1080 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HexagonalGrid-PT-226-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 46 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 169 cols
[2024-05-25 08:29:12] [INFO ] Computed 68 invariants in 34 ms
[2024-05-25 08:29:13] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-25 08:29:13] [INFO ] Invariant cache hit.
[2024-05-25 08:29:13] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2024-05-25 08:29:13] [INFO ] Invariant cache hit.
[2024-05-25 08:29:13] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1438 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 38 out of 169 places after structural reductions.
[2024-05-25 08:29:14] [INFO ] Flatten gal took : 76 ms
[2024-05-25 08:29:14] [INFO ] Flatten gal took : 35 ms
[2024-05-25 08:29:14] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 36 out of 169 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:29:14] [INFO ] Invariant cache hit.
[2024-05-25 08:29:14] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 15 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:15] [INFO ] Invariant cache hit.
[2024-05-25 08:29:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-25 08:29:15] [INFO ] Invariant cache hit.
[2024-05-25 08:29:15] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-25 08:29:15] [INFO ] Invariant cache hit.
[2024-05-25 08:29:15] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 169/169 places, 270/270 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 249 ms :[true, p0, p0]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s46 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 7 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-00 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 28 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:16] [INFO ] Invariant cache hit.
[2024-05-25 08:29:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 08:29:16] [INFO ] Invariant cache hit.
[2024-05-25 08:29:16] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-25 08:29:16] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-25 08:29:16] [INFO ] Invariant cache hit.
[2024-05-25 08:29:16] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 769 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s60 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 865 reset in 1212 ms.
Product exploration explored 100000 steps with 875 reset in 1255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-25 08:29:19] [INFO ] Invariant cache hit.
[2024-05-25 08:29:20] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2024-05-25 08:29:20] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-25 08:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:29:20] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-25 08:29:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:29:20] [INFO ] [Nat]Absence check using 67 positive place invariants in 26 ms returned sat
[2024-05-25 08:29:20] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-25 08:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:29:20] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-25 08:29:20] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-25 08:29:21] [INFO ] Added : 56 causal constraints over 12 iterations in 484 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:21] [INFO ] Invariant cache hit.
[2024-05-25 08:29:21] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-25 08:29:21] [INFO ] Invariant cache hit.
[2024-05-25 08:29:21] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-25 08:29:21] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-25 08:29:21] [INFO ] Invariant cache hit.
[2024-05-25 08:29:21] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 732 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-25 08:29:22] [INFO ] Invariant cache hit.
[2024-05-25 08:29:22] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2024-05-25 08:29:22] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-25 08:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:29:22] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-25 08:29:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:29:22] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2024-05-25 08:29:22] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-25 08:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:29:23] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-25 08:29:23] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-25 08:29:23] [INFO ] Added : 56 causal constraints over 12 iterations in 281 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 843 reset in 1050 ms.
Product exploration explored 100000 steps with 866 reset in 1132 ms.
Built C files in :
/tmp/ltsmin2489271090511365350
[2024-05-25 08:29:25] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-25 08:29:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:29:25] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-25 08:29:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:29:25] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-25 08:29:25] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:29:25] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2489271090511365350
Running compilation step : cd /tmp/ltsmin2489271090511365350;'/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 1029 ms.
Running link step : cd /tmp/ltsmin2489271090511365350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2489271090511365350;'/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/stateBased6826237821496021361.hoa' '--buchi-type=spotba'
LTSmin run took 1592 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-02 finished in 12200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:28] [INFO ] Invariant cache hit.
[2024-05-25 08:29:28] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-25 08:29:28] [INFO ] Invariant cache hit.
[2024-05-25 08:29:28] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-25 08:29:28] [INFO ] Invariant cache hit.
[2024-05-25 08:29:29] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 781 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s42 1) (LT s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 44176 reset in 780 ms.
Product exploration explored 100000 steps with 44010 reset in 802 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 230 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:31] [INFO ] Invariant cache hit.
[2024-05-25 08:29:31] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-25 08:29:31] [INFO ] Invariant cache hit.
[2024-05-25 08:29:32] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-05-25 08:29:32] [INFO ] Invariant cache hit.
[2024-05-25 08:29:32] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 812 ms. Remains : 169/169 places, 270/270 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 44415 reset in 699 ms.
Product exploration explored 100000 steps with 44066 reset in 783 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:34] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-25 08:29:34] [INFO ] Invariant cache hit.
[2024-05-25 08:29:35] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 169/169 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin1699183023073039800
[2024-05-25 08:29:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1699183023073039800
Running compilation step : cd /tmp/ltsmin1699183023073039800;'/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 699 ms.
Running link step : cd /tmp/ltsmin1699183023073039800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1699183023073039800;'/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/stateBased3322505366459200526.hoa' '--buchi-type=spotba'
LTSmin run took 3221 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-03 finished in 10809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(!p0)||G((p1 U X(p2)))))))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:39] [INFO ] Invariant cache hit.
[2024-05-25 08:29:39] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 08:29:39] [INFO ] Invariant cache hit.
[2024-05-25 08:29:39] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-25 08:29:39] [INFO ] Invariant cache hit.
[2024-05-25 08:29:39] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 575 ms :[false, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false, false, (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}, { cond=(AND p0 p1), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 10}], [{ cond=p0, acceptance={} source=5 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 13}], [{ cond=(NOT p2), acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}, { cond=p1, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 7}, { cond=(NOT p0), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 9}, { cond=p0, acceptance={} source=11 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 13}], [{ cond=(NOT p0), acceptance={} source=13 dest: 10}, { cond=p0, acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s77 1)), p1:(AND (GEQ s47 1) (GEQ s68 1)), p2:(AND (GEQ s47 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 423 steps with 139 reset in 6 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-04 finished in 1343 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||X(F(p1))))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:40] [INFO ] Invariant cache hit.
[2024-05-25 08:29:40] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-25 08:29:40] [INFO ] Invariant cache hit.
[2024-05-25 08:29:41] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-05-25 08:29:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 08:29:41] [INFO ] Invariant cache hit.
[2024-05-25 08:29:41] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s84 1)), p1:(OR (LT s45 1) (LT s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 405 reset in 1044 ms.
Product exploration explored 100000 steps with 402 reset in 1129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 301 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:44] [INFO ] Invariant cache hit.
[2024-05-25 08:29:44] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-25 08:29:44] [INFO ] Invariant cache hit.
[2024-05-25 08:29:44] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-25 08:29:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 08:29:44] [INFO ] Invariant cache hit.
[2024-05-25 08:29:45] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 753 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 182 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 371 reset in 1040 ms.
Product exploration explored 100000 steps with 392 reset in 1147 ms.
Built C files in :
/tmp/ltsmin4126246002199899766
[2024-05-25 08:29:48] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-25 08:29:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:29:48] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-25 08:29:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:29:48] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-25 08:29:48] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:29:48] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4126246002199899766
Running compilation step : cd /tmp/ltsmin4126246002199899766;'/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 826 ms.
Running link step : cd /tmp/ltsmin4126246002199899766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4126246002199899766;'/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/stateBased9504314085735232634.hoa' '--buchi-type=spotba'
LTSmin run took 4146 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-05 finished in 12702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 15 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:53] [INFO ] Invariant cache hit.
[2024-05-25 08:29:53] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-25 08:29:53] [INFO ] Invariant cache hit.
[2024-05-25 08:29:53] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-25 08:29:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 08:29:53] [INFO ] Invariant cache hit.
[2024-05-25 08:29:54] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 965 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s83 1) (LT s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17 reset in 921 ms.
Stack based approach found an accepted trace after 71686 steps with 9 reset with depth 8016 and stack size 8016 in 813 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-06 finished in 2764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U G(X(X((F(p1)||!p2)))))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:56] [INFO ] Invariant cache hit.
[2024-05-25 08:29:56] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-25 08:29:56] [INFO ] Invariant cache hit.
[2024-05-25 08:29:56] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-25 08:29:56] [INFO ] Invariant cache hit.
[2024-05-25 08:29:56] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s47 1) (GEQ s125 1)), p2:(AND (GEQ s46 1) (GEQ s67 1)), p1:(AND (GEQ s103 1) (GEQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6160 steps with 0 reset in 50 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-07 finished in 882 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(((p1 U X(!p2))&&p0))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:29:56] [INFO ] Invariant cache hit.
[2024-05-25 08:29:57] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-25 08:29:57] [INFO ] Invariant cache hit.
[2024-05-25 08:29:57] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-25 08:29:57] [INFO ] Invariant cache hit.
[2024-05-25 08:29:57] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s48 1) (GEQ s126 1)), p1:(AND (GEQ s45 1) (GEQ s123 1)), p2:(AND (GEQ s47 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1653 reset in 1086 ms.
Product exploration explored 100000 steps with 1627 reset in 1187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 657 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Finished random walk after 8234 steps, including 2 resets, run visited all 8 properties in 115 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (AND p0 p1 p2)), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND p1 p2))]
Knowledge based reduction with 10 factoid took 963 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
[2024-05-25 08:30:02] [INFO ] Invariant cache hit.
[2024-05-25 08:30:02] [INFO ] [Real]Absence check using 67 positive place invariants in 31 ms returned sat
[2024-05-25 08:30:02] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 08:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:30:02] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-25 08:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:30:02] [INFO ] [Nat]Absence check using 67 positive place invariants in 31 ms returned sat
[2024-05-25 08:30:02] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-25 08:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:30:03] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-25 08:30:03] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-25 08:30:03] [INFO ] Added : 58 causal constraints over 12 iterations in 273 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:03] [INFO ] Invariant cache hit.
[2024-05-25 08:30:03] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-25 08:30:03] [INFO ] Invariant cache hit.
[2024-05-25 08:30:03] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-25 08:30:03] [INFO ] Invariant cache hit.
[2024-05-25 08:30:04] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 793 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Finished random walk after 1883 steps, including 0 resets, run visited all 8 properties in 45 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (AND p0 p1 p2)), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND p1 p2))]
Knowledge based reduction with 10 factoid took 969 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
[2024-05-25 08:30:06] [INFO ] Invariant cache hit.
[2024-05-25 08:30:06] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2024-05-25 08:30:06] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 08:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:30:06] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-25 08:30:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:30:07] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2024-05-25 08:30:07] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-25 08:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:30:07] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-25 08:30:07] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-25 08:30:07] [INFO ] Added : 58 causal constraints over 12 iterations in 277 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 1665 reset in 1084 ms.
Product exploration explored 100000 steps with 1617 reset in 1182 ms.
Built C files in :
/tmp/ltsmin10233032455172456946
[2024-05-25 08:30:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10233032455172456946
Running compilation step : cd /tmp/ltsmin10233032455172456946;'/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 663 ms.
Running link step : cd /tmp/ltsmin10233032455172456946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10233032455172456946;'/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/stateBased1258264492874188439.hoa' '--buchi-type=spotba'
LTSmin run took 3773 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-08 finished in 17736 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 U (G(!p0)||(X(!p2)&&p1))))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:14] [INFO ] Invariant cache hit.
[2024-05-25 08:30:14] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-25 08:30:14] [INFO ] Invariant cache hit.
[2024-05-25 08:30:15] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-25 08:30:15] [INFO ] Invariant cache hit.
[2024-05-25 08:30:15] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s21 1) (GEQ s81 1))) (NOT (AND (GEQ s42 1) (GEQ s111 1) (NOT (AND (GEQ s21 1) (GEQ s81 1)))))), p0:(AND (GEQ s42 1) (GEQ s111 1) (N...], 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 1449 reset in 1179 ms.
Product exploration explored 100000 steps with 1484 reset in 1263 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) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 501 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:30:18] [INFO ] Invariant cache hit.
[2024-05-25 08:30:18] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 840 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 120 ms :[p0, p0, (AND p0 p2)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:20] [INFO ] Invariant cache hit.
[2024-05-25 08:30:20] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-25 08:30:20] [INFO ] Invariant cache hit.
[2024-05-25 08:30:20] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-25 08:30:20] [INFO ] Invariant cache hit.
[2024-05-25 08:30:20] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 3 factoid took 568 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND p0 p2)]
Finished random walk after 243 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (AND p2 p0)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 3 factoid took 598 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p0, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 123 ms :[p0, p0, (AND p0 p2)]
Product exploration explored 100000 steps with 1492 reset in 1152 ms.
Product exploration explored 100000 steps with 1445 reset in 1242 ms.
Built C files in :
/tmp/ltsmin13580649150692460724
[2024-05-25 08:30:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13580649150692460724
Running compilation step : cd /tmp/ltsmin13580649150692460724;'/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 677 ms.
Running link step : cd /tmp/ltsmin13580649150692460724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13580649150692460724;'/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/stateBased14102672207105381963.hoa' '--buchi-type=spotba'
LTSmin run took 2138 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-09 finished in 13194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0)||G(p1)) U (!p2&&X(X(!p3)))))))'
Support contains 8 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:27] [INFO ] Invariant cache hit.
[2024-05-25 08:30:27] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-25 08:30:27] [INFO ] Invariant cache hit.
[2024-05-25 08:30:28] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-25 08:30:28] [INFO ] Invariant cache hit.
[2024-05-25 08:30:28] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 647 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 8}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 9}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=5 dest: 10}, { cond=p2, acceptance={0} source=5 dest: 11}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 12}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=5 dest: 13}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={0} source=8 dest: 9}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={0} source=8 dest: 10}, { cond=(AND p2 p3), acceptance={0} source=8 dest: 11}, { cond=(AND p2 (NOT p0) (NOT p1) p3), acceptance={0} source=8 dest: 12}, { cond=(AND p2 (NOT p0) p1 p3), acceptance={0} source=8 dest: 13}], [{ cond=(OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p0) p1 p3)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={} source=10 dest: 13}], [{ cond=(AND p2 p3), acceptance={0} source=11 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1) p3), acceptance={0} source=11 dest: 3}, { cond=(AND p2 (NOT p0) p1 p3), acceptance={0} source=11 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0} source=11 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={0} source=11 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={0} source=11 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={} source=12 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=13 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s44 1) (GEQ s51 1)), p0:(AND (GEQ s46 1) (GEQ s115 1)), p1:(AND (GEQ s43 1) (GEQ s64 1)), p3:(AND (GEQ s47 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13923 reset in 983 ms.
Product exploration explored 100000 steps with 13987 reset in 1066 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 526 ms. Reduced automaton from 14 states, 38 edges and 4 AP (stutter sensitive) to 14 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 633 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 19) seen :18
Finished Best-First random walk after 4899 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=349 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p3)), (F (OR (AND (NOT p0) p1 p3) (AND (NOT p0) (NOT p2) p3))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 p2 p3)), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 p3)), (F p0), (F p2), (F (AND (NOT p0) p1 p3)), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p3)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 1 factoid took 981 ms. Reduced automaton from 14 states, 38 edges and 4 AP (stutter sensitive) to 14 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 630 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 639 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 8 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:34] [INFO ] Invariant cache hit.
[2024-05-25 08:30:34] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 08:30:34] [INFO ] Invariant cache hit.
[2024-05-25 08:30:35] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-25 08:30:35] [INFO ] Invariant cache hit.
[2024-05-25 08:30:35] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 1 factoid took 441 ms. Reduced automaton from 14 states, 38 edges and 4 AP (stutter sensitive) to 14 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 698 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Finished random walk after 4369 steps, including 1 resets, run visited all 19 properties in 84 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p3)), (F (OR (AND (NOT p0) p1 p3) (AND (NOT p0) (NOT p2) p3))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2 p3)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 p3)), (F p0), (F p2), (F (AND (NOT p0) p1 p3)), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p3)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 1 factoid took 976 ms. Reduced automaton from 14 states, 38 edges and 4 AP (stutter sensitive) to 14 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 644 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 635 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 634 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Product exploration explored 100000 steps with 13948 reset in 984 ms.
Product exploration explored 100000 steps with 13504 reset in 1071 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 638 ms :[(OR p3 p2), (OR p2 p3), (OR p2 p3), (NOT p0), (AND (NOT p0) (NOT p1)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p3 (NOT p1) (NOT p2)), p3, (AND (NOT p0) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 8 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 08:30:42] [INFO ] Invariant cache hit.
[2024-05-25 08:30:42] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 169/169 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin12060942210149635645
[2024-05-25 08:30:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12060942210149635645
Running compilation step : cd /tmp/ltsmin12060942210149635645;'/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 690 ms.
Running link step : cd /tmp/ltsmin12060942210149635645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12060942210149635645;'/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/stateBased6793508175945229607.hoa' '--buchi-type=spotba'
LTSmin run took 771 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-10 finished in 16473 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((G(!p0)||X(p1))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:44] [INFO ] Invariant cache hit.
[2024-05-25 08:30:44] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-25 08:30:44] [INFO ] Invariant cache hit.
[2024-05-25 08:30:44] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-25 08:30:44] [INFO ] Invariant cache hit.
[2024-05-25 08:30:45] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s47 1) (GEQ s68 1)), p1:(OR (LT s46 1) (LT s124 1) (LT s48 1) (LT s121 1) (LT s46 1) (LT s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-11 finished in 1085 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(F(p1))||p0))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:45] [INFO ] Invariant cache hit.
[2024-05-25 08:30:45] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 08:30:45] [INFO ] Invariant cache hit.
[2024-05-25 08:30:45] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-25 08:30:45] [INFO ] Invariant cache hit.
[2024-05-25 08:30:46] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s43 1) (LT s64 1)), p1:(AND (GEQ s46 1) (GEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 44054 reset in 697 ms.
Product exploration explored 100000 steps with 44435 reset in 766 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:48] [INFO ] Invariant cache hit.
[2024-05-25 08:30:48] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-25 08:30:48] [INFO ] Invariant cache hit.
[2024-05-25 08:30:48] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-25 08:30:48] [INFO ] Invariant cache hit.
[2024-05-25 08:30:49] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 121 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 254 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 44017 reset in 692 ms.
Product exploration explored 100000 steps with 44137 reset in 800 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 08:30:51] [INFO ] Invariant cache hit.
[2024-05-25 08:30:52] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 169/169 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin11675848783696864841
[2024-05-25 08:30:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11675848783696864841
Running compilation step : cd /tmp/ltsmin11675848783696864841;'/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 682 ms.
Running link step : cd /tmp/ltsmin11675848783696864841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11675848783696864841;'/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/stateBased11011863427404657503.hoa' '--buchi-type=spotba'
LTSmin run took 6172 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-226-LTLFireability-13 finished in 13675 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(p1)&&p0) U p2) U G(p3))))'
Support contains 7 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 08:30:59] [INFO ] Invariant cache hit.
[2024-05-25 08:30:59] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-25 08:30:59] [INFO ] Invariant cache hit.
[2024-05-25 08:30:59] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-25 08:30:59] [INFO ] Invariant cache hit.
[2024-05-25 08:30:59] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p3), (NOT p3), true, (OR (NOT p2) (NOT p1)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3)))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 p2) (AND p3 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 p2 (NOT p1)) (AND p3 p0 (NOT p1))), acceptance={} source=5 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s43 1) (GEQ s116 1)), p2:(AND (GEQ s48 1) (GEQ s62 1)), p0:(AND (GEQ s43 1) (GEQ s77 1)), p1:(AND (GEQ s47 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-15 finished in 972 ms.
All properties solved by simple procedures.
Total runtime 108398 ms.

BK_STOP 1716625861193

--------------------
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="HexagonalGrid-PT-226"
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 HexagonalGrid-PT-226, 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 r219-smll-171649597700013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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