Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576200435.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-36b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576200435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 179K May 10 09:34 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-36b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652740275959

Running Version 202205111006
[2022-05-16 22:31:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 22:31:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:31:18] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2022-05-16 22:31:18] [INFO ] Transformed 720 places.
[2022-05-16 22:31:18] [INFO ] Transformed 757 transitions.
[2022-05-16 22:31:18] [INFO ] Found NUPN structural information;
[2022-05-16 22:31:18] [INFO ] Parsed PT model containing 720 places and 757 transitions in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 72 place count 648 transition count 686
Iterating global reduction 1 with 71 rules applied. Total rules applied 143 place count 648 transition count 686
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 173 place count 618 transition count 656
Iterating global reduction 1 with 30 rules applied. Total rules applied 203 place count 618 transition count 656
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 231 place count 618 transition count 628
Applied a total of 231 rules in 200 ms. Remains 618 /720 variables (removed 102) and now considering 628/757 (removed 129) transitions.
// Phase 1: matrix 628 rows 618 cols
[2022-05-16 22:31:19] [INFO ] Computed 37 place invariants in 37 ms
[2022-05-16 22:31:19] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 628 rows 618 cols
[2022-05-16 22:31:19] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-16 22:31:20] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
// Phase 1: matrix 628 rows 618 cols
[2022-05-16 22:31:20] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-16 22:31:20] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/720 places, 628/757 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/720 places, 628/757 transitions.
Support contains 38 out of 618 places after structural reductions.
[2022-05-16 22:31:21] [INFO ] Flatten gal took : 118 ms
[2022-05-16 22:31:21] [INFO ] Flatten gal took : 58 ms
[2022-05-16 22:31:21] [INFO ] Input system was already deterministic with 628 transitions.
Support contains 36 out of 618 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 1348 ms. (steps per millisecond=7 ) properties (out of 18) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 628 rows 618 cols
[2022-05-16 22:31:23] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:23] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-16 22:31:24] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 34 ms returned sat
[2022-05-16 22:31:24] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2022-05-16 22:31:25] [INFO ] After 918ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 299 ms.
[2022-05-16 22:31:25] [INFO ] After 1658ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 5 different solutions.
Finished Parikh walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 8 properties in 45 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 115 stabilizing places and 115 stable transitions
Graph (complete) has 961 edges and 618 vertex of which 578 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.45 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Graph (trivial) has 516 edges and 618 vertex of which 6 / 618 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 955 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 303 rules applied. Total rules applied 305 place count 572 transition count 315
Reduce places removed 303 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 314 rules applied. Total rules applied 619 place count 269 transition count 304
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 622 place count 266 transition count 304
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 622 place count 266 transition count 228
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 774 place count 190 transition count 228
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 809 place count 155 transition count 193
Iterating global reduction 3 with 35 rules applied. Total rules applied 844 place count 155 transition count 193
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 1058 place count 48 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1059 place count 48 transition count 85
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1094 place count 13 transition count 16
Iterating global reduction 4 with 35 rules applied. Total rules applied 1129 place count 13 transition count 16
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 1133 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1134 place count 10 transition count 14
Applied a total of 1134 rules in 121 ms. Remains 10 /618 variables (removed 608) and now considering 14/628 (removed 614) transitions.
[2022-05-16 22:31:25] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 22:31:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:31:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-16 22:31:26] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 22:31:26] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 22:31:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:31:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-16 22:31:26] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-16 22:31:26] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 22:31:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:31:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/618 places, 14/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/618 places, 14/628 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s5 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-02 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(X((G(p0)&&p1)))))))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Graph (trivial) has 513 edges and 618 vertex of which 6 / 618 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 955 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 572 transition count 316
Reduce places removed 302 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 313 rules applied. Total rules applied 617 place count 270 transition count 305
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 620 place count 267 transition count 305
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 620 place count 267 transition count 229
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 772 place count 191 transition count 229
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 808 place count 155 transition count 193
Iterating global reduction 3 with 36 rules applied. Total rules applied 844 place count 155 transition count 193
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 1058 place count 48 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1059 place count 48 transition count 85
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1095 place count 12 transition count 14
Iterating global reduction 4 with 36 rules applied. Total rules applied 1131 place count 12 transition count 14
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 1133 place count 11 transition count 13
Applied a total of 1133 rules in 81 ms. Remains 11 /618 variables (removed 607) and now considering 13/628 (removed 615) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-16 22:31:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:31:26] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-16 22:31:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:31:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 22:31:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-16 22:31:26] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-16 22:31:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:31:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/618 places, 13/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/618 places, 13/628 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1), p1:(OR (EQ s7 0) (EQ s5 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 7 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-03 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 607 transition count 617
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 607 transition count 617
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 607 transition count 615
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 601 transition count 609
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 601 transition count 609
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 601 transition count 604
Applied a total of 41 rules in 116 ms. Remains 601 /618 variables (removed 17) and now considering 604/628 (removed 24) transitions.
// Phase 1: matrix 604 rows 601 cols
[2022-05-16 22:31:26] [INFO ] Computed 37 place invariants in 15 ms
[2022-05-16 22:31:27] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 604 rows 601 cols
[2022-05-16 22:31:27] [INFO ] Computed 37 place invariants in 8 ms
[2022-05-16 22:31:27] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 601 cols
[2022-05-16 22:31:27] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:28] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 601/618 places, 604/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/618 places, 604/628 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s164 0) (EQ s519 1) (EQ s298 0) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-04 finished in 1555 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(p0) U p1)))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 608 transition count 618
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 608 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 608 transition count 615
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 604 transition count 611
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 604 transition count 611
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 604 transition count 607
Applied a total of 35 rules in 54 ms. Remains 604 /618 variables (removed 14) and now considering 607/628 (removed 21) transitions.
// Phase 1: matrix 607 rows 604 cols
[2022-05-16 22:31:28] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:28] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 607 rows 604 cols
[2022-05-16 22:31:28] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-16 22:31:29] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
// Phase 1: matrix 607 rows 604 cols
[2022-05-16 22:31:29] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:31:29] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 604/618 places, 607/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 604/618 places, 607/628 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s591 0) (EQ s156 1)), p0:(EQ s435 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Product exploration explored 100000 steps with 50000 reset in 716 ms.
Computed a total of 113 stabilizing places and 113 stable transitions
Graph (complete) has 940 edges and 604 vertex of which 564 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.12 ms
Computed a total of 113 stabilizing places and 113 stable transitions
Detected a total of 113/604 stabilizing places and 113/607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 8 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-06 finished in 3597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 608 transition count 618
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 608 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 608 transition count 615
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 603 transition count 610
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 603 transition count 610
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 603 transition count 606
Applied a total of 37 rules in 54 ms. Remains 603 /618 variables (removed 15) and now considering 606/628 (removed 22) transitions.
// Phase 1: matrix 606 rows 603 cols
[2022-05-16 22:31:31] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-16 22:31:32] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 606 rows 603 cols
[2022-05-16 22:31:32] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:32] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
// Phase 1: matrix 606 rows 603 cols
[2022-05-16 22:31:32] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:33] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 603/618 places, 606/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 603/618 places, 606/628 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s135 0) (EQ s263 1)), p0:(AND (EQ s450 0) (EQ s255 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-07 finished in 2007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X((X(p0)||p1)))&&p2))))'
Support contains 7 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 610 transition count 620
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 610 transition count 620
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 610 transition count 617
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 607 transition count 614
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 607 transition count 614
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 607 transition count 612
Applied a total of 27 rules in 67 ms. Remains 607 /618 variables (removed 11) and now considering 612/628 (removed 16) transitions.
// Phase 1: matrix 612 rows 607 cols
[2022-05-16 22:31:33] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:34] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 612 rows 607 cols
[2022-05-16 22:31:34] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:35] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
// Phase 1: matrix 612 rows 607 cols
[2022-05-16 22:31:35] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:35] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/618 places, 612/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 607/618 places, 612/628 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s587 0) (EQ s60 1)), p1:(AND (EQ s572 0) (EQ s53 1)), p0:(AND (EQ s394 0) (EQ s388 1) (OR (EQ s227 0) (EQ s227 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-08 finished in 2093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 607 transition count 617
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 607 transition count 617
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 607 transition count 615
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 601 transition count 609
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 601 transition count 609
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 601 transition count 604
Applied a total of 41 rules in 71 ms. Remains 601 /618 variables (removed 17) and now considering 604/628 (removed 24) transitions.
// Phase 1: matrix 604 rows 601 cols
[2022-05-16 22:31:36] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-16 22:31:36] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 604 rows 601 cols
[2022-05-16 22:31:36] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:36] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 601 cols
[2022-05-16 22:31:36] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-16 22:31:37] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 601/618 places, 604/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/618 places, 604/628 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s31 0) (EQ s120 1)), p1:(NEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 326 reset in 531 ms.
Product exploration explored 100000 steps with 327 reset in 369 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 937 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.10 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/601 stabilizing places and 111/604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 137 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 1 out of 601 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 604/604 transitions.
Graph (trivial) has 491 edges and 601 vertex of which 6 / 601 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 931 edges and 596 vertex of which 556 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 555 transition count 305
Reduce places removed 289 places and 0 transitions.
Iterating post reduction 1 with 289 rules applied. Total rules applied 580 place count 266 transition count 305
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 580 place count 266 transition count 229
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 732 place count 190 transition count 229
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 767 place count 155 transition count 194
Iterating global reduction 2 with 35 rules applied. Total rules applied 802 place count 155 transition count 194
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 1012 place count 50 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1013 place count 50 transition count 88
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1048 place count 15 transition count 19
Iterating global reduction 3 with 35 rules applied. Total rules applied 1083 place count 15 transition count 19
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 3 with 4 rules applied. Total rules applied 1087 place count 13 transition count 18
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1089 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1090 place count 12 transition count 17
Applied a total of 1090 rules in 52 ms. Remains 12 /601 variables (removed 589) and now considering 17/604 (removed 587) transitions.
[2022-05-16 22:31:39] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 22:31:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:31:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-16 22:31:39] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 22:31:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:31:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:31:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 22:31:39] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-16 22:31:39] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-16 22:31:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:31:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/601 places, 17/604 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/601 places, 17/604 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/12 stabilizing places and 6/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-13 finished in 4166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0)) U p1)))'
Support contains 6 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 607 transition count 617
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 607 transition count 617
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 607 transition count 614
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 601 transition count 608
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 601 transition count 608
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 601 transition count 603
Applied a total of 42 rules in 68 ms. Remains 601 /618 variables (removed 17) and now considering 603/628 (removed 25) transitions.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:40] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:40] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:40] [INFO ] Computed 37 place invariants in 10 ms
[2022-05-16 22:31:41] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:41] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-16 22:31:42] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 601/618 places, 603/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/618 places, 603/628 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s543 0) (EQ s407 1) (EQ s160 0) (EQ s227 1)), p0:(OR (EQ s366 0) (EQ s255 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 326 reset in 365 ms.
Product exploration explored 100000 steps with 328 reset in 330 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 936 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.11 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 463 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:44] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:44] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 22:31:44] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 28 ms returned sat
[2022-05-16 22:31:44] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 22:31:44] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-16 22:31:44] [INFO ] After 792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 155 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 551 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 6 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Applied a total of 0 rules in 13 ms. Remains 601 /601 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:45] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:46] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:46] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:46] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:46] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:31:47] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 603/603 transitions.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 936 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 361 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:31:48] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:31:48] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 22:31:48] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 30 ms returned sat
[2022-05-16 22:31:49] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 22:31:49] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-16 22:31:49] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 144 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 793 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 325 reset in 206 ms.
Product exploration explored 100000 steps with 326 reset in 327 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 6 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Graph (trivial) has 481 edges and 601 vertex of which 6 / 601 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 930 edges and 596 vertex of which 556 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 284 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 284 rules applied. Total rules applied 286 place count 556 transition count 594
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 286 place count 556 transition count 596
Deduced a syphon composed of 322 places in 2 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 324 place count 556 transition count 596
Discarding 209 places :
Symmetric choice reduction at 1 with 209 rule applications. Total rules 533 place count 347 transition count 387
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 742 place count 347 transition count 387
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 777 place count 312 transition count 352
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 812 place count 312 transition count 352
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 1 with 113 rules applied. Total rules applied 925 place count 312 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 927 place count 312 transition count 351
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1005 place count 234 transition count 272
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1083 place count 234 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1084 place count 234 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1085 place count 233 transition count 271
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1086 place count 233 transition count 271
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1120 place count 233 transition count 369
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1183 place count 170 transition count 243
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 1246 place count 170 transition count 243
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 1333 place count 83 transition count 98
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 1420 place count 83 transition count 98
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 1420 rules in 219 ms. Remains 83 /601 variables (removed 518) and now considering 98/603 (removed 505) transitions.
[2022-05-16 22:31:51] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 98 rows 83 cols
[2022-05-16 22:31:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:31:52] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/601 places, 98/603 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/601 places, 98/603 transitions.
Product exploration explored 100000 steps with 328 reset in 314 ms.
Product exploration explored 100000 steps with 325 reset in 327 ms.
Built C files in :
/tmp/ltsmin11957361784864443828
[2022-05-16 22:31:52] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11957361784864443828
Running compilation step : cd /tmp/ltsmin11957361784864443828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2013 ms.
Running link step : cd /tmp/ltsmin11957361784864443828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11957361784864443828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13878161158201621123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Applied a total of 0 rules in 21 ms. Remains 601 /601 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:32:07] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:32:08] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:32:08] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:32:08] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:32:08] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:32:09] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 603/603 transitions.
Built C files in :
/tmp/ltsmin14957719506940837533
[2022-05-16 22:32:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14957719506940837533
Running compilation step : cd /tmp/ltsmin14957719506940837533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1378 ms.
Running link step : cd /tmp/ltsmin14957719506940837533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14957719506940837533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5808603074533195197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 22:32:24] [INFO ] Flatten gal took : 51 ms
[2022-05-16 22:32:24] [INFO ] Flatten gal took : 42 ms
[2022-05-16 22:32:24] [INFO ] Time to serialize gal into /tmp/LTL15660268925303287548.gal : 10 ms
[2022-05-16 22:32:24] [INFO ] Time to serialize properties into /tmp/LTL4954307394455048477.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15660268925303287548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4954307394455048477.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1566026...267
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((p430==0)||(p296==1))")))U("(((p643==0)||(p480==1))||((p184==0)||(p264==1)))"))))
Formula 0 simplified : !G(GX"((p430==0)||(p296==1))" U "(((p643==0)||(p480==1))||((p184==0)||(p264==1)))")
Detected timeout of ITS tools.
[2022-05-16 22:32:39] [INFO ] Flatten gal took : 36 ms
[2022-05-16 22:32:39] [INFO ] Applying decomposition
[2022-05-16 22:32:39] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2727253712023181595.txt' '-o' '/tmp/graph2727253712023181595.bin' '-w' '/tmp/graph2727253712023181595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2727253712023181595.bin' '-l' '-1' '-v' '-w' '/tmp/graph2727253712023181595.weights' '-q' '0' '-e' '0.001'
[2022-05-16 22:32:39] [INFO ] Decomposing Gal with order
[2022-05-16 22:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:32:40] [INFO ] Removed a total of 188 redundant transitions.
[2022-05-16 22:32:40] [INFO ] Flatten gal took : 145 ms
[2022-05-16 22:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-16 22:32:40] [INFO ] Time to serialize gal into /tmp/LTL17036860141664568639.gal : 15 ms
[2022-05-16 22:32:40] [INFO ] Time to serialize properties into /tmp/LTL17277847257525669771.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17036860141664568639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17277847257525669771.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1703686...247
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((i23.i0.u158.p430==0)||(i16.i1.u108.p296==1))")))U("(((i35.i2.u233.p643==0)||(i26.i1.u177.p480==1))||((i10.i0.u68.p184==0)...184
Formula 0 simplified : !G(GX"((i23.i0.u158.p430==0)||(i16.i1.u108.p296==1))" U "(((i35.i2.u233.p643==0)||(i26.i1.u177.p480==1))||((i10.i0.u68.p184==0)||(i1...176
Reverse transition relation is NOT exact ! Due to transitions t554, i2.t549, i2.i0.t542, i3.i0.t526, i3.i0.u25.t536, i4.t519, i4.i1.u35.t512, i5.t505, i5.i...1161
Computing Next relation with stutter on 3.00189e+17 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17512864186196908286
[2022-05-16 22:32:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17512864186196908286
Running compilation step : cd /tmp/ltsmin17512864186196908286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1800 ms.
Running link step : cd /tmp/ltsmin17512864186196908286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17512864186196908286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp0==true))) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-14 finished in 90391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0)) U p1)))'
Found a SL insensitive property : GPUForwardProgress-PT-36b-LTLCardinality-14
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 6 out of 618 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 618/618 places, 628/628 transitions.
Graph (trivial) has 505 edges and 618 vertex of which 6 / 618 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 955 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 572 transition count 325
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 303 rules applied. Total rules applied 598 place count 279 transition count 315
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 604 place count 276 transition count 312
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 607 place count 273 transition count 312
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 607 place count 273 transition count 238
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 755 place count 199 transition count 238
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 792 place count 162 transition count 201
Iterating global reduction 4 with 37 rules applied. Total rules applied 829 place count 162 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 830 place count 162 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 830 place count 162 transition count 199
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 832 place count 161 transition count 199
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 5 with 216 rules applied. Total rules applied 1048 place count 53 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1049 place count 53 transition count 90
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 1079 place count 23 transition count 31
Iterating global reduction 6 with 30 rules applied. Total rules applied 1109 place count 23 transition count 31
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 6 with 2 rules applied. Total rules applied 1111 place count 22 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1112 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1113 place count 21 transition count 29
Applied a total of 1113 rules in 48 ms. Remains 21 /618 variables (removed 597) and now considering 29/628 (removed 599) transitions.
// Phase 1: matrix 29 rows 21 cols
[2022-05-16 22:33:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:33:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 29 rows 21 cols
[2022-05-16 22:33:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:33:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 29 rows 21 cols
[2022-05-16 22:33:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:10] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 21/618 places, 29/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/618 places, 29/628 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s17 0) (EQ s14 1) (EQ s2 0) (EQ s6 1)), p0:(OR (EQ s12 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 1 reset in 1 ms.
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-14 finished in 457 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-14 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-16 22:33:10] [INFO ] Flatten gal took : 26 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 113004 ms.

BK_STOP 1652740391210

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-36b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-36b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260576200435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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