Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951100907.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-32, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951100907
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K Mar 5 18:23 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-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679678358267

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 17:19:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 17:19:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 17:19:20] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2023-03-24 17:19:20] [INFO ] Transformed 3806 places.
[2023-03-24 17:19:20] [INFO ] Transformed 506 transitions.
[2023-03-24 17:19:20] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 184 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 3739 transition count 506
Applied a total of 67 rules in 502 ms. Remains 3739 /3806 variables (removed 67) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3739 cols
[2023-03-24 17:19:21] [INFO ] Computed 3234 place invariants in 256 ms
[2023-03-24 17:19:25] [INFO ] Implicit Places using invariants in 3820 ms returned []
[2023-03-24 17:19:25] [INFO ] Invariant cache hit.
[2023-03-24 17:19:28] [INFO ] Implicit Places using invariants and state equation in 3705 ms returned []
Implicit Place search using SMT with State Equation took 7569 ms to find 0 implicit places.
[2023-03-24 17:19:28] [INFO ] Invariant cache hit.
[2023-03-24 17:19:29] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3739/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8820 ms. Remains : 3739/3806 places, 506/506 transitions.
Support contains 184 out of 3739 places after structural reductions.
[2023-03-24 17:19:30] [INFO ] Flatten gal took : 244 ms
[2023-03-24 17:19:30] [INFO ] Flatten gal took : 145 ms
[2023-03-24 17:19:30] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-24 17:19:30] [INFO ] Invariant cache hit.
[2023-03-24 17:19:32] [INFO ] After 1435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 17:19:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-24 17:19:34] [INFO ] [Nat]Absence check using 1 positive and 3233 generalized place invariants in 824 ms returned sat
[2023-03-24 17:19:57] [INFO ] After 22057ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :7
[2023-03-24 17:19:57] [INFO ] After 22061ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :7
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 17:19:57] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :7
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 8 properties in 32 ms.
Support contains 1 out of 3739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 336 are kept as prefixes of interest. Removing 3403 places using SCC suffix rule.14 ms
Discarding 3403 places :
Also discarding 232 output transitions
Drop transitions removed 232 transitions
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 270 transition count 104
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 271 place count 236 transition count 104
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 271 place count 236 transition count 5
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 129 places
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 327 rules applied. Total rules applied 598 place count 8 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 599 place count 8 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 7 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 600 place count 7 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 603 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 4 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 605 place count 3 transition count 2
Applied a total of 605 rules in 56 ms. Remains 3 /3739 variables (removed 3736) and now considering 2/506 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 3/3739 places, 2/506 transitions.
Incomplete random walk after 10000 steps, including 3333 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3333 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Probably explored full state space saw : 3 states, properties seen :0
Probabilistic random walk after 5 steps, saw 3 distinct states, run finished after 10 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 3 states, properties seen :0
Exhaustive walk after 5 steps, saw 3 distinct states, run finished after 1 ms. (steps per millisecond=5 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3739 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3739 transition count 506
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(!p0) U ((p1&&X(!p0))||X(G(!p0))))))))'
Support contains 100 out of 3739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3737 transition count 506
Applied a total of 2 rules in 366 ms. Remains 3737 /3739 variables (removed 2) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2023-03-24 17:19:58] [INFO ] Computed 3233 place invariants in 155 ms
[2023-03-24 17:20:02] [INFO ] Implicit Places using invariants in 4132 ms returned []
[2023-03-24 17:20:02] [INFO ] Invariant cache hit.
[2023-03-24 17:20:12] [INFO ] Implicit Places using invariants and state equation in 10354 ms returned [2282, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2294, 2295, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2322, 2323, 2324, 2325, 2326, 2327, 2328]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14496 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3739 places, 506/506 transitions.
Applied a total of 0 rules in 283 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15146 ms. Remains : 3704/3739 places, 506/506 transitions.
Stuttering acceptance computed with spot in 390 ms :[p0, p0, p0, p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s188 s189 s190 s191 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s222 s223 s224 s225 s226 s227 s228 s229 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-00 finished in 15619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 34 out of 3739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3736 transition count 506
Applied a total of 3 rules in 268 ms. Remains 3736 /3739 variables (removed 3) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:20:13] [INFO ] Computed 3232 place invariants in 39 ms
[2023-03-24 17:20:20] [INFO ] Implicit Places using invariants in 6767 ms returned []
[2023-03-24 17:20:20] [INFO ] Invariant cache hit.
[2023-03-24 17:20:31] [INFO ] Implicit Places using invariants and state equation in 10692 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17476 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3739 places, 506/506 transitions.
Applied a total of 0 rules in 251 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17998 ms. Remains : 3703/3739 places, 506/506 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-03 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: 1}]], initial=2, aps=[p0:(LEQ (ADD s125 s126 s127 s128 s129 s130 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s156 s157 s158 s163 s164 s165 s...], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1782 ms.
Product exploration explored 100000 steps with 33333 reset in 1718 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-03 finished in 22421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 34 out of 3739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 3671 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.41 ms
Discarding 68 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3669 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3669 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 3667 transition count 501
Applied a total of 7 rules in 891 ms. Remains 3667 /3739 variables (removed 72) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3667 cols
[2023-03-24 17:20:36] [INFO ] Computed 3168 place invariants in 89 ms
[2023-03-24 17:20:40] [INFO ] Implicit Places using invariants in 3986 ms returned []
[2023-03-24 17:20:40] [INFO ] Invariant cache hit.
[2023-03-24 17:20:52] [INFO ] Implicit Places using invariants and state equation in 11744 ms returned [2213, 2214, 2215, 2216, 2217, 2218, 2219, 2220, 2225, 2226, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2253, 2254, 2255, 2256, 2257, 2258, 2259, 3277, 3278, 3279, 3280, 3281, 3282, 3283, 3284, 3640, 3643, 3644, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15736 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3601/3739 places, 501/506 transitions.
Applied a total of 0 rules in 515 ms. Remains 3601 /3601 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17142 ms. Remains : 3601/3739 places, 501/506 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 3 (ADD s3436 s3437 s3438 s3439 s3440 s3441 s3442 s3443 s3444 s3445 s3446 s3447 s3448 s3449 s3450 s3451 s3452 s3453 s3454 s3455 s3456 s3457 s345...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2466 reset in 559 ms.
Product exploration explored 100000 steps with 2461 reset in 535 ms.
Computed a total of 3601 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3601 transition count 501
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1431648 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :{}
Probabilistic random walk after 1431648 steps, saw 172666 distinct states, run finished after 3003 ms. (steps per millisecond=476 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 3601 cols
[2023-03-24 17:20:58] [INFO ] Computed 3104 place invariants in 69 ms
[2023-03-24 17:20:59] [INFO ] [Real]Absence check using 0 positive and 3104 generalized place invariants in 824 ms returned sat
[2023-03-24 17:20:59] [INFO ] After 1362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:21:00] [INFO ] [Nat]Absence check using 0 positive and 3104 generalized place invariants in 810 ms returned sat
[2023-03-24 17:21:02] [INFO ] After 1435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:21:02] [INFO ] After 1612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-24 17:21:02] [INFO ] After 3025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 74 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 34 out of 3601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3601/3601 places, 501/501 transitions.
Applied a total of 0 rules in 315 ms. Remains 3601 /3601 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:21:03] [INFO ] Invariant cache hit.
[2023-03-24 17:21:06] [INFO ] Implicit Places using invariants in 3381 ms returned []
[2023-03-24 17:21:06] [INFO ] Invariant cache hit.
[2023-03-24 17:21:19] [INFO ] Implicit Places using invariants and state equation in 12701 ms returned []
Implicit Place search using SMT with State Equation took 16091 ms to find 0 implicit places.
[2023-03-24 17:21:19] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-24 17:21:19] [INFO ] Invariant cache hit.
[2023-03-24 17:21:21] [INFO ] Dead Transitions using invariants and state equation in 1661 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18157 ms. Remains : 3601/3601 places, 501/501 transitions.
Computed a total of 3601 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3601 transition count 501
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1487497 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :{}
Probabilistic random walk after 1487497 steps, saw 179039 distinct states, run finished after 3001 ms. (steps per millisecond=495 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 17:21:25] [INFO ] Invariant cache hit.
[2023-03-24 17:21:26] [INFO ] [Real]Absence check using 0 positive and 3104 generalized place invariants in 811 ms returned sat
[2023-03-24 17:21:26] [INFO ] After 1298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:21:27] [INFO ] [Nat]Absence check using 0 positive and 3104 generalized place invariants in 811 ms returned sat
[2023-03-24 17:21:29] [INFO ] After 1394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:21:29] [INFO ] After 1571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-24 17:21:29] [INFO ] After 2980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2462 reset in 511 ms.
Product exploration explored 100000 steps with 2467 reset in 549 ms.
Support contains 34 out of 3601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3601/3601 places, 501/501 transitions.
Applied a total of 0 rules in 294 ms. Remains 3601 /3601 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:21:30] [INFO ] Invariant cache hit.
[2023-03-24 17:21:34] [INFO ] Implicit Places using invariants in 3792 ms returned []
[2023-03-24 17:21:34] [INFO ] Invariant cache hit.
[2023-03-24 17:21:44] [INFO ] Implicit Places using invariants and state equation in 9887 ms returned []
Implicit Place search using SMT with State Equation took 13681 ms to find 0 implicit places.
[2023-03-24 17:21:44] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-24 17:21:44] [INFO ] Invariant cache hit.
[2023-03-24 17:21:46] [INFO ] Dead Transitions using invariants and state equation in 2003 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16050 ms. Remains : 3601/3601 places, 501/501 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-05 finished in 71007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 3739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 1 are kept as prefixes of interest. Removing 3738 places using SCC suffix rule.11 ms
Discarding 3738 places :
Also discarding 505 output transitions
Drop transitions removed 505 transitions
Applied a total of 1 rules in 16 ms. Remains 1 /3739 variables (removed 3738) and now considering 1/506 (removed 505) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-24 17:21:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-24 17:21:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-24 17:21:46] [INFO ] Invariant cache hit.
[2023-03-24 17:21:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-24 17:21:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-24 17:21:46] [INFO ] Invariant cache hit.
[2023-03-24 17:21:47] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/3739 places, 1/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 1/3739 places, 1/506 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-06 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 2616 are kept as prefixes of interest. Removing 1123 places using SCC suffix rule.13 ms
Discarding 1123 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2616 transition count 445
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2582 transition count 377
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2582 transition count 377
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 103 place count 2580 transition count 375
Applied a total of 103 rules in 508 ms. Remains 2580 /3739 variables (removed 1159) and now considering 375/506 (removed 131) transitions.
// Phase 1: matrix 375 rows 2580 cols
[2023-03-24 17:21:47] [INFO ] Computed 2208 place invariants in 11 ms
[2023-03-24 17:21:51] [INFO ] Implicit Places using invariants in 3712 ms returned []
[2023-03-24 17:21:51] [INFO ] Invariant cache hit.
[2023-03-24 17:22:00] [INFO ] Implicit Places using invariants and state equation in 8573 ms returned [1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1137, 1138, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1165, 1166, 1167, 1168, 1169, 1170, 1171]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 12292 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2547/3739 places, 375/506 transitions.
Applied a total of 0 rules in 171 ms. Remains 2547 /2547 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12971 ms. Remains : 2547/3739 places, 375/506 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-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:(GT s2161 s2398)], 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 108 steps with 2 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-10 finished in 13029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 3636 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.14 ms
Discarding 103 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
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 7 place count 3632 transition count 499
Applied a total of 7 rules in 865 ms. Remains 3632 /3739 variables (removed 107) and now considering 499/506 (removed 7) transitions.
// Phase 1: matrix 499 rows 3632 cols
[2023-03-24 17:22:01] [INFO ] Computed 3136 place invariants in 21 ms
[2023-03-24 17:22:04] [INFO ] Implicit Places using invariants in 3683 ms returned []
[2023-03-24 17:22:04] [INFO ] Invariant cache hit.
[2023-03-24 17:22:14] [INFO ] Implicit Places using invariants and state equation in 9733 ms returned [2211, 2212, 2213, 2214, 2215, 2216, 2217, 2218, 2223, 2224, 2227, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 3275, 3276, 3277, 3278, 3279, 3280, 3281, 3282, 3605, 3608, 3609, 3610, 3611, 3612, 3613, 3614, 3615, 3616, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3630, 3631]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 13453 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3566/3739 places, 499/506 transitions.
Applied a total of 0 rules in 286 ms. Remains 3566 /3566 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14606 ms. Remains : 3566/3739 places, 499/506 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-11 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 1 s98)], 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 42 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-11 finished in 14733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 3703 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.10 ms
Discarding 36 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 3700 transition count 501
Applied a total of 5 rules in 624 ms. Remains 3700 /3739 variables (removed 39) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3700 cols
[2023-03-24 17:22:15] [INFO ] Computed 3201 place invariants in 78 ms
[2023-03-24 17:22:19] [INFO ] Implicit Places using invariants in 3925 ms returned []
[2023-03-24 17:22:19] [INFO ] Invariant cache hit.
[2023-03-24 17:22:30] [INFO ] Implicit Places using invariants and state equation in 10568 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 14497 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3739 places, 501/506 transitions.
Applied a total of 0 rules in 286 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15408 ms. Remains : 3634/3739 places, 501/506 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-12 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 s36 s3058)], 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 2463 reset in 396 ms.
Product exploration explored 100000 steps with 2465 reset in 400 ms.
Computed a total of 3634 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 501
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1634460 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :{}
Probabilistic random walk after 1634460 steps, saw 196444 distinct states, run finished after 3002 ms. (steps per millisecond=544 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 3634 cols
[2023-03-24 17:22:35] [INFO ] Computed 3136 place invariants in 45 ms
[2023-03-24 17:22:35] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:22:37] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 785 ms returned sat
[2023-03-24 17:22:38] [INFO ] After 1819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:22:39] [INFO ] After 1993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-24 17:22:39] [INFO ] After 3380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 145 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 501/501 transitions.
Applied a total of 0 rules in 293 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:22:39] [INFO ] Invariant cache hit.
[2023-03-24 17:22:43] [INFO ] Implicit Places using invariants in 3836 ms returned []
[2023-03-24 17:22:43] [INFO ] Invariant cache hit.
[2023-03-24 17:22:55] [INFO ] Implicit Places using invariants and state equation in 11681 ms returned []
Implicit Place search using SMT with State Equation took 15543 ms to find 0 implicit places.
[2023-03-24 17:22:55] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-24 17:22:55] [INFO ] Invariant cache hit.
[2023-03-24 17:22:57] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17492 ms. Remains : 3634/3634 places, 501/501 transitions.
Computed a total of 3634 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 501
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1639832 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1639832 steps, saw 197151 distinct states, run finished after 3003 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 17:23:01] [INFO ] Invariant cache hit.
[2023-03-24 17:23:01] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:23:02] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 776 ms returned sat
[2023-03-24 17:23:04] [INFO ] After 1589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:23:04] [INFO ] After 1760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-24 17:23:04] [INFO ] After 3138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2462 reset in 423 ms.
Product exploration explored 100000 steps with 2465 reset in 408 ms.
Support contains 2 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 501/501 transitions.
Applied a total of 0 rules in 290 ms. Remains 3634 /3634 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:23:06] [INFO ] Invariant cache hit.
[2023-03-24 17:23:12] [INFO ] Implicit Places using invariants in 6534 ms returned []
[2023-03-24 17:23:12] [INFO ] Invariant cache hit.
[2023-03-24 17:23:24] [INFO ] Implicit Places using invariants and state equation in 12088 ms returned []
Implicit Place search using SMT with State Equation took 18625 ms to find 0 implicit places.
[2023-03-24 17:23:24] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-24 17:23:24] [INFO ] Invariant cache hit.
[2023-03-24 17:23:25] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19771 ms. Remains : 3634/3634 places, 501/501 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-12 finished in 70801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 3739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3739/3739 places, 506/506 transitions.
Graph (complete) has 42285 edges and 3739 vertex of which 3636 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.13 ms
Discarding 103 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 3632 transition count 499
Applied a total of 7 rules in 881 ms. Remains 3632 /3739 variables (removed 107) and now considering 499/506 (removed 7) transitions.
// Phase 1: matrix 499 rows 3632 cols
[2023-03-24 17:23:26] [INFO ] Computed 3136 place invariants in 21 ms
[2023-03-24 17:23:33] [INFO ] Implicit Places using invariants in 6710 ms returned []
[2023-03-24 17:23:33] [INFO ] Invariant cache hit.
[2023-03-24 17:23:42] [INFO ] Implicit Places using invariants and state equation in 9299 ms returned [2211, 2212, 2213, 2214, 2215, 2216, 2217, 2218, 2223, 2224, 2227, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 3275, 3276, 3277, 3278, 3279, 3280, 3281, 3282, 3605, 3608, 3609, 3610, 3611, 3612, 3613, 3614, 3615, 3616, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3630, 3631]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16014 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3566/3739 places, 499/506 transitions.
Applied a total of 0 rules in 277 ms. Remains 3566 /3566 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17172 ms. Remains : 3566/3739 places, 499/506 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s3485 s222)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2463 reset in 386 ms.
Product exploration explored 100000 steps with 2461 reset in 403 ms.
Computed a total of 3566 stabilizing places and 499 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3566 transition count 499
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1466097 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :{}
Probabilistic random walk after 1466097 steps, saw 176768 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 499 rows 3566 cols
[2023-03-24 17:23:47] [INFO ] Computed 3072 place invariants in 28 ms
[2023-03-24 17:23:48] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:23:49] [INFO ] [Nat]Absence check using 0 positive and 3072 generalized place invariants in 844 ms returned sat
[2023-03-24 17:23:51] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:23:51] [INFO ] After 1582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-24 17:23:51] [INFO ] After 3016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-14 finished in 25629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-24 17:23:51] [INFO ] Flatten gal took : 100 ms
[2023-03-24 17:23:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-24 17:23:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3739 places, 506 transitions and 8106 arcs took 18 ms.
Total runtime 271678 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1012/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1012/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-PT-32-LTLCardinality-05
Could not compute solution for formula : QuasiCertifProtocol-PT-32-LTLCardinality-12

BK_STOP 1679678679100

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name QuasiCertifProtocol-PT-32-LTLCardinality-05
ltl formula formula --ltl=/tmp/1012/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3739 places, 506 transitions and 8106 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1012/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1012/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1012/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1012/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d1f63c33f4]
1: pnml2lts-mc(+0xa2496) [0x55d1f63c3496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fd5cddb4140]
3: pnml2lts-mc(+0x405be5) [0x55d1f6726be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d1f648c3f9]
5: pnml2lts-mc(+0x164ac4) [0x55d1f6485ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d1f6593e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d1f63d71f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fd5cdc074d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fd5cdc0767a]
10: pnml2lts-mc(+0xa1581) [0x55d1f63c2581]
11: pnml2lts-mc(+0xa1910) [0x55d1f63c2910]
12: pnml2lts-mc(+0xa32a2) [0x55d1f63c42a2]
13: pnml2lts-mc(+0xa50f4) [0x55d1f63c60f4]
14: pnml2lts-mc(+0xa516b) [0x55d1f63c616b]
15: pnml2lts-mc(+0x3f34b3) [0x55d1f67144b3]
16: pnml2lts-mc(+0x7c63d) [0x55d1f639d63d]
17: pnml2lts-mc(+0x67d86) [0x55d1f6388d86]
18: pnml2lts-mc(+0x60a8a) [0x55d1f6381a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d1f637fb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fd5cdbefd0a]
21: pnml2lts-mc(+0x6075e) [0x55d1f638175e]
ltl formula name QuasiCertifProtocol-PT-32-LTLCardinality-12
ltl formula formula --ltl=/tmp/1012/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3739 places, 506 transitions and 8106 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.040 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1012/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1012/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1012/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1012/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-32"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-32, 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 r297-tall-167873951100907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 ;