fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r487-tall-167912703500723
Last Updated
May 14, 2023

About the Execution of LoLa+red for TriangularGrid-PT-2011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.783 16732.00 26149.00 308.00 FFFFFFFFFFTFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912703500723.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is TriangularGrid-PT-2011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703500723
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 33K Mar 5 18:23 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 TriangularGrid-PT-2011-LTLCardinality-00
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-01
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-02
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-03
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-04
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-05
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-06
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-07
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-08
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-09
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-10
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-11
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-12
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-13
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-14
FORMULA_NAME TriangularGrid-PT-2011-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679222036962

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-2011
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 10:33:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 10:33:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:33:58] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-19 10:33:58] [INFO ] Transformed 52 places.
[2023-03-19 10:33:58] [INFO ] Transformed 42 transitions.
[2023-03-19 10:33:58] [INFO ] Parsed PT model containing 52 places and 42 transitions and 168 arcs in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TriangularGrid-PT-2011-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2023-03-19 10:33:58] [INFO ] Computed 23 place invariants in 12 ms
[2023-03-19 10:33:59] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-19 10:33:59] [INFO ] Invariant cache hit.
[2023-03-19 10:33:59] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-19 10:33:59] [INFO ] Invariant cache hit.
[2023-03-19 10:33:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 52/52 places, 42/42 transitions.
Support contains 33 out of 52 places after structural reductions.
[2023-03-19 10:33:59] [INFO ] Flatten gal took : 22 ms
[2023-03-19 10:33:59] [INFO ] Flatten gal took : 8 ms
[2023-03-19 10:33:59] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 31 out of 52 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 10:33:59] [INFO ] Invariant cache hit.
[2023-03-19 10:33:59] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-19 10:33:59] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:33:59] [INFO ] After 59ms 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.
FORMULA TriangularGrid-PT-2011-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&X(G(!p1))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:00] [INFO ] Invariant cache hit.
[2023-03-19 10:34:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 10:34:00] [INFO ] Invariant cache hit.
[2023-03-19 10:34:00] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 10:34:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:34:00] [INFO ] Invariant cache hit.
[2023-03-19 10:34:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s33 s42), p0:(LEQ s10 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 16075 steps with 725 reset in 125 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-00 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:00] [INFO ] Invariant cache hit.
[2023-03-19 10:34:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 10:34:00] [INFO ] Invariant cache hit.
[2023-03-19 10:34:01] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-19 10:34:01] [INFO ] Invariant cache hit.
[2023-03-19 10:34:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT s14 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-01 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:01] [INFO ] Invariant cache hit.
[2023-03-19 10:34:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 10:34:01] [INFO ] Invariant cache hit.
[2023-03-19 10:34:01] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-19 10:34:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:34:01] [INFO ] Invariant cache hit.
[2023-03-19 10:34:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s30), p1:(LEQ s39 s8), p2:(GT s2 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3385 reset in 325 ms.
Stack based approach found an accepted trace after 59259 steps with 2004 reset with depth 85 and stack size 85 in 217 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-03 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(!p0)))))'
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, p0, false, false]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-04 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-19 10:34:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s17 s38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2822 steps with 4 reset in 8 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-05 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 10:34:02] [INFO ] Invariant cache hit.
[2023-03-19 10:34:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s24), p1:(LEQ s51 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2869 reset in 254 ms.
Product exploration explored 100000 steps with 2846 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:04] [INFO ] Invariant cache hit.
[2023-03-19 10:34:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 10:34:04] [INFO ] Invariant cache hit.
[2023-03-19 10:34:04] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-19 10:34:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:34:04] [INFO ] Invariant cache hit.
[2023-03-19 10:34:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 52/52 places, 42/42 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2900 reset in 227 ms.
Product exploration explored 100000 steps with 2864 reset in 244 ms.
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:05] [INFO ] Invariant cache hit.
[2023-03-19 10:34:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 10:34:05] [INFO ] Invariant cache hit.
[2023-03-19 10:34:05] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-19 10:34:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:34:05] [INFO ] Invariant cache hit.
[2023-03-19 10:34:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 52/52 places, 42/42 transitions.
Treatment of property TriangularGrid-PT-2011-LTLCardinality-06 finished in 3078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:05] [INFO ] Invariant cache hit.
[2023-03-19 10:34:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 10:34:05] [INFO ] Invariant cache hit.
[2023-03-19 10:34:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-19 10:34:05] [INFO ] Invariant cache hit.
[2023-03-19 10:34:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-07 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-19 10:34:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s0), p1:(GT s49 s24)], nbAcceptance=2, 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 144 reset in 320 ms.
Stack based approach found an accepted trace after 2836 steps with 5 reset with depth 347 and stack size 342 in 10 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-08 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(G(p1))))))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GT 1 s36), p0:(AND (GT 1 s36) (LEQ s42 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-09 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)&&(p1||X(p2))))||(p3 U p2))))'
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 10:34:06] [INFO ] Invariant cache hit.
[2023-03-19 10:34:07] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 10:34:07] [INFO ] Invariant cache hit.
[2023-03-19 10:34:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=8 dest: 8}]], initial=4, aps=[p0:(LEQ s47 s23), p2:(LEQ s3 s12), p3:(GT s24 s28), p1:(LEQ 1 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 179 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) p2 (NOT p3) p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3))))
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TriangularGrid-PT-2011-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TriangularGrid-PT-2011-LTLCardinality-10 finished in 1167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(X(p1) U ((!p2&&X(p1))||X(G(p1))))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:08] [INFO ] Invariant cache hit.
[2023-03-19 10:34:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 10:34:08] [INFO ] Invariant cache hit.
[2023-03-19 10:34:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-19 10:34:08] [INFO ] Invariant cache hit.
[2023-03-19 10:34:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s15 s32), p0:(GT 1 s46), p2:(OR (LEQ 2 s36) (LEQ s29 s40))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10127 reset in 242 ms.
Stack based approach found an accepted trace after 81806 steps with 8192 reset with depth 32 and stack size 32 in 210 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-12 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:08] [INFO ] Invariant cache hit.
[2023-03-19 10:34:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 10:34:08] [INFO ] Invariant cache hit.
[2023-03-19 10:34:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-19 10:34:08] [INFO ] Invariant cache hit.
[2023-03-19 10:34:09] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s12 s36) (GT s14 s0))], 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 23 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-2011-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLCardinality-13 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:09] [INFO ] Invariant cache hit.
[2023-03-19 10:34:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 10:34:09] [INFO ] Invariant cache hit.
[2023-03-19 10:34:09] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 10:34:09] [INFO ] Invariant cache hit.
[2023-03-19 10:34:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s35 s39)], 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 39927 reset in 162 ms.
Product exploration explored 100000 steps with 39839 reset in 179 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 168 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 79 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 )
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 169 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:10] [INFO ] Invariant cache hit.
[2023-03-19 10:34:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 10:34:10] [INFO ] Invariant cache hit.
[2023-03-19 10:34:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 10:34:10] [INFO ] Invariant cache hit.
[2023-03-19 10:34:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 52/52 places, 42/42 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 173 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 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 319 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39859 reset in 165 ms.
Product exploration explored 100000 steps with 39615 reset in 175 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:34:11] [INFO ] Invariant cache hit.
[2023-03-19 10:34:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 52/52 places, 42/42 transitions.
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:11] [INFO ] Invariant cache hit.
[2023-03-19 10:34:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-19 10:34:12] [INFO ] Invariant cache hit.
[2023-03-19 10:34:12] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 10:34:12] [INFO ] Invariant cache hit.
[2023-03-19 10:34:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 52/52 places, 42/42 transitions.
Treatment of property TriangularGrid-PT-2011-LTLCardinality-15 finished in 2988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : TriangularGrid-PT-2011-LTLCardinality-15
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-19 10:34:12] [INFO ] Invariant cache hit.
[2023-03-19 10:34:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 10:34:12] [INFO ] Invariant cache hit.
[2023-03-19 10:34:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-19 10:34:12] [INFO ] Invariant cache hit.
[2023-03-19 10:34:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 141 ms. Remains : 52/52 places, 42/42 transitions.
Running random walk in product with property : TriangularGrid-PT-2011-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s35 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 39874 reset in 158 ms.
Stack based approach found an accepted trace after 1869 steps with 761 reset with depth 8 and stack size 8 in 4 ms.
Treatment of property TriangularGrid-PT-2011-LTLCardinality-15 finished in 474 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 10:34:12] [INFO ] Flatten gal took : 11 ms
[2023-03-19 10:34:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-19 10:34:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 42 transitions and 168 arcs took 1 ms.
Total runtime 14251 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TriangularGrid-PT-2011
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLCardinality

FORMULA TriangularGrid-PT-2011-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-2011-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679222053694

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 TriangularGrid-PT-2011-LTLCardinality-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for TriangularGrid-PT-2011-LTLCardinality-06
lola: result : false
lola: markings : 115
lola: fired transitions : 115
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 TriangularGrid-PT-2011-LTLCardinality-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for TriangularGrid-PT-2011-LTLCardinality-15
lola: result : false
lola: markings : 163
lola: fired transitions : 164
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TriangularGrid-PT-2011-LTLCardinality-06: LTL false LTL model checker
TriangularGrid-PT-2011-LTLCardinality-15: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="TriangularGrid-PT-2011"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is TriangularGrid-PT-2011, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912703500723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-2011.tgz
mv TriangularGrid-PT-2011 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;