About the Execution of ITS-Tools for QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.903 | 3600000.00 | 4988449.00 | 67697.20 | FTFFFF?FFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400972.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400972
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 22K Apr 30 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 30 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 13:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 149K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652994286455
Running Version 202205111006
[2022-05-19 21:04:47] [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]
[2022-05-19 21:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 21:04:47] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-19 21:04:47] [INFO ] Transformed 550 places.
[2022-05-19 21:04:47] [INFO ] Transformed 176 transitions.
[2022-05-19 21:04:47] [INFO ] Parsed PT model containing 550 places and 176 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 468 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 144 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 49 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 21:04:48] [INFO ] Computed 350 place invariants in 36 ms
[2022-05-19 21:04:48] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 21:04:48] [INFO ] Computed 350 place invariants in 14 ms
[2022-05-19 21:04:49] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [303, 304, 311, 312, 313, 315, 316, 317, 318, 355]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1061 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 514/550 places, 176/176 transitions.
Support contains 144 out of 514 places after structural reductions.
[2022-05-19 21:04:49] [INFO ] Flatten gal took : 57 ms
[2022-05-19 21:04:49] [INFO ] Flatten gal took : 30 ms
[2022-05-19 21:04:49] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 132 out of 514 places (down from 144) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 23) seen :4
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:50] [INFO ] Computed 340 place invariants in 8 ms
[2022-05-19 21:04:50] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2022-05-19 21:04:50] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:17
[2022-05-19 21:04:50] [INFO ] After 167ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:17
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-19 21:04:51] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:17
[2022-05-19 21:04:51] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 52 ms returned sat
[2022-05-19 21:04:51] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :15
[2022-05-19 21:04:52] [INFO ] After 807ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :15
Attempting to minimize the solution found.
Minimization took 307 ms.
[2022-05-19 21:04:52] [INFO ] After 1564ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :15
Fused 18 Parikh solutions to 14 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 15 properties in 26 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 12 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:53] [INFO ] Computed 340 place invariants in 12 ms
[2022-05-19 21:04:53] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:53] [INFO ] Computed 340 place invariants in 5 ms
[2022-05-19 21:04:54] [INFO ] Implicit Places using invariants and state equation in 560 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 911 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s80 1) (GEQ s501 1) (GEQ s502 1) (GEQ s503 1) (GEQ s504 1) (GEQ s505 1) (GEQ s507 1) (GEQ s508 1) (GEQ s509 1) (GEQ s510 1) (GEQ s511 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-00 finished in 1484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(X(X(G(p0)))))&&(p0 U F(p1))))&&p0)))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:54] [INFO ] Computed 340 place invariants in 10 ms
[2022-05-19 21:04:54] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:54] [INFO ] Computed 340 place invariants in 3 ms
[2022-05-19 21:04:55] [INFO ] Implicit Places using invariants and state equation in 576 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 913 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}]], initial=0, aps=[p0:(GEQ s75 1), p1:(GEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-02 finished in 1277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 22 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.9 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 500 transition count 172
Applied a total of 5 rules in 40 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2022-05-19 21:04:55] [INFO ] Computed 330 place invariants in 7 ms
[2022-05-19 21:04:56] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 172 rows 500 cols
[2022-05-19 21:04:56] [INFO ] Computed 330 place invariants in 15 ms
[2022-05-19 21:04:56] [INFO ] Implicit Places using invariants and state equation in 590 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 922 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/514 places, 172/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 499/514 places, 172/176 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s477 1)) (AND (GEQ s68 1) (GEQ s418 1)) (AND (GEQ s72 1) (GEQ s422 1)) (AND (GEQ s69 1) (GEQ s478 1)) (AND (GEQ s78 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 235 steps with 34 reset in 10 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-03 finished in 1070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U p1)&&X(F(X(!p0))))))'
Support contains 13 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:56] [INFO ] Computed 340 place invariants in 3 ms
[2022-05-19 21:04:57] [INFO ] Implicit Places using invariants in 321 ms returned []
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:57] [INFO ] Computed 340 place invariants in 4 ms
[2022-05-19 21:04:57] [INFO ] Implicit Places using invariants and state equation in 530 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 766 ms :[(OR p0 p1), (OR p0 p1), true, p1, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LT s80 1), p0:(OR (AND (GEQ s0 1) (GEQ s35 1)) (AND (GEQ s0 1) (GEQ s37 1)) (AND (GEQ s0 1) (GEQ s36 1)) (AND (GEQ s0 1) (GEQ s46 1)) (AND (GEQ s0 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-04 finished in 1653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U G((G(p0)&&p1))))&&G(p2))))'
Support contains 45 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 512 transition count 174
Applied a total of 3 rules in 45 ms. Remains 512 /514 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 512 cols
[2022-05-19 21:04:58] [INFO ] Computed 340 place invariants in 5 ms
[2022-05-19 21:04:58] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 174 rows 512 cols
[2022-05-19 21:04:58] [INFO ] Computed 340 place invariants in 5 ms
[2022-05-19 21:04:59] [INFO ] Implicit Places using invariants and state equation in 614 ms returned [308, 420, 421, 422, 423, 424, 425, 477, 480, 481, 482, 483]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 912 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/514 places, 174/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/514 places, 174/176 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s52 1) (GEQ s482 1)) (AND (GEQ s43 1) (GEQ s475 1)) (AND (GEQ s51 1) (GEQ s483 1)) (AND (GEQ s53 1) (GEQ s481 1)) (AND (GEQ s44 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 1122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(!p0 U (X(p0)&&p1)))||G(X(X(p2))))))'
Support contains 35 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:59] [INFO ] Computed 340 place invariants in 3 ms
[2022-05-19 21:04:59] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:04:59] [INFO ] Computed 340 place invariants in 7 ms
[2022-05-19 21:05:00] [INFO ] Implicit Places using invariants and state equation in 562 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 877 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1), (AND p1 p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 p2), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(OR (GEQ s46 1) (GEQ s32 1) (GEQ s35 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s42 1) (GEQ s45 1)), p2:(OR (LT s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6925 reset in 356 ms.
Product exploration explored 100000 steps with 6921 reset in 249 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X p2)), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 979 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 8 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p2), p0, (AND p0 (NOT p2)), (AND p1 p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:03] [INFO ] Computed 340 place invariants in 24 ms
[2022-05-19 21:05:03] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2022-05-19 21:05:03] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 21:05:03] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2022-05-19 21:05:03] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2022-05-19 21:05:04] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 134 ms.
[2022-05-19 21:05:04] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 4 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 7 properties in 8 ms. (steps per millisecond=3 )
Parikh walk visited 7 properties in 8 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X p2)), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (AND p2 p0)), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 1365 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:06] [INFO ] Computed 340 place invariants in 22 ms
[2022-05-19 21:05:06] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:06] [INFO ] Computed 340 place invariants in 23 ms
[2022-05-19 21:05:07] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:07] [INFO ] Computed 340 place invariants in 27 ms
[2022-05-19 21:05:07] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:08] [INFO ] Computed 340 place invariants in 16 ms
[2022-05-19 21:05:08] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 51 ms returned sat
[2022-05-19 21:05:08] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 21:05:08] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 47 ms returned sat
[2022-05-19 21:05:08] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 21:05:08] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-19 21:05:09] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 764 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Product exploration explored 100000 steps with 6923 reset in 220 ms.
Product exploration explored 100000 steps with 6930 reset in 186 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 6 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 501 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 94 ms. Remains 501 /513 variables (removed 12) and now considering 175/176 (removed 1) transitions.
[2022-05-19 21:05:11] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 175 rows 501 cols
[2022-05-19 21:05:11] [INFO ] Computed 330 place invariants in 9 ms
[2022-05-19 21:05:11] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 175/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/513 places, 175/176 transitions.
Product exploration explored 100000 steps with 6927 reset in 231 ms.
Product exploration explored 100000 steps with 6930 reset in 197 ms.
Built C files in :
/tmp/ltsmin13770229091956815716
[2022-05-19 21:05:12] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13770229091956815716
Running compilation step : cd /tmp/ltsmin13770229091956815716;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 519 ms.
Running link step : cd /tmp/ltsmin13770229091956815716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13770229091956815716;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9018427114282622605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 26 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:27] [INFO ] Computed 340 place invariants in 22 ms
[2022-05-19 21:05:27] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:27] [INFO ] Computed 340 place invariants in 24 ms
[2022-05-19 21:05:28] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2022-05-19 21:05:28] [INFO ] Computed 340 place invariants in 27 ms
[2022-05-19 21:05:28] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin15332735550154510448
[2022-05-19 21:05:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15332735550154510448
Running compilation step : cd /tmp/ltsmin15332735550154510448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 402 ms.
Running link step : cd /tmp/ltsmin15332735550154510448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15332735550154510448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5980701328618252863.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:05:43] [INFO ] Flatten gal took : 24 ms
[2022-05-19 21:05:43] [INFO ] Flatten gal took : 23 ms
[2022-05-19 21:05:43] [INFO ] Time to serialize gal into /tmp/LTL6671112452754100274.gal : 4 ms
[2022-05-19 21:05:43] [INFO ] Time to serialize properties into /tmp/LTL1151436249637294923.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6671112452754100274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1151436249637294923.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6671112...266
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_...657
Formula 0 simplified : !G(G!(!"(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_6>=1...628
Detected timeout of ITS tools.
[2022-05-19 21:05:58] [INFO ] Flatten gal took : 21 ms
[2022-05-19 21:05:58] [INFO ] Applying decomposition
[2022-05-19 21:05:58] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2952331014663707127.txt' '-o' '/tmp/graph2952331014663707127.bin' '-w' '/tmp/graph2952331014663707127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2952331014663707127.bin' '-l' '-1' '-v' '-w' '/tmp/graph2952331014663707127.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:05:58] [INFO ] Decomposing Gal with order
[2022-05-19 21:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:05:58] [INFO ] Removed a total of 109 redundant transitions.
[2022-05-19 21:05:58] [INFO ] Flatten gal took : 84 ms
[2022-05-19 21:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 22 ms.
[2022-05-19 21:05:58] [INFO ] Time to serialize gal into /tmp/LTL3237729455265933536.gal : 8 ms
[2022-05-19 21:05:58] [INFO ] Time to serialize properties into /tmp/LTL15073366324325284871.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3237729455265933536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15073366324325284871.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3237729...246
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((i16.i1.u19.s4_9>=1)||(i13.i0.u11.s4_0>=1))||((i17.u12.s4_3>=1)||(i14.i0.u13.s4_1>=1)))||(((i11.i0.u64.s4_4>=1)||(i6...1123
Formula 0 simplified : !G(G!(!"(((((i16.i1.u19.s4_9>=1)||(i13.i0.u11.s4_0>=1))||((i17.u12.s4_3>=1)||(i14.i0.u13.s4_1>=1)))||(((i11.i0.u64.s4_4>=1)||(i6.i0....1094
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5714719105959735464
[2022-05-19 21:06:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5714719105959735464
Running compilation step : cd /tmp/ltsmin5714719105959735464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 398 ms.
Running link step : cd /tmp/ltsmin5714719105959735464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5714719105959735464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-06 finished in 89502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F((X(p0)||X(p1)))||G(p1)) U p2))'
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 173
Applied a total of 3 rules in 30 ms. Remains 501 /514 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:29] [INFO ] Computed 330 place invariants in 7 ms
[2022-05-19 21:06:29] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:29] [INFO ] Computed 330 place invariants in 10 ms
[2022-05-19 21:06:29] [INFO ] Implicit Places using invariants and state equation in 531 ms returned [307]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 857 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/514 places, 173/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/514 places, 173/176 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s55 1)), p1:(GEQ s85 1), p2:(GEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-08 finished in 1051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&p1))&&G(F(G(F(!p1))))))'
Support contains 13 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 347 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.1 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 346 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 345 transition count 127
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 345 transition count 127
Applied a total of 26 rules in 26 ms. Remains 345 /514 variables (removed 169) and now considering 127/176 (removed 49) transitions.
// Phase 1: matrix 127 rows 345 cols
[2022-05-19 21:06:30] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-19 21:06:30] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 127 rows 345 cols
[2022-05-19 21:06:30] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-19 21:06:30] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [266, 267, 268, 269, 270, 271, 321, 324, 325, 326, 327]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 514 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 334/514 places, 127/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 334 /334 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 334/514 places, 127/176 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (NOT p1)), p1, p1, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s105 1) (LT s141 1) (LT s142 1) (LT s143 1) (LT s144 1) (LT s145 1) (LT s146 1) (LT s147 1) (LT s148 1) (LT s149 1) (LT s150 1) (LT s163 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-09 finished in 741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((F(p0) U G(F(p0))))) U X(F(G(p0))))))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 347 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.2 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 347 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 345 transition count 127
Applied a total of 27 rules in 23 ms. Remains 345 /514 variables (removed 169) and now considering 127/176 (removed 49) transitions.
// Phase 1: matrix 127 rows 345 cols
[2022-05-19 21:06:30] [INFO ] Computed 220 place invariants in 3 ms
[2022-05-19 21:06:31] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 127 rows 345 cols
[2022-05-19 21:06:31] [INFO ] Computed 220 place invariants in 8 ms
[2022-05-19 21:06:31] [INFO ] Implicit Places using invariants and state equation in 325 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 534 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 344/514 places, 127/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 344 /344 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 344/514 places, 127/176 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s56 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 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-10 finished in 614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||!p1) U !p2))'
Support contains 17 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 501 transition count 173
Applied a total of 4 rules in 31 ms. Remains 501 /514 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:31] [INFO ] Computed 330 place invariants in 7 ms
[2022-05-19 21:06:31] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:31] [INFO ] Computed 330 place invariants in 7 ms
[2022-05-19 21:06:32] [INFO ] Implicit Places using invariants and state equation in 498 ms returned [307]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 828 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/514 places, 173/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/514 places, 173/176 transitions.
Stuttering acceptance computed with spot in 86 ms :[p2, true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (NOT (OR (NOT (AND (GEQ s0 1) (GEQ s51 1))) (GEQ s75 1))) (NOT (AND (GEQ s74 1) (GEQ s421 1)))), p1:(AND (GEQ s27 1) (GEQ s330 1) (GEQ s331 1) (GEQ...], 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 26 steps with 2 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-12 finished in 974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !p1))'
Support contains 14 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 501 transition count 173
Applied a total of 4 rules in 29 ms. Remains 501 /514 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:32] [INFO ] Computed 330 place invariants in 8 ms
[2022-05-19 21:06:32] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:32] [INFO ] Computed 330 place invariants in 4 ms
[2022-05-19 21:06:33] [INFO ] Implicit Places using invariants and state equation in 592 ms returned [307]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 909 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/514 places, 173/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/514 places, 173/176 transitions.
Stuttering acceptance computed with spot in 71 ms :[p1, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s85 1) (LT s466 1) (LT s467 1) (LT s468 1) (LT s469 1) (LT s470 1) (LT s471 1) (LT s472 1) (LT s473 1) (LT s474 1) (LT s476 1) (LT s477 1)), p0...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-13 finished in 1032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&p1))))'
Support contains 14 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:06:33] [INFO ] Computed 340 place invariants in 5 ms
[2022-05-19 21:06:33] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 176 rows 514 cols
[2022-05-19 21:06:33] [INFO ] Computed 340 place invariants in 3 ms
[2022-05-19 21:06:34] [INFO ] Implicit Places using invariants and state equation in 557 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 892 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s23 1) (LT s338 1) (LT s346 1) (LT s349 1) (LT s359 1) (LT s377 1) (LT s380 1) (LT s390 1) (LT s410 1) (LT s417 1) (LT s434 1) (LT s446 1)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6926 reset in 188 ms.
Product exploration explored 100000 steps with 6931 reset in 203 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 8 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-14 finished in 1845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(!p0 U (X(p0)&&p1)))||G(X(X(p2))))))'
Found a SL insensitive property : QuasiCertifProtocol-PT-10-LTLFireability-06
Stuttering acceptance computed with spot in 317 ms :[true, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND (NOT p2) p0 p1), (AND p1 p0), (NOT p2)]
Support contains 35 out of 514 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 501 transition count 173
Applied a total of 4 rules in 30 ms. Remains 501 /514 variables (removed 13) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:35] [INFO ] Computed 330 place invariants in 10 ms
[2022-05-19 21:06:36] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 173 rows 501 cols
[2022-05-19 21:06:36] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-19 21:06:36] [INFO ] Implicit Places using invariants and state equation in 537 ms returned [307]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 844 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 500/514 places, 173/176 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 500/514 places, 173/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 p2), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=3, aps=[p0:(OR (GEQ s46 1) (GEQ s32 1) (GEQ s35 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s42 1) (GEQ s45 1)), p2:(OR (LT s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6928 reset in 199 ms.
Product exploration explored 100000 steps with 6923 reset in 199 ms.
Computed a total of 500 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 173
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X p2)), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 854 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 8 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p2), p0, (AND p0 (NOT p2)), (AND p1 p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:06:38] [INFO ] Computed 330 place invariants in 8 ms
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 50 ms returned sat
[2022-05-19 21:06:38] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 21:06:39] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 48 ms returned sat
[2022-05-19 21:06:39] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2022-05-19 21:06:39] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-05-19 21:06:39] [INFO ] After 935ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 7 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=7 )
Parikh walk visited 7 properties in 3 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X p2)), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (AND p2 p0)), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 1662 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:06:42] [INFO ] Computed 330 place invariants in 20 ms
[2022-05-19 21:06:42] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:06:42] [INFO ] Computed 330 place invariants in 8 ms
[2022-05-19 21:06:43] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:06:43] [INFO ] Computed 330 place invariants in 9 ms
[2022-05-19 21:06:43] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 173/173 transitions.
Computed a total of 500 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 173
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:06:44] [INFO ] Computed 330 place invariants in 17 ms
[2022-05-19 21:06:44] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 50 ms returned sat
[2022-05-19 21:06:44] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 21:06:44] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 51 ms returned sat
[2022-05-19 21:06:44] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 21:06:44] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-05-19 21:06:44] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 29 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=7 )
Parikh walk visited 4 properties in 3 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 442 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Stuttering acceptance computed with spot in 602 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Product exploration explored 100000 steps with 6929 reset in 179 ms.
Product exploration explored 100000 steps with 6919 reset in 180 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), p0, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 p0)]
Support contains 35 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 173/173 transitions.
Applied a total of 0 rules in 27 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2022-05-19 21:06:47] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:06:47] [INFO ] Computed 330 place invariants in 9 ms
[2022-05-19 21:06:47] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 173/173 transitions.
Product exploration explored 100000 steps with 6929 reset in 189 ms.
Product exploration explored 100000 steps with 6924 reset in 177 ms.
Built C files in :
/tmp/ltsmin3515590431673187961
[2022-05-19 21:06:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3515590431673187961
Running compilation step : cd /tmp/ltsmin3515590431673187961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 422 ms.
Running link step : cd /tmp/ltsmin3515590431673187961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3515590431673187961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13782620917771630833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:07:03] [INFO ] Computed 330 place invariants in 15 ms
[2022-05-19 21:07:03] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:07:03] [INFO ] Computed 330 place invariants in 9 ms
[2022-05-19 21:07:04] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 500 cols
[2022-05-19 21:07:04] [INFO ] Computed 330 place invariants in 10 ms
[2022-05-19 21:07:04] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 173/173 transitions.
Built C files in :
/tmp/ltsmin16018929936558050032
[2022-05-19 21:07:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16018929936558050032
Running compilation step : cd /tmp/ltsmin16018929936558050032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 422 ms.
Running link step : cd /tmp/ltsmin16018929936558050032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16018929936558050032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11284110150104067513.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 21:07:19] [INFO ] Flatten gal took : 21 ms
[2022-05-19 21:07:19] [INFO ] Flatten gal took : 17 ms
[2022-05-19 21:07:19] [INFO ] Time to serialize gal into /tmp/LTL12984487205551033687.gal : 3 ms
[2022-05-19 21:07:19] [INFO ] Time to serialize properties into /tmp/LTL10831133990072674072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12984487205551033687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10831133990072674072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1298448...268
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_...657
Formula 0 simplified : !G(G!(!"(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_6>=1...628
Detected timeout of ITS tools.
[2022-05-19 21:07:34] [INFO ] Flatten gal took : 17 ms
[2022-05-19 21:07:34] [INFO ] Applying decomposition
[2022-05-19 21:07:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11140814278208593424.txt' '-o' '/tmp/graph11140814278208593424.bin' '-w' '/tmp/graph11140814278208593424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11140814278208593424.bin' '-l' '-1' '-v' '-w' '/tmp/graph11140814278208593424.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:07:34] [INFO ] Decomposing Gal with order
[2022-05-19 21:07:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:07:34] [INFO ] Removed a total of 122 redundant transitions.
[2022-05-19 21:07:34] [INFO ] Flatten gal took : 51 ms
[2022-05-19 21:07:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 48 ms.
[2022-05-19 21:07:34] [INFO ] Time to serialize gal into /tmp/LTL17401920322745953514.gal : 90 ms
[2022-05-19 21:07:34] [INFO ] Time to serialize properties into /tmp/LTL9097553931253397633.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17401920322745953514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9097553931253397633.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1740192...246
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((i22.u16.s4_9>=1)||(i11.u52.s4_0>=1))||((i15.u11.s4_3>=1)||(i19.u12.s4_1>=1)))||(((i14.u55.s4_4>=1)||(i12.u14.s4_7>=...1025
Formula 0 simplified : !G(G!(!"(((((i22.u16.s4_9>=1)||(i11.u52.s4_0>=1))||((i15.u11.s4_3>=1)||(i19.u12.s4_1>=1)))||(((i14.u55.s4_4>=1)||(i12.u14.s4_7>=1))|...996
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10895486901794129184
[2022-05-19 21:07:49] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10895486901794129184
Running compilation step : cd /tmp/ltsmin10895486901794129184;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin10895486901794129184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10895486901794129184;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-06 finished in 89639 ms.
[2022-05-19 21:08:04] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16339903219964054736
[2022-05-19 21:08:04] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2022-05-19 21:08:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:08:05] [INFO ] Applying decomposition
[2022-05-19 21:08:05] [INFO ] Flatten gal took : 14 ms
[2022-05-19 21:08:05] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2022-05-19 21:08:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 21:08:05] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16951411574062370819.txt' '-o' '/tmp/graph16951411574062370819.bin' '-w' '/tmp/graph16951411574062370819.weights'
[2022-05-19 21:08:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16951411574062370819.bin' '-l' '-1' '-v' '-w' '/tmp/graph16951411574062370819.weights' '-q' '0' '-e' '0.001'
[2022-05-19 21:08:05] [INFO ] Decomposing Gal with order
[2022-05-19 21:08:05] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16339903219964054736
Running compilation step : cd /tmp/ltsmin16339903219964054736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 21:08:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 21:08:05] [INFO ] Removed a total of 109 redundant transitions.
[2022-05-19 21:08:05] [INFO ] Flatten gal took : 29 ms
[2022-05-19 21:08:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 11 ms.
[2022-05-19 21:08:05] [INFO ] Time to serialize gal into /tmp/LTLFireability17554361520162621888.gal : 3 ms
[2022-05-19 21:08:05] [INFO ] Time to serialize properties into /tmp/LTLFireability15310616388555072992.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17554361520162621888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15310616388555072992.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((i12.i1.u19.s4_9>=1)||(i16.i0.u11.s4_0>=1))||((i20.i1.u60.s4_3>=1)||(i17.u13.s4_1>=1)))||(((i10.u12.s4_4>=1)||(i9.i1...1113
Formula 0 simplified : !G(G!(!"(((((i12.i1.u19.s4_9>=1)||(i16.i0.u11.s4_0>=1))||((i20.i1.u60.s4_3>=1)||(i17.u13.s4_1>=1)))||(((i10.u12.s4_4>=1)||(i9.i1.u59...1084
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin16339903219964054736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16339903219964054736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: LTL layer: formula: [](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))
pins2lts-mc-linux64( 4/ 8), 0.003: "[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.073: DFS-FIFO for weak LTL, using special progress label 180
pins2lts-mc-linux64( 0/ 8), 0.073: There are 181 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.073: State length is 515, there are 201 groups
pins2lts-mc-linux64( 0/ 8), 0.073: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.073: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.073: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.073: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.167: ~1 levels ~960 states ~9008 transitions
pins2lts-mc-linux64( 2/ 8), 0.211: ~1 levels ~1920 states ~17936 transitions
pins2lts-mc-linux64( 2/ 8), 0.279: ~1 levels ~3840 states ~36376 transitions
pins2lts-mc-linux64( 2/ 8), 0.381: ~1 levels ~7680 states ~63912 transitions
pins2lts-mc-linux64( 2/ 8), 0.557: ~1 levels ~15360 states ~114248 transitions
pins2lts-mc-linux64( 2/ 8), 0.833: ~1 levels ~30720 states ~194256 transitions
pins2lts-mc-linux64( 2/ 8), 1.178: ~1 levels ~61440 states ~321400 transitions
pins2lts-mc-linux64( 2/ 8), 2.845: ~1 levels ~122880 states ~1193376 transitions
pins2lts-mc-linux64( 7/ 8), 4.682: ~1 levels ~245760 states ~2544664 transitions
pins2lts-mc-linux64( 7/ 8), 7.205: ~1 levels ~491520 states ~4497224 transitions
pins2lts-mc-linux64( 7/ 8), 11.462: ~1 levels ~983040 states ~7795832 transitions
pins2lts-mc-linux64( 7/ 8), 18.681: ~1 levels ~1966080 states ~11902096 transitions
pins2lts-mc-linux64( 6/ 8), 38.134: ~1 levels ~3932160 states ~25655112 transitions
pins2lts-mc-linux64( 4/ 8), 72.399: ~1 levels ~7864320 states ~47503992 transitions
pins2lts-mc-linux64( 7/ 8), 151.694: ~1 levels ~15728640 states ~117710624 transitions
pins2lts-mc-linux64( 5/ 8), 322.916: ~1 levels ~31457280 states ~239273144 transitions
pins2lts-mc-linux64( 3/ 8), 370.271: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 370.321:
pins2lts-mc-linux64( 0/ 8), 370.321: mean standard work distribution: 11.3% (states) 5.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 370.321:
pins2lts-mc-linux64( 0/ 8), 370.321: Explored 30949940 states 287239054 transitions, fanout: 9.281
pins2lts-mc-linux64( 0/ 8), 370.321: Total exploration time 370.230 sec (370.170 sec minimum, 370.202 sec on average)
pins2lts-mc-linux64( 0/ 8), 370.321: States per second: 83597, Transitions per second: 775839
pins2lts-mc-linux64( 0/ 8), 370.322:
pins2lts-mc-linux64( 0/ 8), 370.322: Progress states detected: 42261231
pins2lts-mc-linux64( 0/ 8), 370.322: Redundant explorations: -26.7654
pins2lts-mc-linux64( 0/ 8), 370.322:
pins2lts-mc-linux64( 0/ 8), 370.322: Queue width: 8B, total height: 20662928, memory: 157.65MB
pins2lts-mc-linux64( 0/ 8), 370.322: Tree memory: 578.4MB, 14.4 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 370.322: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 370.322: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 370.322: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 370.322: Est. total memory use: 736.1MB (~1181.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16339903219964054736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16339903219964054736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](!(!(LTLAPp0==true) U (X((LTLAPp0==true))&&(LTLAPp1==true))))||[](X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 21:29:11] [INFO ] Flatten gal took : 196 ms
[2022-05-19 21:29:12] [INFO ] Time to serialize gal into /tmp/LTLFireability12756824814830400373.gal : 397 ms
[2022-05-19 21:29:12] [INFO ] Time to serialize properties into /tmp/LTLFireability3761440152549825774.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12756824814830400373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3761440152549825774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((G((G(!((!("(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_...657
Formula 0 simplified : !G(G!(!"(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_6>=1...628
Detected timeout of ITS tools.
[2022-05-19 21:50:17] [INFO ] Flatten gal took : 60 ms
[2022-05-19 21:50:18] [INFO ] Input system was already deterministic with 176 transitions.
[2022-05-19 21:50:18] [INFO ] Transformed 514 places.
[2022-05-19 21:50:18] [INFO ] Transformed 176 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 21:50:18] [INFO ] Time to serialize gal into /tmp/LTLFireability13563483509715182505.gal : 6 ms
[2022-05-19 21:50:18] [INFO ] Time to serialize properties into /tmp/LTLFireability4601125266434020547.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13563483509715182505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4601125266434020547.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G(!((!("(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_...657
Formula 0 simplified : !G(G!(!"(((((s4_9>=1)||(s4_0>=1))||((s4_3>=1)||(s4_1>=1)))||(((s4_4>=1)||(s4_7>=1))||((s4_2>=1)||(s4_5>=1))))||(((s4_8>=1)||(s4_6>=1...628
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
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 QuasiCertifProtocol-PT-10, 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 r168-tall-165277017400972"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 ;