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.r295-tall-167873948500899.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 lolaxred
Input is QuasiCertifProtocol-PT-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500899
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 749K 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-28-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678919657911

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 22:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 22:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:34:19] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-15 22:34:19] [INFO ] Transformed 2998 places.
[2023-03-15 22:34:19] [INFO ] Transformed 446 transitions.
[2023-03-15 22:34:19] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1146 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Applied a total of 0 rules in 197 ms. Remains 2998 /2998 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-15 22:34:20] [INFO ] Computed 2553 place invariants in 104 ms
[2023-03-15 22:34:24] [INFO ] Implicit Places using invariants in 4252 ms returned []
[2023-03-15 22:34:24] [INFO ] Invariant cache hit.
[2023-03-15 22:34:40] [INFO ] Implicit Places using invariants and state equation in 16491 ms returned []
Implicit Place search using SMT with State Equation took 20889 ms to find 0 implicit places.
[2023-03-15 22:34:40] [INFO ] Invariant cache hit.
[2023-03-15 22:34:42] [INFO ] Dead Transitions using invariants and state equation in 1599 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22692 ms. Remains : 2998/2998 places, 446/446 transitions.
Support contains 1146 out of 2998 places after structural reductions.
[2023-03-15 22:34:42] [INFO ] Flatten gal took : 178 ms
[2023-03-15 22:34:42] [INFO ] Flatten gal took : 104 ms
[2023-03-15 22:34:43] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 1118 out of 2998 places (down from 1146) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 22) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-15 22:34:43] [INFO ] Invariant cache hit.
[2023-03-15 22:34:44] [INFO ] [Real]Absence check using 32 positive place invariants in 35 ms returned sat
[2023-03-15 22:34:45] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 532 ms returned sat
[2023-03-15 22:34:45] [INFO ] After 1758ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-15 22:34:46] [INFO ] [Nat]Absence check using 32 positive place invariants in 34 ms returned sat
[2023-03-15 22:34:46] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 504 ms returned sat
[2023-03-15 22:35:10] [INFO ] After 22280ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :13
[2023-03-15 22:35:10] [INFO ] After 22285ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :13
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 22:35:10] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :13
Fused 19 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 9 ms.
Support contains 1000 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2997 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2997 transition count 444
Applied a total of 3 rules in 224 ms. Remains 2997 /2998 variables (removed 1) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 2997/2998 places, 444/446 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 444 rows 2997 cols
[2023-03-15 22:35:11] [INFO ] Computed 2554 place invariants in 54 ms
[2023-03-15 22:35:12] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 22:35:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2023-03-15 22:35:13] [INFO ] [Nat]Absence check using 31 positive and 2523 generalized place invariants in 569 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:35:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 22:35:37] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 96 out of 2997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2997/2997 places, 444/444 transitions.
Graph (complete) has 30313 edges and 2997 vertex of which 2965 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2965 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 2964 transition count 440
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 33 place count 2964 transition count 411
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 62 place count 2935 transition count 411
Applied a total of 62 rules in 520 ms. Remains 2935 /2997 variables (removed 62) and now considering 411/444 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 521 ms. Remains : 2935/2997 places, 411/444 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 564842 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 564842 steps, saw 76995 distinct states, run finished after 3002 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 411 rows 2935 cols
[2023-03-15 22:35:41] [INFO ] Computed 2525 place invariants in 28 ms
[2023-03-15 22:35:41] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 22:35:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 34 ms returned sat
[2023-03-15 22:35:43] [INFO ] [Nat]Absence check using 30 positive and 2495 generalized place invariants in 550 ms returned sat
[2023-03-15 22:35:49] [INFO ] After 5939ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-15 22:35:54] [INFO ] After 10577ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 3157 ms.
[2023-03-15 22:35:57] [INFO ] After 15537ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 6 different solutions.
Finished Parikh walk after 151 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 6 properties in 43 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2998 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2998 transition count 446
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(G(p0)))'
Support contains 900 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2965 transition count 446
Applied a total of 33 rules in 229 ms. Remains 2965 /2998 variables (removed 33) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2965 cols
[2023-03-15 22:35:58] [INFO ] Computed 2521 place invariants in 33 ms
[2023-03-15 22:36:00] [INFO ] Implicit Places using invariants in 2860 ms returned []
[2023-03-15 22:36:00] [INFO ] Invariant cache hit.
[2023-03-15 22:36:08] [INFO ] Implicit Places using invariants and state equation in 7610 ms returned [1998, 1999, 2001, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10474 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Applied a total of 0 rules in 101 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10806 ms. Remains : 2936/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-02 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:(OR (GT (ADD s1914 s1915 s1916 s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 ...], 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 2 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-02 finished in 11022 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(G(p0)))'
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 148 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-15 22:36:08] [INFO ] Computed 2492 place invariants in 40 ms
[2023-03-15 22:36:13] [INFO ] Implicit Places using invariants in 4136 ms returned []
[2023-03-15 22:36:13] [INFO ] Invariant cache hit.
[2023-03-15 22:36:20] [INFO ] Implicit Places using invariants and state equation in 6957 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11098 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 147 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11394 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s2754 s2755 s2756 s2757 s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s27...], 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]]
Product exploration explored 100000 steps with 3030 reset in 535 ms.
Product exploration explored 100000 steps with 3024 reset in 404 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 transition count 446
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 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1570521 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :{}
Probabilistic random walk after 1570521 steps, saw 198515 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 2908 cols
[2023-03-15 22:36:25] [INFO ] Computed 2464 place invariants in 103 ms
[2023-03-15 22:36:25] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:36:26] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 527 ms returned sat
[2023-03-15 22:36:27] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:36:27] [INFO ] After 1048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-15 22:36:27] [INFO ] After 2010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Applied a total of 0 rules in 146 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 22:36:27] [INFO ] Invariant cache hit.
[2023-03-15 22:36:31] [INFO ] Implicit Places using invariants in 3998 ms returned []
[2023-03-15 22:36:31] [INFO ] Invariant cache hit.
[2023-03-15 22:36:38] [INFO ] Implicit Places using invariants and state equation in 6782 ms returned []
Implicit Place search using SMT with State Equation took 10782 ms to find 0 implicit places.
[2023-03-15 22:36:38] [INFO ] Invariant cache hit.
[2023-03-15 22:36:39] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11968 ms. Remains : 2908/2908 places, 446/446 transitions.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 transition count 446
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 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1597142 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :{}
Probabilistic random walk after 1597142 steps, saw 201782 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:36:43] [INFO ] Invariant cache hit.
[2023-03-15 22:36:43] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:36:44] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 498 ms returned sat
[2023-03-15 22:36:45] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:36:45] [INFO ] After 1019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-15 22:36:45] [INFO ] After 1888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 65 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3026 reset in 361 ms.
Product exploration explored 100000 steps with 3023 reset in 382 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Graph (complete) has 28339 edges and 2908 vertex of which 2067 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.17 ms
Discarding 841 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2010 transition count 332
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2010 transition count 332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 2010 transition count 334
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 117 rules in 482 ms. Remains 2010 /2908 variables (removed 898) and now considering 334/446 (removed 112) transitions.
[2023-03-15 22:36:47] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 334 rows 2010 cols
[2023-03-15 22:36:47] [INFO ] Computed 1680 place invariants in 30 ms
[2023-03-15 22:36:48] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2010/2908 places, 334/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1310 ms. Remains : 2010/2908 places, 334/446 transitions.
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2908 cols
[2023-03-15 22:36:48] [INFO ] Computed 2464 place invariants in 106 ms
[2023-03-15 22:36:52] [INFO ] Implicit Places using invariants in 4072 ms returned []
[2023-03-15 22:36:52] [INFO ] Invariant cache hit.
[2023-03-15 22:36:59] [INFO ] Implicit Places using invariants and state equation in 6659 ms returned []
Implicit Place search using SMT with State Equation took 10735 ms to find 0 implicit places.
[2023-03-15 22:36:59] [INFO ] Invariant cache hit.
[2023-03-15 22:37:00] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11901 ms. Remains : 2908/2908 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-03 finished in 51723 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 58 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2964 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2961 transition count 441
Applied a total of 5 rules in 339 ms. Remains 2961 /2998 variables (removed 37) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2961 cols
[2023-03-15 22:37:00] [INFO ] Computed 2522 place invariants in 15 ms
[2023-03-15 22:37:04] [INFO ] Implicit Places using invariants in 3891 ms returned []
[2023-03-15 22:37:04] [INFO ] Invariant cache hit.
[2023-03-15 22:37:14] [INFO ] Implicit Places using invariants and state equation in 10133 ms returned [1995, 1996, 1998, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2625, 2626, 2627, 2628, 2629, 2630, 2635, 2636, 2637, 2638, 2868, 2869, 2870, 2871, 2872, 2873, 2874, 2875, 2882]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 14031 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2903/2998 places, 441/446 transitions.
Applied a total of 0 rules in 177 ms. Remains 2903 /2903 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14549 ms. Remains : 2903/2998 places, 441/446 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-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 (ADD s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s2777 s2778 s2779 s2780 s278...], 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 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-04 finished in 14619 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 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2065 are kept as prefixes of interest. Removing 933 places using SCC suffix rule.9 ms
Discarding 933 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 2036 transition count 387
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 2036 transition count 387
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 61 place count 2034 transition count 385
Applied a total of 61 rules in 249 ms. Remains 2034 /2998 variables (removed 964) and now considering 385/446 (removed 61) transitions.
// Phase 1: matrix 385 rows 2034 cols
[2023-03-15 22:37:15] [INFO ] Computed 1680 place invariants in 6 ms
[2023-03-15 22:37:17] [INFO ] Implicit Places using invariants in 2212 ms returned []
[2023-03-15 22:37:17] [INFO ] Invariant cache hit.
[2023-03-15 22:37:21] [INFO ] Implicit Places using invariants and state equation in 3520 ms returned [1097, 1098, 1100, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1737, 1738, 1739, 1740, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1955]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 5735 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1976/2998 places, 385/446 transitions.
Applied a total of 0 rules in 97 ms. Remains 1976 /1976 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6081 ms. Remains : 1976/2998 places, 385/446 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-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:(GT 2 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], 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 2813 reset in 407 ms.
Product exploration explored 100000 steps with 2816 reset in 431 ms.
Computed a total of 1976 stabilizing places and 385 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1976 transition count 385
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 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-05 finished in 7329 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(F(!p0)))'
Support contains 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 144 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:37:22] [INFO ] Computed 2492 place invariants in 25 ms
[2023-03-15 22:37:26] [INFO ] Implicit Places using invariants in 4084 ms returned []
[2023-03-15 22:37:26] [INFO ] Invariant cache hit.
[2023-03-15 22:37:33] [INFO ] Implicit Places using invariants and state equation in 6623 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10709 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 139 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10993 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58))], 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][false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-07 finished in 11084 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(F(p0)))'
Support contains 2 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 145 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
[2023-03-15 22:37:33] [INFO ] Invariant cache hit.
[2023-03-15 22:37:37] [INFO ] Implicit Places using invariants in 3798 ms returned []
[2023-03-15 22:37:37] [INFO ] Invariant cache hit.
[2023-03-15 22:37:44] [INFO ] Implicit Places using invariants and state equation in 6689 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10490 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 140 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10775 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2752 s2838)], 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][false, false]]
Product exploration explored 100000 steps with 7448 reset in 552 ms.
Product exploration explored 100000 steps with 7406 reset in 628 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-08 finished in 12592 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||G(p1)))))'
Support contains 4 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2939 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.7 ms
Discarding 59 places :
Also discarding 0 output 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 2937 transition count 444
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2937 transition count 444
Applied a total of 4 rules in 657 ms. Remains 2937 /2998 variables (removed 61) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2937 cols
[2023-03-15 22:37:46] [INFO ] Computed 2495 place invariants in 43 ms
[2023-03-15 22:37:50] [INFO ] Implicit Places using invariants in 4022 ms returned []
[2023-03-15 22:37:50] [INFO ] Invariant cache hit.
[2023-03-15 22:37:59] [INFO ] Implicit Places using invariants and state equation in 8751 ms returned [1971, 1972, 1974, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2611, 2612, 2613, 2614, 2841, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2855]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 12779 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2879/2998 places, 444/446 transitions.
Applied a total of 0 rules in 172 ms. Remains 2879 /2879 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13609 ms. Remains : 2879/2998 places, 444/446 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s1118 s57), p0:(LEQ s217 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2811 reset in 403 ms.
Product exploration explored 100000 steps with 2817 reset in 364 ms.
Computed a total of 2879 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2879 transition count 444
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 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-10 finished in 15075 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((!p0||G(F(!p0)))))'
Support contains 2 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 136 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-15 22:38:01] [INFO ] Computed 2492 place invariants in 34 ms
[2023-03-15 22:38:05] [INFO ] Implicit Places using invariants in 3674 ms returned []
[2023-03-15 22:38:05] [INFO ] Invariant cache hit.
[2023-03-15 22:38:12] [INFO ] Implicit Places using invariants and state equation in 7245 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10922 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 139 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11198 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 120 ms :[p0, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s26 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-11 finished in 11337 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((G(p0)||G(F(p1)))))'
Support contains 5 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 149 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-15 22:38:12] [INFO ] Computed 2493 place invariants in 25 ms
[2023-03-15 22:38:16] [INFO ] Implicit Places using invariants in 3883 ms returned []
[2023-03-15 22:38:16] [INFO ] Invariant cache hit.
[2023-03-15 22:38:23] [INFO ] Implicit Places using invariants and state equation in 6498 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 10386 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2909/2998 places, 446/446 transitions.
Applied a total of 0 rules in 140 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10676 ms. Remains : 2909/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 1 s29) (GT s1978 s211)), p1:(GT s2754 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3025 reset in 293 ms.
Product exploration explored 100000 steps with 3024 reset in 315 ms.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 293 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 777070 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 777070 steps, saw 99220 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 446 rows 2909 cols
[2023-03-15 22:38:28] [INFO ] Computed 2465 place invariants in 13 ms
[2023-03-15 22:38:28] [INFO ] [Real]Absence check using 0 positive and 2465 generalized place invariants in 496 ms returned sat
[2023-03-15 22:38:29] [INFO ] After 951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 22:38:29] [INFO ] [Nat]Absence check using 0 positive and 2465 generalized place invariants in 483 ms returned sat
[2023-03-15 22:38:35] [INFO ] After 5169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 22:38:35] [INFO ] After 5762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 660 ms.
[2023-03-15 22:38:36] [INFO ] After 7381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=49 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 400 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 144 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 22:38:37] [INFO ] Invariant cache hit.
[2023-03-15 22:38:40] [INFO ] Implicit Places using invariants in 3625 ms returned []
[2023-03-15 22:38:40] [INFO ] Invariant cache hit.
[2023-03-15 22:38:49] [INFO ] Implicit Places using invariants and state equation in 8099 ms returned []
Implicit Place search using SMT with State Equation took 11728 ms to find 0 implicit places.
[2023-03-15 22:38:49] [INFO ] Invariant cache hit.
[2023-03-15 22:38:50] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12899 ms. Remains : 2909/2909 places, 446/446 transitions.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 305 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1156081 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :{}
Probabilistic random walk after 1156081 steps, saw 146529 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 22:38:54] [INFO ] Invariant cache hit.
[2023-03-15 22:38:54] [INFO ] [Real]Absence check using 0 positive and 2465 generalized place invariants in 502 ms returned sat
[2023-03-15 22:38:55] [INFO ] After 939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 22:38:55] [INFO ] [Nat]Absence check using 0 positive and 2465 generalized place invariants in 479 ms returned sat
[2023-03-15 22:39:00] [INFO ] After 4913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 22:39:02] [INFO ] After 6249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-15 22:39:02] [INFO ] After 7882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 196 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=39 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3028 reset in 313 ms.
Product exploration explored 100000 steps with 3028 reset in 316 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Graph (complete) has 28340 edges and 2909 vertex of which 2879 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2879 transition count 445
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 309 ms. Remains 2879 /2909 variables (removed 30) and now considering 445/446 (removed 1) transitions.
[2023-03-15 22:39:04] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 445 rows 2879 cols
[2023-03-15 22:39:04] [INFO ] Computed 2437 place invariants in 11 ms
[2023-03-15 22:39:05] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2879/2909 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1384 ms. Remains : 2879/2909 places, 445/446 transitions.
Support contains 5 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 140 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2023-03-15 22:39:06] [INFO ] Computed 2465 place invariants in 21 ms
[2023-03-15 22:39:09] [INFO ] Implicit Places using invariants in 3699 ms returned []
[2023-03-15 22:39:09] [INFO ] Invariant cache hit.
[2023-03-15 22:39:17] [INFO ] Implicit Places using invariants and state equation in 7628 ms returned []
Implicit Place search using SMT with State Equation took 11331 ms to find 0 implicit places.
[2023-03-15 22:39:17] [INFO ] Invariant cache hit.
[2023-03-15 22:39:18] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12495 ms. Remains : 2909/2909 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-12 finished in 65895 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(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLCardinality-03
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2096 are kept as prefixes of interest. Removing 902 places using SCC suffix rule.17 ms
Discarding 902 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2038 transition count 331
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2038 transition count 331
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 119 place count 2036 transition count 329
Applied a total of 119 rules in 272 ms. Remains 2036 /2998 variables (removed 962) and now considering 329/446 (removed 117) transitions.
// Phase 1: matrix 329 rows 2036 cols
[2023-03-15 22:39:18] [INFO ] Computed 1708 place invariants in 18 ms
[2023-03-15 22:39:21] [INFO ] Implicit Places using invariants in 2238 ms returned []
[2023-03-15 22:39:21] [INFO ] Invariant cache hit.
[2023-03-15 22:39:26] [INFO ] Implicit Places using invariants and state equation in 5735 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1954]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7975 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1978/2998 places, 329/446 transitions.
Applied a total of 0 rules in 94 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8341 ms. Remains : 1978/2998 places, 329/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s1833 s1834 s1835 s1836 s1837 s1838 s1839 s1840 s1841 s1842 s1843 s1844 s1845 s1846 s1847 s1848 s1849 s1850 s1851 s1852 s1853 s1854 s1855 s18...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2811 reset in 413 ms.
Product exploration explored 100000 steps with 2812 reset in 423 ms.
Computed a total of 1978 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1978 transition count 329
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 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2173629 steps, run timeout after 3001 ms. (steps per millisecond=724 ) properties seen :{}
Probabilistic random walk after 2173629 steps, saw 276286 distinct states, run finished after 3002 ms. (steps per millisecond=724 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 329 rows 1978 cols
[2023-03-15 22:39:31] [INFO ] Computed 1652 place invariants in 21 ms
[2023-03-15 22:39:31] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:39:32] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 297 ms returned sat
[2023-03-15 22:39:32] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:39:32] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-15 22:39:32] [INFO ] After 1156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 1978 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Applied a total of 0 rules in 73 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2023-03-15 22:39:33] [INFO ] Invariant cache hit.
[2023-03-15 22:39:35] [INFO ] Implicit Places using invariants in 2021 ms returned []
[2023-03-15 22:39:35] [INFO ] Invariant cache hit.
[2023-03-15 22:39:38] [INFO ] Implicit Places using invariants and state equation in 3220 ms returned []
Implicit Place search using SMT with State Equation took 5243 ms to find 0 implicit places.
[2023-03-15 22:39:38] [INFO ] Invariant cache hit.
[2023-03-15 22:39:39] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5956 ms. Remains : 1978/1978 places, 329/329 transitions.
Computed a total of 1978 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1978 transition count 329
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 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2188580 steps, run timeout after 3001 ms. (steps per millisecond=729 ) properties seen :{}
Probabilistic random walk after 2188580 steps, saw 277944 distinct states, run finished after 3001 ms. (steps per millisecond=729 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:39:42] [INFO ] Invariant cache hit.
[2023-03-15 22:39:42] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:39:43] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 299 ms returned sat
[2023-03-15 22:39:43] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:39:43] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-15 22:39:44] [INFO ] After 1189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
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))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2817 reset in 405 ms.
Product exploration explored 100000 steps with 2815 reset in 425 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 1978 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Applied a total of 0 rules in 95 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2023-03-15 22:39:45] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 22:39:45] [INFO ] Invariant cache hit.
[2023-03-15 22:39:46] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 765 ms. Remains : 1978/1978 places, 329/329 transitions.
Support contains 30 out of 1978 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Applied a total of 0 rules in 67 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2023-03-15 22:39:46] [INFO ] Invariant cache hit.
[2023-03-15 22:39:48] [INFO ] Implicit Places using invariants in 2029 ms returned []
[2023-03-15 22:39:48] [INFO ] Invariant cache hit.
[2023-03-15 22:39:51] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 5654 ms to find 0 implicit places.
[2023-03-15 22:39:51] [INFO ] Invariant cache hit.
[2023-03-15 22:39:52] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6374 ms. Remains : 1978/1978 places, 329/329 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-03 finished in 34160 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((G(p0)||G(F(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLCardinality-12
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2907 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.11 ms
Discarding 91 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2905 transition count 442
Applied a total of 3 rules in 324 ms. Remains 2905 /2998 variables (removed 93) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2905 cols
[2023-03-15 22:39:53] [INFO ] Computed 2465 place invariants in 20 ms
[2023-03-15 22:39:57] [INFO ] Implicit Places using invariants in 3948 ms returned []
[2023-03-15 22:39:57] [INFO ] Invariant cache hit.
[2023-03-15 22:40:04] [INFO ] Implicit Places using invariants and state equation in 7170 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2607, 2608, 2609, 2610, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2819, 2826]
Discarding 57 places :
Implicit Place search using SMT with State Equation took 11120 ms to find 57 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2848/2998 places, 442/446 transitions.
Applied a total of 0 rules in 154 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11599 ms. Remains : 2848/2998 places, 442/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 1 s29) (GT s1976 s211)), p1:(GT s2731 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2811 reset in 336 ms.
Product exploration explored 100000 steps with 2815 reset in 353 ms.
Computed a total of 2848 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2848 transition count 442
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1292765 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :{}
Probabilistic random walk after 1292765 steps, saw 166142 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 442 rows 2848 cols
[2023-03-15 22:40:09] [INFO ] Computed 2409 place invariants in 11 ms
[2023-03-15 22:40:10] [INFO ] [Real]Absence check using 0 positive and 2409 generalized place invariants in 486 ms returned sat
[2023-03-15 22:40:10] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 22:40:11] [INFO ] [Nat]Absence check using 0 positive and 2409 generalized place invariants in 483 ms returned sat
[2023-03-15 22:40:15] [INFO ] After 4050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 22:40:16] [INFO ] After 5406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1635 ms.
[2023-03-15 22:40:18] [INFO ] After 7990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 195 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=48 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2848 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2848/2848 places, 442/442 transitions.
Applied a total of 0 rules in 138 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-15 22:40:19] [INFO ] Invariant cache hit.
[2023-03-15 22:40:22] [INFO ] Implicit Places using invariants in 3689 ms returned []
[2023-03-15 22:40:22] [INFO ] Invariant cache hit.
[2023-03-15 22:40:29] [INFO ] Implicit Places using invariants and state equation in 6552 ms returned []
Implicit Place search using SMT with State Equation took 10242 ms to find 0 implicit places.
[2023-03-15 22:40:29] [INFO ] Invariant cache hit.
[2023-03-15 22:40:30] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11408 ms. Remains : 2848/2848 places, 442/442 transitions.
Computed a total of 2848 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2848 transition count 442
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 397 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1318196 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1318196 steps, saw 169225 distinct states, run finished after 3004 ms. (steps per millisecond=438 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 22:40:34] [INFO ] Invariant cache hit.
[2023-03-15 22:40:35] [INFO ] [Real]Absence check using 0 positive and 2409 generalized place invariants in 474 ms returned sat
[2023-03-15 22:40:35] [INFO ] After 910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 22:40:36] [INFO ] [Nat]Absence check using 0 positive and 2409 generalized place invariants in 476 ms returned sat
[2023-03-15 22:40:40] [INFO ] After 3976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 22:40:41] [INFO ] After 5687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1215 ms.
[2023-03-15 22:40:43] [INFO ] After 7841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 195 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=32 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2812 reset in 342 ms.
Product exploration explored 100000 steps with 2817 reset in 354 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2848 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2848/2848 places, 442/442 transitions.
Applied a total of 0 rules in 155 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-15 22:40:44] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 22:40:44] [INFO ] Invariant cache hit.
[2023-03-15 22:40:46] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1269 ms. Remains : 2848/2848 places, 442/442 transitions.
Support contains 5 out of 2848 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2848/2848 places, 442/442 transitions.
Applied a total of 0 rules in 131 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-15 22:40:46] [INFO ] Invariant cache hit.
[2023-03-15 22:40:49] [INFO ] Implicit Places using invariants in 3534 ms returned []
[2023-03-15 22:40:49] [INFO ] Invariant cache hit.
[2023-03-15 22:40:56] [INFO ] Implicit Places using invariants and state equation in 6635 ms returned []
Implicit Place search using SMT with State Equation took 10171 ms to find 0 implicit places.
[2023-03-15 22:40:56] [INFO ] Invariant cache hit.
[2023-03-15 22:40:57] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11400 ms. Remains : 2848/2848 places, 442/442 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-12 finished in 64899 ms.
[2023-03-15 22:40:57] [INFO ] Flatten gal took : 69 ms
[2023-03-15 22:40:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 22:40:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2998 places, 446 transitions and 6489 arcs took 11 ms.
Total runtime 398283 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-28
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678920249184

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 6 (type SKEL/SRCH) for 0 QuasiCertifProtocol-PT-28-LTLCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: FINISHED task # 6 (type SKEL/SRCH) for QuasiCertifProtocol-PT-28-LTLCardinality-03
lola: result : false
lola: markings : 10901
lola: fired transitions : 34269
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-28-LTLCardinality-12
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1799 3/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 246859 m, 49371 m/sec, 1756789 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1799 4/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 461797 m, 42987 m/sec, 3607357 t fired, .

Time elapsed: 11 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1799 6/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 710118 m, 49664 m/sec, 5454245 t fired, .

Time elapsed: 16 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1799 8/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 922224 m, 42421 m/sec, 7271442 t fired, .

Time elapsed: 21 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1799 10/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 1162679 m, 48091 m/sec, 9090626 t fired, .

Time elapsed: 26 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1799 11/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 1373887 m, 42241 m/sec, 10891154 t fired, .

Time elapsed: 31 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1799 13/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 1610259 m, 47274 m/sec, 12704221 t fired, .

Time elapsed: 36 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1799 15/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 1820321 m, 42012 m/sec, 14502330 t fired, .

Time elapsed: 41 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1799 16/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 2052275 m, 46390 m/sec, 16301655 t fired, .

Time elapsed: 46 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1799 18/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 2258880 m, 41321 m/sec, 18078479 t fired, .

Time elapsed: 51 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1799 20/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 2491649 m, 46553 m/sec, 19877672 t fired, .

Time elapsed: 56 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1799 21/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 2692627 m, 40195 m/sec, 21654505 t fired, .

Time elapsed: 61 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1799 23/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 2924745 m, 46423 m/sec, 23460385 t fired, .

Time elapsed: 66 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1799 25/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 3133014 m, 41653 m/sec, 25252700 t fired, .

Time elapsed: 71 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1799 27/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 3361609 m, 45719 m/sec, 27065623 t fired, .

Time elapsed: 76 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1799 28/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 3579029 m, 43484 m/sec, 28866404 t fired, .

Time elapsed: 81 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1799 30/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 3787366 m, 41667 m/sec, 30648443 t fired, .

Time elapsed: 86 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1799 32/32 QuasiCertifProtocol-PT-28-LTLCardinality-12 4004173 m, 43361 m/sec, 32435166 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for QuasiCertifProtocol-PT-28-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-28-LTLCardinality-03
lola: time limit : 3504 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3504 3/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 264854 m, 52970 m/sec, 1899552 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3504 4/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 476715 m, 42372 m/sec, 3754396 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3504 6/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 727248 m, 50106 m/sec, 5607063 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3504 8/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 939058 m, 42362 m/sec, 7430005 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3504 10/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 1182125 m, 48613 m/sec, 9256311 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3504 11/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 1391886 m, 41952 m/sec, 11060751 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3504 13/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 1629995 m, 47621 m/sec, 12883034 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3504 15/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 1840030 m, 42007 m/sec, 14686278 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3504 17/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 2076675 m, 47329 m/sec, 16492130 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3504 18/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 2279573 m, 40579 m/sec, 18276606 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3504 20/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 2515341 m, 47153 m/sec, 20082884 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3504 22/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 2717037 m, 40339 m/sec, 21866030 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3504 23/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 2952548 m, 47102 m/sec, 23683478 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3504 25/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 3167164 m, 42923 m/sec, 25490972 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3504 27/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 3387213 m, 44009 m/sec, 27301639 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3504 29/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 3608336 m, 44224 m/sec, 29105215 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3504 30/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 3812815 m, 40895 m/sec, 30890041 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3504 32/32 QuasiCertifProtocol-PT-28-LTLCardinality-03 4034691 m, 44375 m/sec, 32684050 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-PT-28-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-28-LTLCardinality-03: LTL unknown AGGR
QuasiCertifProtocol-PT-28-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 191 secs. Pages in use: 32

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-28"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is QuasiCertifProtocol-PT-28, 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 r295-tall-167873948500899"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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