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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 6.9K Apr 11 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 179K 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-36b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716555269110

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-36b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:54:30] [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:54:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:54:30] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-24 12:54:30] [INFO ] Transformed 720 places.
[2024-05-24 12:54:30] [INFO ] Transformed 757 transitions.
[2024-05-24 12:54:30] [INFO ] Found NUPN structural information;
[2024-05-24 12:54:30] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 75 place count 645 transition count 683
Iterating global reduction 1 with 74 rules applied. Total rules applied 149 place count 645 transition count 683
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 181 place count 613 transition count 651
Iterating global reduction 1 with 32 rules applied. Total rules applied 213 place count 613 transition count 651
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 244 place count 613 transition count 620
Applied a total of 244 rules in 155 ms. Remains 613 /720 variables (removed 107) and now considering 620/757 (removed 137) transitions.
// Phase 1: matrix 620 rows 613 cols
[2024-05-24 12:54:31] [INFO ] Computed 37 invariants in 26 ms
[2024-05-24 12:54:31] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-24 12:54:31] [INFO ] Invariant cache hit.
[2024-05-24 12:54:32] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-24 12:54:32] [INFO ] Invariant cache hit.
[2024-05-24 12:54:32] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/720 places, 620/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1173 ms. Remains : 613/720 places, 620/757 transitions.
Support contains 35 out of 613 places after structural reductions.
[2024-05-24 12:54:32] [INFO ] Flatten gal took : 66 ms
[2024-05-24 12:54:32] [INFO ] Flatten gal took : 31 ms
[2024-05-24 12:54:32] [INFO ] Input system was already deterministic with 620 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 32) seen :21
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 12:54:33] [INFO ] Invariant cache hit.
[2024-05-24 12:54:33] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 20 ms returned sat
[2024-05-24 12:54:33] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 12:54:33] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 20 ms returned sat
[2024-05-24 12:54:34] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-24 12:54:34] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 339 ms.
[2024-05-24 12:54:35] [INFO ] After 1510ms 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 187 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=187 )
Parikh walk visited 9 properties in 16 ms.
Computed a total of 116 stabilizing places and 116 stable transitions
Graph (complete) has 953 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.47 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1))&&F(p2))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 501 edges and 613 vertex of which 6 / 613 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 947 edges and 608 vertex of which 568 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 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 567 transition count 313
Reduce places removed 297 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 305 rules applied. Total rules applied 604 place count 270 transition count 305
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 608 place count 267 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 610 place count 266 transition count 303
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 610 place count 266 transition count 229
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 758 place count 192 transition count 229
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 793 place count 157 transition count 194
Iterating global reduction 4 with 35 rules applied. Total rules applied 828 place count 157 transition count 194
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 1040 place count 51 transition count 88
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1074 place count 17 transition count 20
Iterating global reduction 4 with 34 rules applied. Total rules applied 1108 place count 17 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1110 place count 16 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1112 place count 14 transition count 18
Applied a total of 1112 rules in 49 ms. Remains 14 /613 variables (removed 599) and now considering 18/620 (removed 602) transitions.
[2024-05-24 12:54:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-24 12:54:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:54:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 12:54:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 12:54:35] [INFO ] Invariant cache hit.
[2024-05-24 12:54:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:54:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 12:54:35] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 12:54:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 12:54:35] [INFO ] Invariant cache hit.
[2024-05-24 12:54:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/613 places, 18/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 14/613 places, 18/620 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 280 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1 0), p1:(EQ s11 0), p2:(OR (EQ s5 0) (EQ s9 0) (EQ s13 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-01 finished in 494 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)||(((p1 U p2)&&(p3 U p4)) U p2)))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 498 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 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 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 293 place count 567 transition count 319
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 298 rules applied. Total rules applied 591 place count 276 transition count 312
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 595 place count 273 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 272 transition count 311
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 596 place count 272 transition count 236
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 746 place count 197 transition count 236
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 781 place count 162 transition count 201
Iterating global reduction 4 with 35 rules applied. Total rules applied 816 place count 162 transition count 201
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1034 place count 53 transition count 92
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1066 place count 21 transition count 28
Iterating global reduction 4 with 32 rules applied. Total rules applied 1098 place count 21 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1102 place count 19 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1104 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1105 place count 18 transition count 27
Applied a total of 1105 rules in 48 ms. Remains 18 /613 variables (removed 595) and now considering 27/620 (removed 593) transitions.
[2024-05-24 12:54:36] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 18 cols
[2024-05-24 12:54:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:54:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 12:54:36] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:36] [INFO ] Invariant cache hit.
[2024-05-24 12:54:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 12:54:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 12:54:36] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:54:36] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:36] [INFO ] Invariant cache hit.
[2024-05-24 12:54:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/613 places, 27/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 18/613 places, 27/620 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p4) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s17 1), p2:(EQ s6 1), p1:(EQ s11 1), p4:(EQ s3 1), p3:(NEQ s8 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 39971 reset in 221 ms.
Product exploration explored 100000 steps with 40001 reset in 125 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/18 stabilizing places and 8/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) p3), (X (NOT (AND (NOT p0) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p4) p3)), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X (NOT p0)), (X p0), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p4) p3))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))))]
Knowledge based reduction with 9 factoid took 729 ms. Reduced automaton from 3 states, 6 edges and 5 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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) p3), (X (NOT (AND (NOT p0) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p4) p3)), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X (NOT p0)), (X p0), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p4) p3))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))))), (F p0)]
Knowledge based reduction with 9 factoid took 901 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-24 12:54:38] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:38] [INFO ] Invariant cache hit.
[2024-05-24 12:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 12:54:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 12:54:38] [INFO ] [Real]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:54:38] [INFO ] Computed and/alt/rep : 25/50/23 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:54:38] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 18 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 : 18/18 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-24 12:54:38] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:38] [INFO ] Invariant cache hit.
[2024-05-24 12:54:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 12:54:38] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:38] [INFO ] Invariant cache hit.
[2024-05-24 12:54:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 12:54:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 12:54:38] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:54:38] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:38] [INFO ] Invariant cache hit.
[2024-05-24 12:54:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 18/18 places, 27/27 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/18 stabilizing places and 8/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 166 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 35 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 210 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-05-24 12:54:39] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 12:54:39] [INFO ] Invariant cache hit.
[2024-05-24 12:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 12:54:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 12:54:39] [INFO ] [Real]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:54:39] [INFO ] Computed and/alt/rep : 25/50/23 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:54:39] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40067 reset in 69 ms.
Product exploration explored 100000 steps with 39928 reset in 163 ms.
Built C files in :
/tmp/ltsmin4129143818560827192
[2024-05-24 12:54:39] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-24 12:54:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:54:39] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-24 12:54:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:54:39] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-24 12:54:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:54:39] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4129143818560827192
Running compilation step : cd /tmp/ltsmin4129143818560827192;'/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 184 ms.
Running link step : cd /tmp/ltsmin4129143818560827192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4129143818560827192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1481602928225334437.hoa' '--buchi-type=spotba'
LTSmin run took 95 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-02 finished in 3757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
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 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
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 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 79 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-24 12:54:40] [INFO ] Computed 37 invariants in 12 ms
[2024-05-24 12:54:40] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-24 12:54:40] [INFO ] Invariant cache hit.
[2024-05-24 12:54:40] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-24 12:54:40] [INFO ] Invariant cache hit.
[2024-05-24 12:54:40] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-03 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s255 1), p1:(EQ s253 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-03 finished in 1027 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 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 506 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 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 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 314
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 306 rules applied. Total rules applied 604 place count 271 transition count 304
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 610 place count 267 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 612 place count 265 transition count 302
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 612 place count 265 transition count 228
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 760 place count 191 transition count 228
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 797 place count 154 transition count 191
Iterating global reduction 4 with 37 rules applied. Total rules applied 834 place count 154 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 834 place count 154 transition count 190
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 836 place count 153 transition count 190
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 4 with 214 rules applied. Total rules applied 1050 place count 46 transition count 83
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1084 place count 12 transition count 15
Iterating global reduction 4 with 34 rules applied. Total rules applied 1118 place count 12 transition count 15
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 1120 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1121 place count 10 transition count 13
Applied a total of 1121 rules in 44 ms. Remains 10 /613 variables (removed 603) and now considering 13/620 (removed 607) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 12:54:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:54:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 12:54:41] [INFO ] Invariant cache hit.
[2024-05-24 12:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:54:41] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-24 12:54:41] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:54:41] [INFO ] Invariant cache hit.
[2024-05-24 12:54:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/613 places, 13/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 10/613 places, 13/620 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s6 0), p0:(AND (EQ s1 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-04 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(G((p0&&X(X((p1||G(F(p2))))))))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
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 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
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 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 56 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-24 12:54:41] [INFO ] Computed 37 invariants in 9 ms
[2024-05-24 12:54:41] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-24 12:54:41] [INFO ] Invariant cache hit.
[2024-05-24 12:54:41] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-24 12:54:41] [INFO ] Invariant cache hit.
[2024-05-24 12:54:41] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 764 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s167 0) (EQ s526 0) (EQ s587 0) (EQ s598 0)), p1:(EQ s26 0), p2:(EQ s167 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16654 reset in 219 ms.
Product exploration explored 100000 steps with 16768 reset in 232 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/600 stabilizing places and 111/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:54:43] [INFO ] Invariant cache hit.
[2024-05-24 12:54:43] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:54:43] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 17 ms returned sat
[2024-05-24 12:54:43] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 12:54:43] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-24 12:54:43] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 20 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2024-05-24 12:54:44] [INFO ] Invariant cache hit.
[2024-05-24 12:54:44] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-24 12:54:44] [INFO ] Invariant cache hit.
[2024-05-24 12:54:45] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-24 12:54:45] [INFO ] Invariant cache hit.
[2024-05-24 12:54:45] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 600/600 places, 602/602 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.7 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/600 stabilizing places and 111/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:54:45] [INFO ] Invariant cache hit.
[2024-05-24 12:54:46] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:54:46] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 17 ms returned sat
[2024-05-24 12:54:46] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:54:46] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-24 12:54:46] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16676 reset in 194 ms.
Product exploration explored 100000 steps with 16751 reset in 200 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Graph (trivial) has 485 edges and 600 vertex of which 6 / 600 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 929 edges and 595 vertex of which 555 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
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 555 transition count 593
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 289 place count 555 transition count 595
Deduced a syphon composed of 325 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 327 place count 555 transition count 595
Discarding 212 places :
Symmetric choice reduction at 1 with 212 rule applications. Total rules 539 place count 343 transition count 383
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 212 rules applied. Total rules applied 751 place count 343 transition count 383
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 786 place count 308 transition count 348
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 821 place count 308 transition count 348
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 931 place count 308 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 933 place count 308 transition count 347
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1010 place count 231 transition count 269
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1087 place count 231 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1088 place count 231 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1089 place count 230 transition count 268
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1090 place count 230 transition count 268
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1126 place count 230 transition count 374
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 1195 place count 161 transition count 236
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 1264 place count 161 transition count 236
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 1363 place count 62 transition count 71
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 1462 place count 62 transition count 71
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 1462 rules in 96 ms. Remains 62 /600 variables (removed 538) and now considering 71/602 (removed 531) transitions.
[2024-05-24 12:54:48] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 71 rows 62 cols
[2024-05-24 12:54:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:54:48] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/600 places, 71/602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 62/600 places, 71/602 transitions.
Built C files in :
/tmp/ltsmin13927208980534406343
[2024-05-24 12:54:48] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13927208980534406343
Running compilation step : cd /tmp/ltsmin13927208980534406343;'/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 842 ms.
Running link step : cd /tmp/ltsmin13927208980534406343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13927208980534406343;'/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/stateBased12897640949051485772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 22 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-24 12:55:03] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 12:55:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-24 12:55:04] [INFO ] Invariant cache hit.
[2024-05-24 12:55:04] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-24 12:55:04] [INFO ] Invariant cache hit.
[2024-05-24 12:55:04] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 727 ms. Remains : 600/600 places, 602/602 transitions.
Built C files in :
/tmp/ltsmin7511055623146509092
[2024-05-24 12:55:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7511055623146509092
Running compilation step : cd /tmp/ltsmin7511055623146509092;'/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 832 ms.
Running link step : cd /tmp/ltsmin7511055623146509092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7511055623146509092;'/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/stateBased1174133604436152571.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:55:19] [INFO ] Flatten gal took : 26 ms
[2024-05-24 12:55:19] [INFO ] Flatten gal took : 24 ms
[2024-05-24 12:55:19] [INFO ] Time to serialize gal into /tmp/LTL5634162373588972279.gal : 5 ms
[2024-05-24 12:55:19] [INFO ] Time to serialize properties into /tmp/LTL15042777519370374415.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5634162373588972279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10278536787315847927.hoa' '-atoms' '/tmp/LTL15042777519370374415.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15042777519370374415.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10278536787315847927.hoa
Detected timeout of ITS tools.
[2024-05-24 12:55:34] [INFO ] Flatten gal took : 22 ms
[2024-05-24 12:55:34] [INFO ] Flatten gal took : 22 ms
[2024-05-24 12:55:34] [INFO ] Time to serialize gal into /tmp/LTL6264149264285512670.gal : 5 ms
[2024-05-24 12:55:34] [INFO ] Time to serialize properties into /tmp/LTL13400417010944972610.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6264149264285512670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13400417010944972610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X(("(p26==0)")||(G(F("(p193==0)"))))))&&("(((p193==0)||(p624==0))||((p701==0)||(p716==0)))"))))))
Formula 0 simplified : XXF(!"(((p193==0)||(p624==0))||((p701==0)||(p716==0)))" | XX(!"(p26==0)" & FG!"(p193==0)"))
Detected timeout of ITS tools.
[2024-05-24 12:55:50] [INFO ] Flatten gal took : 25 ms
[2024-05-24 12:55:50] [INFO ] Applying decomposition
[2024-05-24 12:55:50] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph227163062850025975.txt' '-o' '/tmp/graph227163062850025975.bin' '-w' '/tmp/graph227163062850025975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph227163062850025975.bin' '-l' '-1' '-v' '-w' '/tmp/graph227163062850025975.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:55:50] [INFO ] Decomposing Gal with order
[2024-05-24 12:55:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:55:50] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-24 12:55:50] [INFO ] Flatten gal took : 77 ms
[2024-05-24 12:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-24 12:55:50] [INFO ] Time to serialize gal into /tmp/LTL3668237487086576759.gal : 11 ms
[2024-05-24 12:55:50] [INFO ] Time to serialize properties into /tmp/LTL13840003256171143810.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3668237487086576759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13840003256171143810.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X(("(i0.i1.u11.p26==0)")||(G(F("(i9.i1.u73.p193==0)"))))))&&("(((i9.i1.u73.p193==0)||(i33.i1.u225.p624==0))||((i38.u250.p7...190
Formula 0 simplified : XXF(!"(((i9.i1.u73.p193==0)||(i33.i1.u225.p624==0))||((i38.u250.p701==0)||(i38.u251.p716==0)))" | XX(!"(i0.i1.u11.p26==0)" & FG!"(i9...174
Reverse transition relation is NOT exact ! Due to transitions t546, i1.t541, i1.i1.u21.t534, i2.t528, i2.i0.t519, i3.t512, i3.i2.t505, i4.t498, i4.i0.t491,...1156
Computing Next relation with stutter on 3.00189e+17 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12082008421701201791
[2024-05-24 12:56:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12082008421701201791
Running compilation step : cd /tmp/ltsmin12082008421701201791;'/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 811 ms.
Running link step : cd /tmp/ltsmin12082008421701201791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12082008421701201791;'/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' '--ltl' 'X(X([]((X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 99321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (G(p1)&&p2))))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
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 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
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 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 72 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-24 12:56:20] [INFO ] Invariant cache hit.
[2024-05-24 12:56:20] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-24 12:56:20] [INFO ] Invariant cache hit.
[2024-05-24 12:56:21] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-24 12:56:21] [INFO ] Invariant cache hit.
[2024-05-24 12:56:21] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 873 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s584 1), p0:(AND (EQ s447 1) (EQ s587 1) (EQ s598 1)), p2:(AND (EQ s447 1) (EQ s587 1) (EQ s598 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]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-07 finished in 1079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
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 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
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 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 48 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-24 12:56:21] [INFO ] Invariant cache hit.
[2024-05-24 12:56:21] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-24 12:56:21] [INFO ] Invariant cache hit.
[2024-05-24 12:56:22] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-24 12:56:22] [INFO ] Invariant cache hit.
[2024-05-24 12:56:22] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-09 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:(EQ s411 0)], 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 92 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-09 finished in 889 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(((p1&&G(p2))||p0))&&(p3||G(p1)))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
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 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
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 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 60 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-24 12:56:22] [INFO ] Invariant cache hit.
[2024-05-24 12:56:22] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-24 12:56:22] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s360 0), p3:(EQ s253 1), p0:(OR (EQ s196 0) (EQ s587 0) (EQ s598 0)), p2:(OR (EQ s196 0) (EQ s587 0) (EQ s598 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5204 steps with 16 reset in 17 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-10 finished in 1137 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&&F(p1))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 505 edges and 613 vertex of which 6 / 613 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 947 edges and 608 vertex of which 568 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 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 315
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 305 rules applied. Total rules applied 602 place count 272 transition count 305
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 607 place count 268 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 608 place count 267 transition count 304
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 608 place count 267 transition count 230
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 756 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 793 place count 156 transition count 193
Iterating global reduction 4 with 37 rules applied. Total rules applied 830 place count 156 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 830 place count 156 transition count 192
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 832 place count 155 transition count 192
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1050 place count 46 transition count 83
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1083 place count 13 transition count 17
Iterating global reduction 4 with 33 rules applied. Total rules applied 1116 place count 13 transition count 17
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 1118 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1119 place count 11 transition count 15
Applied a total of 1119 rules in 24 ms. Remains 11 /613 variables (removed 602) and now considering 15/620 (removed 605) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-05-24 12:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/613 places, 15/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 11/613 places, 15/620 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s7 1), p0:(EQ s4 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, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-11 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 504 edges and 613 vertex of which 6 / 613 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 947 edges and 608 vertex of which 568 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 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 567 transition count 316
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 304 rules applied. Total rules applied 600 place count 273 transition count 306
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 606 place count 269 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 608 place count 267 transition count 304
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 608 place count 267 transition count 229
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 758 place count 192 transition count 229
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 795 place count 155 transition count 192
Iterating global reduction 4 with 37 rules applied. Total rules applied 832 place count 155 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 832 place count 155 transition count 191
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 834 place count 154 transition count 191
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 1046 place count 48 transition count 85
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1080 place count 14 transition count 17
Iterating global reduction 4 with 34 rules applied. Total rules applied 1114 place count 14 transition count 17
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 1116 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1117 place count 12 transition count 15
Applied a total of 1117 rules in 30 ms. Remains 12 /613 variables (removed 601) and now considering 15/620 (removed 605) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-24 12:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/613 places, 15/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 12/613 places, 15/620 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (OR (EQ s3 1) (EQ s8 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-12 finished in 155 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))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 504 edges and 613 vertex of which 6 / 613 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 947 edges and 608 vertex of which 568 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 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 315
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 305 rules applied. Total rules applied 602 place count 272 transition count 305
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 608 place count 268 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 610 place count 266 transition count 303
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 610 place count 266 transition count 230
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 756 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 793 place count 156 transition count 193
Iterating global reduction 4 with 37 rules applied. Total rules applied 830 place count 156 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 830 place count 156 transition count 192
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 832 place count 155 transition count 192
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 4 with 216 rules applied. Total rules applied 1048 place count 47 transition count 84
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1080 place count 15 transition count 20
Iterating global reduction 4 with 32 rules applied. Total rules applied 1112 place count 15 transition count 20
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 1114 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1115 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1116 place count 13 transition count 18
Applied a total of 1116 rules in 27 ms. Remains 13 /613 variables (removed 600) and now considering 18/620 (removed 602) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 12:56:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:56:24] [INFO ] Invariant cache hit.
[2024-05-24 12:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 12:56:24] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:56:24] [INFO ] Invariant cache hit.
[2024-05-24 12:56:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/613 places, 18/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 13/613 places, 18/620 transitions.
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s9 1) (EQ s5 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-13 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 605 transition count 612
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 605 transition count 612
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 605 transition count 609
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 603 transition count 607
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 603 transition count 607
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 603 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 602 transition count 605
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 602 transition count 605
Applied a total of 26 rules in 54 ms. Remains 602 /613 variables (removed 11) and now considering 605/620 (removed 15) transitions.
// Phase 1: matrix 605 rows 602 cols
[2024-05-24 12:56:24] [INFO ] Computed 37 invariants in 6 ms
[2024-05-24 12:56:24] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-24 12:56:24] [INFO ] Invariant cache hit.
[2024-05-24 12:56:24] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-05-24 12:56:24] [INFO ] Invariant cache hit.
[2024-05-24 12:56:24] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 605/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 602/613 places, 605/620 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s558 1) (EQ s589 1) (EQ s600 1)), p1:(EQ s323 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-14 finished in 952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1))))))))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 606 transition count 613
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 606 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 606 transition count 612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 603 transition count 609
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 603 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 602 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 602 transition count 606
Applied a total of 25 rules in 58 ms. Remains 602 /613 variables (removed 11) and now considering 606/620 (removed 14) transitions.
// Phase 1: matrix 606 rows 602 cols
[2024-05-24 12:56:25] [INFO ] Computed 37 invariants in 6 ms
[2024-05-24 12:56:25] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-24 12:56:25] [INFO ] Invariant cache hit.
[2024-05-24 12:56:25] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-24 12:56:25] [INFO ] Invariant cache hit.
[2024-05-24 12:56:25] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 606/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 602/613 places, 606/620 transitions.
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s95 1) (EQ s54 1)), p1:(EQ s54 1), p0:(AND (EQ s95 1) (EQ s430 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 326 reset in 234 ms.
Product exploration explored 100000 steps with 329 reset in 294 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 939 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 479009 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 479009 steps, saw 186285 distinct states, run finished after 3002 ms. (steps per millisecond=159 ) properties seen :2
Running SMT prover for 3 properties.
[2024-05-24 12:56:30] [INFO ] Invariant cache hit.
[2024-05-24 12:56:30] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 18 ms returned sat
[2024-05-24 12:56:30] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-24 12:56:30] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 18 ms returned sat
[2024-05-24 12:56:31] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-24 12:56:31] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-24 12:56:31] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 111 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F p0)]
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Applied a total of 0 rules in 14 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-05-24 12:56:31] [INFO ] Invariant cache hit.
[2024-05-24 12:56:31] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-24 12:56:31] [INFO ] Invariant cache hit.
[2024-05-24 12:56:32] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-24 12:56:32] [INFO ] Invariant cache hit.
[2024-05-24 12:56:32] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 602/602 places, 606/606 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 939 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 571542 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 571542 steps, saw 218113 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :2
Running SMT prover for 2 properties.
[2024-05-24 12:56:35] [INFO ] Invariant cache hit.
[2024-05-24 12:56:36] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 21 ms returned sat
[2024-05-24 12:56:36] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:56:36] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 17 ms returned sat
[2024-05-24 12:56:36] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:56:36] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-24 12:56:36] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 103 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 328 reset in 187 ms.
Product exploration explored 100000 steps with 327 reset in 194 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Graph (trivial) has 489 edges and 602 vertex of which 6 / 602 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 933 edges and 597 vertex of which 557 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
Performed 286 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 286 rules applied. Total rules applied 288 place count 557 transition count 597
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 288 place count 557 transition count 601
Deduced a syphon composed of 326 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 328 place count 557 transition count 601
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 538 place count 347 transition count 391
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 748 place count 347 transition count 391
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 783 place count 312 transition count 356
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 818 place count 312 transition count 356
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 930 place count 312 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 932 place count 312 transition count 355
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1009 place count 235 transition count 277
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1086 place count 235 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1087 place count 235 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1088 place count 234 transition count 276
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1089 place count 234 transition count 276
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1125 place count 234 transition count 383
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1195 place count 164 transition count 243
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1265 place count 164 transition count 243
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 1361 place count 68 transition count 83
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 1457 place count 68 transition count 83
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1457 rules in 71 ms. Remains 68 /602 variables (removed 534) and now considering 83/606 (removed 523) transitions.
[2024-05-24 12:56:38] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 83 rows 68 cols
[2024-05-24 12:56:38] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:56:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/602 places, 83/606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 68/602 places, 83/606 transitions.
Built C files in :
/tmp/ltsmin16751034467490825954
[2024-05-24 12:56:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16751034467490825954
Running compilation step : cd /tmp/ltsmin16751034467490825954;'/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 909 ms.
Running link step : cd /tmp/ltsmin16751034467490825954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16751034467490825954;'/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/stateBased17197797749501956323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Applied a total of 0 rules in 19 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
// Phase 1: matrix 606 rows 602 cols
[2024-05-24 12:56:53] [INFO ] Computed 37 invariants in 7 ms
[2024-05-24 12:56:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-24 12:56:53] [INFO ] Invariant cache hit.
[2024-05-24 12:56:53] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-24 12:56:53] [INFO ] Invariant cache hit.
[2024-05-24 12:56:54] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 602/602 places, 606/606 transitions.
Built C files in :
/tmp/ltsmin16765448164663246007
[2024-05-24 12:56:54] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16765448164663246007
Running compilation step : cd /tmp/ltsmin16765448164663246007;'/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 859 ms.
Running link step : cd /tmp/ltsmin16765448164663246007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16765448164663246007;'/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/stateBased5435014310268379703.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:57:09] [INFO ] Flatten gal took : 28 ms
[2024-05-24 12:57:09] [INFO ] Flatten gal took : 16 ms
[2024-05-24 12:57:09] [INFO ] Time to serialize gal into /tmp/LTL3925497767805033555.gal : 3 ms
[2024-05-24 12:57:09] [INFO ] Time to serialize properties into /tmp/LTL13430321489501600781.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3925497767805033555.gal' '-t' 'CGAL' '-hoa' '/tmp/aut623966446124064457.hoa' '-atoms' '/tmp/LTL13430321489501600781.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL13430321489501600781.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut623966446124064457.hoa
Detected timeout of ITS tools.
[2024-05-24 12:57:24] [INFO ] Flatten gal took : 17 ms
[2024-05-24 12:57:24] [INFO ] Flatten gal took : 16 ms
[2024-05-24 12:57:24] [INFO ] Time to serialize gal into /tmp/LTL1662078531355534986.gal : 3 ms
[2024-05-24 12:57:24] [INFO ] Time to serialize properties into /tmp/LTL5355692090329565593.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1662078531355534986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5355692090329565593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((p105==1)&&(p507==1))"))U((G(!("((p105==1)&&(p507==1))")))||((!("((p105==1)&&(p507==1))"))&&(("(p57==1)")U(("((p105==1)&...193
Formula 0 simplified : XXG((!"(p57==1)" M !"((p105==1)&&(p57==1))") U "((p105==1)&&(p507==1))")
Detected timeout of ITS tools.
[2024-05-24 12:57:39] [INFO ] Flatten gal took : 14 ms
[2024-05-24 12:57:39] [INFO ] Applying decomposition
[2024-05-24 12:57:39] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15639624088548086588.txt' '-o' '/tmp/graph15639624088548086588.bin' '-w' '/tmp/graph15639624088548086588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15639624088548086588.bin' '-l' '-1' '-v' '-w' '/tmp/graph15639624088548086588.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:57:39] [INFO ] Decomposing Gal with order
[2024-05-24 12:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:57:39] [INFO ] Removed a total of 193 redundant transitions.
[2024-05-24 12:57:39] [INFO ] Flatten gal took : 32 ms
[2024-05-24 12:57:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-24 12:57:39] [INFO ] Time to serialize gal into /tmp/LTL7197325819633429990.gal : 6 ms
[2024-05-24 12:57:39] [INFO ] Time to serialize properties into /tmp/LTL14504217334351787638.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7197325819633429990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14504217334351787638.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((i6.u37.p105==1)&&(i26.u185.p507==1))"))U((G(!("((i6.u37.p105==1)&&(i26.u185.p507==1))")))||((!("((i6.u37.p105==1)&&(i26...269
Formula 0 simplified : XXG((!"(i4.u23.p57==1)" M !"((i6.u37.p105==1)&&(i4.u23.p57==1))") U "((i6.u37.p105==1)&&(i26.u185.p507==1))")
Reverse transition relation is NOT exact ! Due to transitions t546, i0.t196, i0.t189, i1.i1.t256, i1.i1.i2.t248, i2.i0.t541, i2.i0.i1.u20.t534, i3.t470, i3...1038
Computing Next relation with stutter on 3.00189e+17 deadlock states
298 unique states visited
297 strongly connected components in search stack
300 transitions explored
298 items max in DFS search stack
1322 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.2818,340680,1,0,631017,321,6090,896640,153,912,1684195
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-15 finished in 89547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X((p1||G(F(p2))))))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-36b-LTLFireability-05
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 502 edges and 613 vertex of which 6 / 613 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 947 edges and 608 vertex of which 568 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 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 314
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 306 rules applied. Total rules applied 604 place count 271 transition count 304
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 608 place count 267 transition count 304
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 608 place count 267 transition count 230
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 756 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 793 place count 156 transition count 193
Iterating global reduction 3 with 37 rules applied. Total rules applied 830 place count 156 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 1044 place count 49 transition count 86
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1077 place count 16 transition count 20
Iterating global reduction 3 with 33 rules applied. Total rules applied 1110 place count 16 transition count 20
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 3 with 2 rules applied. Total rules applied 1112 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1113 place count 14 transition count 18
Applied a total of 1113 rules in 30 ms. Remains 14 /613 variables (removed 599) and now considering 18/620 (removed 602) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-24 12:57:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:57:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:57:55] [INFO ] Invariant cache hit.
[2024-05-24 12:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:57:55] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 12:57:55] [INFO ] Invariant cache hit.
[2024-05-24 12:57:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/613 places, 18/620 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 111 ms. Remains : 14/613 places, 18/620 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s8 0) (EQ s11 0) (EQ s13 0)), p1:(EQ s1 0), p2:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 234 steps with 29 reset in 1 ms.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 486 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-24 12:57:55] [INFO ] Flatten gal took : 14 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 204580 ms.

BK_STOP 1716555476052

--------------------
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-36b"
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-36b, 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-171640625500378"
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 [ "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 ;