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-171690585400042.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-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585400042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.9K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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-50-LTLCardinality-00
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-01
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-02
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-03
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-04
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-05
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-06
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-07
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-08
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-09
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-10
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-11
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-12
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-13
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-14
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716992128889

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-50
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 14:15:31] [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]
[2024-05-29 14:15:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:15:31] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-05-29 14:15:31] [WARNING] Unknown XML tag in source file: size
[2024-05-29 14:15:31] [WARNING] Unknown XML tag in source file: color
[2024-05-29 14:15:31] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-29 14:15:31] [INFO ] Transformed 30 places.
[2024-05-29 14:15:31] [INFO ] Transformed 32 transitions.
[2024-05-29 14:15:31] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TCPcondis-PT-50-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA TCPcondis-PT-50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 20 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 14:15:32] [INFO ] Computed 9 invariants in 7 ms
[2024-05-29 14:15:32] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-29 14:15:32] [INFO ] Invariant cache hit.
[2024-05-29 14:15:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-29 14:15:32] [INFO ] Invariant cache hit.
[2024-05-29 14:15:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 21 out of 30 places after structural reductions.
[2024-05-29 14:15:32] [INFO ] Flatten gal took : 29 ms
[2024-05-29 14:15:33] [INFO ] Flatten gal took : 10 ms
[2024-05-29 14:15:33] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 2041 steps, including 0 resets, run visited all 29 properties in 32 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-06 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(F((G(F(!p0))||(F(!p0)&&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 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 14:15:33] [INFO ] Invariant cache hit.
[2024-05-29 14:15:33] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:15:33] [INFO ] Invariant cache hit.
[2024-05-29 14:15:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-29 14:15:33] [INFO ] Invariant cache hit.
[2024-05-29 14:15:33] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 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 408 ms :[p0, p0, p0]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT s8 s4) (LEQ s26 s6)), p0:(OR (LEQ s8 s4) (LEQ 3 s21))], 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 631 reset in 516 ms.
Product exploration explored 100000 steps with 678 reset in 364 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[p0, p0, p0, false, (AND p1 p0)]
Finished random walk after 5915 steps, including 1 resets, run visited all 4 properties in 28 ms. (steps per millisecond=211 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[p0, p0, p0, false, (AND p1 p0)]
Stuttering acceptance computed with spot in 262 ms :[p0, p0, p0, false, (AND p1 p0)]
[2024-05-29 14:15:36] [INFO ] Invariant cache hit.
[2024-05-29 14:15:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 14:15:36] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-29 14:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-29 14:15:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:15:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 14:15:36] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-29 14:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-29 14:15:36] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 14:15:36] [INFO ] Added : 23 causal constraints over 5 iterations in 91 ms. Result :sat
Could not prove EG p0
Support contains 5 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 4 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 2 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 43 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 14:15:36] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:15:37] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 14:15:37] [INFO ] Invariant cache hit.
[2024-05-29 14:15:37] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-29 14:15:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:37] [INFO ] Invariant cache hit.
[2024-05-29 14:15:37] [INFO ] Dead Transitions using invariants and state equation in 54 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 553 ms. Remains : 24/30 places, 24/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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[p0, p0, p0, false, (AND p1 p0)]
Finished random walk after 5459 steps, including 1 resets, run visited all 4 properties in 30 ms. (steps per millisecond=181 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 244 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[p0, p0, p0, false, (AND p1 p0)]
Stuttering acceptance computed with spot in 232 ms :[p0, p0, p0, false, (AND p1 p0)]
[2024-05-29 14:15:38] [INFO ] Invariant cache hit.
[2024-05-29 14:15:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 14:15:38] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-29 14:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-29 14:15:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:15:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 14:15:38] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-29 14:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:38] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-29 14:15:38] [INFO ] Computed and/alt/rep : 22/78/22 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 14:15:38] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 234 ms :[p0, p0, p0, false, (AND p1 p0)]
Product exploration explored 100000 steps with 755 reset in 470 ms.
Stack based approach found an accepted trace after 7018 steps with 47 reset with depth 23 and stack size 23 in 40 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-01 finished in 5902 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||F(G(p1)))))'
Support contains 2 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.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 14:15:39] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 14:15:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 14:15:39] [INFO ] Invariant cache hit.
[2024-05-29 14:15:39] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-29 14:15:39] [INFO ] Invariant cache hit.
[2024-05-29 14:15:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-02 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:(LEQ 2 s29), p1:(LEQ 1 s25)], 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 273 ms.
Product exploration explored 100000 steps with 0 reset in 536 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2024-05-29 14:15:41] [INFO ] Invariant cache hit.
[2024-05-29 14:15:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 14:15:41] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 14:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-29 14:15:41] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 14:15:41] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 30 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 : 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 13 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 14:15:41] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:15:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 14:15:41] [INFO ] Invariant cache hit.
[2024-05-29 14:15:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-29 14:15:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:41] [INFO ] Invariant cache hit.
[2024-05-29 14:15:41] [INFO ] Dead Transitions using invariants and state equation in 51 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 198 ms. Remains : 24/30 places, 24/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 : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1)]
[2024-05-29 14:15:42] [INFO ] Invariant cache hit.
[2024-05-29 14:15:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 14:15:42] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-29 14:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-29 14:15:42] [INFO ] Computed and/alt/rep : 22/79/22 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 14:15:42] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 291 ms.
Stack based approach found an accepted trace after 23309 steps with 0 reset with depth 23310 and stack size 23310 in 62 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-02 finished in 3173 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||G(p1)||G((p2 U p0))))))'
Support contains 4 out of 30 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 : 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
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 28 transition count 29
Applied a total of 5 rules in 4 ms. Remains 28 /30 variables (removed 2) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 28 cols
[2024-05-29 14:15:42] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:15:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 14:15:42] [INFO ] Invariant cache hit.
[2024-05-29 14:15:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 14:15:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:15:42] [INFO ] Invariant cache hit.
[2024-05-29 14:15:42] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 29/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 28/30 places, 29/32 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-04 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)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s4 s9), p0:(LEQ s0 s14)], 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 0 reset in 221 ms.
Product exploration explored 100000 steps with 0 reset in 242 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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1939 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=387 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 28 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 : 28/28 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 14:15:44] [INFO ] Invariant cache hit.
[2024-05-29 14:15:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 14:15:44] [INFO ] Invariant cache hit.
[2024-05-29 14:15:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-29 14:15:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:44] [INFO ] Invariant cache hit.
[2024-05-29 14:15:44] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 28/28 places, 29/29 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1123 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=561 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 365 ms.
Product exploration explored 100000 steps with 0 reset in 473 ms.
Built C files in :
/tmp/ltsmin5613732015638674378
[2024-05-29 14:15:46] [INFO ] Computing symmetric may disable matrix : 29 transitions.
[2024-05-29 14:15:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:46] [INFO ] Computing symmetric may enable matrix : 29 transitions.
[2024-05-29 14:15:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:46] [INFO ] Computing Do-Not-Accords matrix : 29 transitions.
[2024-05-29 14:15:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:46] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5613732015638674378
Running compilation step : cd /tmp/ltsmin5613732015638674378;'/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 453 ms.
Running link step : cd /tmp/ltsmin5613732015638674378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin5613732015638674378;'/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/stateBased12724975058683520334.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLCardinality-04 finished in 4355 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 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.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 14:15:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:15:47] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 14:15:47] [INFO ] Invariant cache hit.
[2024-05-29 14:15:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-29 14:15:47] [INFO ] Invariant cache hit.
[2024-05-29 14:15:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-05 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 s10)], 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 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-05 finished in 604 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 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 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 11 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-29 14:15:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:15:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 14:15:47] [INFO ] Invariant cache hit.
[2024-05-29 14:15:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-29 14:15:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:47] [INFO ] Invariant cache hit.
[2024-05-29 14:15:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-07 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:(GT 2 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 69 reset in 346 ms.
Stack based approach found an accepted trace after 3361 steps with 1 reset with depth 1706 and stack size 1706 in 18 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-07 finished in 672 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||G(p1)||X(p2)||G(p3))))))'
Support contains 7 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.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 14:15:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:15:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 14:15:48] [INFO ] Invariant cache hit.
[2024-05-29 14:15:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-29 14:15:48] [INFO ] Invariant cache hit.
[2024-05-29 14:15:48] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 580 ms :[true, (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 9}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p3), 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: 6}], [{ cond=(NOT p3), acceptance={} source=8 dest: 0}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=10 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p1 p3), acceptance={} source=10 dest: 10}]], initial=7, aps=[p2:(LEQ s23 s2), p0:(AND (LEQ s23 s2) (LEQ 1 s1)), p1:(LEQ s24 s26), p3:(LEQ s14 s29)], 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, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-08 finished in 776 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((F(G(p0))&&G(p1))))'
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 7 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 14:15:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:15:49] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 14:15:49] [INFO ] Invariant cache hit.
[2024-05-29 14:15:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-29 14:15:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:49] [INFO ] Invariant cache hit.
[2024-05-29 14:15:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s10), p0:(GT s1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stack based approach found an accepted trace after 14588 steps with 0 reset with depth 14589 and stack size 14589 in 46 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-09 finished in 559 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||G(p1)))))'
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 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
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 28 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 5 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 14:15:49] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:15:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 14:15:49] [INFO ] Invariant cache hit.
[2024-05-29 14:15:49] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-29 14:15:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:49] [INFO ] Invariant cache hit.
[2024-05-29 14:15:49] [INFO ] Dead Transitions using invariants and state equation in 35 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 134 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-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)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s15 s13), p0:(LEQ s6 s4)], 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 394 reset in 378 ms.
Product exploration explored 100000 steps with 408 reset in 271 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), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4137 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=689 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-29 14:15:50] [INFO ] Invariant cache hit.
[2024-05-29 14:15:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 14:15:51] [INFO ] Invariant cache hit.
[2024-05-29 14:15:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-29 14:15:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:15:51] [INFO ] Invariant cache hit.
[2024-05-29 14:15:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 26/26 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1327 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=331 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 395 reset in 361 ms.
Product exploration explored 100000 steps with 388 reset in 328 ms.
Built C files in :
/tmp/ltsmin5398644040464632176
[2024-05-29 14:15:52] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2024-05-29 14:15:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:52] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2024-05-29 14:15:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:52] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2024-05-29 14:15:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5398644040464632176
Running compilation step : cd /tmp/ltsmin5398644040464632176;'/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 132 ms.
Running link step : cd /tmp/ltsmin5398644040464632176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5398644040464632176;'/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/stateBased14092820527061385318.hoa' '--buchi-type=spotba'
LTSmin run took 879 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLCardinality-10 finished in 3806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(p1))))'
Support contains 2 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.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 14:15:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:15:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 14:15:53] [INFO ] Invariant cache hit.
[2024-05-29 14:15:53] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-29 14:15:53] [INFO ] Invariant cache hit.
[2024-05-29 14:15:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s12), p1:(GT 3 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-11 finished in 505 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))||(p1&&X(p2))) U X(p3)))'
Support contains 7 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 14:15:53] [INFO ] Invariant cache hit.
[2024-05-29 14:15:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 14:15:53] [INFO ] Invariant cache hit.
[2024-05-29 14:15:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-29 14:15:54] [INFO ] Invariant cache hit.
[2024-05-29 14:15:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), true, (NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p3 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(GT s15 s24), p1:(LEQ s24 s2), p3:(OR (LEQ s10 s25) (LEQ 1 s4)), p2:(GT 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 960 steps with 34 reset in 4 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-12 finished in 408 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((((p0 U p1) U p2)&&F(p0)&&G(p3)))))'
Support contains 6 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 14:15:54] [INFO ] Invariant cache hit.
[2024-05-29 14:15:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 14:15:54] [INFO ] Invariant cache hit.
[2024-05-29 14:15:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 14:15:54] [INFO ] Invariant cache hit.
[2024-05-29 14:15:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p0), (NOT p3)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p2 (NOT p0) p3) (AND p1 (NOT p0) p3)), acceptance={} source=2 dest: 6}, { cond=(OR (AND p2 p3) (AND p1 p3) (AND p0 p3)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 3}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s4 s8), p1:(LEQ 1 s18), p0:(LEQ s24 s16), p3:(LEQ 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-13 finished in 587 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)&&(!p0||G(p1)))))'
Support contains 3 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 14:15:54] [INFO ] Invariant cache hit.
[2024-05-29 14:15:54] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 14:15:54] [INFO ] Invariant cache hit.
[2024-05-29 14:15:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 14:15:55] [INFO ] Invariant cache hit.
[2024-05-29 14:15:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=2, aps=[p0:(LEQ 1 s29), p1:(GT s8 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1534 reset in 306 ms.
Product exploration explored 100000 steps with 1533 reset in 331 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1893 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=631 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-29 14:15:56] [INFO ] Invariant cache hit.
[2024-05-29 14:15:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 14:15:56] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 14:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-29 14:15:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:15:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 14:15:56] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 14:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:56] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-29 14:15:56] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 14:15:56] [INFO ] Added : 25 causal constraints over 5 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 30 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 : 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
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 28 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 7 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 14:15:56] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 14:15:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 14:15:56] [INFO ] Invariant cache hit.
[2024-05-29 14:15:56] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-29 14:15:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:15:56] [INFO ] Invariant cache hit.
[2024-05-29 14:15:56] [INFO ] Dead Transitions using invariants and state equation in 38 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 151 ms. Remains : 26/30 places, 26/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 460 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=230 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-29 14:15:57] [INFO ] Invariant cache hit.
[2024-05-29 14:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 14:15:57] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-29 14:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-29 14:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 14:15:57] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-29 14:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:15:57] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-29 14:15:57] [INFO ] Computed and/alt/rep : 24/83/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 14:15:57] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2055 reset in 168 ms.
Stack based approach found an accepted trace after 2435 steps with 52 reset with depth 13 and stack size 13 in 5 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-14 finished in 2632 ms.
All properties solved by simple procedures.
Total runtime 25911 ms.

BK_STOP 1716992158587

--------------------
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="TCPcondis-PT-50"
export BK_EXAMINATION="LTLCardinality"
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-50, 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 r439-smll-171690585400042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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