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

About the Execution of ITS-Tools for Murphy-PT-D2N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
427.840 14398.00 21560.00 377.20 FTTFFFFTFFFTFFFF 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.r517-tall-167987243700347.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 itstools
Input is Murphy-PT-D2N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243700347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N100-LTLCardinality-00
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-01
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-02
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-03
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-04
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-05
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-06
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-07
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-08
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-09
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-10
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-11
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-12
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-13
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-14
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680937690442

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-08 07:08:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-08 07:08:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:08:12] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-08 07:08:12] [INFO ] Transformed 18 places.
[2023-04-08 07:08:12] [INFO ] Transformed 21 transitions.
[2023-04-08 07:08:12] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-PT-D2N100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 16 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:08:12] [INFO ] Computed 4 invariants in 8 ms
[2023-04-08 07:08:12] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
[2023-04-08 07:08:12] [INFO ] Invariant cache hit.
[2023-04-08 07:08:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:08:12] [INFO ] Invariant cache hit.
[2023-04-08 07:08:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:08:12] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-04-08 07:08:12] [INFO ] Invariant cache hit.
[2023-04-08 07:08:12] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 17 out of 18 places after structural reductions.
[2023-04-08 07:08:13] [INFO ] Flatten gal took : 17 ms
[2023-04-08 07:08:13] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:08:13] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:08:13] [INFO ] Invariant cache hit.
[2023-04-08 07:08:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:13] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:08:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:13] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-04-08 07:08:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:08:13] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-04-08 07:08:13] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-08 07:08:13] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Graph (complete) has 69 edges and 18 vertex of which 6 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 8
Applied a total of 3 rules in 7 ms. Remains 6 /18 variables (removed 12) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-04-08 07:08:13] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:08:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 6/18 places, 8/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Probably explored full state space saw : 36 states, properties seen :0
Probabilistic random walk after 132 steps, saw 36 distinct states, run finished after 13 ms. (steps per millisecond=10 ) properties seen :0
Explored full state space saw : 36 states, properties seen :0
Exhaustive walk after 132 steps, saw 36 distinct states, run finished after 2 ms. (steps per millisecond=66 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA Murphy-PT-D2N100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((!p0||X(p1)))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:08:14] [INFO ] Computed 4 invariants in 1 ms
[2023-04-08 07:08:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:08:14] [INFO ] Invariant cache hit.
[2023-04-08 07:08:14] [INFO ] Implicit Places using invariants in 32 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 16/18 places, 21/21 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s6), p1:(OR (GT 1 s0) (GT s14 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 351 ms.
Stack based approach found an accepted trace after 49 steps with 4 reset with depth 39 and stack size 38 in 2 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-00 finished in 849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X((X(p1)||G(!p0)))))))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:14] [INFO ] Invariant cache hit.
[2023-04-08 07:08:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:08:14] [INFO ] Invariant cache hit.
[2023-04-08 07:08:14] [INFO ] Implicit Places using invariants in 27 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 6}]], initial=7, aps=[p1:(GT s1 s6), p0:(GT s5 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 251 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 9 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Finished random walk after 106 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 9 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 15 cols
[2023-04-08 07:08:16] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:08:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:08:16] [INFO ] Invariant cache hit.
[2023-04-08 07:08:16] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:08:16] [INFO ] Invariant cache hit.
[2023-04-08 07:08:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:08:16] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:08:16] [INFO ] Invariant cache hit.
[2023-04-08 07:08:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 15/15 places, 21/21 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 9 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Finished random walk after 338 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=338 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 9 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Entered a terminal (fully accepting) state of product in 26692 steps with 0 reset in 49 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-03 finished in 4019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:08:18] [INFO ] Computed 4 invariants in 0 ms
[2023-04-08 07:08:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-08 07:08:18] [INFO ] Invariant cache hit.
[2023-04-08 07:08:18] [INFO ] Implicit Places using invariants in 29 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s9)], 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 32829 reset in 115 ms.
Stack based approach found an accepted trace after 94 steps with 38 reset with depth 4 and stack size 4 in 1 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-04 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:19] [INFO ] Invariant cache hit.
[2023-04-08 07:08:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:08:19] [INFO ] Invariant cache hit.
[2023-04-08 07:08:19] [INFO ] Implicit Places using invariants in 50 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s6), p1:(GT s0 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 321 reset in 139 ms.
Stack based approach found an accepted trace after 174 steps with 16 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-05 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:19] [INFO ] Invariant cache hit.
[2023-04-08 07:08:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 07:08:19] [INFO ] Invariant cache hit.
[2023-04-08 07:08:19] [INFO ] Implicit Places using invariants in 21 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s3 s6) (LEQ 3 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 72 reset in 129 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-08 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:19] [INFO ] Invariant cache hit.
[2023-04-08 07:08:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:08:19] [INFO ] Invariant cache hit.
[2023-04-08 07:08:19] [INFO ] Implicit Places using invariants in 39 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s14 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8805 reset in 132 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-10 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((!p0&&G(p1)) U p2))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:20] [INFO ] Invariant cache hit.
[2023-04-08 07:08:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:08:20] [INFO ] Invariant cache hit.
[2023-04-08 07:08:20] [INFO ] Implicit Places using invariants in 20 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s4), p2:(LEQ 1 s9), p1:(LEQ s7 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-12 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p0) U (p1||F(p2)))||G(p3)))))'
Support contains 5 out of 18 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 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:20] [INFO ] Invariant cache hit.
[2023-04-08 07:08:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 07:08:20] [INFO ] Invariant cache hit.
[2023-04-08 07:08:20] [INFO ] Implicit Places using invariants in 22 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s11 s6), p3:(AND (GT s11 s6) (GT 1 s0)), p2:(LEQ s2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 154 ms.
Stack based approach found an accepted trace after 15011 steps with 0 reset with depth 15012 and stack size 14406 in 29 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-13 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((p1||G(p2)))))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:08:20] [INFO ] Invariant cache hit.
[2023-04-08 07:08:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:08:20] [INFO ] Invariant cache hit.
[2023-04-08 07:08:20] [INFO ] Implicit Places using invariants in 34 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 1 s1), p1:(LEQ 2 s3), p0:(LEQ 1 s12)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 39 reset in 227 ms.
Product exploration explored 100000 steps with 35 reset in 136 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 p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1297 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=162 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 15 cols
[2023-04-08 07:08:21] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:08:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:08:21] [INFO ] Invariant cache hit.
[2023-04-08 07:08:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:08:21] [INFO ] Invariant cache hit.
[2023-04-08 07:08:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:08:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 07:08:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:08:21] [INFO ] Invariant cache hit.
[2023-04-08 07:08:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 15/15 places, 21/21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 3535 steps, including 1 resets, run visited all 5 properties in 12 ms. (steps per millisecond=294 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 357 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 39 reset in 133 ms.
Product exploration explored 100000 steps with 39 reset in 148 ms.
Built C files in :
/tmp/ltsmin7891583936711526698
[2023-04-08 07:08:23] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2023-04-08 07:08:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:23] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2023-04-08 07:08:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:23] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2023-04-08 07:08:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7891583936711526698
Running compilation step : cd /tmp/ltsmin7891583936711526698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 247 ms.
Running link step : cd /tmp/ltsmin7891583936711526698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7891583936711526698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5182250361768656285.hoa' '--buchi-type=spotba'
LTSmin run took 157 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Murphy-PT-D2N100-LTLCardinality-14 finished in 2798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:08:23] [INFO ] Computed 4 invariants in 5 ms
[2023-04-08 07:08:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:08:23] [INFO ] Invariant cache hit.
[2023-04-08 07:08:23] [INFO ] Implicit Places using invariants in 25 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-15 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 s14 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 2046 steps with 0 reset with depth 2047 and stack size 1975 in 4 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-15 finished in 262 ms.
All properties solved by simple procedures.
Total runtime 11537 ms.

BK_STOP 1680937704840

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D2N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Murphy-PT-D2N100, 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 r517-tall-167987243700347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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