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.r455-smll-167912647300355.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 SquareGrid-PT-020102, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647300355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.6K Feb 25 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 55K 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 SquareGrid-PT-020102-LTLCardinality-00
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-01
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-02
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-03
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-04
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-05
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-06
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-07
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-08
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-09
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-10
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-11
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-12
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-13
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-14
FORMULA_NAME SquareGrid-PT-020102-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679229263543

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=SquareGrid-PT-020102
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 12:34:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 12:34:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:34:27] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-19 12:34:27] [INFO ] Transformed 68 places.
[2023-03-19 12:34:27] [INFO ] Transformed 72 transitions.
[2023-03-19 12:34:27] [INFO ] Parsed PT model containing 68 places and 72 transitions and 288 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SquareGrid-PT-020102-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 18 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2023-03-19 12:34:27] [INFO ] Computed 29 place invariants in 15 ms
[2023-03-19 12:34:28] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-19 12:34:28] [INFO ] Invariant cache hit.
[2023-03-19 12:34:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-19 12:34:28] [INFO ] Invariant cache hit.
[2023-03-19 12:34:28] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 68/68 places, 72/72 transitions.
Support contains 35 out of 68 places after structural reductions.
[2023-03-19 12:34:28] [INFO ] Flatten gal took : 64 ms
[2023-03-19 12:34:28] [INFO ] Flatten gal took : 28 ms
[2023-03-19 12:34:29] [INFO ] Input system was already deterministic with 72 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 12:34:29] [INFO ] Invariant cache hit.
[2023-03-19 12:34:30] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-19 12:34:30] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 12:34:30] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 11 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' '!(X(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:30] [INFO ] Invariant cache hit.
[2023-03-19 12:34:30] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-19 12:34:30] [INFO ] Invariant cache hit.
[2023-03-19 12:34:30] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-19 12:34:30] [INFO ] Invariant cache hit.
[2023-03-19 12:34:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-00 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:(GT s55 s44)], 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 2 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-00 finished in 931 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((p0 U p1)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 14 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:31] [INFO ] Invariant cache hit.
[2023-03-19 12:34:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-19 12:34:31] [INFO ] Invariant cache hit.
[2023-03-19 12:34:31] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-19 12:34:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 12:34:31] [INFO ] Invariant cache hit.
[2023-03-19 12:34:31] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s38 s36) (LEQ 1 s45)), p0:(LEQ s12 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-02 finished in 669 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 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:32] [INFO ] Invariant cache hit.
[2023-03-19 12:34:32] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 12:34:32] [INFO ] Invariant cache hit.
[2023-03-19 12:34:32] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-19 12:34:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 12:34:32] [INFO ] Invariant cache hit.
[2023-03-19 12:34:32] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s60)], 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 5020 steps with 1 reset in 130 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-03 finished in 689 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 U (p1||G(p0))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:32] [INFO ] Invariant cache hit.
[2023-03-19 12:34:32] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 12:34:32] [INFO ] Invariant cache hit.
[2023-03-19 12:34:33] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-19 12:34:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 12:34:33] [INFO ] Invariant cache hit.
[2023-03-19 12:34:33] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s7 s53) (GT 2 s57)), p0:(GT 2 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1657 steps with 6 reset in 21 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-06 finished in 583 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||F((!p0 U (p1||G(!p0))))||(p2 U (p3||G(p2))))))'
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:33] [INFO ] Invariant cache hit.
[2023-03-19 12:34:33] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 12:34:33] [INFO ] Invariant cache hit.
[2023-03-19 12:34:33] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-19 12:34:33] [INFO ] Invariant cache hit.
[2023-03-19 12:34:33] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 233 ms :[false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s42 s52), p1:(AND (GT 2 s40) (GT s42 s52)), p3:(AND (NOT (OR (LEQ s25 s23) (LEQ s54 s1))) (GT s18 s0)), p2:(GT s18 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 707 ms.
Product exploration explored 100000 steps with 50000 reset in 613 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) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))
Knowledge based reduction with 4 factoid took 370 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SquareGrid-PT-020102-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SquareGrid-PT-020102-LTLCardinality-07 finished in 2397 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(p0)&&(G(p0)||X(G(p1)))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:35] [INFO ] Invariant cache hit.
[2023-03-19 12:34:35] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-19 12:34:35] [INFO ] Invariant cache hit.
[2023-03-19 12:34:36] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-19 12:34:36] [INFO ] Invariant cache hit.
[2023-03-19 12:34:36] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT s60 s41), p1:(GT s33 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-08 finished in 761 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(F(p0))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:36] [INFO ] Invariant cache hit.
[2023-03-19 12:34:36] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 12:34:36] [INFO ] Invariant cache hit.
[2023-03-19 12:34:36] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-19 12:34:36] [INFO ] Invariant cache hit.
[2023-03-19 12:34:36] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s47 s22)], 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 4995 reset in 689 ms.
Stack based approach found an accepted trace after 82571 steps with 4072 reset with depth 29 and stack size 29 in 588 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-09 finished in 1889 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(F(p0))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:38] [INFO ] Invariant cache hit.
[2023-03-19 12:34:38] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 12:34:38] [INFO ] Invariant cache hit.
[2023-03-19 12:34:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-19 12:34:38] [INFO ] Invariant cache hit.
[2023-03-19 12:34:38] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s62 s46)], 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]]
Stuttering criterion allowed to conclude after 13666 steps with 3482 reset in 65 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-10 finished in 504 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((G(F(p0))||(F(p0)&&F(p1))))) U G(p1)))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:38] [INFO ] Invariant cache hit.
[2023-03-19 12:34:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 12:34:38] [INFO ] Invariant cache hit.
[2023-03-19 12:34:39] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-19 12:34:39] [INFO ] Invariant cache hit.
[2023-03-19 12:34:39] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 434 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GT s49 s48), p0:(GT s65 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2756 reset in 642 ms.
Product exploration explored 100000 steps with 2544 reset in 557 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 423 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 509 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 504 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 461 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 447 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
[2023-03-19 12:34:43] [INFO ] Invariant cache hit.
[2023-03-19 12:34:43] [INFO ] [Real]Absence check using 28 positive place invariants in 15 ms returned sat
[2023-03-19 12:34:43] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:34:43] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-19 12:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:34:43] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2023-03-19 12:34:43] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 12:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:34:43] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-19 12:34:43] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-19 12:34:43] [INFO ] Added : 23 causal constraints over 5 iterations in 101 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:43] [INFO ] Invariant cache hit.
[2023-03-19 12:34:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 12:34:43] [INFO ] Invariant cache hit.
[2023-03-19 12:34:43] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-19 12:34:43] [INFO ] Invariant cache hit.
[2023-03-19 12:34:44] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 68/68 places, 72/72 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 p1) p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 435 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Finished random walk after 155 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 512 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
[2023-03-19 12:34:46] [INFO ] Invariant cache hit.
[2023-03-19 12:34:46] [INFO ] [Real]Absence check using 28 positive place invariants in 24 ms returned sat
[2023-03-19 12:34:46] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:34:46] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-19 12:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:34:46] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-19 12:34:46] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 12:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:34:46] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-19 12:34:46] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 12:34:46] [INFO ] Added : 23 causal constraints over 5 iterations in 85 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 427 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2786 reset in 595 ms.
Stuttering criterion allowed to conclude after 1882 steps with 44 reset in 11 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-11 finished in 9031 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))||G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:47] [INFO ] Invariant cache hit.
[2023-03-19 12:34:48] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-19 12:34:48] [INFO ] Invariant cache hit.
[2023-03-19 12:34:48] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-19 12:34:48] [INFO ] Invariant cache hit.
[2023-03-19 12:34:48] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT 1 s7), p1:(GT s0 s36)], 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]]
Stuttering criterion allowed to conclude after 3970 steps with 2 reset in 21 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-13 finished in 648 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||X(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-19 12:34:48] [INFO ] Invariant cache hit.
[2023-03-19 12:34:48] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-19 12:34:48] [INFO ] Invariant cache hit.
[2023-03-19 12:34:48] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-19 12:34:48] [INFO ] Invariant cache hit.
[2023-03-19 12:34:48] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SquareGrid-PT-020102-LTLCardinality-15 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s7 s24), p1:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 5 reset in 0 ms.
FORMULA SquareGrid-PT-020102-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLCardinality-15 finished in 602 ms.
All properties solved by simple procedures.
Total runtime 21994 ms.
ITS solved all properties within timeout

BK_STOP 1679229290459

--------------------
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

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="SquareGrid-PT-020102"
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 SquareGrid-PT-020102, 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 r455-smll-167912647300355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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