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.r197-tall-171640625400337.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 GPUForwardProgress-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625400337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 22:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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 GPUForwardProgress-PT-20b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-20b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716554871919

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=GPUForwardProgress-PT-20b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 12:47:53] [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-24 12:47:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:47:53] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-24 12:47:53] [INFO ] Transformed 416 places.
[2024-05-24 12:47:53] [INFO ] Transformed 437 transitions.
[2024-05-24 12:47:53] [INFO ] Found NUPN structural information;
[2024-05-24 12:47:53] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 369 transition count 391
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 369 transition count 391
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 115 place count 347 transition count 369
Iterating global reduction 1 with 22 rules applied. Total rules applied 137 place count 347 transition count 369
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 156 place count 347 transition count 350
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 346 transition count 349
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 346 transition count 349
Applied a total of 158 rules in 89 ms. Remains 346 /416 variables (removed 70) and now considering 349/437 (removed 88) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-24 12:47:53] [INFO ] Computed 21 invariants in 23 ms
[2024-05-24 12:47:54] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-24 12:47:54] [INFO ] Invariant cache hit.
[2024-05-24 12:47:54] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-24 12:47:54] [INFO ] Invariant cache hit.
[2024-05-24 12:47:54] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 346/416 places, 349/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 346/416 places, 349/437 transitions.
Support contains 17 out of 346 places after structural reductions.
[2024-05-24 12:47:54] [INFO ] Flatten gal took : 47 ms
[2024-05-24 12:47:54] [INFO ] Flatten gal took : 23 ms
[2024-05-24 12:47:54] [INFO ] Input system was already deterministic with 349 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:47:55] [INFO ] Invariant cache hit.
[2024-05-24 12:47:55] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 11 ms returned sat
[2024-05-24 12:47:55] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 12:47:55] [INFO ] After 148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 12:47:55] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 349/349 transitions.
Graph (trivial) has 284 edges and 346 vertex of which 6 / 346 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 531 edges and 341 vertex of which 317 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 165 rules applied. Total rules applied 167 place count 317 transition count 174
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 165 rules applied. Total rules applied 332 place count 154 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 333 place count 153 transition count 172
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 333 place count 153 transition count 129
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 419 place count 110 transition count 129
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 440 place count 89 transition count 108
Iterating global reduction 3 with 21 rules applied. Total rules applied 461 place count 89 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 461 place count 89 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 463 place count 88 transition count 107
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 585 place count 27 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 587 place count 26 transition count 45
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 589 place count 26 transition count 43
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 607 place count 8 transition count 7
Iterating global reduction 5 with 18 rules applied. Total rules applied 625 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 628 place count 6 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 7 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 630 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 631 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 632 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 633 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 633 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 635 place count 2 transition count 2
Applied a total of 635 rules in 39 ms. Remains 2 /346 variables (removed 344) and now considering 2/349 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 2/346 places, 2/349 transitions.
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.
Computed a total of 64 stabilizing places and 64 stable transitions
Graph (complete) has 538 edges and 346 vertex of which 322 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.11 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&&X((p0 U (X(!p1)||G(p0))))))))'
Support contains 1 out of 346 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 345 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 345 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 345 transition count 347
Applied a total of 3 rules in 19 ms. Remains 345 /346 variables (removed 1) and now considering 347/349 (removed 2) transitions.
// Phase 1: matrix 347 rows 345 cols
[2024-05-24 12:47:55] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:47:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 12:47:55] [INFO ] Invariant cache hit.
[2024-05-24 12:47:55] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-24 12:47:55] [INFO ] Invariant cache hit.
[2024-05-24 12:47:56] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/346 places, 347/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 345/346 places, 347/349 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 189 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 32812 steps with 186 reset in 164 ms.
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-01 finished in 950 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(!F(p0))) U X(p1)))'
Support contains 4 out of 346 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 345 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 345 transition count 348
Applied a total of 2 rules in 17 ms. Remains 345 /346 variables (removed 1) and now considering 348/349 (removed 1) transitions.
// Phase 1: matrix 348 rows 345 cols
[2024-05-24 12:47:56] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:47:56] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 12:47:56] [INFO ] Invariant cache hit.
[2024-05-24 12:47:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-24 12:47:56] [INFO ] Invariant cache hit.
[2024-05-24 12:47:56] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/346 places, 348/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 345/346 places, 348/349 transitions.
Stuttering acceptance computed with spot in 182 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s275 0) (EQ s63 1)), p1:(OR (EQ s275 0) (EQ s63 1) (EQ s155 0) (EQ s104 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 537 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.15 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-04 finished in 1302 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 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Graph (trivial) has 283 edges and 346 vertex of which 6 / 346 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 532 edges and 341 vertex of which 317 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 316 transition count 179
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 324 place count 156 transition count 177
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 327 place count 155 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 329 place count 153 transition count 175
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 329 place count 153 transition count 131
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 417 place count 109 transition count 131
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 436 place count 90 transition count 112
Iterating global reduction 4 with 19 rules applied. Total rules applied 455 place count 90 transition count 112
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 577 place count 29 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 578 place count 29 transition count 50
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 597 place count 10 transition count 13
Iterating global reduction 5 with 19 rules applied. Total rules applied 616 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 618 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 619 place count 8 transition count 11
Applied a total of 619 rules in 28 ms. Remains 8 /346 variables (removed 338) and now considering 11/349 (removed 338) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:47:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:47:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 12:47:57] [INFO ] Invariant cache hit.
[2024-05-24 12:47:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:47:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 12:47:57] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:47:57] [INFO ] Invariant cache hit.
[2024-05-24 12:47:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/346 places, 11/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 8/346 places, 11/349 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-05 finished in 180 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)))'
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 344 transition count 347
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 344 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 344 transition count 346
Applied a total of 5 rules in 25 ms. Remains 344 /346 variables (removed 2) and now considering 346/349 (removed 3) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:47:57] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:47:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 12:47:58] [INFO ] Invariant cache hit.
[2024-05-24 12:47:58] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-24 12:47:58] [INFO ] Invariant cache hit.
[2024-05-24 12:47:58] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/346 places, 346/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 344/346 places, 346/349 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s137 0) (EQ s281 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-06 finished in 507 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 346 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 344 transition count 347
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 344 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 344 transition count 346
Applied a total of 5 rules in 16 ms. Remains 344 /346 variables (removed 2) and now considering 346/349 (removed 3) transitions.
[2024-05-24 12:47:58] [INFO ] Invariant cache hit.
[2024-05-24 12:47:58] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 12:47:58] [INFO ] Invariant cache hit.
[2024-05-24 12:47:58] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-24 12:47:58] [INFO ] Invariant cache hit.
[2024-05-24 12:47:58] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/346 places, 346/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 344/346 places, 346/349 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s150 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-11 finished in 1058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Graph (trivial) has 283 edges and 346 vertex of which 6 / 346 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 532 edges and 341 vertex of which 317 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 316 transition count 179
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 324 place count 156 transition count 177
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 155 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 154 transition count 176
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 327 place count 154 transition count 133
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 413 place count 111 transition count 133
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 432 place count 92 transition count 114
Iterating global reduction 4 with 19 rules applied. Total rules applied 451 place count 92 transition count 114
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 575 place count 30 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 576 place count 30 transition count 51
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 594 place count 12 transition count 16
Iterating global reduction 5 with 18 rules applied. Total rules applied 612 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 614 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 615 place count 10 transition count 14
Applied a total of 615 rules in 34 ms. Remains 10 /346 variables (removed 336) and now considering 14/349 (removed 335) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 12:47:59] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:47:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 12:47:59] [INFO ] Invariant cache hit.
[2024-05-24 12:47:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:47:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 12:47:59] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:47:59] [INFO ] Invariant cache hit.
[2024-05-24 12:47:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/346 places, 14/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 10/346 places, 14/349 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-14 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 (NEQ s3 0) (NEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-14 finished in 159 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((!p0 U X(p1))))))'
Support contains 4 out of 346 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 346/346 places, 349/349 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 344 transition count 347
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 344 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 344 transition count 346
Applied a total of 5 rules in 19 ms. Remains 344 /346 variables (removed 2) and now considering 346/349 (removed 3) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:47:59] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 12:47:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 12:47:59] [INFO ] Invariant cache hit.
[2024-05-24 12:47:59] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-24 12:47:59] [INFO ] Invariant cache hit.
[2024-05-24 12:48:00] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/346 places, 346/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 344/346 places, 346/349 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s197 0) (EQ s252 1)), p1:(OR (EQ s48 0) (EQ s36 1))], nbAcceptance=2, 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 33369 reset in 189 ms.
Product exploration explored 100000 steps with 33420 reset in 249 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8704 steps, including 49 resets, run visited all 3 properties in 30 ms. (steps per millisecond=290 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-24 12:48:01] [INFO ] Invariant cache hit.
[2024-05-24 12:48:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 12:48:01] [INFO ] Invariant cache hit.
[2024-05-24 12:48:01] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-24 12:48:01] [INFO ] Invariant cache hit.
[2024-05-24 12:48:01] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2571 steps, including 13 resets, run visited all 3 properties in 13 ms. (steps per millisecond=197 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33417 reset in 203 ms.
Product exploration explored 100000 steps with 33302 reset in 213 ms.
Built C files in :
/tmp/ltsmin307660010588594930
[2024-05-24 12:48:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin307660010588594930
Running compilation step : cd /tmp/ltsmin307660010588594930;'/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 560 ms.
Running link step : cd /tmp/ltsmin307660010588594930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin307660010588594930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4025435430063383947.hoa' '--buchi-type=spotba'
LTSmin run took 994 ms.
FORMULA GPUForwardProgress-PT-20b-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-20b-LTLCardinality-15 finished in 5153 ms.
All properties solved by simple procedures.
Total runtime 11430 ms.

BK_STOP 1716554885844

--------------------
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="GPUForwardProgress-PT-20b"
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 GPUForwardProgress-PT-20b, 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 r197-tall-171640625400337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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