About the Execution of ITS-Tools for GPUForwardProgress-PT-36b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2300.403 | 119334.00 | 219705.00 | 478.30 | FFTFFFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156200237.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r292-tall-162124156200237
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.9K May 11 18:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 123K May 12 08:13 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-00
FORMULA_NAME GPUForwardProgress-PT-36b-01
FORMULA_NAME GPUForwardProgress-PT-36b-02
FORMULA_NAME GPUForwardProgress-PT-36b-03
FORMULA_NAME GPUForwardProgress-PT-36b-04
FORMULA_NAME GPUForwardProgress-PT-36b-05
FORMULA_NAME GPUForwardProgress-PT-36b-06
FORMULA_NAME GPUForwardProgress-PT-36b-07
FORMULA_NAME GPUForwardProgress-PT-36b-08
FORMULA_NAME GPUForwardProgress-PT-36b-09
FORMULA_NAME GPUForwardProgress-PT-36b-10
FORMULA_NAME GPUForwardProgress-PT-36b-11
FORMULA_NAME GPUForwardProgress-PT-36b-12
FORMULA_NAME GPUForwardProgress-PT-36b-13
FORMULA_NAME GPUForwardProgress-PT-36b-14
FORMULA_NAME GPUForwardProgress-PT-36b-15
=== Now, execution of the tool begins
BK_START 1621277707104
Running Version 0
[2021-05-17 18:55:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 18:55:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:55:08] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-17 18:55:08] [INFO ] Transformed 720 places.
[2021-05-17 18:55:08] [INFO ] Transformed 757 transitions.
[2021-05-17 18:55:08] [INFO ] Found NUPN structural information;
[2021-05-17 18:55:08] [INFO ] Parsed PT model containing 720 places and 757 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:55:08] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPUForwardProgress-PT-36b-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 720 places. Attempting structural reductions.
Starting structural reductions, 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 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 185 place count 609 transition count 647
Iterating global reduction 1 with 36 rules applied. Total rules applied 221 place count 609 transition count 647
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 255 place count 609 transition count 613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 608 transition count 612
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 608 transition count 612
Applied a total of 257 rules in 169 ms. Remains 608 /720 variables (removed 112) and now considering 612/757 (removed 145) transitions.
// Phase 1: matrix 612 rows 608 cols
[2021-05-17 18:55:09] [INFO ] Computed 37 place invariants in 26 ms
[2021-05-17 18:55:09] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 612 rows 608 cols
[2021-05-17 18:55:09] [INFO ] Computed 37 place invariants in 8 ms
[2021-05-17 18:55:09] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
// Phase 1: matrix 612 rows 608 cols
[2021-05-17 18:55:09] [INFO ] Computed 37 place invariants in 7 ms
[2021-05-17 18:55:10] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 608/720 places, 612/757 transitions.
[2021-05-17 18:55:10] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 18:55:10] [INFO ] Flatten gal took : 75 ms
FORMULA GPUForwardProgress-PT-36b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:55:10] [INFO ] Flatten gal took : 37 ms
[2021-05-17 18:55:10] [INFO ] Input system was already deterministic with 612 transitions.
Incomplete random walk after 100000 steps, including 325 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 27) seen :23
Running SMT prover for 4 properties.
// Phase 1: matrix 612 rows 608 cols
[2021-05-17 18:55:11] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:11] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:11] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-17 18:55:11] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-17 18:55:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:55:11] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 22 ms returned sat
[2021-05-17 18:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:11] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2021-05-17 18:55:11] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 40 ms.
[2021-05-17 18:55:13] [INFO ] Added : 220 causal constraints over 44 iterations in 1255 ms. Result :sat
[2021-05-17 18:55:13] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:13] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-17 18:55:13] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 46 ms.
[2021-05-17 18:55:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:55:13] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 17 ms returned sat
[2021-05-17 18:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:13] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-17 18:55:13] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 28 ms.
[2021-05-17 18:55:15] [INFO ] Added : 193 causal constraints over 40 iterations in 1153 ms. Result :sat
[2021-05-17 18:55:15] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:15] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-17 18:55:15] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-17 18:55:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:55:15] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 16 ms returned sat
[2021-05-17 18:55:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:15] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-17 18:55:15] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 34 ms.
[2021-05-17 18:55:16] [INFO ] Added : 179 causal constraints over 36 iterations in 1013 ms. Result :sat
[2021-05-17 18:55:16] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:16] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-17 18:55:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:55:17] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:55:17] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-17 18:55:17] [INFO ] Computed and/alt/rep : 606/865/606 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-17 18:55:18] [INFO ] Added : 135 causal constraints over 28 iterations in 929 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 601 transition count 605
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 600 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 600 transition count 602
Applied a total of 18 rules in 45 ms. Remains 600 /608 variables (removed 8) and now considering 602/612 (removed 10) transitions.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:18] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:18] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:18] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:18] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:18] [INFO ] Computed 37 place invariants in 4 ms
[2021-05-17 18:55:19] [INFO ] Dead Transitions using invariants and state equation in 269 ms returned []
Finished structural reductions, in 1 iterations. Remains : 600/608 places, 602/612 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s229 0), p0:(NEQ s302 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-00 finished in 1184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)||(p2&&F(p3))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Graph (trivial) has 492 edges and 608 vertex of which 6 / 608 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 292 place count 602 transition count 314
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 297 rules applied. Total rules applied 589 place count 311 transition count 308
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 595 place count 308 transition count 305
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 598 place count 305 transition count 305
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 598 place count 305 transition count 229
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 750 place count 229 transition count 229
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 751 place count 228 transition count 228
Iterating global reduction 4 with 1 rules applied. Total rules applied 752 place count 228 transition count 228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 752 place count 228 transition count 227
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 754 place count 227 transition count 227
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 962 place count 123 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 963 place count 122 transition count 122
Applied a total of 963 rules in 113 ms. Remains 122 /608 variables (removed 486) and now considering 122/612 (removed 490) transitions.
[2021-05-17 18:55:19] [INFO ] Flow matrix only has 89 transitions (discarded 33 similar events)
// Phase 1: matrix 89 rows 122 cols
[2021-05-17 18:55:19] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-17 18:55:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2021-05-17 18:55:19] [INFO ] Flow matrix only has 89 transitions (discarded 33 similar events)
// Phase 1: matrix 89 rows 122 cols
[2021-05-17 18:55:19] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:55:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:55:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2021-05-17 18:55:19] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 18:55:19] [INFO ] Flow matrix only has 89 transitions (discarded 33 similar events)
// Phase 1: matrix 89 rows 122 cols
[2021-05-17 18:55:19] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:55:19] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/608 places, 122/612 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-36b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s76 0), p0:(NEQ s32 1), p1:(NEQ s4 1), p3:(NEQ s85 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2710 steps with 87 reset in 58 ms.
FORMULA GPUForwardProgress-PT-36b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-01 finished in 583 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(F(p0))||(X(X(p1)) U ((p2&&X(X(p1)))||X(X(G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 601 transition count 605
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 600 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 600 transition count 602
Applied a total of 18 rules in 87 ms. Remains 600 /608 variables (removed 8) and now considering 602/612 (removed 10) transitions.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:20] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:20] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:20] [INFO ] Computed 37 place invariants in 10 ms
[2021-05-17 18:55:20] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:20] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:20] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 600/608 places, 602/612 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (NEQ s462 1) (NEQ s587 1) (NEQ s598 1)), p0:(NEQ s277 0), p1:(NEQ s229 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20019 reset in 331 ms.
Product exploration explored 100000 steps with 20052 reset in 371 ms.
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Knowledge obtained : [p2, (NOT p0), p1]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 19928 reset in 217 ms.
Product exploration explored 100000 steps with 20039 reset in 230 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 600/600 places, 602/602 transitions.
Graph (trivial) has 484 edges and 600 vertex of which 6 / 600 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.
Performed 288 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 288 rules applied. Total rules applied 289 place count 595 transition count 596
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 289 place count 595 transition count 598
Deduced a syphon composed of 327 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 328 place count 595 transition count 598
Discarding 177 places :
Symmetric choice reduction at 1 with 177 rule applications. Total rules 505 place count 418 transition count 421
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 682 place count 418 transition count 421
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 259 places in 1 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 791 place count 418 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 793 place count 418 transition count 419
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 868 place count 343 transition count 344
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 943 place count 343 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 944 place count 343 transition count 344
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 945 place count 342 transition count 343
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 946 place count 342 transition count 343
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 982 place count 342 transition count 450
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1018 place count 306 transition count 378
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1054 place count 306 transition count 378
Deduced a syphon composed of 184 places in 0 ms
Applied a total of 1054 rules in 148 ms. Remains 306 /600 variables (removed 294) and now considering 378/602 (removed 224) transitions.
[2021-05-17 18:55:22] [INFO ] Redundant transitions in 25 ms returned []
[2021-05-17 18:55:22] [INFO ] Flow matrix only has 344 transitions (discarded 34 similar events)
// Phase 1: matrix 344 rows 306 cols
[2021-05-17 18:55:22] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:23] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 1 iterations. Remains : 306/600 places, 378/602 transitions.
Product exploration explored 100000 steps with 19978 reset in 775 ms.
Product exploration explored 100000 steps with 20058 reset in 717 ms.
[2021-05-17 18:55:24] [INFO ] Flatten gal took : 28 ms
[2021-05-17 18:55:24] [INFO ] Flatten gal took : 26 ms
[2021-05-17 18:55:24] [INFO ] Time to serialize gal into /tmp/LTL4261766543536940085.gal : 13 ms
[2021-05-17 18:55:24] [INFO ] Time to serialize properties into /tmp/LTL3357704324302373316.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4261766543536940085.gal, -t, CGAL, -LTL, /tmp/LTL3357704324302373316.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4261766543536940085.gal -t CGAL -LTL /tmp/LTL3357704324302373316.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(p325!=0)")))||((X(X("(p267!=1)")))U((("(((p546!=1)||(p701!=1))||(p716!=1))")&&(X(X("(p267!=1)"))))||(X(X(G("(p267!=1)"))))))))))
Formula 0 simplified : !XG(XF"(p325!=0)" | (XX"(p267!=1)" U (("(((p546!=1)||(p701!=1))||(p716!=1))" & XX"(p267!=1)") | XXG"(p267!=1)")))
Detected timeout of ITS tools.
[2021-05-17 18:55:39] [INFO ] Flatten gal took : 25 ms
[2021-05-17 18:55:39] [INFO ] Applying decomposition
[2021-05-17 18:55:39] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8685948814836837917.txt, -o, /tmp/graph8685948814836837917.bin, -w, /tmp/graph8685948814836837917.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8685948814836837917.bin, -l, -1, -v, -w, /tmp/graph8685948814836837917.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:55:39] [INFO ] Decomposing Gal with order
[2021-05-17 18:55:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:55:40] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-17 18:55:40] [INFO ] Flatten gal took : 88 ms
[2021-05-17 18:55:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-17 18:55:40] [INFO ] Time to serialize gal into /tmp/LTL7099958586087352678.gal : 15 ms
[2021-05-17 18:55:40] [INFO ] Time to serialize properties into /tmp/LTL1488056853498937737.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7099958586087352678.gal, -t, CGAL, -LTL, /tmp/LTL1488056853498937737.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7099958586087352678.gal -t CGAL -LTL /tmp/LTL1488056853498937737.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(i18.u127.p325!=0)")))||((X(X("(i14.u101.p267!=1)")))U((("(((i28.u199.p546!=1)||(i36.u253.p701!=1))||(i36.u255.p716!=1))")&&(X(X("(i14.u101.p267!=1)"))))||(X(X(G("(i14.u101.p267!=1)"))))))))))
Formula 0 simplified : !XG(XF"(i18.u127.p325!=0)" | (XX"(i14.u101.p267!=1)" U (("(((i28.u199.p546!=1)||(i36.u253.p701!=1))||(i36.u255.p716!=1))" & XX"(i14.u101.p267!=1)") | XXG"(i14.u101.p267!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t538, i0.i1.t191, i0.i1.i1.u174.t184, i1.i1.t205, i1.i1.i1.u173.t198, i2.i1.t520, i2.i1.i1.u23.t513, i3.t526, i3.u19.t533, i4.t506, i4.u29.t498, i5.t484, i5.u37.t491, i6.t477, i6.t470, i7.t463, i7.t455, i8.t448, i8.t441, i9.t434, i9.t427, i10.t420, i10.t413, i11.t406, i11.t399, i12.t392, i12.t385, i13.t378, i13.t371, i14.t364, i14.u102.t355, i15.t348, i15.t341, i16.t334, i16.u110.t326, i17.t312, i17.u117.t319, i18.t305, i18.t298, i19.t291, i19.t284, i20.t270, i20.u138.t277, i21.t263, i21.u146.t254, i22.t247, i22.t240, i23.t233, i23.t226, i24.t219, i24.t212, i25.t177, i25.t169, i26.t162, i26.u191.t155, i27.t148, i27.t141, i28.t134, i28.t127, i29.t120, i29.u205.t113, i30.t106, i30.u211.t99, i31.t92, i31.u222.t85, i32.t78, i32.u223.t71, i33.t64, i33.t57, i34.t50, i34.u236.t43, i35.t36, i35.u247.t29, i36.t23, i36.t12, i36.t2, i36.u248.t24, i36.u254.t6, i36.u254.t7, i36.u254.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/522/80/602
Computing Next relation with stutter on 3.00189e+17 deadlock states
300 unique states visited
300 strongly connected components in search stack
301 transitions explored
300 items max in DFS search stack
1168 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,11.7438,267532,1,0,498119,323,6325,717316,159,964,1552372
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-36b-03 finished in 33466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(G(p1))))||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 603 transition count 607
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 603 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 603 transition count 605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 602 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 602 transition count 604
Applied a total of 14 rules in 42 ms. Remains 602 /608 variables (removed 6) and now considering 604/612 (removed 8) transitions.
// Phase 1: matrix 604 rows 602 cols
[2021-05-17 18:55:53] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:53] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 604 rows 602 cols
[2021-05-17 18:55:53] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:54] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 602 cols
[2021-05-17 18:55:54] [INFO ] Computed 37 place invariants in 4 ms
[2021-05-17 18:55:54] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Finished structural reductions, in 1 iterations. Remains : 602/608 places, 604/612 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s95 1), p2:(EQ s126 1), p1:(EQ s251 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 408 reset in 185 ms.
Product exploration explored 100000 steps with 405 reset in 265 ms.
Graph (complete) has 937 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 409 reset in 267 ms.
Product exploration explored 100000 steps with 406 reset in 253 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 602 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 602/602 places, 604/604 transitions.
Graph (trivial) has 487 edges and 602 vertex of which 6 / 602 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.
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 597 transition count 598
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 290 place count 597 transition count 1334
Deduced a syphon composed of 330 places in 2 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 331 place count 597 transition count 1334
Discarding 177 places :
Symmetric choice reduction at 1 with 177 rule applications. Total rules 508 place count 420 transition count 743
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 685 place count 420 transition count 743
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 263 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 795 place count 420 transition count 743
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 797 place count 420 transition count 741
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 872 place count 345 transition count 666
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 947 place count 345 transition count 666
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 948 place count 345 transition count 666
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 949 place count 344 transition count 665
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 950 place count 344 transition count 665
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -311
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 985 place count 344 transition count 976
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 1020 place count 309 transition count 906
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 1055 place count 309 transition count 906
Deduced a syphon composed of 188 places in 0 ms
Applied a total of 1055 rules in 143 ms. Remains 309 /602 variables (removed 293) and now considering 906/604 (removed -302) transitions.
[2021-05-17 18:55:56] [INFO ] Redundant transitions in 32 ms returned []
[2021-05-17 18:55:56] [INFO ] Flow matrix only has 774 transitions (discarded 132 similar events)
// Phase 1: matrix 774 rows 309 cols
[2021-05-17 18:55:56] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:56] [INFO ] Dead Transitions using invariants and state equation in 354 ms returned []
Finished structural reductions, in 1 iterations. Remains : 309/602 places, 906/604 transitions.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-04 finished in 3113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G((!p0||F((p1||G(!p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Graph (trivial) has 498 edges and 608 vertex of which 6 / 608 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.
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 297 place count 602 transition count 309
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 302 rules applied. Total rules applied 599 place count 306 transition count 303
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 603 place count 303 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 604 place count 302 transition count 302
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 604 place count 302 transition count 227
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 754 place count 227 transition count 227
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 755 place count 226 transition count 226
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 226 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 756 place count 226 transition count 225
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 758 place count 225 transition count 225
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 970 place count 119 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 971 place count 118 transition count 118
Applied a total of 971 rules in 38 ms. Remains 118 /608 variables (removed 490) and now considering 118/612 (removed 494) transitions.
[2021-05-17 18:55:56] [INFO ] Flow matrix only has 84 transitions (discarded 34 similar events)
// Phase 1: matrix 84 rows 118 cols
[2021-05-17 18:55:56] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:55:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2021-05-17 18:55:56] [INFO ] Flow matrix only has 84 transitions (discarded 34 similar events)
// Phase 1: matrix 84 rows 118 cols
[2021-05-17 18:55:56] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-17 18:55:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:55:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2021-05-17 18:55:56] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 18:55:56] [INFO ] Flow matrix only has 84 transitions (discarded 34 similar events)
// Phase 1: matrix 84 rows 118 cols
[2021-05-17 18:55:56] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-17 18:55:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 118/608 places, 118/612 transitions.
Stuttering acceptance computed with spot in 93 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s1 0), p1:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-05 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 601 transition count 605
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 600 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 600 transition count 602
Applied a total of 18 rules in 29 ms. Remains 600 /608 variables (removed 8) and now considering 602/612 (removed 10) transitions.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:57] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:57] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:57] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:57] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:57] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:57] [INFO ] Dead Transitions using invariants and state equation in 288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 600/608 places, 602/612 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s435 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10786 steps with 34 reset in 57 ms.
FORMULA GPUForwardProgress-PT-36b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-06 finished in 939 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Graph (trivial) has 498 edges and 608 vertex of which 6 / 608 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.
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 296 place count 602 transition count 310
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 301 rules applied. Total rules applied 597 place count 307 transition count 304
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 601 place count 304 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 303 transition count 303
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 602 place count 303 transition count 227
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 754 place count 227 transition count 227
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 755 place count 226 transition count 226
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 226 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 756 place count 226 transition count 225
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 758 place count 225 transition count 225
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 970 place count 119 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 971 place count 118 transition count 118
Applied a total of 971 rules in 33 ms. Remains 118 /608 variables (removed 490) and now considering 118/612 (removed 494) transitions.
[2021-05-17 18:55:57] [INFO ] Flow matrix only has 83 transitions (discarded 35 similar events)
// Phase 1: matrix 83 rows 118 cols
[2021-05-17 18:55:57] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-17 18:55:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2021-05-17 18:55:58] [INFO ] Flow matrix only has 83 transitions (discarded 35 similar events)
// Phase 1: matrix 83 rows 118 cols
[2021-05-17 18:55:58] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-17 18:55:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:55:58] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2021-05-17 18:55:58] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 18:55:58] [INFO ] Flow matrix only has 83 transitions (discarded 35 similar events)
// Phase 1: matrix 83 rows 118 cols
[2021-05-17 18:55:58] [INFO ] Computed 37 place invariants in 7 ms
[2021-05-17 18:55:58] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 118/608 places, 118/612 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 0) (NEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-07 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 606
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 602 transition count 605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 601 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 601 transition count 604
Applied a total of 15 rules in 27 ms. Remains 601 /608 variables (removed 7) and now considering 604/612 (removed 8) transitions.
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:55:58] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:55:58] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:55:58] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:58] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:55:58] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-17 18:55:59] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 601/608 places, 604/612 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-36b-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s324 1) (NEQ s589 1)), p1:(NEQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 328 reset in 310 ms.
Entered a terminal (fully accepting) state of product in 94613 steps with 309 reset in 243 ms.
FORMULA GPUForwardProgress-PT-36b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-08 finished in 1418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U G(p1))||X(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 601 transition count 605
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 600 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 600 transition count 602
Applied a total of 18 rules in 29 ms. Remains 600 /608 variables (removed 8) and now considering 602/612 (removed 10) transitions.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:59] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:55:59] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:55:59] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:00] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:56:00] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:00] [INFO ] Dead Transitions using invariants and state equation in 283 ms returned []
Finished structural reductions, in 1 iterations. Remains : 600/608 places, 602/612 transitions.
Stuttering acceptance computed with spot in 50 ms :[p1, false]
Running random walk in product with property : GPUForwardProgress-PT-36b-09 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s350 1), p0:(AND (EQ s569 0) (EQ s350 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property GPUForwardProgress-PT-36b-09 finished in 857 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 606
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 602 transition count 605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 601 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 601 transition count 604
Applied a total of 15 rules in 27 ms. Remains 601 /608 variables (removed 7) and now considering 604/612 (removed 8) transitions.
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:56:00] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:00] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:56:00] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:01] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:56:01] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:01] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 1 iterations. Remains : 601/608 places, 604/612 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s219 1), p1:(AND (EQ s253 1) (EQ s588 1) (EQ s599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-10 finished in 868 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p1))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 601 transition count 605
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 600 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 600 transition count 602
Applied a total of 18 rules in 31 ms. Remains 600 /608 variables (removed 8) and now considering 602/612 (removed 10) transitions.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:56:01] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:01] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:56:01] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:01] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:56:01] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:02] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Finished structural reductions, in 1 iterations. Remains : 600/608 places, 602/612 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p0) p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-14 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(EQ s554 0), p0:(OR (EQ s46 0) (EQ s587 0) (EQ s598 0) (EQ s82 0)), p1:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33388 reset in 364 ms.
Product exploration explored 100000 steps with 33356 reset in 374 ms.
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p0) p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 33353 reset in 357 ms.
Product exploration explored 100000 steps with 33312 reset in 365 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p0) p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 600/600 places, 602/602 transitions.
Graph (trivial) has 483 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.
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 595 transition count 596
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 290 place count 595 transition count 598
Deduced a syphon composed of 329 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 330 place count 595 transition count 598
Discarding 179 places :
Symmetric choice reduction at 1 with 179 rule applications. Total rules 509 place count 416 transition count 419
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 179 rules applied. Total rules applied 688 place count 416 transition count 419
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 794 place count 416 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 796 place count 416 transition count 417
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 870 place count 342 transition count 343
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 944 place count 342 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 183 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 945 place count 342 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 946 place count 341 transition count 342
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 947 place count 341 transition count 342
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 982 place count 341 transition count 446
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 1017 place count 306 transition count 376
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 1052 place count 306 transition count 376
Deduced a syphon composed of 182 places in 0 ms
Applied a total of 1052 rules in 63 ms. Remains 306 /600 variables (removed 294) and now considering 376/602 (removed 226) transitions.
[2021-05-17 18:56:04] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 18:56:04] [INFO ] Flow matrix only has 343 transitions (discarded 33 similar events)
// Phase 1: matrix 343 rows 306 cols
[2021-05-17 18:56:04] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:56:04] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Finished structural reductions, in 1 iterations. Remains : 306/600 places, 376/602 transitions.
Product exploration explored 100000 steps with 33215 reset in 1101 ms.
Product exploration explored 100000 steps with 33299 reset in 1162 ms.
[2021-05-17 18:56:06] [INFO ] Flatten gal took : 19 ms
[2021-05-17 18:56:06] [INFO ] Flatten gal took : 18 ms
[2021-05-17 18:56:06] [INFO ] Time to serialize gal into /tmp/LTL18151357711280845440.gal : 4 ms
[2021-05-17 18:56:06] [INFO ] Time to serialize properties into /tmp/LTL5353538430322346593.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18151357711280845440.gal, -t, CGAL, -LTL, /tmp/LTL5353538430322346593.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18151357711280845440.gal -t CGAL -LTL /tmp/LTL5353538430322346593.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((X("(p32!=1)"))&&("((((p48==0)||(p701==0))||(p716==0))||(p91==0))")))U(G("(p656==0)"))))
Formula 0 simplified : !(G("((((p48==0)||(p701==0))||(p716==0))||(p91==0))" & X"(p32!=1)") U G"(p656==0)")
Detected timeout of ITS tools.
[2021-05-17 18:56:21] [INFO ] Flatten gal took : 18 ms
[2021-05-17 18:56:21] [INFO ] Applying decomposition
[2021-05-17 18:56:21] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8209994310921353562.txt, -o, /tmp/graph8209994310921353562.bin, -w, /tmp/graph8209994310921353562.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8209994310921353562.bin, -l, -1, -v, -w, /tmp/graph8209994310921353562.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:56:22] [INFO ] Decomposing Gal with order
[2021-05-17 18:56:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:56:22] [INFO ] Removed a total of 77 redundant transitions.
[2021-05-17 18:56:22] [INFO ] Flatten gal took : 37 ms
[2021-05-17 18:56:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 18:56:22] [INFO ] Time to serialize gal into /tmp/LTL6504854655874177948.gal : 5 ms
[2021-05-17 18:56:22] [INFO ] Time to serialize properties into /tmp/LTL8174870050737243944.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6504854655874177948.gal, -t, CGAL, -LTL, /tmp/LTL8174870050737243944.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6504854655874177948.gal -t CGAL -LTL /tmp/LTL8174870050737243944.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G((X("(i3.i0.i1.u13.p32!=1)"))&&("((((i3.i1.i1.u19.p48==0)||(i37.u246.p701==0))||(i37.u246.p716==0))||(i6.u39.p91==0))")))U(G("(i35.u230.p656==0)"))))
Formula 0 simplified : !(G("((((i3.i1.i1.u19.p48==0)||(i37.u246.p701==0))||(i37.u246.p716==0))||(i6.u39.p91==0))" & X"(i3.i0.i1.u13.p32!=1)") U G"(i35.u230.p656==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11399161796662432033
[2021-05-17 18:56:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11399161796662432033
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11399161796662432033]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11399161796662432033] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11399161796662432033] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property GPUForwardProgress-PT-36b-14 finished in 36749 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F((p1&&G(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 608/608 places, 612/612 transitions.
Graph (trivial) has 499 edges and 608 vertex of which 6 / 608 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.
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 297 place count 602 transition count 309
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 302 rules applied. Total rules applied 599 place count 306 transition count 303
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 602 place count 303 transition count 303
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 602 place count 303 transition count 227
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 754 place count 227 transition count 227
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 974 place count 117 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 975 place count 116 transition count 116
Applied a total of 975 rules in 58 ms. Remains 116 /608 variables (removed 492) and now considering 116/612 (removed 496) transitions.
[2021-05-17 18:56:38] [INFO ] Flow matrix only has 81 transitions (discarded 35 similar events)
// Phase 1: matrix 81 rows 116 cols
[2021-05-17 18:56:38] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:56:38] [INFO ] Implicit Places using invariants in 340 ms returned []
[2021-05-17 18:56:38] [INFO ] Flow matrix only has 81 transitions (discarded 35 similar events)
// Phase 1: matrix 81 rows 116 cols
[2021-05-17 18:56:38] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:56:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-17 18:56:38] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2021-05-17 18:56:38] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 18:56:38] [INFO ] Flow matrix only has 81 transitions (discarded 35 similar events)
// Phase 1: matrix 81 rows 116 cols
[2021-05-17 18:56:38] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:56:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 116/608 places, 116/612 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s115 1), p1:(EQ s115 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-15 finished in 670 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14697372910059473025
[2021-05-17 18:56:38] [INFO ] Computing symmetric may disable matrix : 612 transitions.
[2021-05-17 18:56:38] [INFO ] Applying decomposition
[2021-05-17 18:56:38] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:56:38] [INFO ] Computing symmetric may enable matrix : 612 transitions.
[2021-05-17 18:56:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:56:38] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13945626971735106614.txt, -o, /tmp/graph13945626971735106614.bin, -w, /tmp/graph13945626971735106614.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13945626971735106614.bin, -l, -1, -v, -w, /tmp/graph13945626971735106614.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:56:38] [INFO ] Decomposing Gal with order
[2021-05-17 18:56:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:56:38] [INFO ] Computing Do-Not-Accords matrix : 612 transitions.
[2021-05-17 18:56:38] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:56:38] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14697372910059473025
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14697372910059473025]
[2021-05-17 18:56:38] [INFO ] Removed a total of 184 redundant transitions.
[2021-05-17 18:56:39] [INFO ] Flatten gal took : 78 ms
[2021-05-17 18:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 18:56:39] [INFO ] Time to serialize gal into /tmp/LTLFireability12850167759778867819.gal : 6 ms
[2021-05-17 18:56:39] [INFO ] Time to serialize properties into /tmp/LTLFireability2779411645681769824.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12850167759778867819.gal, -t, CGAL, -LTL, /tmp/LTLFireability2779411645681769824.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12850167759778867819.gal -t CGAL -LTL /tmp/LTLFireability2779411645681769824.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("((((i2.i1.u20.p48==0)||(i38.u250.p701==0))||(i38.u253.p716==0))||(i5.i1.u41.p91==0))")&&(X("(i3.i0.u13.p32!=1)"))))U(G("(i36.i0.u237.p656==0)"))))
Formula 0 simplified : !(G("((((i2.i1.u20.p48==0)||(i38.u250.p701==0))||(i38.u253.p716==0))||(i5.i1.u41.p91==0))" & X"(i3.i0.u13.p32!=1)") U G"(i36.i0.u237.p656==0)")
Reverse transition relation is NOT exact ! Due to transitions t4, t683, i2.t678, i2.i2.t667, i3.t661, i3.i1.t650, i4.t644, i4.i2.u35.t633, i5.t625, i5.i1.u41.t614, i6.t607, i6.i1.u42.t596, i7.i2.t579, i7.i2.u49.t590, i8.t571, i8.i2.t560, i9.t553, i9.i1.u66.t542, i10.t535, i10.i2.t524, i11.t517, i11.i1.u79.t506, i12.t499, i12.i1.u85.t488, i13.t481, i13.i1.t470, i14.t463, i14.i1.u97.t452, i15.t445, i15.i2.t434, i16.t428, i16.i1.t417, i17.t409, i17.i1.u111.t398, i18.t391, i18.i2.t380, i19.t373, i19.i2.t362, i20.t355, i20.i2.t344, i21.i0.t326, i21.i0.t337, i22.t319, i22.i1.u150.t308, i23.t301, i23.i2.t290, i24.t283, i24.i1.u163.t272, i25.t265, i25.i1.u164.t254, i26.t247, i26.i1.u170.t236, i27.i0.t219, i27.i0.u177.t230, i28.t211, i28.i2.t200, i29.t193, i29.i2.t182, i30.t175, i30.i2.t164, i31.t157, i31.i2.t146, i32.i0.t128, i32.i0.u210.t139, i33.t121, i33.i2.t110, i34.i0.t92, i34.i0.u225.t103, i35.t85, i35.i1.u229.t74, i36.t67, i36.i1.u235.t56, i37.i1.t38, i37.i1.u245.t49, i38.t30, i38.t15, i38.t14, i38.u247.t33, i38.u254.t7, i38.u254.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/532/80/612
Computing Next relation with stutter on 3.00189e+17 deadlock states
Compilation finished in 4269 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14697372910059473025]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([](((LTLAPp0==true)&&X((LTLAPp1==true)))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14697372910059473025]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1176 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,11.8211,394900,1,0,755802,334,5995,1.06074e+06,156,820,1911950
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1621277826438
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-36b, examination is 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 r292-tall-162124156200237"
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 '
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 ;