Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016100035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 8.1K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 46K May 10 09:34 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 Peterson-COL-6-LTLCardinality-00
FORMULA_NAME Peterson-COL-6-LTLCardinality-01
FORMULA_NAME Peterson-COL-6-LTLCardinality-02
FORMULA_NAME Peterson-COL-6-LTLCardinality-03
FORMULA_NAME Peterson-COL-6-LTLCardinality-04
FORMULA_NAME Peterson-COL-6-LTLCardinality-05
FORMULA_NAME Peterson-COL-6-LTLCardinality-06
FORMULA_NAME Peterson-COL-6-LTLCardinality-07
FORMULA_NAME Peterson-COL-6-LTLCardinality-08
FORMULA_NAME Peterson-COL-6-LTLCardinality-09
FORMULA_NAME Peterson-COL-6-LTLCardinality-10
FORMULA_NAME Peterson-COL-6-LTLCardinality-11
FORMULA_NAME Peterson-COL-6-LTLCardinality-12
FORMULA_NAME Peterson-COL-6-LTLCardinality-13
FORMULA_NAME Peterson-COL-6-LTLCardinality-14
FORMULA_NAME Peterson-COL-6-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652775150963

Running Version 202205111006
[2022-05-17 08:12:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 08:12:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:12:32] [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.
[2022-05-17 08:12:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 08:12:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 597 ms
[2022-05-17 08:12:32] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 08:12:33] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2022-05-17 08:12:33] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-6-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 457 steps, including 0 resets, run visited all 18 properties in 25 ms. (steps per millisecond=18 )
[2022-05-17 08:12:33] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:12:33] [INFO ] Flatten gal took : 3 ms
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 08:12:33] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 38 ms.
[2022-05-17 08:12:33] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 42 places in 15 ms
Reduce places removed 42 places and 84 transitions.
Support contains 1274 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 33 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 08:12:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:12:33] [INFO ] Computed 27 place invariants in 37 ms
[2022-05-17 08:12:33] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-05-17 08:12:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:12:33] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 08:12:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:12:35] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2022-05-17 08:12:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:12:35] [INFO ] Computed 27 place invariants in 24 ms
[2022-05-17 08:12:36] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1274 out of 1330 places after structural reductions.
[2022-05-17 08:12:36] [INFO ] Flatten gal took : 133 ms
[2022-05-17 08:12:36] [INFO ] Flatten gal took : 115 ms
[2022-05-17 08:12:37] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:12:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:12:37] [INFO ] Computed 27 place invariants in 16 ms
[2022-05-17 08:12:37] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2022-05-17 08:12:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 08:12:38] [INFO ] After 1022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:12:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2022-05-17 08:12:38] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 08:12:39] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:12:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:12:39] [INFO ] After 448ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:12:40] [INFO ] Deduced a trap composed of 32 places in 518 ms of which 5 ms to minimize.
[2022-05-17 08:12:41] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 2 ms to minimize.
[2022-05-17 08:12:41] [INFO ] Deduced a trap composed of 12 places in 492 ms of which 1 ms to minimize.
[2022-05-17 08:12:42] [INFO ] Deduced a trap composed of 126 places in 466 ms of which 2 ms to minimize.
[2022-05-17 08:12:43] [INFO ] Deduced a trap composed of 209 places in 473 ms of which 1 ms to minimize.
[2022-05-17 08:12:43] [INFO ] Deduced a trap composed of 156 places in 485 ms of which 1 ms to minimize.
[2022-05-17 08:12:44] [INFO ] Deduced a trap composed of 227 places in 479 ms of which 1 ms to minimize.
[2022-05-17 08:12:44] [INFO ] Deduced a trap composed of 141 places in 471 ms of which 1 ms to minimize.
[2022-05-17 08:12:45] [INFO ] Deduced a trap composed of 224 places in 475 ms of which 1 ms to minimize.
[2022-05-17 08:12:46] [INFO ] Deduced a trap composed of 325 places in 465 ms of which 1 ms to minimize.
[2022-05-17 08:12:46] [INFO ] Deduced a trap composed of 230 places in 482 ms of which 1 ms to minimize.
[2022-05-17 08:12:47] [INFO ] Deduced a trap composed of 120 places in 444 ms of which 1 ms to minimize.
[2022-05-17 08:12:47] [INFO ] Deduced a trap composed of 130 places in 454 ms of which 1 ms to minimize.
[2022-05-17 08:12:48] [INFO ] Deduced a trap composed of 214 places in 468 ms of which 1 ms to minimize.
[2022-05-17 08:12:48] [INFO ] Deduced a trap composed of 60 places in 461 ms of which 1 ms to minimize.
[2022-05-17 08:12:49] [INFO ] Deduced a trap composed of 177 places in 462 ms of which 1 ms to minimize.
[2022-05-17 08:12:50] [INFO ] Deduced a trap composed of 84 places in 485 ms of which 1 ms to minimize.
[2022-05-17 08:12:50] [INFO ] Deduced a trap composed of 86 places in 476 ms of which 1 ms to minimize.
[2022-05-17 08:12:51] [INFO ] Deduced a trap composed of 223 places in 451 ms of which 1 ms to minimize.
[2022-05-17 08:12:51] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 1 ms to minimize.
[2022-05-17 08:12:52] [INFO ] Deduced a trap composed of 75 places in 454 ms of which 1 ms to minimize.
[2022-05-17 08:12:52] [INFO ] Deduced a trap composed of 217 places in 429 ms of which 1 ms to minimize.
[2022-05-17 08:12:53] [INFO ] Deduced a trap composed of 75 places in 480 ms of which 1 ms to minimize.
[2022-05-17 08:12:54] [INFO ] Deduced a trap composed of 76 places in 470 ms of which 1 ms to minimize.
[2022-05-17 08:12:54] [INFO ] Deduced a trap composed of 186 places in 495 ms of which 1 ms to minimize.
[2022-05-17 08:12:55] [INFO ] Deduced a trap composed of 249 places in 481 ms of which 1 ms to minimize.
[2022-05-17 08:12:55] [INFO ] Deduced a trap composed of 90 places in 469 ms of which 1 ms to minimize.
[2022-05-17 08:12:56] [INFO ] Deduced a trap composed of 284 places in 497 ms of which 1 ms to minimize.
[2022-05-17 08:12:57] [INFO ] Deduced a trap composed of 84 places in 450 ms of which 1 ms to minimize.
[2022-05-17 08:12:57] [INFO ] Deduced a trap composed of 182 places in 451 ms of which 1 ms to minimize.
[2022-05-17 08:12:58] [INFO ] Deduced a trap composed of 27 places in 468 ms of which 1 ms to minimize.
[2022-05-17 08:12:58] [INFO ] Deduced a trap composed of 77 places in 450 ms of which 1 ms to minimize.
[2022-05-17 08:12:59] [INFO ] Deduced a trap composed of 16 places in 457 ms of which 1 ms to minimize.
[2022-05-17 08:12:59] [INFO ] Deduced a trap composed of 65 places in 430 ms of which 0 ms to minimize.
[2022-05-17 08:13:00] [INFO ] Deduced a trap composed of 198 places in 447 ms of which 4 ms to minimize.
[2022-05-17 08:13:01] [INFO ] Deduced a trap composed of 61 places in 463 ms of which 1 ms to minimize.
[2022-05-17 08:13:01] [INFO ] Deduced a trap composed of 76 places in 453 ms of which 1 ms to minimize.
[2022-05-17 08:13:02] [INFO ] Deduced a trap composed of 149 places in 414 ms of which 1 ms to minimize.
[2022-05-17 08:13:02] [INFO ] Deduced a trap composed of 22 places in 478 ms of which 1 ms to minimize.
[2022-05-17 08:13:03] [INFO ] Deduced a trap composed of 84 places in 471 ms of which 2 ms to minimize.
[2022-05-17 08:13:03] [INFO ] Deduced a trap composed of 224 places in 478 ms of which 0 ms to minimize.
[2022-05-17 08:13:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 08:13:03] [INFO ] After 25339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 11 ms.
Support contains 42 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 1330 transition count 1448
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 1 with 582 rules applied. Total rules applied 1164 place count 748 transition count 1448
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1164 place count 748 transition count 1190
Deduced a syphon composed of 258 places in 2 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 131 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/1330 places, 1190/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639864 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639864 steps, saw 94536 distinct states, run finished after 3002 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:13:07] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2022-05-17 08:13:07] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 08:13:07] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-05-17 08:13:07] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 08:13:07] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:13:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 08:13:07] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-17 08:13:07] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:13:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:13:08] [INFO ] After 127ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:13:08] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2022-05-17 08:13:08] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:08] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2022-05-17 08:13:08] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2022-05-17 08:13:09] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 1 ms to minimize.
[2022-05-17 08:13:09] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 1 ms to minimize.
[2022-05-17 08:13:09] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 0 ms to minimize.
[2022-05-17 08:13:09] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 1 ms to minimize.
[2022-05-17 08:13:09] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 1 ms to minimize.
[2022-05-17 08:13:10] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 1 ms to minimize.
[2022-05-17 08:13:10] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 1 ms to minimize.
[2022-05-17 08:13:10] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2022-05-17 08:13:10] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-17 08:13:10] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2022-05-17 08:13:11] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 1 ms to minimize.
[2022-05-17 08:13:11] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2022-05-17 08:13:11] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2022-05-17 08:13:11] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 0 ms to minimize.
[2022-05-17 08:13:11] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 2 ms to minimize.
[2022-05-17 08:13:12] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 5 ms to minimize.
[2022-05-17 08:13:12] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 1 ms to minimize.
[2022-05-17 08:13:12] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 1 ms to minimize.
[2022-05-17 08:13:12] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 1 ms to minimize.
[2022-05-17 08:13:12] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2022-05-17 08:13:13] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2022-05-17 08:13:13] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 2 ms to minimize.
[2022-05-17 08:13:13] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2022-05-17 08:13:13] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 1 ms to minimize.
[2022-05-17 08:13:13] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2022-05-17 08:13:14] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:14] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:14] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 0 ms to minimize.
[2022-05-17 08:13:14] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 0 ms to minimize.
[2022-05-17 08:13:14] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 0 ms to minimize.
[2022-05-17 08:13:15] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 1 ms to minimize.
[2022-05-17 08:13:15] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2022-05-17 08:13:15] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 0 ms to minimize.
[2022-05-17 08:13:15] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2022-05-17 08:13:15] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2022-05-17 08:13:16] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 0 ms to minimize.
[2022-05-17 08:13:16] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 0 ms to minimize.
[2022-05-17 08:13:16] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 1 ms to minimize.
[2022-05-17 08:13:16] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-05-17 08:13:16] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:17] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:17] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 0 ms to minimize.
[2022-05-17 08:13:17] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 1 ms to minimize.
[2022-05-17 08:13:17] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:18] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2022-05-17 08:13:18] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2022-05-17 08:13:18] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 0 ms to minimize.
[2022-05-17 08:13:18] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 1 ms to minimize.
[2022-05-17 08:13:18] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 1 ms to minimize.
[2022-05-17 08:13:19] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:19] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 1 ms to minimize.
[2022-05-17 08:13:19] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 0 ms to minimize.
[2022-05-17 08:13:19] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2022-05-17 08:13:19] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2022-05-17 08:13:20] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 0 ms to minimize.
[2022-05-17 08:13:20] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 0 ms to minimize.
[2022-05-17 08:13:20] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:20] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 1 ms to minimize.
[2022-05-17 08:13:20] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2022-05-17 08:13:21] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2022-05-17 08:13:21] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2022-05-17 08:13:21] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:21] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 0 ms to minimize.
[2022-05-17 08:13:21] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 1 ms to minimize.
[2022-05-17 08:13:22] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 1 ms to minimize.
[2022-05-17 08:13:22] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 0 ms to minimize.
[2022-05-17 08:13:22] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2022-05-17 08:13:22] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 0 ms to minimize.
[2022-05-17 08:13:23] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 0 ms to minimize.
[2022-05-17 08:13:23] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2022-05-17 08:13:23] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2022-05-17 08:13:23] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:23] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:24] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:24] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 0 ms to minimize.
[2022-05-17 08:13:24] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 0 ms to minimize.
[2022-05-17 08:13:24] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2022-05-17 08:13:24] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2022-05-17 08:13:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 82 trap constraints in 16887 ms
[2022-05-17 08:13:25] [INFO ] After 17107ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-17 08:13:25] [INFO ] After 17471ms 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.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Peterson-COL-6-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&F((G(p1)&&!p0))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1008 place count 826 transition count 1442
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1176 place count 742 transition count 1442
Applied a total of 1176 rules in 124 ms. Remains 742 /1330 variables (removed 588) and now considering 1442/2030 (removed 588) transitions.
[2022-05-17 08:13:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 08:13:25] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 08:13:25] [INFO ] Implicit Places using invariants in 293 ms returned []
[2022-05-17 08:13:25] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 08:13:25] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 08:13:26] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:13:27] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
[2022-05-17 08:13:28] [INFO ] Redundant transitions in 80 ms returned []
[2022-05-17 08:13:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 08:13:28] [INFO ] Computed 27 place invariants in 12 ms
[2022-05-17 08:13:28] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 742/1330 places, 1442/2030 transitions.
Finished structural reductions, in 1 iterations. Remains : 742/1330 places, 1442/2030 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6)), p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6) (ADD s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 376 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 1 ms.
FORMULA Peterson-COL-6-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLCardinality-00 finished in 4037 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&G(p0)) U p1)&&F(p0)))'
Support contains 588 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1078 transition count 1778
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 504 place count 1078 transition count 1729
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 602 place count 1029 transition count 1729
Applied a total of 602 rules in 104 ms. Remains 1029 /1330 variables (removed 301) and now considering 1729/2030 (removed 301) transitions.
[2022-05-17 08:13:29] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
// Phase 1: matrix 1519 rows 1029 cols
[2022-05-17 08:13:29] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 08:13:29] [INFO ] Implicit Places using invariants in 231 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 237 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1022/1330 places, 1729/2030 transitions.
Applied a total of 0 rules in 27 ms. Remains 1022 /1022 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1022/1330 places, 1729/2030 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-6-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLCardinality-01 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(F(p0)))))'
Support contains 49 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 79 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 08:13:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:13:29] [INFO ] Computed 27 place invariants in 12 ms
[2022-05-17 08:13:30] [INFO ] Implicit Places using invariants in 383 ms returned []
[2022-05-17 08:13:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:13:30] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 08:13:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:13:35] [INFO ] Implicit Places using invariants and state equation in 4818 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
[2022-05-17 08:13:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:13:35] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 08:13:35] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 977 ms.
Product exploration explored 100000 steps with 33333 reset in 888 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 988 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-6-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-6-LTLCardinality-02 finished in 9111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||X(!p0)||G(X(p2))))'
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 16 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 08:13:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:13:38] [INFO ] Computed 27 place invariants in 9 ms
[2022-05-17 08:13:39] [INFO ] Implicit Places using invariants in 268 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 270 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ (ADD s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797 s798 s799 s800 s801 s802 s803 s804 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1897 ms.
Product exploration explored 100000 steps with 50000 reset in 1895 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-6-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-6-LTLCardinality-03 finished in 4510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(X(!(F(p0) U X(p0)))))&&X(F(p1)))))'
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1008 place count 826 transition count 1477
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1106 place count 777 transition count 1477
Applied a total of 1106 rules in 133 ms. Remains 777 /1330 variables (removed 553) and now considering 1477/2030 (removed 553) transitions.
[2022-05-17 08:13:43] [INFO ] Flow matrix only has 1267 transitions (discarded 210 similar events)
// Phase 1: matrix 1267 rows 777 cols
[2022-05-17 08:13:43] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-17 08:13:43] [INFO ] Implicit Places using invariants in 273 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 275 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 770/1330 places, 1477/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 770 /770 variables (removed 0) and now considering 1477/1477 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 770/1330 places, 1477/2030 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 (ADD s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s499 s500 s501 s502 s503 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1112 reset in 587 ms.
Stack based approach found an accepted trace after 631 steps with 11 reset with depth 43 and stack size 41 in 6 ms.
FORMULA Peterson-COL-6-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLCardinality-05 finished in 1161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(p0))))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 600 place count 1030 transition count 1695
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 670 place count 995 transition count 1695
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 742 place count 959 transition count 1659
Applied a total of 742 rules in 125 ms. Remains 959 /1330 variables (removed 371) and now considering 1659/2030 (removed 371) transitions.
[2022-05-17 08:13:44] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 959 cols
[2022-05-17 08:13:44] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-17 08:13:45] [INFO ] Implicit Places using invariants in 328 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 329 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 952/1330 places, 1659/2030 transitions.
Applied a total of 0 rules in 20 ms. Remains 952 /952 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 952/1330 places, 1659/2030 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-08 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 (ADD s441 s442 s443 s444 s445 s446 s447) (ADD s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 102 reset in 653 ms.
Product exploration explored 100000 steps with 102 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 456 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=114 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 301 out of 952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 1659/1659 transitions.
Applied a total of 0 rules in 28 ms. Remains 952 /952 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2022-05-17 08:13:46] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2022-05-17 08:13:46] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 08:13:47] [INFO ] Implicit Places using invariants in 266 ms returned []
[2022-05-17 08:13:47] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2022-05-17 08:13:47] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 08:13:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:13:50] [INFO ] Implicit Places using invariants and state equation in 3132 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
[2022-05-17 08:13:50] [INFO ] Redundant transitions in 89 ms returned []
[2022-05-17 08:13:50] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2022-05-17 08:13:50] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-17 08:13:51] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 952/952 places, 1659/1659 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1157 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=96 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 105 reset in 660 ms.
Product exploration explored 100000 steps with 107 reset in 672 ms.
Built C files in :
/tmp/ltsmin15531941656217002347
[2022-05-17 08:13:53] [INFO ] Too many transitions (1659) to apply POR reductions. Disabling POR matrices.
[2022-05-17 08:13:53] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15531941656217002347
Running compilation step : cd /tmp/ltsmin15531941656217002347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15531941656217002347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15531941656217002347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 301 out of 952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 1659/1659 transitions.
Applied a total of 0 rules in 33 ms. Remains 952 /952 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2022-05-17 08:13:56] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2022-05-17 08:13:56] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 08:13:56] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-05-17 08:13:56] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2022-05-17 08:13:56] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 08:13:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:13:59] [INFO ] Implicit Places using invariants and state equation in 3130 ms returned []
Implicit Place search using SMT with State Equation took 3435 ms to find 0 implicit places.
[2022-05-17 08:13:59] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-17 08:13:59] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2022-05-17 08:13:59] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 08:14:00] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 952/952 places, 1659/1659 transitions.
Built C files in :
/tmp/ltsmin7558038919422265797
[2022-05-17 08:14:00] [INFO ] Too many transitions (1659) to apply POR reductions. Disabling POR matrices.
[2022-05-17 08:14:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7558038919422265797
Running compilation step : cd /tmp/ltsmin7558038919422265797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2824 ms.
Running link step : cd /tmp/ltsmin7558038919422265797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7558038919422265797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased661595333518060302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 08:14:15] [INFO ] Flatten gal took : 62 ms
[2022-05-17 08:14:15] [INFO ] Flatten gal took : 63 ms
[2022-05-17 08:14:15] [INFO ] Time to serialize gal into /tmp/LTL1994781108297703132.gal : 10 ms
[2022-05-17 08:14:15] [INFO ] Time to serialize properties into /tmp/LTL7019591581780005490.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1994781108297703132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7019591581780005490.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1994781...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(F("((((CS_0+CS_1)+(CS_2+CS_3))+((CS_4+CS_5)+CS_6))<=(((((((((BeginLoop_0+BeginLoop_1)+(BeginLoop_2+BeginLoop_3))+((BeginLoo...4684
Formula 0 simplified : !GXXXF"((((CS_0+CS_1)+(CS_2+CS_3))+((CS_4+CS_5)+CS_6))<=(((((((((BeginLoop_0+BeginLoop_1)+(BeginLoop_2+BeginLoop_3))+((BeginLoop_4+B...4672
Detected timeout of ITS tools.
[2022-05-17 08:14:30] [INFO ] Flatten gal took : 54 ms
[2022-05-17 08:14:30] [INFO ] Applying decomposition
[2022-05-17 08:14:30] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1231990692912269814.txt' '-o' '/tmp/graph1231990692912269814.bin' '-w' '/tmp/graph1231990692912269814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1231990692912269814.bin' '-l' '-1' '-v' '-w' '/tmp/graph1231990692912269814.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:14:31] [INFO ] Decomposing Gal with order
[2022-05-17 08:14:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:14:31] [INFO ] Removed a total of 1723 redundant transitions.
[2022-05-17 08:14:31] [INFO ] Flatten gal took : 503 ms
[2022-05-17 08:14:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 41 ms.
[2022-05-17 08:14:32] [INFO ] Time to serialize gal into /tmp/LTL10942915628613561005.gal : 20 ms
[2022-05-17 08:14:32] [INFO ] Time to serialize properties into /tmp/LTL6743133146460937032.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10942915628613561005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6743133146460937032.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1094291...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(F("((((gu178.CS_0+gu178.CS_1)+(gu178.CS_2+gu178.CS_3))+((gu178.CS_4+gu178.CS_5)+gu178.CS_6))<=(((((((((gu178.BeginLoop_0+gu...6490
Formula 0 simplified : !GXXXF"((((gu178.CS_0+gu178.CS_1)+(gu178.CS_2+gu178.CS_3))+((gu178.CS_4+gu178.CS_5)+gu178.CS_6))<=(((((((((gu178.BeginLoop_0+gu178.B...6478
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17903862156625008498
[2022-05-17 08:14:47] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17903862156625008498
Running compilation step : cd /tmp/ltsmin17903862156625008498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2879 ms.
Running link step : cd /tmp/ltsmin17903862156625008498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17903862156625008498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-6-LTLCardinality-08 finished in 77720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((X(G(X(p0)))||(F(p0)&&p0))))))'
Support contains 294 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 08:15:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:15:02] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 08:15:02] [INFO ] Implicit Places using invariants in 395 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 397 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 2 (ADD s1029 s1030 s1031 s1032 s1033 s1034 s1035 s1036 s1037 s1038 s1039 s1040 s1041 s1042 s1043 s1044 s1045 s1046 s1047 s1048 s1049 s1050 s1051 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 981 ms.
Product exploration explored 100000 steps with 33333 reset in 992 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 40 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-6-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-6-LTLCardinality-10 finished in 2577 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(F(X(G(p0))) U (X(p1)||p2)))))'
Support contains 1218 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 8 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 08:15:04] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:15:04] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 08:15:05] [INFO ] Implicit Places using invariants in 255 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 258 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 5 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR p2 p1), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, (OR (AND p0 p2) (AND p0 p1)), (AND p0 p1)]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ (ADD s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s12...], 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]]
Product exploration explored 100000 steps with 3605 reset in 1647 ms.
Stack based approach found an accepted trace after 16277 steps with 569 reset with depth 25 and stack size 25 in 274 ms.
FORMULA Peterson-COL-6-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLCardinality-12 finished in 2498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(!X(p0))) U (F(G(X(p1)))||p0)))))'
Support contains 553 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 08:15:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:15:07] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 08:15:07] [INFO ] Implicit Places using invariants in 277 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 280 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ (ADD s476 s477 s478 s479 s480 s481 s482) (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1871 ms.
Product exploration explored 100000 steps with 50000 reset in 1850 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-6-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-6-LTLCardinality-15 finished in 4324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(p0))))))'
[2022-05-17 08:15:11] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin850771149440376573
[2022-05-17 08:15:11] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2022-05-17 08:15:11] [INFO ] Applying decomposition
[2022-05-17 08:15:12] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin850771149440376573
Running compilation step : cd /tmp/ltsmin850771149440376573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 08:15:12] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15068849352006527294.txt' '-o' '/tmp/graph15068849352006527294.bin' '-w' '/tmp/graph15068849352006527294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15068849352006527294.bin' '-l' '-1' '-v' '-w' '/tmp/graph15068849352006527294.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:15:12] [INFO ] Decomposing Gal with order
[2022-05-17 08:15:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:15:13] [INFO ] Removed a total of 1589 redundant transitions.
[2022-05-17 08:15:13] [INFO ] Flatten gal took : 753 ms
[2022-05-17 08:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 28 ms.
[2022-05-17 08:15:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality6409093938174966860.gal : 28 ms
[2022-05-17 08:15:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality12606433476187200372.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6409093938174966860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12606433476187200372.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(F("((((gu55.CS_0+gu55.CS_1)+(gu55.CS_2+gu55.CS_3))+((gu55.CS_4+gu55.CS_5)+gu55.CS_6))<=(((((((((gu55.BeginLoop_0+gu55.Begin...6189
Formula 0 simplified : !GXXXF"((((gu55.CS_0+gu55.CS_1)+(gu55.CS_2+gu55.CS_3))+((gu55.CS_4+gu55.CS_5)+gu55.CS_6))<=(((((((((gu55.BeginLoop_0+gu55.BeginLoop_...6177
Compilation finished in 3939 ms.
Running link step : cd /tmp/ltsmin850771149440376573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin850771149440376573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 08:36:07] [INFO ] Applying decomposition
[2022-05-17 08:36:07] [INFO ] Flatten gal took : 127 ms
[2022-05-17 08:36:08] [INFO ] Decomposing Gal with order
[2022-05-17 08:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:36:08] [INFO ] Removed a total of 1876 redundant transitions.
[2022-05-17 08:36:08] [INFO ] Flatten gal took : 281 ms
[2022-05-17 08:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-17 08:36:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality15776304569318163046.gal : 26 ms
[2022-05-17 08:36:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality5129426643057208306.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15776304569318163046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5129426643057208306.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(F("((((gProcess0.CS_0+gProcess1.CS_1)+(gProcess2.CS_2+gProcess3.CS_3))+((gProcess4.CS_4+gProcess5.CS_5)+gProcess6.CS_6))<=(...11406
Formula 0 simplified : !GXXXF"((((gProcess0.CS_0+gProcess1.CS_1)+(gProcess2.CS_2+gProcess3.CS_3))+((gProcess4.CS_4+gProcess5.CS_5)+gProcess6.CS_6))<=((((((...11394
Detected timeout of ITS tools.
[2022-05-17 08:57:03] [INFO ] Flatten gal took : 177 ms
[2022-05-17 08:57:03] [INFO ] Input system was already deterministic with 2030 transitions.
[2022-05-17 08:57:03] [INFO ] Transformed 1330 places.
[2022-05-17 08:57:03] [INFO ] Transformed 2030 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-17 08:57:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality3024485944600553253.gal : 90 ms
[2022-05-17 08:57:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality14653321696412682498.ltl : 111 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3024485944600553253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14653321696412682498.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(X(X(F("((((CS_0+CS_1)+(CS_2+CS_3))+((CS_4+CS_5)+CS_6))<=(((((((((BeginLoop_0+BeginLoop_1)+(BeginLoop_2+BeginLoop_3))+((BeginLoo...4684
Formula 0 simplified : !GXXXF"((((CS_0+CS_1)+(CS_2+CS_3))+((CS_4+CS_5)+CS_6))<=(((((((((BeginLoop_0+BeginLoop_1)+(BeginLoop_2+BeginLoop_3))+((BeginLoop_4+B...4672

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Peterson-COL-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-6, 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 r168-tall-165277016100035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;