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-171640625400348.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-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625400348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 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.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 22:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 22:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 22:13 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 122K 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-24b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716555067803

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:51:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:51:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:51:09] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-24 12:51:09] [INFO ] Transformed 492 places.
[2024-05-24 12:51:09] [INFO ] Transformed 517 transitions.
[2024-05-24 12:51:09] [INFO ] Found NUPN structural information;
[2024-05-24 12:51:09] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 50 place count 442 transition count 468
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 442 transition count 468
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 120 place count 421 transition count 447
Iterating global reduction 1 with 21 rules applied. Total rules applied 141 place count 421 transition count 447
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 160 place count 421 transition count 428
Applied a total of 160 rules in 90 ms. Remains 421 /492 variables (removed 71) and now considering 428/517 (removed 89) transitions.
// Phase 1: matrix 428 rows 421 cols
[2024-05-24 12:51:09] [INFO ] Computed 25 invariants in 23 ms
[2024-05-24 12:51:09] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-24 12:51:09] [INFO ] Invariant cache hit.
[2024-05-24 12:51:10] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-24 12:51:10] [INFO ] Invariant cache hit.
[2024-05-24 12:51:10] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 421/492 places, 428/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 788 ms. Remains : 421/492 places, 428/517 transitions.
Support contains 28 out of 421 places after structural reductions.
[2024-05-24 12:51:10] [INFO ] Flatten gal took : 54 ms
[2024-05-24 12:51:10] [INFO ] Flatten gal took : 21 ms
[2024-05-24 12:51:10] [INFO ] Input system was already deterministic with 428 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 12:51:11] [INFO ] Invariant cache hit.
[2024-05-24 12:51:11] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-24 12:51:11] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 12:51:11] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 22 ms returned sat
[2024-05-24 12:51:12] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-24 12:51:12] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-24 12:51:12] [INFO ] After 1048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=162 )
Parikh walk visited 9 properties in 20 ms.
Computed a total of 81 stabilizing places and 81 stable transitions
Graph (complete) has 653 edges and 421 vertex of which 393 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.16 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 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 351 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 387 transition count 216
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 210 rules applied. Total rules applied 414 place count 185 transition count 208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 417 place count 182 transition count 208
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 417 place count 182 transition count 157
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 519 place count 131 transition count 157
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 543 place count 107 transition count 133
Iterating global reduction 3 with 24 rules applied. Total rules applied 567 place count 107 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 567 place count 107 transition count 132
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 569 place count 106 transition count 132
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 739 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 762 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 4 with 2 rules applied. Total rules applied 764 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 766 place count 8 transition count 11
Applied a total of 766 rules in 42 ms. Remains 8 /421 variables (removed 413) and now considering 11/428 (removed 417) transitions.
[2024-05-24 12:51:13] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 12:51:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:51:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:51:13] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-24 12:51:13] [INFO ] Invariant cache hit.
[2024-05-24 12:51:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:51:13] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-24 12:51:13] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:51:13] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-24 12:51:13] [INFO ] Invariant cache hit.
[2024-05-24 12:51:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/421 places, 11/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 8/421 places, 11/428 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 146 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-01 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 s3 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 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-01 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F((p1||X((p2||X(F((p2&&F(p0))))))))))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 71 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-24 12:51:13] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 12:51:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-24 12:51:13] [INFO ] Invariant cache hit.
[2024-05-24 12:51:13] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-24 12:51:13] [INFO ] Invariant cache hit.
[2024-05-24 12:51:14] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p1:(EQ s137 1), p0:(EQ s77 1), p2:(NEQ s243 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 25000 reset in 354 ms.
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.8 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 3850 steps, including 18 resets, run visited all 2 properties in 50 ms. (steps per millisecond=77 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 15 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-05-24 12:51:15] [INFO ] Invariant cache hit.
[2024-05-24 12:51:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 12:51:15] [INFO ] Invariant cache hit.
[2024-05-24 12:51:16] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-24 12:51:16] [INFO ] Invariant cache hit.
[2024-05-24 12:51:16] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 408/408 places, 410/410 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 1413 steps, including 6 resets, run visited all 2 properties in 19 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Product exploration explored 100000 steps with 25000 reset in 210 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 328 edges and 408 vertex of which 6 / 408 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 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 192 rules applied. Total rules applied 194 place count 375 transition count 401
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 194 place count 375 transition count 403
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 222 place count 375 transition count 403
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 365 place count 232 transition count 260
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 508 place count 232 transition count 260
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 531 place count 209 transition count 237
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 554 place count 209 transition count 237
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 629 place count 209 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 631 place count 209 transition count 236
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 683 place count 157 transition count 183
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 735 place count 157 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 736 place count 157 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 737 place count 156 transition count 182
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 156 transition count 182
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 760 place count 156 transition count 247
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 802 place count 114 transition count 163
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 844 place count 114 transition count 163
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 904 place count 54 transition count 63
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 964 place count 54 transition count 63
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 964 rules in 122 ms. Remains 54 /408 variables (removed 354) and now considering 63/410 (removed 347) transitions.
[2024-05-24 12:51:18] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 63 rows 54 cols
[2024-05-24 12:51:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:51:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/408 places, 63/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 54/408 places, 63/410 transitions.
Built C files in :
/tmp/ltsmin3133772633074044811
[2024-05-24 12:51:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3133772633074044811
Running compilation step : cd /tmp/ltsmin3133772633074044811;'/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 653 ms.
Running link step : cd /tmp/ltsmin3133772633074044811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3133772633074044811;'/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/stateBased8364201315529318634.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-03 finished in 5858 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 U p1)||F(p2)))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 347 edges and 421 vertex of which 6 / 421 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 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 387 transition count 220
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 204 rules applied. Total rules applied 404 place count 189 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 187 transition count 214
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 406 place count 187 transition count 162
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 510 place count 135 transition count 162
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 533 place count 112 transition count 139
Iterating global reduction 3 with 23 rules applied. Total rules applied 556 place count 112 transition count 139
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 704 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 705 place count 38 transition count 64
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 727 place count 16 transition count 21
Iterating global reduction 4 with 22 rules applied. Total rules applied 749 place count 16 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 753 place count 14 transition count 20
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 755 place count 14 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 13 transition count 19
Applied a total of 756 rules in 27 ms. Remains 13 /421 variables (removed 408) and now considering 19/428 (removed 409) transitions.
[2024-05-24 12:51:19] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 12:51:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:51:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:51:19] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:51:19] [INFO ] Invariant cache hit.
[2024-05-24 12:51:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 12:51:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-24 12:51:19] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 12:51:19] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:51:19] [INFO ] Invariant cache hit.
[2024-05-24 12:51:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/421 places, 19/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 13/421 places, 19/428 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s5 1), p1:(EQ s11 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 55 steps with 3 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-04 finished in 256 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 U p1)||G(p2))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 411 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 34 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-24 12:51:19] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 12:51:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-24 12:51:19] [INFO ] Invariant cache hit.
[2024-05-24 12:51:19] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-24 12:51:19] [INFO ] Invariant cache hit.
[2024-05-24 12:51:20] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s379 1), p0:(EQ s35 1), p2:(EQ s221 0)], 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]]
Entered a terminal (fully accepting) state of product in 20589 steps with 99 reset in 43 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-05 finished in 779 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((F(G(p0)) U p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 411 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 29 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-24 12:51:20] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 12:51:20] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-24 12:51:20] [INFO ] Invariant cache hit.
[2024-05-24 12:51:20] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-05-24 12:51:20] [INFO ] Invariant cache hit.
[2024-05-24 12:51:21] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 711 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s257 1) (EQ s397 1) (EQ s408 1)), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-06 finished in 872 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 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 351 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 387 transition count 218
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 208 rules applied. Total rules applied 410 place count 187 transition count 210
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 414 place count 184 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 183 transition count 209
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 415 place count 183 transition count 158
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 517 place count 132 transition count 158
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 541 place count 108 transition count 134
Iterating global reduction 4 with 24 rules applied. Total rules applied 565 place count 108 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 565 place count 108 transition count 133
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 567 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 739 place count 10 transition count 13
Iterating global reduction 5 with 23 rules applied. Total rules applied 762 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 764 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 765 place count 8 transition count 11
Applied a total of 765 rules in 34 ms. Remains 8 /421 variables (removed 413) and now considering 11/428 (removed 417) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:51:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:51:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 12:51:21] [INFO ] Invariant cache hit.
[2024-05-24 12:51:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:51:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-24 12:51:21] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 12:51:21] [INFO ] Invariant cache hit.
[2024-05-24 12:51:21] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/421 places, 11/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 8/421 places, 11/428 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-07 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 s4 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-07 finished in 175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U X(G((p2&&X(!p0))))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 410 transition count 414
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 410 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 410 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 409 transition count 411
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 409 transition count 411
Applied a total of 29 rules in 31 ms. Remains 409 /421 variables (removed 12) and now considering 411/428 (removed 17) transitions.
// Phase 1: matrix 411 rows 409 cols
[2024-05-24 12:51:21] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 12:51:21] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 12:51:21] [INFO ] Invariant cache hit.
[2024-05-24 12:51:21] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-24 12:51:21] [INFO ] Invariant cache hit.
[2024-05-24 12:51:21] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/421 places, 411/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 409/421 places, 411/428 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), true, (AND p2 p0), (NOT p1), (AND (NOT p1) p2 p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}]], initial=2, aps=[p2:(EQ s12 1), p1:(EQ s223 1), p0:(NEQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-09 finished in 808 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 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 353 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 387 transition count 215
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 211 rules applied. Total rules applied 416 place count 184 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 419 place count 181 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 419 place count 181 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 521 place count 130 transition count 156
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 545 place count 106 transition count 132
Iterating global reduction 3 with 24 rules applied. Total rules applied 569 place count 106 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 569 place count 106 transition count 131
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 571 place count 105 transition count 131
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 740 place count 9 transition count 11
Iterating global reduction 4 with 24 rules applied. Total rules applied 764 place count 9 transition count 11
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 4 with 2 rules applied. Total rules applied 766 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 767 place count 7 transition count 9
Applied a total of 767 rules in 17 ms. Remains 7 /421 variables (removed 414) and now considering 9/428 (removed 419) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-24 12:51:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:51:22] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-24 12:51:22] [INFO ] Invariant cache hit.
[2024-05-24 12:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:51:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:51:22] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:51:22] [INFO ] Invariant cache hit.
[2024-05-24 12:51:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/421 places, 9/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 7/421 places, 9/428 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-11 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:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-11 finished in 167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 349 edges and 421 vertex of which 6 / 421 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 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 387 transition count 218
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 408 place count 187 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 185 transition count 212
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 410 place count 185 transition count 160
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 514 place count 133 transition count 160
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 538 place count 109 transition count 136
Iterating global reduction 3 with 24 rules applied. Total rules applied 562 place count 109 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 562 place count 109 transition count 135
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 564 place count 108 transition count 135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 708 place count 36 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 36 transition count 62
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 732 place count 13 transition count 17
Iterating global reduction 4 with 23 rules applied. Total rules applied 755 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 759 place count 11 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 761 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 762 place count 10 transition count 15
Applied a total of 762 rules in 23 ms. Remains 10 /421 variables (removed 411) and now considering 15/428 (removed 413) transitions.
[2024-05-24 12:51:22] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 12:51:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:51:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 12:51:22] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:51:22] [INFO ] Invariant cache hit.
[2024-05-24 12:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:51:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 12:51:22] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:51:22] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:51:22] [INFO ] Invariant cache hit.
[2024-05-24 12:51:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/421 places, 15/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 10/421 places, 15/428 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s4 1), p1:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-12 finished in 196 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))||G(p1))))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 30 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-24 12:51:22] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 12:51:22] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-24 12:51:22] [INFO ] Invariant cache hit.
[2024-05-24 12:51:22] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-24 12:51:22] [INFO ] Invariant cache hit.
[2024-05-24 12:51:23] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s317 0) (EQ s92 0)), p1:(EQ s92 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT 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 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-13 finished in 1274 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(p1)))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 414 transition count 421
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 414 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 414 transition count 419
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 411 transition count 416
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 411 transition count 416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 34 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-24 12:51:23] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 12:51:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-24 12:51:23] [INFO ] Invariant cache hit.
[2024-05-24 12:51:24] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-24 12:51:24] [INFO ] Invariant cache hit.
[2024-05-24 12:51:24] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s8 1), p0:(OR (AND (EQ s379 1) (EQ s336 1)) (AND (EQ s379 1) (EQ s204 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-14 finished in 763 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 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 30 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-24 12:51:24] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 12:51:24] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 12:51:24] [INFO ] Invariant cache hit.
[2024-05-24 12:51:24] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-24 12:51:24] [INFO ] Invariant cache hit.
[2024-05-24 12:51:25] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s141 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 634 reset in 133 ms.
Product exploration explored 100000 steps with 634 reset in 189 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 150 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
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 132 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-24 12:51:25] [INFO ] Invariant cache hit.
[2024-05-24 12:51:25] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-24 12:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:51:26] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 12:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:51:26] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-24 12:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:51:26] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 12:51:26] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 22 ms.
[2024-05-24 12:51:28] [INFO ] Added : 392 causal constraints over 79 iterations in 2140 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 333 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 193 place count 374 transition count 209
Reduce places removed 191 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 192 rules applied. Total rules applied 385 place count 183 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 182 transition count 208
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 386 place count 182 transition count 156
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 490 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 513 place count 107 transition count 133
Iterating global reduction 3 with 23 rules applied. Total rules applied 536 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 684 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 708 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 731 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 4 with 2 rules applied. Total rules applied 733 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 734 place count 8 transition count 11
Applied a total of 734 rules in 14 ms. Remains 8 /408 variables (removed 400) and now considering 11/410 (removed 399) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:51:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:51:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 12:51:28] [INFO ] Invariant cache hit.
[2024-05-24 12:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:51:28] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 12:51:28] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:51:28] [INFO ] Invariant cache hit.
[2024-05-24 12:51:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/408 places, 11/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 8/408 places, 11/410 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 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 30 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 148 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-24 12:51:29] [INFO ] Invariant cache hit.
[2024-05-24 12:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:51:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:51:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:51:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:51:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 12:51:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:51:29] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:51:29] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-15 finished in 4554 ms.
All properties solved by simple procedures.
Total runtime 19932 ms.

BK_STOP 1716555090413

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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