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-165277017400955.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400955
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.1K Apr 30 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 30 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 13:16 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 4.5K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 55K 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-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652992485718

Running Version 202205111006
[2022-05-19 20:34:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 20:34:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:34:47] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-19 20:34:47] [INFO ] Transformed 86 places.
[2022-05-19 20:34:47] [INFO ] Transformed 56 transitions.
[2022-05-19 20:34:47] [INFO ] Parsed PT model containing 86 places and 56 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 56
Applied a total of 4 rules in 9 ms. Remains 82 /86 variables (removed 4) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 82 cols
[2022-05-19 20:34:47] [INFO ] Computed 27 place invariants in 23 ms
[2022-05-19 20:34:47] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 56 rows 82 cols
[2022-05-19 20:34:47] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-19 20:34:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [48, 49, 55]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 325 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 79/86 places, 56/56 transitions.
Support contains 43 out of 79 places after structural reductions.
[2022-05-19 20:34:47] [INFO ] Flatten gal took : 26 ms
[2022-05-19 20:34:47] [INFO ] Flatten gal took : 14 ms
[2022-05-19 20:34:47] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1639 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 10000 steps, including 561 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 542 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 564 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 563 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 558 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 569 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 575 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 559 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 550 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 553 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 565 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 56 rows 79 cols
[2022-05-19 20:34:49] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-19 20:34:49] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2022-05-19 20:34:49] [INFO ] [Real]Absence check using 1 positive and 23 generalized place invariants in 4 ms returned sat
[2022-05-19 20:34:49] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-19 20:34:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-19 20:34:49] [INFO ] [Nat]Absence check using 1 positive and 23 generalized place invariants in 17 ms returned sat
[2022-05-19 20:34:49] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2022-05-19 20:34:50] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-19 20:34:50] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :8
Fused 12 Parikh solutions to 7 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 8 properties in 6 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 79 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!F(G(F(p0))) U X((G(p1)||p1)))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 74 transition count 56
Applied a total of 5 rules in 2 ms. Remains 74 /79 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 20:34:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:34:50] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 20:34:50] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:34:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 20:34:50] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-19 20:34:50] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/79 places, 56/56 transitions.
Stuttering acceptance computed with spot in 629 ms :[p1, p1, p1, true, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s7 s8 s9) s24), p0:(LEQ 1 s21)], 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-00 finished in 993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(X(p1))))))'
Support contains 9 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 56
Applied a total of 3 rules in 4 ms. Remains 76 /79 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:34:51] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-19 20:34:51] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:34:51] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-19 20:34:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:34:51] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 20:34:51] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/79 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/79 places, 56/56 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ (ADD s1 s2 s3) (ADD s34 s35 s40)), p1:(GT 2 (ADD s15 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
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 p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-01 finished in 1183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||p1))))'
Support contains 14 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Graph (complete) has 150 edges and 79 vertex of which 70 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3 place count 68 transition count 52
Applied a total of 3 rules in 10 ms. Remains 68 /79 variables (removed 11) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 68 cols
[2022-05-19 20:34:52] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-19 20:34:52] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 52 rows 68 cols
[2022-05-19 20:34:52] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-19 20:34:52] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [51, 57, 58]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 188 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/79 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/79 places, 52/56 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT s24 (ADD s35 s36 s37 s38 s39 s40 s41 s42 s43)) (LEQ (ADD s8 s9 s10) s4)), p0:(LEQ (ADD s8 s9 s10) s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19050 reset in 245 ms.
Product exploration explored 100000 steps with 19042 reset in 185 ms.
Computed a total of 65 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 52
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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1879 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 20:34:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 20:34:53] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 20:34:53] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 20:34:53] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 20:34:53] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-19 20:34:53] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Support contains 14 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 52/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 20:34:54] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-19 20:34:54] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 20:34:54] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-19 20:34:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-19 20:34:54] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 20:34:54] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 20:34:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 52/52 transitions.
Computed a total of 65 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 52
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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 523 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1865 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 20:34:55] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 20:34:55] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 20:34:55] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 13 ms returned sat
[2022-05-19 20:34:55] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 20:34:55] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-19 20:34:55] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19081 reset in 127 ms.
Product exploration explored 100000 steps with 19083 reset in 144 ms.
Built C files in :
/tmp/ltsmin8455045793917185347
[2022-05-19 20:34:55] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 20:34:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:34:55] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 20:34:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:34:55] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 20:34:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:34:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8455045793917185347
Running compilation step : cd /tmp/ltsmin8455045793917185347;'/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 225 ms.
Running link step : cd /tmp/ltsmin8455045793917185347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8455045793917185347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16831817731685465376.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-03 finished in 3737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Graph (complete) has 150 edges and 79 vertex of which 35 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 35 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 35 transition count 30
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 34 transition count 29
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 34 transition count 29
Applied a total of 16 rules in 7 ms. Remains 34 /79 variables (removed 45) and now considering 29/56 (removed 27) transitions.
// Phase 1: matrix 29 rows 34 cols
[2022-05-19 20:34:56] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 20:34:56] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 29 rows 34 cols
[2022-05-19 20:34:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 20:34:56] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-19 20:34:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 34 cols
[2022-05-19 20:34:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 20:34:56] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/79 places, 29/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/79 places, 29/56 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s12 (ADD s15 s19 s20))], 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 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-04 finished in 175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p1 U G(!p1))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Graph (complete) has 150 edges and 79 vertex of which 69 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 66 transition count 51
Applied a total of 5 rules in 13 ms. Remains 66 /79 variables (removed 13) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2022-05-19 20:34:56] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-19 20:34:56] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 51 rows 66 cols
[2022-05-19 20:34:56] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-19 20:34:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [49, 55, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 112 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/79 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/79 places, 51/56 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s15 s17 s18)), p1:(GT 3 (ADD s54 s55 s61))], 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]]
Product exploration explored 100000 steps with 35947 reset in 104 ms.
Product exploration explored 100000 steps with 35884 reset in 150 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 4607 steps, including 864 resets, run visited all 3 properties in 10 ms. (steps per millisecond=460 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 366 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:34:57] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-19 20:34:57] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 20:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:34:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 20:34:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:34:58] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 20:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:34:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-19 20:34:58] [INFO ] Computed and/alt/rep : 44/84/44 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 20:34:58] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:34:58] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-19 20:34:58] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:34:58] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-19 20:34:58] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-19 20:34:58] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:34:58] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-19 20:34:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 51/51 transitions.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 1136 steps, including 212 resets, run visited all 3 properties in 2 ms. (steps per millisecond=568 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:34:59] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-19 20:34:59] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 20:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:34:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 20:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:34:59] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 20:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:34:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-19 20:34:59] [INFO ] Computed and/alt/rep : 44/84/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 20:34:59] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 35949 reset in 114 ms.
Product exploration explored 100000 steps with 35893 reset in 122 ms.
Built C files in :
/tmp/ltsmin1704680459498841713
[2022-05-19 20:35:00] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-19 20:35:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:35:00] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-19 20:35:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:35:00] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-19 20:35:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:35:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1704680459498841713
Running compilation step : cd /tmp/ltsmin1704680459498841713;'/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 127 ms.
Running link step : cd /tmp/ltsmin1704680459498841713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin1704680459498841713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7936919575153661617.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-05 finished in 4417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 56
Applied a total of 6 rules in 2 ms. Remains 73 /79 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:00] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:00] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:00] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-19 20:35:00] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:00] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/79 places, 56/56 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s62 s63 s69))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-07 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((F(G(p0)) U p1)&&G(p2)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 56
Applied a total of 6 rules in 2 ms. Remains 73 /79 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:01] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:01] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:01] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:35:01] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:01] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-19 20:35:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/79 places, 56/56 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT 1 s72), p1:(GT s0 s11), p0:(LEQ 1 s69)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-08 finished in 368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 56
Applied a total of 6 rules in 3 ms. Remains 73 /79 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:01] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:35:01] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:01] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:01] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 20:35:01] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:35:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/79 places, 56/56 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s67 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-10 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 56/56 transitions.
Graph (complete) has 150 edges and 79 vertex of which 39 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 38 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 36 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 36 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 35 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 35 transition count 33
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 15 place count 34 transition count 32
Applied a total of 15 rules in 10 ms. Remains 34 /79 variables (removed 45) and now considering 32/56 (removed 24) transitions.
// Phase 1: matrix 32 rows 34 cols
[2022-05-19 20:35:01] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 20:35:01] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2022-05-19 20:35:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 20:35:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [16, 20, 21]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 85 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/79 places, 32/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/79 places, 32/56 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-14 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:(LEQ s14 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18056 reset in 104 ms.
Product exploration explored 100000 steps with 18080 reset in 111 ms.
Computed a total of 31 stabilizing places and 32 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 32
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-14 finished in 482 ms.
All properties solved by simple procedures.
Total runtime 15275 ms.

BK_STOP 1652992502705

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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