fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r439-smll-171690585300003
Last Updated
July 7, 2024

About the Execution of 2023-gold for TCPcondis-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
347.212 20374.00 34724.00 447.00 FFFFFTFFFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r439-smll-171690585300003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is TCPcondis-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585300003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 03:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 03:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 24K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716982495897

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 11:34:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 11:34:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:34:59] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-05-29 11:34:59] [WARNING] Unknown XML tag in source file: size
[2024-05-29 11:34:59] [WARNING] Unknown XML tag in source file: color
[2024-05-29 11:34:59] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-29 11:34:59] [INFO ] Transformed 30 places.
[2024-05-29 11:34:59] [INFO ] Transformed 32 transitions.
[2024-05-29 11:34:59] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TCPcondis-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 23 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:59] [INFO ] Computed 9 invariants in 9 ms
[2024-05-29 11:35:00] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-29 11:35:00] [INFO ] Invariant cache hit.
[2024-05-29 11:35:00] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-29 11:35:00] [INFO ] Invariant cache hit.
[2024-05-29 11:35:00] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 25 out of 30 places after structural reductions.
[2024-05-29 11:35:00] [INFO ] Flatten gal took : 40 ms
[2024-05-29 11:35:00] [INFO ] Flatten gal took : 16 ms
[2024-05-29 11:35:00] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 142 steps, including 0 resets, run visited all 23 properties in 33 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
FORMULA TCPcondis-PT-05-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:35:01] [INFO ] Invariant cache hit.
[2024-05-29 11:35:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 11:35:01] [INFO ] Invariant cache hit.
[2024-05-29 11:35:01] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-29 11:35:01] [INFO ] Invariant cache hit.
[2024-05-29 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 30/30 places, 32/32 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 383 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s3 1), p1:(AND (LT s9 1) (OR (LT s13 1) (LT s25 1) (LT s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 697 ms.
Stack based approach found an accepted trace after 1462 steps with 0 reset with depth 1463 and stack size 1463 in 22 ms.
FORMULA TCPcondis-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-00 finished in 1468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 31 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2024-05-29 11:35:02] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 11:35:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 11:35:02] [INFO ] Invariant cache hit.
[2024-05-29 11:35:03] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 11:35:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:35:03] [INFO ] Invariant cache hit.
[2024-05-29 11:35:03] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2899 reset in 380 ms.
Stack based approach found an accepted trace after 189 steps with 4 reset with depth 29 and stack size 29 in 1 ms.
FORMULA TCPcondis-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-01 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(F(G(p1)) U p2))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:35:03] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:35:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 11:35:03] [INFO ] Invariant cache hit.
[2024-05-29 11:35:03] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-29 11:35:03] [INFO ] Invariant cache hit.
[2024-05-29 11:35:03] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s3 1), p0:(AND (GEQ s6 1) (GEQ s19 1)), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 315 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 1 ms.
FORMULA TCPcondis-PT-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-02 finished in 907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&F(p2)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:35:04] [INFO ] Invariant cache hit.
[2024-05-29 11:35:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 11:35:04] [INFO ] Invariant cache hit.
[2024-05-29 11:35:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-29 11:35:04] [INFO ] Invariant cache hit.
[2024-05-29 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s0 1), p2:(AND (GEQ s10 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-03 finished in 475 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((p0&&X((F((X(p2)&&p1))||G(!p3))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:35:05] [INFO ] Invariant cache hit.
[2024-05-29 11:35:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 11:35:05] [INFO ] Invariant cache hit.
[2024-05-29 11:35:05] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 11:35:05] [INFO ] Invariant cache hit.
[2024-05-29 11:35:05] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) p3) (AND (NOT p2) p3)), (OR (NOT p0) (AND (NOT p1) p3) (AND (NOT p2) p3)), (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), (AND (NOT p2) p3), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 p3 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s24 1)), p2:(AND (GEQ s13 1) (GEQ s25 1)), p0:(OR (LT s24 1) (LT s10 1) (LT s15 1)), p3:(AND (GEQ s24 1) (GEQ s10 1) (GEQ s24 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5771 reset in 346 ms.
Product exploration explored 100000 steps with 5835 reset in 483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0 (NOT p3)), (X p0), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), (AND (NOT p2) p3), (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), (OR (AND (NOT p1) p3) (AND (NOT p2) p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:35:07] [INFO ] Invariant cache hit.
[2024-05-29 11:35:07] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0 (NOT p3)), (X p0), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (G (NOT (AND (NOT p1) p3))), (G (NOT (AND (NOT p1) p3 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (AND p1 p3)), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p3 (NOT p2))), (F (AND p1 (NOT p3) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2))))]
Knowledge based reduction with 7 factoid took 604 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:35:08] [INFO ] Invariant cache hit.
[2024-05-29 11:35:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 11:35:08] [INFO ] Invariant cache hit.
[2024-05-29 11:35:08] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-29 11:35:08] [INFO ] Invariant cache hit.
[2024-05-29 11:35:08] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 30/30 places, 32/32 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) (NOT p2) (NOT p3)), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Finished random walk after 355 steps, including 0 resets, run visited all 7 properties in 6 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p3)), (X (X (NOT p3))), (F (AND p1 (NOT p3))), (F p3), (F (AND p1 (NOT p3) (NOT p2))), (F (AND p3 (NOT p2))), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 347 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 5938 reset in 306 ms.
Stack based approach found an accepted trace after 27243 steps with 1535 reset with depth 116 and stack size 116 in 109 ms.
FORMULA TCPcondis-PT-05-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-04 finished in 6447 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((p1&&F(!p0)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 13 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-29 11:35:11] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:35:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 11:35:11] [INFO ] Invariant cache hit.
[2024-05-29 11:35:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 11:35:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:35:11] [INFO ] Invariant cache hit.
[2024-05-29 11:35:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 129 ms :[p0, p0, p0]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s11 1), p0:(AND (GEQ s5 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 395 steps with 0 reset with depth 396 and stack size 396 in 1 ms.
FORMULA TCPcondis-PT-05-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-06 finished in 534 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(F(p0))||G((p1&&F(p2))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 7 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 11:35:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:35:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 11:35:12] [INFO ] Invariant cache hit.
[2024-05-29 11:35:12] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 11:35:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:35:12] [INFO ] Invariant cache hit.
[2024-05-29 11:35:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s9 1) (LT s21 1)), p0:(OR (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s1 1) (GEQ s16 1))), p2:(AND (GEQ s1 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12344 reset in 167 ms.
Stack based approach found an accepted trace after 50483 steps with 6191 reset with depth 14 and stack size 14 in 93 ms.
FORMULA TCPcondis-PT-05-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-10 finished in 549 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 (p1||X(p1)))||F(p2)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:35:12] [INFO ] Computed 9 invariants in 4 ms
[2024-05-29 11:35:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 11:35:12] [INFO ] Invariant cache hit.
[2024-05-29 11:35:12] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-29 11:35:12] [INFO ] Invariant cache hit.
[2024-05-29 11:35:12] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}]], initial=1, aps=[p2:(AND (GEQ s5 1) (GEQ s17 1)), p1:(AND (GEQ s2 1) (GEQ s20 1)), p0:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2086 reset in 289 ms.
Stack based approach found an accepted trace after 14146 steps with 290 reset with depth 108 and stack size 108 in 42 ms.
FORMULA TCPcondis-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-11 finished in 702 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)&&F(G((p1&&(F(p2)||G(p3))))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 26 transition count 27
Applied a total of 9 rules in 12 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2024-05-29 11:35:13] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:35:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 11:35:13] [INFO ] Invariant cache hit.
[2024-05-29 11:35:13] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-29 11:35:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:35:13] [INFO ] Invariant cache hit.
[2024-05-29 11:35:13] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s9 1), p1:(GEQ s0 1), p2:(AND (GEQ s10 1) (GEQ s25 1)), p3:(AND (GEQ s4 1) (GEQ s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 12016 reset in 282 ms.
Stack based approach found an accepted trace after 8109 steps with 963 reset with depth 67 and stack size 67 in 25 ms.
FORMULA TCPcondis-PT-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-13 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 15 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2024-05-29 11:35:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:35:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 11:35:14] [INFO ] Invariant cache hit.
[2024-05-29 11:35:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-29 11:35:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:35:14] [INFO ] Invariant cache hit.
[2024-05-29 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10148 reset in 213 ms.
Stack based approach found an accepted trace after 9823 steps with 1018 reset with depth 15 and stack size 15 in 23 ms.
FORMULA TCPcondis-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-14 finished in 576 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 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 8 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2024-05-29 11:35:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:35:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 11:35:14] [INFO ] Invariant cache hit.
[2024-05-29 11:35:14] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-29 11:35:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:35:14] [INFO ] Invariant cache hit.
[2024-05-29 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-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:(AND (GEQ s4 1) (GEQ s13 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 291 ms.
Stack based approach found an accepted trace after 240 steps with 0 reset with depth 241 and stack size 241 in 1 ms.
FORMULA TCPcondis-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-15 finished in 569 ms.
All properties solved by simple procedures.
Total runtime 15953 ms.

BK_STOP 1716982516271

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is TCPcondis-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r439-smll-171690585300003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-05.tgz
mv TCPcondis-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;