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-167873948500884.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500884
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 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 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 360K 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-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678917917843

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 22:05:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 22:05:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:05:19] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-15 22:05:19] [INFO ] Transformed 1398 places.
[2023-03-15 22:05:19] [INFO ] Transformed 296 transitions.
[2023-03-15 22:05:19] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 946 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 57 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2023-03-15 22:05:19] [INFO ] Computed 1062 place invariants in 68 ms
[2023-03-15 22:05:20] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-15 22:05:20] [INFO ] Invariant cache hit.
[2023-03-15 22:05:21] [INFO ] Implicit Places using invariants and state equation in 942 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 931, 933, 934]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 1696 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1339/1398 places, 296/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1782 ms. Remains : 1339/1398 places, 296/296 transitions.
Support contains 946 out of 1339 places after structural reductions.
[2023-03-15 22:05:21] [INFO ] Flatten gal took : 101 ms
[2023-03-15 22:05:21] [INFO ] Flatten gal took : 65 ms
[2023-03-15 22:05:21] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 945 out of 1339 places (down from 946) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:05:22] [INFO ] Computed 1045 place invariants in 30 ms
[2023-03-15 22:05:23] [INFO ] [Real]Absence check using 0 positive and 1045 generalized place invariants in 180 ms returned sat
[2023-03-15 22:05:23] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-15 22:05:24] [INFO ] [Nat]Absence check using 0 positive and 1045 generalized place invariants in 175 ms returned sat
[2023-03-15 22:05:26] [INFO ] After 1881ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-15 22:05:28] [INFO ] After 3691ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 2144 ms.
[2023-03-15 22:05:30] [INFO ] After 6893ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 13 different solutions.
Finished Parikh walk after 138 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=34 )
Parikh walk visited 15 properties in 24 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1339 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1339 transition count 296
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' '!(F(G(p0)))'
Support contains 20 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 951 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.13 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 951 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 921 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 921 transition count 221
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 1 with 4 rules applied. Total rules applied 71 place count 919 transition count 219
Applied a total of 71 rules in 195 ms. Remains 919 /1339 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2023-03-15 22:05:31] [INFO ] Computed 703 place invariants in 5 ms
[2023-03-15 22:05:31] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-15 22:05:31] [INFO ] Invariant cache hit.
[2023-03-15 22:05:33] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned [515, 516]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2130 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1339 places, 219/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 917 /917 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2359 ms. Remains : 917/1339 places, 219/296 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s98 1) (GEQ s861 1) (GEQ s862 1) (GEQ s863 1) (GEQ s864 1) (GEQ s865 1) (GEQ s866 1) (GEQ s867 1) (GEQ s868 1) (GEQ s869 1) (GEQ s870 1) (GEQ...], 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 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-00 finished in 2556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:05:33] [INFO ] Computed 1045 place invariants in 13 ms
[2023-03-15 22:05:34] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2023-03-15 22:05:34] [INFO ] Invariant cache hit.
[2023-03-15 22:05:36] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3118 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3197 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s127 1), p0:(AND (GEQ s146 1) (GEQ s1281 1) (GEQ s1282 1) (GEQ s1283 1) (GEQ s1284 1) (GEQ s1285 1) (GEQ s1286 1) (GEQ s1287 1) (GEQ s1288 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-01 finished in 3322 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 1 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 951 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.6 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 950 transition count 280
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 920 transition count 220
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 920 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 919 transition count 219
Applied a total of 69 rules in 97 ms. Remains 919 /1339 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2023-03-15 22:05:36] [INFO ] Computed 703 place invariants in 6 ms
[2023-03-15 22:05:37] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-15 22:05:37] [INFO ] Invariant cache hit.
[2023-03-15 22:05:38] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 2041 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1339 places, 219/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 898 /898 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2179 ms. Remains : 898/1339 places, 219/296 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-02 finished in 2243 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 U (G(!p0)||(!p0&&(p1||X(X(F(!p2)))))))))'
Support contains 41 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:05:39] [INFO ] Computed 1045 place invariants in 16 ms
[2023-03-15 22:05:40] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2023-03-15 22:05:40] [INFO ] Invariant cache hit.
[2023-03-15 22:05:42] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3103 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3185 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, p2, p0, p0, (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s127 1) (GEQ s1305 1) (GEQ s1306 1) (GEQ s1307 1) (GEQ s1308 1) (GEQ s1309 1) (GEQ s1310 1) (GEQ s1313 1) (GEQ s1314 1) (GEQ s1315 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-03 finished in 3431 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' '!((p0 U (F(p1)||X(G((G(p2) U p3))))))'
Support contains 836 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:05:42] [INFO ] Invariant cache hit.
[2023-03-15 22:05:43] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-15 22:05:43] [INFO ] Invariant cache hit.
[2023-03-15 22:05:44] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1598 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1621 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0, 1} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0, 1} source=7 dest: 7}]], initial=1, aps=[p1:(OR (AND (GEQ s78 1) (GEQ s1264 1)) (AND (GEQ s77 1) (GEQ s1265 1)) (AND (GEQ s93 1) (GEQ s1251 1)) (AND (GEQ s86 1) (GEQ s1256 1)) (AND (GEQ s97 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-05 finished in 1994 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 20 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:05:44] [INFO ] Invariant cache hit.
[2023-03-15 22:05:45] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-15 22:05:45] [INFO ] Invariant cache hit.
[2023-03-15 22:05:47] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3487 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3567 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s127 1) (GEQ s1305 1) (GEQ s1306 1) (GEQ s1307 1) (GEQ s1308 1) (GEQ s1309 1) (GEQ s1310 1) (GEQ s1313 1) (GEQ s1314 1) (GEQ s1315 1) (GEQ s1...], 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 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-06 finished in 3650 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)&&X(G(p1)))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:05:48] [INFO ] Invariant cache hit.
[2023-03-15 22:05:49] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2023-03-15 22:05:49] [INFO ] Invariant cache hit.
[2023-03-15 22:05:51] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3414 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3494 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(LT s1268 1), p0:(OR (LT s125 1) (LT s1236 1) (LT s1237 1) (LT s1238 1) (LT s1239 1) (LT s1240 1) (LT s1241 1) (LT s1242 1) (LT s1243 1) (LT s1244 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-07 finished in 3690 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((X(p1)||p0))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:05:51] [INFO ] Invariant cache hit.
[2023-03-15 22:05:52] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2023-03-15 22:05:52] [INFO ] Invariant cache hit.
[2023-03-15 22:05:55] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3557 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 48 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3645 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s105 1) (LT s1273 1)), p0:(OR (LT s105 1) (LT s1273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4422 reset in 297 ms.
Product exploration explored 100000 steps with 4419 reset in 259 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 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 103 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1142778 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1142778 steps, saw 162943 distinct states, run finished after 3004 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 22:06:00] [INFO ] Computed 1044 place invariants in 102 ms
[2023-03-15 22:06:00] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 159 ms returned sat
[2023-03-15 22:06:00] [INFO ] After 359ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3
[2023-03-15 22:06:01] [INFO ] After 520ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-15 22:06:01] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 3 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 527 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:06:01] [INFO ] Invariant cache hit.
[2023-03-15 22:06:03] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2023-03-15 22:06:03] [INFO ] Invariant cache hit.
[2023-03-15 22:06:05] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 3218 ms to find 0 implicit places.
[2023-03-15 22:06:05] [INFO ] Invariant cache hit.
[2023-03-15 22:06:05] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3663 ms. Remains : 1337/1337 places, 296/296 transitions.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1483274 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :{}
Probabilistic random walk after 1483274 steps, saw 211484 distinct states, run finished after 3001 ms. (steps per millisecond=494 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:06:09] [INFO ] Invariant cache hit.
[2023-03-15 22:06:09] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 178 ms returned sat
[2023-03-15 22:06:09] [INFO ] After 350ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 22:06:09] [INFO ] After 448ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-15 22:06:10] [INFO ] After 877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4417 reset in 206 ms.
Product exploration explored 100000 steps with 4422 reset in 217 ms.
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:06:11] [INFO ] Invariant cache hit.
[2023-03-15 22:06:12] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2023-03-15 22:06:12] [INFO ] Invariant cache hit.
[2023-03-15 22:06:14] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 3203 ms to find 0 implicit places.
[2023-03-15 22:06:14] [INFO ] Invariant cache hit.
[2023-03-15 22:06:14] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3650 ms. Remains : 1337/1337 places, 296/296 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 23248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:06:15] [INFO ] Computed 1045 place invariants in 19 ms
[2023-03-15 22:06:16] [INFO ] Implicit Places using invariants in 1111 ms returned []
[2023-03-15 22:06:16] [INFO ] Invariant cache hit.
[2023-03-15 22:06:18] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3427 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3507 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s128 1)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-09 finished in 3648 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(F(p0))||G(p1))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:06:18] [INFO ] Invariant cache hit.
[2023-03-15 22:06:19] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-15 22:06:19] [INFO ] Invariant cache hit.
[2023-03-15 22:06:22] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned [917]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3475 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1339 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3551 ms. Remains : 1338/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s125 1), p0:(OR (LT s759 1) (LT s760 1) (LT s761 1) (LT s762 1) (LT s763 1) (LT s764 1) (LT s765 1) (LT s766 1) (LT s771 1) (LT s772 1) (LT s775 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4420 reset in 232 ms.
Product exploration explored 100000 steps with 4418 reset in 215 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 172 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-10 finished in 4514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(F(p1))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:06:23] [INFO ] Invariant cache hit.
[2023-03-15 22:06:24] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2023-03-15 22:06:24] [INFO ] Invariant cache hit.
[2023-03-15 22:06:26] [INFO ] Implicit Places using invariants and state equation in 2021 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3206 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3286 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1268 1), p1:(GEQ s146 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10826 reset in 382 ms.
Product exploration explored 100000 steps with 10773 reset in 356 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 22:06:28] [INFO ] Computed 1044 place invariants in 96 ms
[2023-03-15 22:06:29] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 807 ms returned sat
[2023-03-15 22:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:33] [INFO ] [Real]Absence check using state equation in 3983 ms returned sat
[2023-03-15 22:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:06:34] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 774 ms returned sat
[2023-03-15 22:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:41] [INFO ] [Nat]Absence check using state equation in 6911 ms returned sat
[2023-03-15 22:06:41] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2023-03-15 22:06:41] [INFO ] Added : 0 causal constraints over 0 iterations in 109 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 949 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.3 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 949 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 919 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 919 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 917 transition count 219
Applied a total of 71 rules in 108 ms. Remains 917 /1337 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 917 cols
[2023-03-15 22:06:41] [INFO ] Computed 702 place invariants in 9 ms
[2023-03-15 22:06:42] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-15 22:06:42] [INFO ] Invariant cache hit.
[2023-03-15 22:06:44] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2023-03-15 22:06:44] [INFO ] Redundant transitions in 30 ms returned [182]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 218 rows 917 cols
[2023-03-15 22:06:44] [INFO ] Computed 702 place invariants in 8 ms
[2023-03-15 22:06:44] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1337 places, 218/296 transitions.
Graph (complete) has 8837 edges and 917 vertex of which 194 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.1 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 176 transition count 162
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 176 transition count 162
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 158 transition count 126
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 158 transition count 126
Applied a total of 73 rules in 13 ms. Remains 158 /917 variables (removed 759) and now considering 126/218 (removed 92) transitions.
// Phase 1: matrix 126 rows 158 cols
[2023-03-15 22:06:44] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-15 22:06:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-15 22:06:44] [INFO ] Invariant cache hit.
[2023-03-15 22:06:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/1337 places, 126/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2873 ms. Remains : 158/1337 places, 126/296 transitions.
Computed a total of 158 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 126
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2023-03-15 22:06:45] [INFO ] Invariant cache hit.
[2023-03-15 22:06:45] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 5 ms returned sat
[2023-03-15 22:06:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:45] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-15 22:06:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:06:45] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 4 ms returned sat
[2023-03-15 22:06:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-15 22:06:45] [INFO ] Computed and/alt/rep : 99/137/99 causal constraints (skipped 6 transitions) in 8 ms.
[2023-03-15 22:06:45] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 10591 reset in 179 ms.
Product exploration explored 100000 steps with 10592 reset in 242 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 22:06:45] [INFO ] Invariant cache hit.
[2023-03-15 22:06:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 22:06:45] [INFO ] Invariant cache hit.
[2023-03-15 22:06:46] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-15 22:06:46] [INFO ] Redundant transitions in 21 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 125 rows 158 cols
[2023-03-15 22:06:46] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-15 22:06:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 125/126 transitions.
Graph (complete) has 991 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 6 ms. Remains 157 /158 variables (removed 1) and now considering 124/125 (removed 1) transitions.
// Phase 1: matrix 124 rows 157 cols
[2023-03-15 22:06:46] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-15 22:06:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-15 22:06:46] [INFO ] Invariant cache hit.
[2023-03-15 22:06:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 157/158 places, 124/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 482 ms. Remains : 157/158 places, 124/126 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-11 finished in 23208 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))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 1319 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 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 1317 transition count 292
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 1317 transition count 292
Applied a total of 4 rules in 126 ms. Remains 1317 /1339 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1317 cols
[2023-03-15 22:06:46] [INFO ] Computed 1027 place invariants in 17 ms
[2023-03-15 22:06:47] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2023-03-15 22:06:47] [INFO ] Invariant cache hit.
[2023-03-15 22:06:49] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned [914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 3449 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1339 places, 292/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3617 ms. Remains : 1296/1339 places, 292/296 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p1), true, (NOT p0), (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 1}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s126 1), p0:(OR (LT s0 1) (LT s106 1)), p2:(AND (GEQ s102 1) (GEQ s1288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4414 reset in 270 ms.
Product exploration explored 100000 steps with 4404 reset in 274 ms.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
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 (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 16 factoid took 704 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 420 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1076904 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1076904 steps, saw 154350 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 292 rows 1296 cols
[2023-03-15 22:06:55] [INFO ] Computed 1008 place invariants in 118 ms
[2023-03-15 22:06:55] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 166 ms returned sat
[2023-03-15 22:06:55] [INFO ] After 315ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-15 22:06:56] [INFO ] After 377ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 22:06:56] [INFO ] After 865ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-15 22:06:56] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 160 ms returned sat
[2023-03-15 22:06:57] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 22:06:57] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-15 22:06:57] [INFO ] After 1400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 6 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p2)), (F p2), (F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 16 factoid took 767 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 119 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Support contains 3 out of 1296 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Applied a total of 0 rules in 30 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2023-03-15 22:06:58] [INFO ] Invariant cache hit.
[2023-03-15 22:06:59] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-15 22:06:59] [INFO ] Invariant cache hit.
[2023-03-15 22:07:01] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 3023 ms to find 0 implicit places.
[2023-03-15 22:07:01] [INFO ] Invariant cache hit.
[2023-03-15 22:07:01] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3444 ms. Remains : 1296/1296 places, 292/292 transitions.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
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) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 490 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1029803 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1029803 steps, saw 148505 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 22:07:06] [INFO ] Invariant cache hit.
[2023-03-15 22:07:06] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 161 ms returned sat
[2023-03-15 22:07:06] [INFO ] After 299ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-15 22:07:06] [INFO ] After 345ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 22:07:06] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-15 22:07:07] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 159 ms returned sat
[2023-03-15 22:07:07] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 22:07:08] [INFO ] After 745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-15 22:07:08] [INFO ] After 1421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 6 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p2), (F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 14 factoid took 567 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 156 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 152 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Product exploration explored 100000 steps with 4216 reset in 255 ms.
Product exploration explored 100000 steps with 4207 reset in 269 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Support contains 3 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Graph (complete) has 8913 edges and 1296 vertex of which 935 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.3 ms
Discarding 361 places :
Also discarding 0 output transitions
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 898 transition count 218
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 898 transition count 218
Applied a total of 75 rules in 119 ms. Remains 898 /1296 variables (removed 398) and now considering 218/292 (removed 74) transitions.
[2023-03-15 22:07:10] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 218 rows 898 cols
[2023-03-15 22:07:10] [INFO ] Computed 684 place invariants in 6 ms
[2023-03-15 22:07:10] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1296 places, 218/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 898/1296 places, 218/292 transitions.
Support contains 3 out of 1296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Applied a total of 0 rules in 31 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 1296 cols
[2023-03-15 22:07:10] [INFO ] Computed 1008 place invariants in 116 ms
[2023-03-15 22:07:11] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2023-03-15 22:07:11] [INFO ] Invariant cache hit.
[2023-03-15 22:07:13] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2023-03-15 22:07:13] [INFO ] Invariant cache hit.
[2023-03-15 22:07:14] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3755 ms. Remains : 1296/1296 places, 292/292 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-13 finished in 27923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&G((F(p1)&&F(G(p0))))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 971 are kept as prefixes of interest. Removing 368 places using SCC suffix rule.2 ms
Discarding 368 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 939 transition count 221
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 939 transition count 221
Applied a total of 70 rules in 92 ms. Remains 939 /1339 variables (removed 400) and now considering 221/296 (removed 75) transitions.
// Phase 1: matrix 221 rows 939 cols
[2023-03-15 22:07:14] [INFO ] Computed 721 place invariants in 7 ms
[2023-03-15 22:07:15] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-15 22:07:15] [INFO ] Invariant cache hit.
[2023-03-15 22:07:16] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned [517, 759, 760, 761, 762, 763, 764, 767, 768, 769, 770, 771, 772, 773, 774, 899, 900, 901, 902, 905]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2039 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 919/1339 places, 221/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 919 /919 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2156 ms. Remains : 919/1339 places, 221/296 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, p0, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s88 1), p1:(AND (GEQ s296 1) (GEQ s297 1) (GEQ s298 1) (GEQ s299 1) (GEQ s300 1) (GEQ s301 1) (GEQ s302 1) (GEQ s303 1) (GEQ s304 1) (GEQ s305 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-14 finished in 2341 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((X(p1)||p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLFireability-08
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 958 are kept as prefixes of interest. Removing 381 places using SCC suffix rule.4 ms
Discarding 381 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 920 transition count 219
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 920 transition count 219
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 77 place count 919 transition count 218
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 919 transition count 218
Applied a total of 78 rules in 91 ms. Remains 919 /1339 variables (removed 420) and now considering 218/296 (removed 78) transitions.
// Phase 1: matrix 218 rows 919 cols
[2023-03-15 22:07:16] [INFO ] Computed 703 place invariants in 9 ms
[2023-03-15 22:07:17] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-15 22:07:17] [INFO ] Invariant cache hit.
[2023-03-15 22:07:18] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 1897 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 898/1339 places, 218/296 transitions.
Applied a total of 0 rules in 26 ms. Remains 898 /898 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2015 ms. Remains : 898/1339 places, 218/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s68 1) (LT s839 1)), p0:(OR (LT s68 1) (LT s839 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4209 reset in 224 ms.
Product exploration explored 100000 steps with 4212 reset in 243 ms.
Computed a total of 898 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 279 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 196 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1203614 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 1203614 steps, saw 173094 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 218 rows 898 cols
[2023-03-15 22:07:23] [INFO ] Computed 684 place invariants in 5 ms
[2023-03-15 22:07:23] [INFO ] [Real]Absence check using 0 positive and 684 generalized place invariants in 104 ms returned sat
[2023-03-15 22:07:23] [INFO ] After 238ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3
[2023-03-15 22:07:23] [INFO ] After 341ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-15 22:07:23] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Parikh walk visited 3 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 898/898 places, 218/218 transitions.
Applied a total of 0 rules in 14 ms. Remains 898 /898 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-15 22:07:24] [INFO ] Invariant cache hit.
[2023-03-15 22:07:25] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-15 22:07:25] [INFO ] Invariant cache hit.
[2023-03-15 22:07:26] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2023-03-15 22:07:26] [INFO ] Invariant cache hit.
[2023-03-15 22:07:26] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2076 ms. Remains : 898/898 places, 218/218 transitions.
Computed a total of 898 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 419 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1659927 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :{}
Probabilistic random walk after 1659927 steps, saw 237357 distinct states, run finished after 3001 ms. (steps per millisecond=553 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:07:30] [INFO ] Invariant cache hit.
[2023-03-15 22:07:30] [INFO ] [Real]Absence check using 0 positive and 684 generalized place invariants in 104 ms returned sat
[2023-03-15 22:07:30] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 22:07:30] [INFO ] After 285ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-15 22:07:30] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4210 reset in 238 ms.
Product exploration explored 100000 steps with 4216 reset in 246 ms.
Support contains 2 out of 898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 898/898 places, 218/218 transitions.
Applied a total of 0 rules in 23 ms. Remains 898 /898 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-15 22:07:31] [INFO ] Invariant cache hit.
[2023-03-15 22:07:32] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-15 22:07:32] [INFO ] Invariant cache hit.
[2023-03-15 22:07:33] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-03-15 22:07:33] [INFO ] Invariant cache hit.
[2023-03-15 22:07:34] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2292 ms. Remains : 898/898 places, 218/218 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 17595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(F(p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-18-LTLFireability-11
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 951 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.4 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 951 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 921 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 921 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 919 transition count 219
Applied a total of 71 rules in 68 ms. Remains 919 /1339 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2023-03-15 22:07:34] [INFO ] Computed 703 place invariants in 10 ms
[2023-03-15 22:07:35] [INFO ] Implicit Places using invariants in 701 ms returned []
[2023-03-15 22:07:35] [INFO ] Invariant cache hit.
[2023-03-15 22:07:36] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned [515, 516]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2162 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 917/1339 places, 219/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 917 /917 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2254 ms. Remains : 917/1339 places, 219/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s852 1), p1:(GEQ s98 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10687 reset in 295 ms.
Product exploration explored 100000 steps with 10690 reset in 319 ms.
Computed a total of 917 stabilizing places and 219 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 917 transition count 219
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
// Phase 1: matrix 219 rows 917 cols
[2023-03-15 22:07:38] [INFO ] Computed 702 place invariants in 7 ms
[2023-03-15 22:07:38] [INFO ] [Real]Absence check using 0 positive and 702 generalized place invariants in 462 ms returned sat
[2023-03-15 22:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:07:40] [INFO ] [Real]Absence check using state equation in 2099 ms returned sat
[2023-03-15 22:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:07:41] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 462 ms returned sat
[2023-03-15 22:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:07:44] [INFO ] [Nat]Absence check using state equation in 2889 ms returned sat
[2023-03-15 22:07:44] [INFO ] Computed and/alt/rep : 154/192/154 causal constraints (skipped 44 transitions) in 14 ms.
[2023-03-15 22:07:44] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 917 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 917/917 places, 219/219 transitions.
Applied a total of 0 rules in 33 ms. Remains 917 /917 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-15 22:07:44] [INFO ] Invariant cache hit.
[2023-03-15 22:07:45] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-15 22:07:45] [INFO ] Invariant cache hit.
[2023-03-15 22:07:46] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2023-03-15 22:07:46] [INFO ] Redundant transitions in 28 ms returned [182]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 218 rows 917 cols
[2023-03-15 22:07:46] [INFO ] Computed 702 place invariants in 4 ms
[2023-03-15 22:07:47] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/917 places, 218/219 transitions.
Graph (complete) has 8837 edges and 917 vertex of which 194 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.2 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 176 transition count 162
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 176 transition count 162
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 158 transition count 126
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 158 transition count 126
Applied a total of 73 rules in 12 ms. Remains 158 /917 variables (removed 759) and now considering 126/218 (removed 92) transitions.
// Phase 1: matrix 126 rows 158 cols
[2023-03-15 22:07:47] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-15 22:07:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-15 22:07:47] [INFO ] Invariant cache hit.
[2023-03-15 22:07:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/917 places, 126/219 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2740 ms. Remains : 158/917 places, 126/219 transitions.
Computed a total of 158 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 126
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2023-03-15 22:07:47] [INFO ] Invariant cache hit.
[2023-03-15 22:07:47] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 4 ms returned sat
[2023-03-15 22:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:07:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-15 22:07:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:07:48] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 5 ms returned sat
[2023-03-15 22:07:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:07:48] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-15 22:07:48] [INFO ] Computed and/alt/rep : 99/137/99 causal constraints (skipped 6 transitions) in 7 ms.
[2023-03-15 22:07:48] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 10621 reset in 178 ms.
Product exploration explored 100000 steps with 10624 reset in 190 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 22:07:48] [INFO ] Invariant cache hit.
[2023-03-15 22:07:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-15 22:07:48] [INFO ] Invariant cache hit.
[2023-03-15 22:07:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-15 22:07:48] [INFO ] Redundant transitions in 17 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 125 rows 158 cols
[2023-03-15 22:07:48] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-15 22:07:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 125/126 transitions.
Graph (complete) has 991 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 3 ms. Remains 157 /158 variables (removed 1) and now considering 124/125 (removed 1) transitions.
// Phase 1: matrix 124 rows 157 cols
[2023-03-15 22:07:48] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-15 22:07:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-15 22:07:48] [INFO ] Invariant cache hit.
[2023-03-15 22:07:49] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 157/158 places, 124/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 480 ms. Remains : 157/158 places, 124/126 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-11 finished in 14870 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))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
[2023-03-15 22:07:49] [INFO ] Flatten gal took : 45 ms
[2023-03-15 22:07:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 22:07:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1339 places, 296 transitions and 2925 arcs took 4 ms.
Total runtime 150070 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-18
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA QuasiCertifProtocol-PT-18-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678918250905

--------------------
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 LTLFireability -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 17 (type SKEL/SRCH) for 0 QuasiCertifProtocol-PT-18-LTLFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: FINISHED task # 17 (type SKEL/SRCH) for QuasiCertifProtocol-PT-18-LTLFireability-08
lola: result : false
lola: markings : 7321
lola: fired transitions : 25998
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-18-LTLFireability-08
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 4/32 QuasiCertifProtocol-PT-18-LTLFireability-08 371356 m, 74271 m/sec, 2484264 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 7/32 QuasiCertifProtocol-PT-18-LTLFireability-08 716530 m, 69034 m/sec, 4921667 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/720 10/32 QuasiCertifProtocol-PT-18-LTLFireability-08 1055700 m, 67834 m/sec, 7352776 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/720 13/32 QuasiCertifProtocol-PT-18-LTLFireability-08 1376987 m, 64257 m/sec, 9760606 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/720 15/32 QuasiCertifProtocol-PT-18-LTLFireability-08 1688226 m, 62247 m/sec, 12141491 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/720 17/32 QuasiCertifProtocol-PT-18-LTLFireability-08 1969606 m, 56276 m/sec, 14452365 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/720 19/32 QuasiCertifProtocol-PT-18-LTLFireability-08 2214949 m, 49068 m/sec, 16697939 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/720 21/32 QuasiCertifProtocol-PT-18-LTLFireability-08 2428505 m, 42711 m/sec, 18930822 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/720 24/32 QuasiCertifProtocol-PT-18-LTLFireability-08 2761390 m, 66577 m/sec, 21340579 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/720 27/32 QuasiCertifProtocol-PT-18-LTLFireability-08 3100522 m, 67826 m/sec, 23744737 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/720 30/32 QuasiCertifProtocol-PT-18-LTLFireability-08 3431168 m, 66129 m/sec, 26137819 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/720 32/32 QuasiCertifProtocol-PT-18-LTLFireability-08 3742162 m, 62198 m/sec, 28510509 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-PT-18-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 2 0 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

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

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 3 QuasiCertifProtocol-PT-18-LTLFireability-11
lola: time limit : 883 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-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/883 7/32 QuasiCertifProtocol-PT-18-LTLFireability-11 542516 m, 108503 m/sec, 2385726 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 8 (type EXCL) for QuasiCertifProtocol-PT-18-LTLFireability-11
lola: result : true
lola: markings : 709044
lola: fired transitions : 3306780
lola: time used : 7.000000
lola: memory pages used : 9
lola: LAUNCH task # 18 (type EXCL) for 3 QuasiCertifProtocol-PT-18-LTLFireability-11
lola: time limit : 1176 sec
lola: memory limit: 32 pages
lola: FINISHED task # 18 (type EXCL) for QuasiCertifProtocol-PT-18-LTLFireability-11
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 10 QuasiCertifProtocol-PT-18-LTLFireability-13
lola: time limit : 1764 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 3/1764 4/32 QuasiCertifProtocol-PT-18-LTLFireability-13 380331 m, 76066 m/sec, 1381086 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 8/1764 9/32 QuasiCertifProtocol-PT-18-LTLFireability-13 900777 m, 104089 m/sec, 3589369 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 13/1764 12/32 QuasiCertifProtocol-PT-18-LTLFireability-13 1219055 m, 63655 m/sec, 5773208 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 18/1764 17/32 QuasiCertifProtocol-PT-18-LTLFireability-13 1775936 m, 111376 m/sec, 7956982 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 23/1764 21/32 QuasiCertifProtocol-PT-18-LTLFireability-13 2187486 m, 82310 m/sec, 10113771 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 28/1764 25/32 QuasiCertifProtocol-PT-18-LTLFireability-13 2603758 m, 83254 m/sec, 12273998 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 33/1764 29/32 QuasiCertifProtocol-PT-18-LTLFireability-13 3054479 m, 90144 m/sec, 14417592 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 38/1764 32/32 QuasiCertifProtocol-PT-18-LTLFireability-13 3398185 m, 68741 m/sec, 16554576 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 13 (type EXCL) for QuasiCertifProtocol-PT-18-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 15 (type EXCL) for 10 QuasiCertifProtocol-PT-18-LTLFireability-13
lola: time limit : 3485 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 5/3485 4/32 QuasiCertifProtocol-PT-18-LTLFireability-13 374179 m, 74835 m/sec, 1343888 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 10/3485 7/32 QuasiCertifProtocol-PT-18-LTLFireability-13 722877 m, 69739 m/sec, 2751102 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 15/3485 10/32 QuasiCertifProtocol-PT-18-LTLFireability-13 976581 m, 50740 m/sec, 4010716 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 20/3485 11/32 QuasiCertifProtocol-PT-18-LTLFireability-13 1165491 m, 37782 m/sec, 5282905 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 25/3485 14/32 QuasiCertifProtocol-PT-18-LTLFireability-13 1437622 m, 54426 m/sec, 6555721 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 30/3485 17/32 QuasiCertifProtocol-PT-18-LTLFireability-13 1771673 m, 66810 m/sec, 7943687 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 35/3485 20/32 QuasiCertifProtocol-PT-18-LTLFireability-13 2036451 m, 52955 m/sec, 9201914 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 40/3485 21/32 QuasiCertifProtocol-PT-18-LTLFireability-13 2223156 m, 37341 m/sec, 10429361 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 45/3485 23/32 QuasiCertifProtocol-PT-18-LTLFireability-13 2453772 m, 46123 m/sec, 11697660 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 50/3485 26/32 QuasiCertifProtocol-PT-18-LTLFireability-13 2785036 m, 66252 m/sec, 13080746 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 55/3485 29/32 QuasiCertifProtocol-PT-18-LTLFireability-13 3037945 m, 50581 m/sec, 14319502 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 60/3485 30/32 QuasiCertifProtocol-PT-18-LTLFireability-13 3218741 m, 36159 m/sec, 15566899 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 15 (type EXCL) for QuasiCertifProtocol-PT-18-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ 0 0 0 0 2 0 2 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLFireability-08: LTL unknown AGGR
QuasiCertifProtocol-PT-18-LTLFireability-11: CONJ true CONJ
QuasiCertifProtocol-PT-18-LTLFireability-13: CONJ unknown CONJ


Time elapsed: 180 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-18"
export BK_EXAMINATION="LTLFireability"
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-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948500884"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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