Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716769596985

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 00:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 00:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:26:38] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-27 00:26:38] [INFO ] Transformed 550 places.
[2024-05-27 00:26:38] [INFO ] Transformed 176 transitions.
[2024-05-27 00:26:38] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 303 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 538 transition count 176
Applied a total of 12 rules in 27 ms. Remains 538 /550 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 538 cols
[2024-05-27 00:26:39] [INFO ] Computed 363 invariants in 29 ms
[2024-05-27 00:26:39] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-27 00:26:39] [INFO ] Invariant cache hit.
[2024-05-27 00:26:40] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2024-05-27 00:26:40] [INFO ] Invariant cache hit.
[2024-05-27 00:26:40] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1508 ms. Remains : 538/550 places, 176/176 transitions.
Support contains 303 out of 538 places after structural reductions.
[2024-05-27 00:26:40] [INFO ] Flatten gal took : 62 ms
[2024-05-27 00:26:40] [INFO ] Flatten gal took : 30 ms
[2024-05-27 00:26:40] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 301 out of 538 places (down from 303) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-27 00:26:41] [INFO ] Invariant cache hit.
[2024-05-27 00:26:41] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-27 00:26:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Nat]Absence check using 2 positive and 361 generalized place invariants in 53 ms returned sat
[2024-05-27 00:26:43] [INFO ] After 1613ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :12
[2024-05-27 00:26:45] [INFO ] After 2818ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :12
Attempting to minimize the solution found.
Minimization took 1305 ms.
[2024-05-27 00:26:46] [INFO ] After 4745ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :12
Fused 18 Parikh solutions to 12 different solutions.
Finished Parikh walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 10 properties in 16 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 249 are kept as prefixes of interest. Removing 289 places using SCC suffix rule.2 ms
Discarding 289 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 227 transition count 61
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 126 place count 216 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 215 transition count 60
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 127 place count 215 transition count 27
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 222 place count 153 transition count 27
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 152 transition count 27
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 110 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 355 place count 31 transition count 16
Applied a total of 355 rules in 34 ms. Remains 31 /538 variables (removed 507) and now considering 16/176 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 31/538 places, 16/176 transitions.
Finished random walk after 11 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 538 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 538 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 525 transition count 176
Applied a total of 13 rules in 21 ms. Remains 525 /538 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2024-05-27 00:26:46] [INFO ] Computed 351 invariants in 22 ms
[2024-05-27 00:26:47] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-27 00:26:47] [INFO ] Invariant cache hit.
[2024-05-27 00:26:47] [INFO ] Implicit Places using invariants and state equation in 637 ms returned [304, 305, 312, 313, 314, 315, 316, 317, 318, 319, 356]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1022 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/538 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1059 ms. Remains : 514/538 places, 176/176 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT (ADD s44 s45 s48 s49 s50 s51 s52 s53 s54 s55 s59) s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 6 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-00 finished in 1410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(p2)))'
Support contains 265 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 536 transition count 176
Applied a total of 2 rules in 6 ms. Remains 536 /538 variables (removed 2) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2024-05-27 00:26:48] [INFO ] Computed 362 invariants in 10 ms
[2024-05-27 00:26:48] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-27 00:26:48] [INFO ] Invariant cache hit.
[2024-05-27 00:26:48] [INFO ] Implicit Places using invariants and state equation in 600 ms returned [315, 316, 323, 324, 325, 326, 327, 328, 329, 330, 367]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 889 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/538 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 900 ms. Remains : 525/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ 2 (ADD s33 s36 s37 s38 s39 s40 s41 s42 s43 s46 s47)), p1:(AND (LEQ 3 (ADD s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-01 finished in 1130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.8 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 510 transition count 171
Applied a total of 5 rules in 39 ms. Remains 510 /538 variables (removed 28) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 510 cols
[2024-05-27 00:26:49] [INFO ] Computed 341 invariants in 13 ms
[2024-05-27 00:26:49] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-27 00:26:49] [INFO ] Invariant cache hit.
[2024-05-27 00:26:50] [INFO ] Implicit Places using invariants and state equation in 695 ms returned [301, 302, 309, 310, 311, 312, 313, 314, 315, 316, 353, 429, 430, 431, 432, 433, 434, 486, 489, 490, 491, 492]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1039 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/538 places, 171/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1095 ms. Remains : 488/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-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:(LEQ 2 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6770 reset in 365 ms.
Product exploration explored 100000 steps with 6784 reset in 220 ms.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 171 rows 488 cols
[2024-05-27 00:26:51] [INFO ] Computed 320 invariants in 9 ms
[2024-05-27 00:26:52] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 222 ms returned sat
[2024-05-27 00:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:52] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2024-05-27 00:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:52] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 142 ms returned sat
[2024-05-27 00:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:53] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2024-05-27 00:26:53] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 15 ms.
[2024-05-27 00:26:53] [INFO ] Added : 12 causal constraints over 3 iterations in 151 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 17 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-27 00:26:53] [INFO ] Invariant cache hit.
[2024-05-27 00:26:54] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-27 00:26:54] [INFO ] Invariant cache hit.
[2024-05-27 00:26:54] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-05-27 00:26:54] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-27 00:26:54] [INFO ] Invariant cache hit.
[2024-05-27 00:26:54] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1079 ms. Remains : 488/488 places, 171/171 transitions.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-27 00:26:55] [INFO ] Invariant cache hit.
[2024-05-27 00:26:55] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 136 ms returned sat
[2024-05-27 00:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:56] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2024-05-27 00:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:56] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 136 ms returned sat
[2024-05-27 00:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:57] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2024-05-27 00:26:57] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 11 ms.
[2024-05-27 00:26:57] [INFO ] Added : 1 causal constraints over 1 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6776 reset in 160 ms.
Product exploration explored 100000 steps with 6763 reset in 201 ms.
Built C files in :
/tmp/ltsmin13914406840199488003
[2024-05-27 00:26:57] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2024-05-27 00:26:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:26:57] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2024-05-27 00:26:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:26:57] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2024-05-27 00:26:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:26:57] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13914406840199488003
Running compilation step : cd /tmp/ltsmin13914406840199488003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin13914406840199488003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13914406840199488003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11996731871064014971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 18 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-27 00:27:13] [INFO ] Invariant cache hit.
[2024-05-27 00:27:13] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-27 00:27:13] [INFO ] Invariant cache hit.
[2024-05-27 00:27:13] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-05-27 00:27:13] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-27 00:27:13] [INFO ] Invariant cache hit.
[2024-05-27 00:27:14] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1106 ms. Remains : 488/488 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin8493405645833335473
[2024-05-27 00:27:14] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2024-05-27 00:27:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:27:14] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2024-05-27 00:27:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:27:14] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2024-05-27 00:27:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:27:14] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8493405645833335473
Running compilation step : cd /tmp/ltsmin8493405645833335473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 457 ms.
Running link step : cd /tmp/ltsmin8493405645833335473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8493405645833335473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6233578886131202713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:27:29] [INFO ] Flatten gal took : 21 ms
[2024-05-27 00:27:29] [INFO ] Flatten gal took : 21 ms
[2024-05-27 00:27:29] [INFO ] Time to serialize gal into /tmp/LTL10730272542917082696.gal : 5 ms
[2024-05-27 00:27:29] [INFO ] Time to serialize properties into /tmp/LTL5243120252322407690.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10730272542917082696.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13503539200714901965.hoa' '-atoms' '/tmp/LTL5243120252322407690.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5243120252322407690.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13503539200714901965.hoa
Detected timeout of ITS tools.
[2024-05-27 00:27:44] [INFO ] Flatten gal took : 19 ms
[2024-05-27 00:27:44] [INFO ] Flatten gal took : 17 ms
[2024-05-27 00:27:44] [INFO ] Time to serialize gal into /tmp/LTL10656935716952560935.gal : 4 ms
[2024-05-27 00:27:44] [INFO ] Time to serialize properties into /tmp/LTL16780250189143267772.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10656935716952560935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16780250189143267772.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(SstopAbort>=2)"))))
Formula 0 simplified : GF!"(SstopAbort>=2)"
Detected timeout of ITS tools.
[2024-05-27 00:27:59] [INFO ] Flatten gal took : 24 ms
[2024-05-27 00:27:59] [INFO ] Applying decomposition
[2024-05-27 00:27:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4625449210802074275.txt' '-o' '/tmp/graph4625449210802074275.bin' '-w' '/tmp/graph4625449210802074275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4625449210802074275.bin' '-l' '-1' '-v' '-w' '/tmp/graph4625449210802074275.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:27:59] [INFO ] Decomposing Gal with order
[2024-05-27 00:27:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:27:59] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-27 00:27:59] [INFO ] Flatten gal took : 73 ms
[2024-05-27 00:27:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 17 ms.
[2024-05-27 00:27:59] [INFO ] Time to serialize gal into /tmp/LTL223014725970557796.gal : 6 ms
[2024-05-27 00:27:59] [INFO ] Time to serialize properties into /tmp/LTL12570118307467036439.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL223014725970557796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12570118307467036439.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.SstopAbort>=2)"))))
Formula 0 simplified : GF!"(u0.SstopAbort>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13919282348496340438
[2024-05-27 00:28:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13919282348496340438
Running compilation step : cd /tmp/ltsmin13919282348496340438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin13919282348496340438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13919282348496340438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-02 finished in 100789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 370 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.3 ms
Discarding 168 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 370 transition count 131
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 370 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 130
Applied a total of 27 rules in 42 ms. Remains 369 /538 variables (removed 169) and now considering 130/176 (removed 46) transitions.
// Phase 1: matrix 130 rows 369 cols
[2024-05-27 00:28:30] [INFO ] Computed 240 invariants in 2 ms
[2024-05-27 00:28:30] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-27 00:28:30] [INFO ] Invariant cache hit.
[2024-05-27 00:28:30] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [159, 160, 167, 168, 169, 170, 171, 172, 173, 174, 210]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 744 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/538 places, 130/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 358 /358 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 807 ms. Remains : 358/538 places, 130/176 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s59 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 113 steps with 16 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-03 finished in 894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X((p1||G(p2)))))))'
Support contains 13 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 11 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-27 00:28:30] [INFO ] Computed 350 invariants in 6 ms
[2024-05-27 00:28:31] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-27 00:28:31] [INFO ] Invariant cache hit.
[2024-05-27 00:28:31] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2024-05-27 00:28:31] [INFO ] Invariant cache hit.
[2024-05-27 00:28:32] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 524/538 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1200 ms. Remains : 524/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s76 (ADD s303 s304 s311 s312 s313 s314 s315 s316 s317 s318 s355)), p1:(GT 1 (ADD s303 s304 s311 s312 s313 s314 s315 s316 s317 s318 s355)), p2:(GT ...], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 6921 reset in 295 ms.
Product exploration explored 100000 steps with 6918 reset in 300 ms.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 555 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 787347 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :{1=1, 2=1, 3=1, 4=1, 7=1, 10=1, 11=1}
Probabilistic random walk after 787347 steps, saw 107443 distinct states, run finished after 3003 ms. (steps per millisecond=262 ) properties seen :7
Running SMT prover for 5 properties.
[2024-05-27 00:28:37] [INFO ] Invariant cache hit.
[2024-05-27 00:28:37] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 00:28:38] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 58 ms returned sat
[2024-05-27 00:28:38] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G p0)]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 735 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-04 finished in 8053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 132 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 523 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 520 transition count 171
Applied a total of 5 rules in 26 ms. Remains 520 /538 variables (removed 18) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2024-05-27 00:28:38] [INFO ] Computed 351 invariants in 3 ms
[2024-05-27 00:28:39] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-27 00:28:39] [INFO ] Invariant cache hit.
[2024-05-27 00:28:39] [INFO ] Implicit Places using invariants and state equation in 493 ms returned [311, 312, 319, 320, 321, 322, 323, 324, 325, 326, 363, 439, 440, 441, 442, 443, 444, 496, 499, 500, 501, 502]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 837 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/538 places, 171/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 877 ms. Remains : 498/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s199 s203 s204 s205 s206 s207 s208 s209 s210 s213 s214) (ADD s200 s201 s202 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s...], 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 12 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-05 finished in 927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 6 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-27 00:28:39] [INFO ] Computed 350 invariants in 3 ms
[2024-05-27 00:28:40] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-27 00:28:40] [INFO ] Invariant cache hit.
[2024-05-27 00:28:40] [INFO ] Implicit Places using invariants and state equation in 635 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 944 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 958 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s75 s225)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-08 finished in 1049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X(p2)&&p1))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 10 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
[2024-05-27 00:28:40] [INFO ] Invariant cache hit.
[2024-05-27 00:28:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-27 00:28:41] [INFO ] Invariant cache hit.
[2024-05-27 00:28:41] [INFO ] Implicit Places using invariants and state equation in 621 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 924 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 943 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(GT s349 s47), p1:(AND (GT s432 s491) (OR (LEQ s349 s47) (GT 3 s35))), p0:(OR (LEQ s349 s47) (GT 3 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 6926 reset in 232 ms.
Product exploration explored 100000 steps with 6927 reset in 208 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (AND (NOT p1) p0 (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0 (NOT p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1833 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 741720 steps, run timeout after 3009 ms. (steps per millisecond=246 ) properties seen :{0=1, 3=1, 4=1, 7=1, 8=1}
Probabilistic random walk after 741720 steps, saw 102042 distinct states, run finished after 3009 ms. (steps per millisecond=246 ) properties seen :5
Running SMT prover for 4 properties.
// Phase 1: matrix 176 rows 513 cols
[2024-05-27 00:28:48] [INFO ] Computed 340 invariants in 21 ms
[2024-05-27 00:28:48] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-27 00:28:48] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 48 ms returned sat
[2024-05-27 00:28:48] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (AND (NOT p1) p0 (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0 (NOT p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (AND p0 (NOT p2) p1)), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 27 factoid took 17 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-09 finished in 7456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 11 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-27 00:28:48] [INFO ] Computed 350 invariants in 9 ms
[2024-05-27 00:28:48] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-27 00:28:48] [INFO ] Invariant cache hit.
[2024-05-27 00:28:49] [INFO ] Implicit Places using invariants and state equation in 649 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1002 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1019 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s75 s422)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-12 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((G(p1) U p2)&&p0))))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 526 transition count 176
Applied a total of 12 rules in 7 ms. Remains 526 /538 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 526 cols
[2024-05-27 00:28:49] [INFO ] Computed 351 invariants in 6 ms
[2024-05-27 00:28:49] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-27 00:28:49] [INFO ] Invariant cache hit.
[2024-05-27 00:28:50] [INFO ] Implicit Places using invariants and state equation in 657 ms returned [305, 306, 313, 314, 315, 316, 317, 318, 319, 320, 357]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 993 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/538 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 515 /515 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1010 ms. Remains : 515/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LEQ s37 s23) (LEQ s486 s77)), p2:(LEQ 2 s12), p1:(AND (LEQ s486 s77) (LEQ s37 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-13 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-27 00:28:50] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3329223374255210164
[2024-05-27 00:28:50] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-27 00:28:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:28:50] [INFO ] Applying decomposition
[2024-05-27 00:28:50] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-27 00:28:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:28:50] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-27 00:28:50] [INFO ] Flatten gal took : 14 ms
[2024-05-27 00:28:50] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:28:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3329223374255210164
Running compilation step : cd /tmp/ltsmin3329223374255210164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2399569297515325125.txt' '-o' '/tmp/graph2399569297515325125.bin' '-w' '/tmp/graph2399569297515325125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2399569297515325125.bin' '-l' '-1' '-v' '-w' '/tmp/graph2399569297515325125.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:28:51] [INFO ] Decomposing Gal with order
[2024-05-27 00:28:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:28:51] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-27 00:28:51] [INFO ] Flatten gal took : 37 ms
[2024-05-27 00:28:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 15 ms.
[2024-05-27 00:28:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality3222701311369704704.gal : 5 ms
[2024-05-27 00:28:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality17219513886713677711.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3222701311369704704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17219513886713677711.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.SstopAbort>=2)"))))
Formula 0 simplified : GF!"(u0.SstopAbort>=2)"
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin3329223374255210164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3329223374255210164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Initializing POR dependencies: labels 177, guards 176
pins2lts-mc-linux64( 5/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.259: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.259: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.259: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.464: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.485: There are 178 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.485: State length is 539, there are 180 groups
pins2lts-mc-linux64( 0/ 8), 0.485: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.485: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.485: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.485: Visible groups: 0 / 180, labels: 1 / 178
pins2lts-mc-linux64( 0/ 8), 0.485: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.485: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.530: [Blue] ~17 levels ~960 states ~2816 transitions
pins2lts-mc-linux64( 4/ 8), 0.554: [Blue] ~17 levels ~1920 states ~5008 transitions
pins2lts-mc-linux64( 4/ 8), 0.601: [Blue] ~17 levels ~3840 states ~10064 transitions
pins2lts-mc-linux64( 4/ 8), 0.695: [Blue] ~17 levels ~7680 states ~22296 transitions
pins2lts-mc-linux64( 0/ 8), 0.871: [Blue] ~17 levels ~15360 states ~49408 transitions
pins2lts-mc-linux64( 2/ 8), 1.242: [Blue] ~17 levels ~30720 states ~108808 transitions
pins2lts-mc-linux64( 1/ 8), 1.903: [Blue] ~17 levels ~61440 states ~205808 transitions
pins2lts-mc-linux64( 7/ 8), 3.152: [Blue] ~19 levels ~122880 states ~492256 transitions
pins2lts-mc-linux64( 1/ 8), 5.756: [Blue] ~17 levels ~245760 states ~1042808 transitions
pins2lts-mc-linux64( 1/ 8), 10.818: [Blue] ~18 levels ~491520 states ~2296248 transitions
pins2lts-mc-linux64( 1/ 8), 22.115: [Blue] ~18 levels ~983040 states ~5368344 transitions
pins2lts-mc-linux64( 5/ 8), 42.945: [Blue] ~30 levels ~1966080 states ~11021680 transitions
pins2lts-mc-linux64( 5/ 8), 88.984: [Blue] ~31 levels ~3932160 states ~23283224 transitions
pins2lts-mc-linux64( 7/ 8), 181.415: [Blue] ~50 levels ~7864320 states ~48470360 transitions
pins2lts-mc-linux64( 5/ 8), 328.407: [Blue] ~51 levels ~15728640 states ~85987616 transitions
pins2lts-mc-linux64( 7/ 8), 655.913: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 655.961:
pins2lts-mc-linux64( 0/ 8), 655.961: Explored 28322445 states 168431221 transitions, fanout: 5.947
pins2lts-mc-linux64( 0/ 8), 655.961: Total exploration time 655.460 sec (655.430 sec minimum, 655.439 sec on average)
pins2lts-mc-linux64( 0/ 8), 655.961: States per second: 43210, Transitions per second: 256966
pins2lts-mc-linux64( 0/ 8), 655.961:
pins2lts-mc-linux64( 0/ 8), 655.961: State space has 28280056 states, 2859 are accepting
pins2lts-mc-linux64( 0/ 8), 655.961: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 655.961: blue states: 28322445 (100.15%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 655.961: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 655.961: all-red states: 2859 (0.01%), bogus 6 (0.00%)
pins2lts-mc-linux64( 0/ 8), 655.961:
pins2lts-mc-linux64( 0/ 8), 655.961: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 655.961:
pins2lts-mc-linux64( 0/ 8), 655.961: Queue width: 8B, total height: 423, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 655.961: Tree memory: 471.8MB, 17.5 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 655.961: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 655.961: Stored 184 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 655.961: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 655.962: Est. total memory use: 471.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3329223374255210164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3329223374255210164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 00:49:41] [INFO ] Flatten gal took : 235 ms
[2024-05-27 00:49:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality5318728714486226208.gal : 39 ms
[2024-05-27 00:49:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality2253419451350356884.ltl : 224 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5318728714486226208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2253419451350356884.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("(SstopAbort>=2)"))))
Formula 0 simplified : GF!"(SstopAbort>=2)"
Detected timeout of ITS tools.
[2024-05-27 01:10:33] [INFO ] Flatten gal took : 212 ms
[2024-05-27 01:10:33] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-27 01:10:33] [INFO ] Transformed 538 places.
[2024-05-27 01:10:33] [INFO ] Transformed 176 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 01:11:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality7531703446184007502.gal : 10 ms
[2024-05-27 01:11:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality1280574727702870230.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7531703446184007502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1280574727702870230.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(SstopAbort>=2)"))))
Formula 0 simplified : GF!"(SstopAbort>=2)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 137240 kB
After kill :
MemTotal: 16393232 kB
MemFree: 14411792 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361400047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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