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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.8K Apr 30 10:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 10:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 09:51 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 4.1K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 47K 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-7-LTLCardinality-00
FORMULA_NAME Peterson-COL-7-LTLCardinality-01
FORMULA_NAME Peterson-COL-7-LTLCardinality-02
FORMULA_NAME Peterson-COL-7-LTLCardinality-03
FORMULA_NAME Peterson-COL-7-LTLCardinality-04
FORMULA_NAME Peterson-COL-7-LTLCardinality-05
FORMULA_NAME Peterson-COL-7-LTLCardinality-06
FORMULA_NAME Peterson-COL-7-LTLCardinality-07
FORMULA_NAME Peterson-COL-7-LTLCardinality-08
FORMULA_NAME Peterson-COL-7-LTLCardinality-09
FORMULA_NAME Peterson-COL-7-LTLCardinality-10
FORMULA_NAME Peterson-COL-7-LTLCardinality-11
FORMULA_NAME Peterson-COL-7-LTLCardinality-12
FORMULA_NAME Peterson-COL-7-LTLCardinality-13
FORMULA_NAME Peterson-COL-7-LTLCardinality-14
FORMULA_NAME Peterson-COL-7-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652778654693

Running Version 202205111006
[2022-05-17 09:10:55] [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 09:10:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:10:56] [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 09:10:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 09:10:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 616 ms
[2022-05-17 09:10:56] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 09:10:56] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 10 ms.
[2022-05-17 09:10:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-7-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 9 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 225 steps, including 0 resets, run visited all 19 properties in 19 ms. (steps per millisecond=11 )
[2022-05-17 09:10:56] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:10:56] [INFO ] Flatten gal took : 2 ms
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] 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 09:10:56] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 50 ms.
[2022-05-17 09:10:56] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 56 places in 28 ms
Reduce places removed 56 places and 112 transitions.
Support contains 1920 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 44 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:10:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:10:57] [INFO ] Computed 31 place invariants in 45 ms
[2022-05-17 09:10:57] [INFO ] Implicit Places using invariants in 611 ms returned []
[2022-05-17 09:10:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:10:57] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-17 09:10:58] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:11:01] [INFO ] Implicit Places using invariants and state equation in 3514 ms returned []
Implicit Place search using SMT with State Equation took 4152 ms to find 0 implicit places.
[2022-05-17 09:11:01] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:11:01] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-17 09:11:02] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1920 out of 1992 places after structural reductions.
[2022-05-17 09:11:02] [INFO ] Flatten gal took : 199 ms
[2022-05-17 09:11:03] [INFO ] Flatten gal took : 164 ms
[2022-05-17 09:11:03] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-17 09:11:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:11:04] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-17 09:11:04] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2022-05-17 09:11:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2022-05-17 09:11:07] [INFO ] After 3234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 09:11:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 09:11:08] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2022-05-17 09:11:10] [INFO ] After 2235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 09:11:10] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:11:12] [INFO ] After 2363ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 09:11:15] [INFO ] Deduced a trap composed of 57 places in 1101 ms of which 5 ms to minimize.
[2022-05-17 09:11:16] [INFO ] Deduced a trap composed of 17 places in 1041 ms of which 3 ms to minimize.
[2022-05-17 09:11:17] [INFO ] Deduced a trap composed of 49 places in 1052 ms of which 3 ms to minimize.
[2022-05-17 09:11:18] [INFO ] Deduced a trap composed of 109 places in 1118 ms of which 1 ms to minimize.
[2022-05-17 09:11:19] [INFO ] Deduced a trap composed of 26 places in 1045 ms of which 2 ms to minimize.
[2022-05-17 09:11:20] [INFO ] Deduced a trap composed of 57 places in 964 ms of which 2 ms to minimize.
[2022-05-17 09:11:22] [INFO ] Deduced a trap composed of 24 places in 965 ms of which 1 ms to minimize.
[2022-05-17 09:11:23] [INFO ] Deduced a trap composed of 73 places in 1050 ms of which 2 ms to minimize.
[2022-05-17 09:11:24] [INFO ] Deduced a trap composed of 17 places in 948 ms of which 1 ms to minimize.
[2022-05-17 09:11:25] [INFO ] Deduced a trap composed of 260 places in 1028 ms of which 2 ms to minimize.
[2022-05-17 09:11:26] [INFO ] Deduced a trap composed of 59 places in 1008 ms of which 2 ms to minimize.
[2022-05-17 09:11:27] [INFO ] Deduced a trap composed of 380 places in 1037 ms of which 2 ms to minimize.
[2022-05-17 09:11:28] [INFO ] Deduced a trap composed of 142 places in 1013 ms of which 1 ms to minimize.
[2022-05-17 09:11:30] [INFO ] Deduced a trap composed of 41 places in 1010 ms of which 2 ms to minimize.
[2022-05-17 09:11:31] [INFO ] Deduced a trap composed of 25 places in 989 ms of which 2 ms to minimize.
[2022-05-17 09:11:32] [INFO ] Deduced a trap composed of 44 places in 1019 ms of which 1 ms to minimize.
[2022-05-17 09:11:33] [INFO ] Deduced a trap composed of 59 places in 967 ms of which 2 ms to minimize.
[2022-05-17 09:11:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 09:11:33] [INFO ] After 25818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 456 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2208
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Applied a total of 1776 rules in 255 ms. Remains 1104 /1992 variables (removed 888) and now considering 2208/3096 (removed 888) transitions.
Finished structural reductions, in 1 iterations. Remains : 1104/1992 places, 2208/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 151830 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151830 steps, saw 59793 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 09:11:37] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 09:11:37] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 09:11:37] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:11:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-17 09:11:39] [INFO ] After 1855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 09:11:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:11:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:11:41] [INFO ] After 1449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 09:11:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:11:42] [INFO ] After 1394ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 09:11:43] [INFO ] Deduced a trap composed of 62 places in 421 ms of which 1 ms to minimize.
[2022-05-17 09:11:44] [INFO ] Deduced a trap composed of 31 places in 437 ms of which 0 ms to minimize.
[2022-05-17 09:11:44] [INFO ] Deduced a trap composed of 57 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:11:45] [INFO ] Deduced a trap composed of 95 places in 444 ms of which 2 ms to minimize.
[2022-05-17 09:11:45] [INFO ] Deduced a trap composed of 44 places in 442 ms of which 1 ms to minimize.
[2022-05-17 09:11:46] [INFO ] Deduced a trap composed of 55 places in 444 ms of which 1 ms to minimize.
[2022-05-17 09:11:47] [INFO ] Deduced a trap composed of 107 places in 435 ms of which 2 ms to minimize.
[2022-05-17 09:11:47] [INFO ] Deduced a trap composed of 91 places in 460 ms of which 1 ms to minimize.
[2022-05-17 09:11:48] [INFO ] Deduced a trap composed of 95 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:11:48] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:11:49] [INFO ] Deduced a trap composed of 115 places in 435 ms of which 1 ms to minimize.
[2022-05-17 09:11:49] [INFO ] Deduced a trap composed of 11 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:11:50] [INFO ] Deduced a trap composed of 176 places in 440 ms of which 1 ms to minimize.
[2022-05-17 09:11:50] [INFO ] Deduced a trap composed of 185 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:11:51] [INFO ] Deduced a trap composed of 167 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:11:51] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 0 ms to minimize.
[2022-05-17 09:11:52] [INFO ] Deduced a trap composed of 138 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:11:52] [INFO ] Deduced a trap composed of 141 places in 426 ms of which 4 ms to minimize.
[2022-05-17 09:11:53] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:11:53] [INFO ] Deduced a trap composed of 143 places in 448 ms of which 1 ms to minimize.
[2022-05-17 09:11:54] [INFO ] Deduced a trap composed of 53 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:11:54] [INFO ] Deduced a trap composed of 48 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:11:55] [INFO ] Deduced a trap composed of 39 places in 421 ms of which 1 ms to minimize.
[2022-05-17 09:11:55] [INFO ] Deduced a trap composed of 103 places in 442 ms of which 1 ms to minimize.
[2022-05-17 09:11:56] [INFO ] Deduced a trap composed of 98 places in 424 ms of which 0 ms to minimize.
[2022-05-17 09:11:56] [INFO ] Deduced a trap composed of 38 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:11:57] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 1 ms to minimize.
[2022-05-17 09:11:57] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:11:58] [INFO ] Deduced a trap composed of 61 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:11:58] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:11:59] [INFO ] Deduced a trap composed of 62 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:11:59] [INFO ] Deduced a trap composed of 25 places in 421 ms of which 1 ms to minimize.
[2022-05-17 09:12:00] [INFO ] Deduced a trap composed of 47 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:12:00] [INFO ] Deduced a trap composed of 97 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:12:01] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:12:01] [INFO ] Deduced a trap composed of 35 places in 421 ms of which 0 ms to minimize.
[2022-05-17 09:12:02] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 0 ms to minimize.
[2022-05-17 09:12:02] [INFO ] Deduced a trap composed of 109 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:12:03] [INFO ] Deduced a trap composed of 52 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:12:03] [INFO ] Deduced a trap composed of 61 places in 424 ms of which 2 ms to minimize.
[2022-05-17 09:12:04] [INFO ] Deduced a trap composed of 17 places in 447 ms of which 1 ms to minimize.
[2022-05-17 09:12:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 09:12:04] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 56 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 56 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 09:12:04] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 09:12:04] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 09:12:05] [INFO ] Implicit Places using invariants in 520 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 524 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 31 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1096/1104 places, 2208/2208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 167661 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167661 steps, saw 61569 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 09:12:08] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:12:08] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:12:09] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:12:10] [INFO ] After 1680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 09:12:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-17 09:12:12] [INFO ] After 1353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 09:12:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:12:13] [INFO ] After 1387ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 09:12:14] [INFO ] Deduced a trap composed of 73 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:12:15] [INFO ] Deduced a trap composed of 30 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:12:15] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:12:16] [INFO ] Deduced a trap composed of 111 places in 402 ms of which 0 ms to minimize.
[2022-05-17 09:12:16] [INFO ] Deduced a trap composed of 40 places in 414 ms of which 0 ms to minimize.
[2022-05-17 09:12:17] [INFO ] Deduced a trap composed of 35 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:12:17] [INFO ] Deduced a trap composed of 53 places in 455 ms of which 1 ms to minimize.
[2022-05-17 09:12:18] [INFO ] Deduced a trap composed of 80 places in 420 ms of which 2 ms to minimize.
[2022-05-17 09:12:18] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 2 ms to minimize.
[2022-05-17 09:12:19] [INFO ] Deduced a trap composed of 66 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:12:19] [INFO ] Deduced a trap composed of 82 places in 416 ms of which 1 ms to minimize.
[2022-05-17 09:12:20] [INFO ] Deduced a trap composed of 35 places in 415 ms of which 1 ms to minimize.
[2022-05-17 09:12:20] [INFO ] Deduced a trap composed of 32 places in 445 ms of which 1 ms to minimize.
[2022-05-17 09:12:21] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 1 ms to minimize.
[2022-05-17 09:12:21] [INFO ] Deduced a trap composed of 84 places in 415 ms of which 0 ms to minimize.
[2022-05-17 09:12:22] [INFO ] Deduced a trap composed of 70 places in 430 ms of which 0 ms to minimize.
[2022-05-17 09:12:22] [INFO ] Deduced a trap composed of 54 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:12:23] [INFO ] Deduced a trap composed of 86 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:12:23] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 3 ms to minimize.
[2022-05-17 09:12:24] [INFO ] Deduced a trap composed of 61 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:12:24] [INFO ] Deduced a trap composed of 83 places in 448 ms of which 1 ms to minimize.
[2022-05-17 09:12:25] [INFO ] Deduced a trap composed of 17 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:12:25] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:12:26] [INFO ] Deduced a trap composed of 69 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:12:26] [INFO ] Deduced a trap composed of 45 places in 413 ms of which 1 ms to minimize.
[2022-05-17 09:12:27] [INFO ] Deduced a trap composed of 87 places in 427 ms of which 0 ms to minimize.
[2022-05-17 09:12:27] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:12:28] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:12:29] [INFO ] Deduced a trap composed of 63 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:12:29] [INFO ] Deduced a trap composed of 82 places in 431 ms of which 0 ms to minimize.
[2022-05-17 09:12:30] [INFO ] Deduced a trap composed of 35 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:12:30] [INFO ] Deduced a trap composed of 68 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:12:31] [INFO ] Deduced a trap composed of 48 places in 414 ms of which 1 ms to minimize.
[2022-05-17 09:12:31] [INFO ] Deduced a trap composed of 74 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:12:32] [INFO ] Deduced a trap composed of 35 places in 422 ms of which 1 ms to minimize.
[2022-05-17 09:12:32] [INFO ] Deduced a trap composed of 43 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:12:33] [INFO ] Deduced a trap composed of 75 places in 403 ms of which 1 ms to minimize.
[2022-05-17 09:12:33] [INFO ] Deduced a trap composed of 117 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:12:34] [INFO ] Deduced a trap composed of 38 places in 416 ms of which 1 ms to minimize.
[2022-05-17 09:12:34] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 1 ms to minimize.
[2022-05-17 09:12:35] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:12:35] [INFO ] Deduced a trap composed of 116 places in 404 ms of which 1 ms to minimize.
[2022-05-17 09:12:35] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 21177 ms
[2022-05-17 09:12:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 09:12:35] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 30 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 29 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 09:12:35] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:12:35] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:12:36] [INFO ] Implicit Places using invariants in 419 ms returned []
[2022-05-17 09:12:36] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:12:36] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:12:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:12:41] [INFO ] Implicit Places using invariants and state equation in 5405 ms returned []
Implicit Place search using SMT with State Equation took 5825 ms to find 0 implicit places.
[2022-05-17 09:12:41] [INFO ] Redundant transitions in 159 ms returned []
[2022-05-17 09:12:41] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:12:41] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:12:42] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1096/1096 places, 2208/2208 transitions.
Graph (trivial) has 896 edges and 1096 vertex of which 98 / 1096 are part of one of the 49 SCC in 4 ms
Free SCC test removed 49 places
Drop transitions removed 98 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 434 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 1024 transition count 1857
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1024 transition count 1850
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 0 with 70 rules applied. Total rules applied 116 place count 1024 transition count 1850
Partial Post-agglomeration rule applied 330 times.
Drop transitions removed 330 transitions
Iterating global reduction 0 with 330 rules applied. Total rules applied 446 place count 1024 transition count 1850
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 452 place count 1024 transition count 1844
Applied a total of 452 rules in 380 ms. Remains 1024 /1096 variables (removed 72) and now considering 1844/2208 (removed 364) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1844 rows 1024 cols
[2022-05-17 09:12:42] [INFO ] Computed 15 place invariants in 16 ms
[2022-05-17 09:12:43] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-17 09:12:43] [INFO ] After 689ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-17 09:12:43] [INFO ] After 892ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-17 09:12:44] [INFO ] After 1254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2022-05-17 09:12:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-17 09:12:44] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 09:12:45] [INFO ] After 1086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 252 ms.
[2022-05-17 09:12:45] [INFO ] After 1569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-17 09:12:45] [INFO ] Flatten gal took : 56 ms
[2022-05-17 09:12:45] [INFO ] Flatten gal took : 55 ms
[2022-05-17 09:12:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16937389326733195549.gal : 33 ms
[2022-05-17 09:12:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11950135392656008942.prop : 3 ms
Invoking ITS tools like this :cd /tmp/redAtoms15404083582225330274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16937389326733195549.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11950135392656008942.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11950135392656008942.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 52
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :52 after 959
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :959 after 1820
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1820 after 45668
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :45668 after 81900
Reachability property AtomicPropp15 is true.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :81900 after 8.09928e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8.09928e+06 after 1.45908e+07
Detected timeout of ITS tools.
[2022-05-17 09:13:00] [INFO ] Flatten gal took : 50 ms
[2022-05-17 09:13:00] [INFO ] Applying decomposition
[2022-05-17 09:13:00] [INFO ] Flatten gal took : 47 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/graph327488865487989328.txt' '-o' '/tmp/graph327488865487989328.bin' '-w' '/tmp/graph327488865487989328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph327488865487989328.bin' '-l' '-1' '-v' '-w' '/tmp/graph327488865487989328.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:13:01] [INFO ] Decomposing Gal with order
[2022-05-17 09:13:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:13:02] [INFO ] Removed a total of 1198 redundant transitions.
[2022-05-17 09:13:02] [INFO ] Flatten gal took : 622 ms
[2022-05-17 09:13:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 438 labels/synchronizations in 67 ms.
[2022-05-17 09:13:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17802219004997531409.gal : 11 ms
[2022-05-17 09:13:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11604112682759094324.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15404083582225330274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17802219004997531409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11604112682759094324.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11604112682759094324.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 44
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :44 after 1232
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1232 after 1708
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1708 after 31772
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :31772 after 88271
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :88271 after 7.66539e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :7.66539e+06 after 2.17787e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1314892011458248472
[2022-05-17 09:13:17] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1314892011458248472
Running compilation step : cd /tmp/ltsmin1314892011458248472;'/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/ltsmin1314892011458248472;'/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/ltsmin1314892011458248472;'/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)
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' '!(X(((G(p0) U X(p1))&&X(p2)&&p1)))'
Support contains 1296 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 15 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:20] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:20] [INFO ] Computed 31 place invariants in 25 ms
[2022-05-17 09:13:21] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-05-17 09:13:21] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:21] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-17 09:13:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:13:26] [INFO ] Implicit Places using invariants and state equation in 5564 ms returned []
Implicit Place search using SMT with State Equation took 5983 ms to find 0 implicit places.
[2022-05-17 09:13:26] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:26] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-17 09:13:28] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ 3 (ADD s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219...], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2264 ms.
Product exploration explored 100000 steps with 33333 reset in 2137 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 (NOT p0) p1 p2), (X (NOT (AND p1 p0))), (X p1), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR (NOT p1) (NOT p2)))))
Knowledge based reduction with 8 factoid took 178 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-7-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-00 finished in 12373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0)))||X(G(p1))))))'
Support contains 456 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 42 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:33] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 09:13:33] [INFO ] Implicit Places using invariants in 586 ms returned []
[2022-05-17 09:13:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:33] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-17 09:13:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:13:46] [INFO ] Implicit Places using invariants and state equation in 12506 ms returned []
Implicit Place search using SMT with State Equation took 13093 ms to find 0 implicit places.
[2022-05-17 09:13:46] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:46] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-17 09:13:47] [INFO ] Dead Transitions using invariants and state equation in 1301 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(LEQ 8 (ADD s0 s1 s2 s3 s4 s5 s6 s7)), p1:(LEQ (ADD s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-7-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLCardinality-03 finished in 14661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 448 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:47] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 09:13:48] [INFO ] Implicit Places using invariants in 392 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 394 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 49 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1720 ms.
Product exploration explored 100000 steps with 50000 reset in 1716 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-7-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-04 finished in 4093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 400 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 2592
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 1 with 504 rules applied. Total rules applied 1008 place count 1488 transition count 2592
Performed 440 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 440 Pre rules applied. Total rules applied 1008 place count 1488 transition count 2152
Deduced a syphon composed of 440 places in 1 ms
Reduce places removed 440 places and 0 transitions.
Iterating global reduction 2 with 880 rules applied. Total rules applied 1888 place count 1048 transition count 2152
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2000 place count 992 transition count 2096
Applied a total of 2000 rules in 159 ms. Remains 992 /1992 variables (removed 1000) and now considering 2096/3096 (removed 1000) transitions.
[2022-05-17 09:13:52] [INFO ] Flow matrix only has 1760 transitions (discarded 336 similar events)
// Phase 1: matrix 1760 rows 992 cols
[2022-05-17 09:13:52] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 09:13:52] [INFO ] Implicit Places using invariants in 262 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 264 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 984/1992 places, 2096/3096 transitions.
Applied a total of 0 rules in 33 ms. Remains 984 /984 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 984/1992 places, 2096/3096 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1416 ms.
Stack based approach found an accepted trace after 262 steps with 0 reset with depth 263 and stack size 263 in 5 ms.
FORMULA Peterson-COL-7-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-06 finished in 1934 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((!p0 U X(p1)))||(G(p2)&&p1))))'
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 39 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:53] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:53] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-17 09:13:54] [INFO ] Implicit Places using invariants in 621 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 623 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 30 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ (ADD s688 s689 s690 s691 s692 s693 s694 s695) (ADD s1536 s1537 s1538 s1539 s1540 s1541 s1542 s1543 s1544 s1545 s1546 s1547 s1548 s1549 s1550 s1551...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1863 ms.
Product exploration explored 100000 steps with 50000 reset in 1868 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 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-7-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-07 finished in 4748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(X(G(F(X(F(p0)))))))||G(p1))))'
Support contains 64 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 392 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1808
Deduced a syphon composed of 392 places in 1 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 2576 place count 704 transition count 1808
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2688 place count 648 transition count 1752
Applied a total of 2688 rules in 169 ms. Remains 648 /1992 variables (removed 1344) and now considering 1752/3096 (removed 1344) transitions.
[2022-05-17 09:13:58] [INFO ] Flow matrix only has 1416 transitions (discarded 336 similar events)
// Phase 1: matrix 1416 rows 648 cols
[2022-05-17 09:13:58] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-17 09:13:59] [INFO ] Implicit Places using invariants in 620 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 624 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 640/1992 places, 1752/3096 transitions.
Applied a total of 0 rules in 27 ms. Remains 640 /640 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 640/1992 places, 1752/3096 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 8 (ADD s296 s297 s298 s299 s300 s301 s302 s303)), p0:(GT 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2605 reset in 453 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA Peterson-COL-7-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-10 finished in 1410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||F(p1)))&&(F(p3)||p2))))'
Support contains 968 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 28 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:14:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:14:00] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-17 09:14:00] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-05-17 09:14:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:14:00] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-17 09:14:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:14:04] [INFO ] Implicit Places using invariants and state equation in 4171 ms returned []
Implicit Place search using SMT with State Equation took 4583 ms to find 0 implicit places.
[2022-05-17 09:14:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:14:04] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-17 09:14:06] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ (ADD s1152 s1153 s1154 s1155 s1156 s1157 s1158 s1159 s1160 s1161 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7336 reset in 750 ms.
Stack based approach found an accepted trace after 14087 steps with 1055 reset with depth 16 and stack size 16 in 114 ms.
FORMULA Peterson-COL-7-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-11 finished in 7138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(p0))) U F(X((X(p0)||p1)))))'
Support contains 456 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 52 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:14:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:14:07] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-17 09:14:07] [INFO ] Implicit Places using invariants in 566 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 570 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 34 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ 2 (ADD s688 s689 s690 s691 s692 s693 s694 s695)) (LEQ (ADD s688 s689 s690 s691 s692 s693 s694 s695) (ADD s696 s697 s698 s699 s700 s701 s702 s7...], 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 50000 reset in 2037 ms.
Product exploration explored 100000 steps with 50000 reset in 2049 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 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-7-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-13 finished in 4967 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(F(p1))))'
Support contains 64 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 58 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:14:12] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:14:12] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-17 09:14:12] [INFO ] Implicit Places using invariants in 544 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 547 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-7-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLCardinality-15 finished in 866 ms.
All properties solved by simple procedures.
Total runtime 197135 ms.

BK_STOP 1652778853127

--------------------
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-7"
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-7, 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-165277016100043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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