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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 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 3.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 131K 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-COL-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716766301927

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-COL-32
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 23:31:43] [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-26 23:31:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:31:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 23:31:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 23:31:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 799 ms
[2024-05-26 23:31:44] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 23:31:44] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-26 23:31:44] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 224 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 23:31:44] [INFO ] Computed 5 invariants in 9 ms
[2024-05-26 23:31:44] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-26 23:31:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 23:31:45] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2024-05-26 23:31:45] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-26 23:31:45] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 17 Parikh solutions to 11 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 13 properties in 37 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 26/26 transitions.
Graph (complete) has 50 edges and 30 vertex of which 22 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 21 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 20 transition count 15
Applied a total of 13 rules in 24 ms. Remains 20 /30 variables (removed 10) and now considering 15/26 (removed 11) transitions.
// Phase 1: matrix 15 rows 20 cols
[2024-05-26 23:31:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-26 23:31:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 20/30 places, 15/26 transitions.
Finished random walk after 249 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-26 23:31:45] [INFO ] Flatten gal took : 19 ms
[2024-05-26 23:31:45] [INFO ] Flatten gal took : 4 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-05-26 23:31:45] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 31 ms.
[2024-05-26 23:31:45] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 2582 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3805 transition count 506
Applied a total of 1 rules in 183 ms. Remains 3805 /3806 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3805 cols
[2024-05-26 23:31:45] [INFO ] Computed 3300 invariants in 89 ms
[2024-05-26 23:31:48] [INFO ] Implicit Places using invariants in 2835 ms returned []
[2024-05-26 23:31:48] [INFO ] Invariant cache hit.
[2024-05-26 23:31:49] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 4158 ms to find 0 implicit places.
[2024-05-26 23:31:49] [INFO ] Invariant cache hit.
[2024-05-26 23:31:50] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3805/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5064 ms. Remains : 3805/3806 places, 506/506 transitions.
Support contains 2582 out of 3805 places after structural reductions.
[2024-05-26 23:31:50] [INFO ] Flatten gal took : 202 ms
[2024-05-26 23:31:50] [INFO ] Flatten gal took : 137 ms
[2024-05-26 23:31:51] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 265 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-26 23:31:52] [INFO ] Invariant cache hit.
[2024-05-26 23:31:53] [INFO ] After 1440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-26 23:31:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-26 23:31:55] [INFO ] [Nat]Absence check using 2 positive and 3298 generalized place invariants in 782 ms returned sat
[2024-05-26 23:32:18] [INFO ] After 21027ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2024-05-26 23:32:18] [INFO ] After 21036ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-26 23:32:18] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 20 Parikh solutions to 3 different solutions.
Parikh walk visited 13 properties in 28 ms.
Support contains 202 out of 3805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 2648 are kept as prefixes of interest. Removing 1157 places using SCC suffix rule.18 ms
Discarding 1157 places :
Also discarding 0 output transitions
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 2615 transition count 372
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 168 place count 2615 transition count 339
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 64 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 1 with 130 rules applied. Total rules applied 298 place count 2518 transition count 339
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 330 place count 2486 transition count 307
Iterating global reduction 1 with 32 rules applied. Total rules applied 362 place count 2486 transition count 307
Applied a total of 362 rules in 472 ms. Remains 2486 /3805 variables (removed 1319) and now considering 307/506 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 2486/3805 places, 307/506 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 2486 cols
[2024-05-26 23:32:19] [INFO ] Computed 2211 invariants in 18 ms
[2024-05-26 23:32:19] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 23:32:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-26 23:32:20] [INFO ] [Nat]Absence check using 1 positive and 2210 generalized place invariants in 524 ms returned sat
[2024-05-26 23:32:22] [INFO ] After 2030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 23:32:22] [INFO ] After 2318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-26 23:32:22] [INFO ] After 3389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 140 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 3 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3805 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3805 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 99 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 2613 are kept as prefixes of interest. Removing 1192 places using SCC suffix rule.34 ms
Discarding 1192 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 2612 transition count 438
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 35 place count 2611 transition count 437
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 2611 transition count 437
Applied a total of 36 rules in 721 ms. Remains 2611 /3805 variables (removed 1194) and now considering 437/506 (removed 69) transitions.
// Phase 1: matrix 437 rows 2611 cols
[2024-05-26 23:32:24] [INFO ] Computed 2176 invariants in 11 ms
[2024-05-26 23:32:28] [INFO ] Implicit Places using invariants in 4197 ms returned []
[2024-05-26 23:32:28] [INFO ] Invariant cache hit.
[2024-05-26 23:32:34] [INFO ] Implicit Places using invariants and state equation in 5995 ms returned [2311, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2346, 2347, 2348, 2349, 2350, 2351, 2352, 2353, 2354, 2355, 2356, 2357, 2358, 2359, 2360, 2361, 2362, 2363, 2364, 2365, 2366, 2367, 2368, 2369, 2370, 2371, 2372, 2373, 2374, 2375, 2376]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 10205 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2545/3805 places, 437/506 transitions.
Applied a total of 0 rules in 179 ms. Remains 2545 /2545 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11106 ms. Remains : 2545/3805 places, 437/506 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 158 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s2179 s2180 s2181 s2182 s2183 s2184 s2185 s2186 s2187 s2188 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2196 s2197 s2198 s2199 s2200 s2201 s220...], nbAcceptance=2, 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 2445 reset in 858 ms.
Product exploration explored 100000 steps with 2440 reset in 767 ms.
Computed a total of 2545 stabilizing places and 437 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2545 transition count 437
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 205 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 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 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 615641 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615641 steps, saw 108618 distinct states, run finished after 3002 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 437 rows 2545 cols
[2024-05-26 23:32:40] [INFO ] Computed 2112 invariants in 17 ms
[2024-05-26 23:32:40] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 23:32:41] [INFO ] [Nat]Absence check using 0 positive and 2112 generalized place invariants in 370 ms returned sat
[2024-05-26 23:32:43] [INFO ] After 1885ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-26 23:32:53] [INFO ] After 11617ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1356 ms.
[2024-05-26 23:32:54] [INFO ] After 13912ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 214 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 10 ms.
Support contains 99 out of 2545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2545/2545 places, 437/437 transitions.
Graph (complete) has 39701 edges and 2545 vertex of which 2544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 2478 transition count 202
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 334 place count 2445 transition count 202
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 334 place count 2445 transition count 135
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 501 place count 2345 transition count 135
Applied a total of 501 rules in 188 ms. Remains 2345 /2545 variables (removed 200) and now considering 135/437 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 2345/2545 places, 135/437 transitions.
Finished random walk after 242 steps, including 4 resets, run visited all 1 properties in 4 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 422 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Support contains 99 out of 2545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2545/2545 places, 437/437 transitions.
Applied a total of 0 rules in 141 ms. Remains 2545 /2545 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2024-05-26 23:32:55] [INFO ] Invariant cache hit.
[2024-05-26 23:32:59] [INFO ] Implicit Places using invariants in 4264 ms returned []
[2024-05-26 23:32:59] [INFO ] Invariant cache hit.
[2024-05-26 23:33:06] [INFO ] Implicit Places using invariants and state equation in 6674 ms returned []
Implicit Place search using SMT with State Equation took 10943 ms to find 0 implicit places.
[2024-05-26 23:33:06] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-26 23:33:06] [INFO ] Invariant cache hit.
[2024-05-26 23:33:07] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12113 ms. Remains : 2545/2545 places, 437/437 transitions.
Computed a total of 2545 stabilizing places and 437 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2545 transition count 437
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 213 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 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 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 547047 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 547047 steps, saw 99611 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-26 23:33:11] [INFO ] Invariant cache hit.
[2024-05-26 23:33:11] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 23:33:12] [INFO ] [Nat]Absence check using 0 positive and 2112 generalized place invariants in 426 ms returned sat
[2024-05-26 23:33:14] [INFO ] After 1832ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-26 23:33:24] [INFO ] After 11658ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1215 ms.
[2024-05-26 23:33:25] [INFO ] After 13870ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 211 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 7 ms.
Support contains 99 out of 2545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2545/2545 places, 437/437 transitions.
Graph (complete) has 39701 edges and 2545 vertex of which 2544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 2478 transition count 202
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 334 place count 2445 transition count 202
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 334 place count 2445 transition count 135
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 501 place count 2345 transition count 135
Applied a total of 501 rules in 177 ms. Remains 2345 /2545 variables (removed 200) and now considering 135/437 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 2345/2545 places, 135/437 transitions.
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 441 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2444 reset in 729 ms.
Product exploration explored 100000 steps with 2441 reset in 737 ms.
Built C files in :
/tmp/ltsmin8775333166352762043
[2024-05-26 23:33:28] [INFO ] Computing symmetric may disable matrix : 437 transitions.
[2024-05-26 23:33:28] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:33:28] [INFO ] Computing symmetric may enable matrix : 437 transitions.
[2024-05-26 23:33:28] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:33:28] [INFO ] Computing Do-Not-Accords matrix : 437 transitions.
[2024-05-26 23:33:28] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:33:28] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8775333166352762043
Running compilation step : cd /tmp/ltsmin8775333166352762043;'/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 2217 ms.
Running link step : cd /tmp/ltsmin8775333166352762043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin8775333166352762043;'/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/stateBased8841876719950714368.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 99 out of 2545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2545/2545 places, 437/437 transitions.
Applied a total of 0 rules in 157 ms. Remains 2545 /2545 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2024-05-26 23:33:43] [INFO ] Invariant cache hit.
[2024-05-26 23:33:47] [INFO ] Implicit Places using invariants in 4200 ms returned []
[2024-05-26 23:33:47] [INFO ] Invariant cache hit.
[2024-05-26 23:33:54] [INFO ] Implicit Places using invariants and state equation in 6736 ms returned []
Implicit Place search using SMT with State Equation took 10972 ms to find 0 implicit places.
[2024-05-26 23:33:54] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-26 23:33:54] [INFO ] Invariant cache hit.
[2024-05-26 23:33:55] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12353 ms. Remains : 2545/2545 places, 437/437 transitions.
Built C files in :
/tmp/ltsmin6857363487335743883
[2024-05-26 23:33:55] [INFO ] Computing symmetric may disable matrix : 437 transitions.
[2024-05-26 23:33:55] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:33:55] [INFO ] Computing symmetric may enable matrix : 437 transitions.
[2024-05-26 23:33:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:33:55] [INFO ] Computing Do-Not-Accords matrix : 437 transitions.
[2024-05-26 23:33:55] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:33:55] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6857363487335743883
Running compilation step : cd /tmp/ltsmin6857363487335743883;'/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 1910 ms.
Running link step : cd /tmp/ltsmin6857363487335743883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6857363487335743883;'/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/stateBased11983289586941819913.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 23:34:10] [INFO ] Flatten gal took : 67 ms
[2024-05-26 23:34:10] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:34:10] [INFO ] Time to serialize gal into /tmp/LTL17978304784879812885.gal : 16 ms
[2024-05-26 23:34:10] [INFO ] Time to serialize properties into /tmp/LTL3207917394372632169.prop : 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/LTL17978304784879812885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6364637511706451411.hoa' '-atoms' '/tmp/LTL3207917394372632169.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...318
Loading property file /tmp/LTL3207917394372632169.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6364637511706451411.hoa
Detected timeout of ITS tools.
[2024-05-26 23:34:25] [INFO ] Flatten gal took : 63 ms
[2024-05-26 23:34:26] [INFO ] Flatten gal took : 66 ms
[2024-05-26 23:34:26] [INFO ] Time to serialize gal into /tmp/LTL10650272913043842573.gal : 8 ms
[2024-05-26 23:34:26] [INFO ] Time to serialize properties into /tmp/LTL1990099894651896938.ltl : 2 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/LTL10650272913043842573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1990099894651896938.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((((n5...970
Formula 0 simplified : G(F!"(((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((((n5_1...962
Detected timeout of ITS tools.
[2024-05-26 23:34:41] [INFO ] Flatten gal took : 61 ms
[2024-05-26 23:34:41] [INFO ] Applying decomposition
[2024-05-26 23:34:41] [INFO ] Flatten gal took : 61 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/graph14800179658444792884.txt' '-o' '/tmp/graph14800179658444792884.bin' '-w' '/tmp/graph14800179658444792884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14800179658444792884.bin' '-l' '-1' '-v' '-w' '/tmp/graph14800179658444792884.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:34:41] [INFO ] Decomposing Gal with order
[2024-05-26 23:34:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:34:42] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-26 23:34:42] [INFO ] Flatten gal took : 451 ms
[2024-05-26 23:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 510 labels/synchronizations in 224 ms.
[2024-05-26 23:34:43] [INFO ] Time to serialize gal into /tmp/LTL14088301221351959403.gal : 27 ms
[2024-05-26 23:34:43] [INFO ] Time to serialize properties into /tmp/LTL5487085062119612105.ltl : 12 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/LTL14088301221351959403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5487085062119612105.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((((gu34.n5_0+gu34.n5_1)+(gu34.n5_2+gu34.n5_3))+((gu34.n5_4+gu34.n5_5)+(gu34.n5_6+gu34.n5_7)))+(((gu34.n5_8+gu34.n5_9)+(gu...1630
Formula 0 simplified : G(F!"(((((((gu34.n5_0+gu34.n5_1)+(gu34.n5_2+gu34.n5_3))+((gu34.n5_4+gu34.n5_5)+(gu34.n5_6+gu34.n5_7)))+(((gu34.n5_8+gu34.n5_9)+(gu34...1622
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15760360089995924231
[2024-05-26 23:34:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15760360089995924231
Running compilation step : cd /tmp/ltsmin15760360089995924231;'/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 1660 ms.
Running link step : cd /tmp/ltsmin15760360089995924231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15760360089995924231;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-01 finished in 169992 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||F(p1)))))'
Support contains 100 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3769 transition count 506
Applied a total of 36 rules in 281 ms. Remains 3769 /3805 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3769 cols
[2024-05-26 23:35:13] [INFO ] Computed 3265 invariants in 22 ms
[2024-05-26 23:35:16] [INFO ] Implicit Places using invariants in 3251 ms returned []
[2024-05-26 23:35:16] [INFO ] Invariant cache hit.
[2024-05-26 23:35:29] [INFO ] Implicit Places using invariants and state equation in 12549 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15814 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3805 places, 506/506 transitions.
Applied a total of 0 rules in 263 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16359 ms. Remains : 3736/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s3697 (ADD s3400 s3401 s3402 s3403 s3404 s3405 s3406 s3407 s3408 s3409 s3410 s3411 s3412 s3413 s3414 s3415 s3416 s3417 s3418 s3419 s3420 s3421 s34...], nbAcceptance=1, 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 2680 reset in 352 ms.
Product exploration explored 100000 steps with 2681 reset in 382 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:35:31] [INFO ] Computed 3232 invariants in 57 ms
[2024-05-26 23:35:32] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 23:35:33] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 720 ms returned sat
[2024-05-26 23:35:34] [INFO ] After 2484ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-02 finished in 21403 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(G((p0&&F(G(p1)))))))'
Support contains 1123 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3769 transition count 506
Applied a total of 36 rules in 131 ms. Remains 3769 /3805 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3769 cols
[2024-05-26 23:35:34] [INFO ] Computed 3265 invariants in 43 ms
[2024-05-26 23:35:39] [INFO ] Implicit Places using invariants in 5103 ms returned []
[2024-05-26 23:35:39] [INFO ] Invariant cache hit.
[2024-05-26 23:35:52] [INFO ] Implicit Places using invariants and state equation in 12401 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17530 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3805 places, 506/506 transitions.
Applied a total of 0 rules in 129 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17790 ms. Remains : 3736/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 (ADD s2179 s2180 s2181 s2182 s2183 s2184 s2185 s2186 s2187 s2188 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2196 s2197 s2198 s2199 s2200 s2201 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-03 finished in 18095 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(((G((p0||(p1 U G(p2))))&&F(p0)) U p3)))'
Support contains 103 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 3771 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.13 ms
Discarding 34 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3770 transition count 505
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 3770 transition count 505
Applied a total of 4 rules in 1275 ms. Remains 3770 /3805 variables (removed 35) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 3770 cols
[2024-05-26 23:35:54] [INFO ] Computed 3266 invariants in 26 ms
[2024-05-26 23:35:57] [INFO ] Implicit Places using invariants in 3527 ms returned []
[2024-05-26 23:35:57] [INFO ] Invariant cache hit.
[2024-05-26 23:36:08] [INFO ] Implicit Places using invariants and state equation in 10614 ms returned []
Implicit Place search using SMT with State Equation took 14150 ms to find 0 implicit places.
[2024-05-26 23:36:08] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-26 23:36:08] [INFO ] Invariant cache hit.
[2024-05-26 23:36:09] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3770/3805 places, 505/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17010 ms. Remains : 3770/3805 places, 505/506 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p3), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p3 p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ s3769 (ADD s3566 s3567 s3568 s3569 s3570 s3571 s3572 s3573 s3574 s3575 s3576 s3577 s3578 s3579 s3580 s3581 s3582 s3583 s3584 s3585 s3586 s3587 s35...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2672 reset in 850 ms.
Product exploration explored 100000 steps with 2675 reset in 873 ms.
Computed a total of 3770 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3770 transition count 505
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 p3 (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (OR p3 p0 p2 p1)), (X p2), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p1)), (X (AND p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p3 p0 p2 p1))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge based reduction with 35 factoid took 2972 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p3), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p3)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-26 23:36:16] [INFO ] Invariant cache hit.
[2024-05-26 23:36:17] [INFO ] After 1055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-26 23:36:19] [INFO ] [Nat]Absence check using 0 positive and 3266 generalized place invariants in 822 ms returned sat
[2024-05-26 23:36:42] [INFO ] After 22452ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2024-05-26 23:36:42] [INFO ] After 22457ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-26 23:36:42] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 15 ms.
Support contains 103 out of 3770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3770/3770 places, 505/505 transitions.
Graph (complete) has 43236 edges and 3770 vertex of which 2681 are kept as prefixes of interest. Removing 1089 places using SCC suffix rule.4 ms
Discarding 1089 places :
Also discarding 0 output transitions
Drop transitions removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 2648 transition count 306
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 233 place count 2648 transition count 273
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 1 with 66 rules applied. Total rules applied 299 place count 2615 transition count 273
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 331 place count 2583 transition count 241
Iterating global reduction 1 with 32 rules applied. Total rules applied 363 place count 2583 transition count 241
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 1089 places
Reduce places removed 1155 places and 0 transitions.
Iterating global reduction 1 with 1221 rules applied. Total rules applied 1584 place count 1428 transition count 175
Applied a total of 1584 rules in 327 ms. Remains 1428 /3770 variables (removed 2342) and now considering 175/505 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 1428/3770 places, 175/505 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 175 rows 1428 cols
[2024-05-26 23:36:43] [INFO ] Computed 1253 invariants in 7 ms
[2024-05-26 23:36:43] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 23:36:44] [INFO ] [Nat]Absence check using 1090 positive place invariants in 181 ms returned sat
[2024-05-26 23:36:44] [INFO ] [Nat]Absence check using 1090 positive and 163 generalized place invariants in 28 ms returned sat
[2024-05-26 23:36:46] [INFO ] After 1746ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-26 23:36:47] [INFO ] After 3224ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 549 ms.
[2024-05-26 23:36:48] [INFO ] After 4275ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 87 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 3 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (OR p3 p0 p2 p1)), (X p2), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p1)), (X (AND p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p3 p0 p2 p1))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (G (NOT p0)), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 (NOT p3))), (F (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))), (F (NOT (OR p0 p1 p2 p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 37 factoid took 3265 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-05 finished in 58594 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)))'
Support contains 66 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 304 are kept as prefixes of interest. Removing 3501 places using SCC suffix rule.15 ms
Discarding 3501 places :
Also discarding 165 output transitions
Drop transitions removed 165 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 303 transition count 209
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 134 place count 302 transition count 208
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 302 transition count 208
Applied a total of 135 rules in 30 ms. Remains 302 /3805 variables (removed 3503) and now considering 208/506 (removed 298) transitions.
// Phase 1: matrix 208 rows 302 cols
[2024-05-26 23:36:51] [INFO ] Computed 96 invariants in 2 ms
[2024-05-26 23:36:51] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-26 23:36:51] [INFO ] Invariant cache hit.
[2024-05-26 23:36:51] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 401 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/3805 places, 208/506 transitions.
Applied a total of 0 rules in 4 ms. Remains 269 /269 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 438 ms. Remains : 269/3805 places, 208/506 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GT (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66) (ADD s1 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2439 reset in 462 ms.
Product exploration explored 100000 steps with 2445 reset in 482 ms.
Computed a total of 269 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 269 transition count 208
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)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, p0]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1920164 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1920164 steps, saw 302746 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 208 rows 269 cols
[2024-05-26 23:36:56] [INFO ] Computed 64 invariants in 2 ms
[2024-05-26 23:36:56] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 23:36:56] [INFO ] [Nat]Absence check using 0 positive and 64 generalized place invariants in 8 ms returned sat
[2024-05-26 23:36:56] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 23:36:56] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-26 23:36:56] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-06 finished in 5148 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||X(p1)))))'
Support contains 68 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3769 transition count 506
Applied a total of 36 rules in 244 ms. Remains 3769 /3805 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3769 cols
[2024-05-26 23:36:56] [INFO ] Computed 3265 invariants in 26 ms
[2024-05-26 23:37:03] [INFO ] Implicit Places using invariants in 6532 ms returned []
[2024-05-26 23:37:03] [INFO ] Invariant cache hit.
[2024-05-26 23:37:12] [INFO ] Implicit Places using invariants and state equation in 9362 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15904 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3805 places, 506/506 transitions.
Applied a total of 0 rules in 223 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16372 ms. Remains : 3736/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s3703 s3704 s3705 s3706 s3707 s3708 s3709 s3710 s3711 s3712 s3713 s3714 s3715 s3716 s3717 s3718 s3719 s3720 s3721 s3722 s3723 s3724 s3725 s372...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-07 finished in 16474 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((G(p0)&&X(X(F(p1)))))))'
Support contains 1188 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3736 transition count 506
Applied a total of 69 rules in 113 ms. Remains 3736 /3805 variables (removed 69) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:37:13] [INFO ] Computed 3232 invariants in 75 ms
[2024-05-26 23:37:17] [INFO ] Implicit Places using invariants in 4063 ms returned []
[2024-05-26 23:37:17] [INFO ] Invariant cache hit.
[2024-05-26 23:37:23] [INFO ] Implicit Places using invariants and state equation in 5844 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 9913 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3805 places, 506/506 transitions.
Applied a total of 0 rules in 106 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10134 ms. Remains : 3703/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p0:(LEQ (ADD s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102 s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s11...], 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-08 finished in 10432 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) U (p1&&G(p0)))))'
Support contains 36 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3737 transition count 506
Applied a total of 68 rules in 220 ms. Remains 3737 /3805 variables (removed 68) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2024-05-26 23:37:23] [INFO ] Computed 3232 invariants in 47 ms
[2024-05-26 23:37:27] [INFO ] Implicit Places using invariants in 3396 ms returned []
[2024-05-26 23:37:27] [INFO ] Invariant cache hit.
[2024-05-26 23:37:36] [INFO ] Implicit Places using invariants and state equation in 9488 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 12895 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3805 places, 506/506 transitions.
Applied a total of 0 rules in 216 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13334 ms. Remains : 3704/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GT s3703 s3701), p1:(GT (ADD s3565 s3566 s3567 s3568 s3569 s3570 s3571 s3572 s3573 s3574 s3575 s3576 s3577 s3578 s3579 s3580 s3581 s3582 s3583 s3584 s...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-09 finished in 13515 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 33 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 270 are kept as prefixes of interest. Removing 3535 places using SCC suffix rule.8 ms
Discarding 3535 places :
Also discarding 167 output transitions
Drop transitions removed 167 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 269 transition count 207
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 134 place count 268 transition count 206
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 268 transition count 206
Applied a total of 135 rules in 22 ms. Remains 268 /3805 variables (removed 3537) and now considering 206/506 (removed 300) transitions.
// Phase 1: matrix 206 rows 268 cols
[2024-05-26 23:37:36] [INFO ] Computed 64 invariants in 2 ms
[2024-05-26 23:37:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-26 23:37:37] [INFO ] Invariant cache hit.
[2024-05-26 23:37:37] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 373 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/3805 places, 206/506 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 235/3805 places, 206/506 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33))], 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 40 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-12 finished in 479 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(p0))'
Support contains 1 out of 3805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43275 edges and 3805 vertex of which 305 are kept as prefixes of interest. Removing 3500 places using SCC suffix rule.12 ms
Discarding 3500 places :
Also discarding 165 output transitions
Drop transitions removed 165 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 304 transition count 209
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 304 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 303 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 303 transition count 208
Applied a total of 136 rules in 27 ms. Remains 303 /3805 variables (removed 3502) and now considering 208/506 (removed 298) transitions.
// Phase 1: matrix 208 rows 303 cols
[2024-05-26 23:37:37] [INFO ] Computed 96 invariants in 1 ms
[2024-05-26 23:37:37] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-26 23:37:37] [INFO ] Invariant cache hit.
[2024-05-26 23:37:37] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 468 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 270/3805 places, 208/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 270 /270 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 501 ms. Remains : 270/3805 places, 208/506 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-13 finished in 548 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((X(p0) U (X(G(p0))||(p1&&X(p0))))))))'
Support contains 68 out of 3805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3737 transition count 506
Applied a total of 68 rules in 219 ms. Remains 3737 /3805 variables (removed 68) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2024-05-26 23:37:38] [INFO ] Computed 3232 invariants in 85 ms
[2024-05-26 23:37:44] [INFO ] Implicit Places using invariants in 6643 ms returned []
[2024-05-26 23:37:44] [INFO ] Invariant cache hit.
[2024-05-26 23:37:56] [INFO ] Implicit Places using invariants and state equation in 11474 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18126 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3805 places, 506/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18580 ms. Remains : 3704/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s1 (ADD s3368 s3369 s3370 s3371 s3372 s3373 s3374 s3375 s3376 s3377 s3378 s3379 s3380 s3381 s3382 s3383 s3384 s3385 s3386 s3387 s3388 s3389 s3390 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-14 finished in 18836 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(G((p0&&X((p0 U (p1||G(p0)))))))))'
Support contains 34 out of 3805 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3736 transition count 506
Applied a total of 69 rules in 227 ms. Remains 3736 /3805 variables (removed 69) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-26 23:37:57] [INFO ] Computed 3232 invariants in 87 ms
[2024-05-26 23:38:03] [INFO ] Implicit Places using invariants in 6199 ms returned []
[2024-05-26 23:38:03] [INFO ] Invariant cache hit.
[2024-05-26 23:38:13] [INFO ] Implicit Places using invariants and state equation in 10648 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16860 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3805 places, 506/506 transitions.
Applied a total of 0 rules in 212 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17300 ms. Remains : 3703/3805 places, 506/506 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s3631 s3632 s3633 s3634 s3635 s3636 s3637 s3638 s3639 s3640 s3641 s3642 s3643 s3644 s3645 s3646 s3647 s3648 s3649 s3650 s3651 s3652 s3653 s365...], 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 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-15 finished in 17459 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)||G(p1))))'
[2024-05-26 23:38:14] [INFO ] Flatten gal took : 118 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10611966438463158401
[2024-05-26 23:38:14] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-26 23:38:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:38:14] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-26 23:38:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:38:14] [INFO ] Applying decomposition
[2024-05-26 23:38:14] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-26 23:38:14] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 23:38:14] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10611966438463158401
Running compilation step : cd /tmp/ltsmin10611966438463158401;'/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'
[2024-05-26 23:38:14] [INFO ] Flatten gal took : 105 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/graph12095193983496006675.txt' '-o' '/tmp/graph12095193983496006675.bin' '-w' '/tmp/graph12095193983496006675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12095193983496006675.bin' '-l' '-1' '-v' '-w' '/tmp/graph12095193983496006675.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:38:15] [INFO ] Decomposing Gal with order
[2024-05-26 23:38:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:38:15] [INFO ] Removed a total of 291 redundant transitions.
[2024-05-26 23:38:15] [INFO ] Flatten gal took : 241 ms
[2024-05-26 23:38:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 109 ms.
[2024-05-26 23:38:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality9492685022417435908.gal : 32 ms
[2024-05-26 23:38:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality2819521961036289156.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/LTLCardinality9492685022417435908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2819521961036289156.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("(((((((gu17.n5_0+gu17.n5_1)+(gu17.n5_2+gu17.n5_3))+((gu17.n5_4+gu17.n5_5)+(gu17.n5_6+gu17.n5_7)))+(((gu17.n5_8+gu17.n5_9)+(gu...1498
Formula 0 simplified : G(F!"(((((((gu17.n5_0+gu17.n5_1)+(gu17.n5_2+gu17.n5_3))+((gu17.n5_4+gu17.n5_5)+(gu17.n5_6+gu17.n5_7)))+(((gu17.n5_8+gu17.n5_9)+(gu17...1490
Compilation finished in 2896 ms.
Running link step : cd /tmp/ltsmin10611966438463158401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10611966438463158401;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Initializing POR dependencies: labels 508, guards 506
pins2lts-mc-linux64( 7/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 21.352: LTL layer: formula: <>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 21.352: "<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 21.353: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 22.106: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 22.162: There are 509 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 22.162: State length is 3806, there are 514 groups
pins2lts-mc-linux64( 0/ 8), 22.162: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 22.162: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 22.162: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 22.162: Visible groups: 0 / 514, labels: 2 / 509
pins2lts-mc-linux64( 0/ 8), 22.162: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 22.162: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 22.972: [Blue] ~40 levels ~960 states ~12712 transitions
pins2lts-mc-linux64( 7/ 8), 23.173: [Blue] ~40 levels ~1920 states ~15992 transitions
pins2lts-mc-linux64( 7/ 8), 23.332: [Blue] ~40 levels ~3840 states ~22832 transitions
pins2lts-mc-linux64( 7/ 8), 23.675: [Blue] ~40 levels ~7680 states ~34688 transitions
pins2lts-mc-linux64( 7/ 8), 24.424: [Blue] ~40 levels ~15360 states ~67744 transitions
pins2lts-mc-linux64( 5/ 8), 25.850: [Blue] ~39 levels ~30720 states ~144232 transitions
pins2lts-mc-linux64( 3/ 8), 29.742: [Blue] ~44 levels ~61440 states ~257672 transitions
pins2lts-mc-linux64( 3/ 8), 35.308: [Blue] ~44 levels ~122880 states ~498456 transitions
pins2lts-mc-linux64( 5/ 8), 46.886: [Blue] ~40 levels ~245760 states ~1272416 transitions
pins2lts-mc-linux64( 5/ 8), 69.898: [Blue] ~40 levels ~491520 states ~2591960 transitions
pins2lts-mc-linux64( 5/ 8), 118.422: [Blue] ~40 levels ~983040 states ~5224944 transitions
pins2lts-mc-linux64( 5/ 8), 224.992: [Blue] ~40 levels ~1966080 states ~11276632 transitions
pins2lts-mc-linux64( 5/ 8), 425.407: [Blue] ~40 levels ~3932160 states ~23026296 transitions
pins2lts-mc-linux64( 5/ 8), 853.323: [Blue] ~40 levels ~7864320 states ~45400704 transitions
pins2lts-mc-linux64( 7/ 8), 1050.829: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1051.045:
pins2lts-mc-linux64( 0/ 8), 1051.045: Explored 8552861 states 49483914 transitions, fanout: 5.786
pins2lts-mc-linux64( 0/ 8), 1051.045: Total exploration time 1028.880 sec (1028.670 sec minimum, 1028.725 sec on average)
pins2lts-mc-linux64( 0/ 8), 1051.045: States per second: 8313, Transitions per second: 48095
pins2lts-mc-linux64( 0/ 8), 1051.045:
pins2lts-mc-linux64( 0/ 8), 1051.045: State space has 8561779 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1051.045: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1051.045: blue states: 8552861 (99.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1051.045: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1051.045: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1051.045:
pins2lts-mc-linux64( 0/ 8), 1051.045: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1051.045:
pins2lts-mc-linux64( 0/ 8), 1051.045: Queue width: 8B, total height: 333, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1051.045: Tree memory: 321.3MB, 39.4 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1051.045: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1051.045: Stored 518 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1051.045: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1051.045: Est. total memory use: 321.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10611966438463158401;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10611966438463158401;'/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))||[]((LTLAPp1==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:00:26] [INFO ] Applying decomposition
[2024-05-27 00:00:26] [INFO ] Flatten gal took : 87 ms
[2024-05-27 00:00:26] [INFO ] Decomposing Gal with order
[2024-05-27 00:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:00:27] [INFO ] Removed a total of 271 redundant transitions.
[2024-05-27 00:00:27] [INFO ] Flatten gal took : 145 ms
[2024-05-27 00:00:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 53 ms.
[2024-05-27 00:00:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality3601453398405042265.gal : 21 ms
[2024-05-27 00:00:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality11719416263491936499.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/LTLCardinality3601453398405042265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11719416263491936499.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...298
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((((gtsid0.n5_0+gtsid1.n5_1)+(gtsid2.n5_2+gtsid3.n5_3))+((gtsid4.n5_4+gtsid5.n5_5)+(gtsid6.n5_6+gtsid7.n5_7)))+(((gtsid8.n...1732
Formula 0 simplified : G(F!"(((((((gtsid0.n5_0+gtsid1.n5_1)+(gtsid2.n5_2+gtsid3.n5_3))+((gtsid4.n5_4+gtsid5.n5_5)+(gtsid6.n5_6+gtsid7.n5_7)))+(((gtsid8.n5_...1724
Detected timeout of ITS tools.
[2024-05-27 00:23:07] [INFO ] Flatten gal took : 790 ms
[2024-05-27 00:23:12] [INFO ] Input system was already deterministic with 506 transitions.
[2024-05-27 00:23:13] [INFO ] Transformed 3805 places.
[2024-05-27 00:23:13] [INFO ] Transformed 506 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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 00:23:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality15219205298760041763.gal : 23 ms
[2024-05-27 00:23:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality2075214557522528070.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/LTLCardinality15219205298760041763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2075214557522528070.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((((n5...970
Formula 0 simplified : G(F!"(((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((((n5_1...962
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6558756 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15896944 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-COL-32"
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-COL-32, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361400032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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