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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 7.6K Apr 29 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 19:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 19:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:10 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 41K 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 LamportFastMutEx-COL-5-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652777032775

Running Version 202205111006
[2022-05-17 08:43:53] [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:43:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:43:54] [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:43:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 08:43:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2022-05-17 08:43:54] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 08:43:54] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 6 ms.
[2022-05-17 08:43:54] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 15 cols
[2022-05-17 08:43:54] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-17 08:43:54] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-05-17 08:43:54] [INFO ] After 99ms SMT Verify possible using all constraints in real 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.
[2022-05-17 08:43:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-17 08:43:55] [INFO ] Flatten gal took : 15 ms
FORMULA LamportFastMutEx-COL-5-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 08:43:55] [INFO ] Flatten gal took : 3 ms
Domain [pid(6), pid(6)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 08:43:55] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 16 ms.
[2022-05-17 08:43:55] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Support contains 90 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:43:55] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:43:55] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-17 08:43:55] [INFO ] Implicit Places using invariants in 126 ms returned []
[2022-05-17 08:43:55] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:43:55] [INFO ] Computed 37 place invariants in 10 ms
[2022-05-17 08:43:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:43:55] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2022-05-17 08:43:55] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:43:55] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-17 08:43:55] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Support contains 90 out of 137 places after structural reductions.
[2022-05-17 08:43:55] [INFO ] Flatten gal took : 28 ms
[2022-05-17 08:43:55] [INFO ] Flatten gal took : 19 ms
[2022-05-17 08:43:55] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :11
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
Running SMT prover for 1 properties.
[2022-05-17 08:43:55] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:43:55] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-17 08:43:55] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2022-05-17 08:43:55] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:43:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2022-05-17 08:43:55] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:43:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:43:56] [INFO ] After 23ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:43:56] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 4 ms to minimize.
[2022-05-17 08:43:56] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2022-05-17 08:43:56] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2022-05-17 08:43:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2022-05-17 08:43:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2022-05-17 08:43:56] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-17 08:43:56] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 36 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1490437 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1490437 steps, saw 389539 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:43:59] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2022-05-17 08:43:59] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-17 08:43:59] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2022-05-17 08:43:59] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:43:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2022-05-17 08:43:59] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:43:59] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:43:59] [INFO ] After 40ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:43:59] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2022-05-17 08:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-17 08:43:59] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-17 08:43:59] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2022-05-17 08:43:59] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2022-05-17 08:43:59] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:43:59] [INFO ] Implicit Places using invariants in 105 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 107 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1578826 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :{}
Probabilistic random walk after 1578826 steps, saw 413665 distinct states, run finished after 3001 ms. (steps per millisecond=526 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:44:02] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:02] [INFO ] Computed 32 place invariants in 2 ms
[2022-05-17 08:44:02] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-17 08:44:03] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:44:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-17 08:44:03] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:44:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:03] [INFO ] After 11ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:44:03] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2022-05-17 08:44:03] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-17 08:44:03] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-17 08:44:03] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2022-05-17 08:44:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2022-05-17 08:44:03] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 08:44:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 368 ms
[2022-05-17 08:44:03] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 08:44:03] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2022-05-17 08:44:03] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:03] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-17 08:44:03] [INFO ] Implicit Places using invariants in 77 ms returned []
[2022-05-17 08:44:03] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:03] [INFO ] Computed 32 place invariants in 5 ms
[2022-05-17 08:44:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:03] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2022-05-17 08:44:03] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-17 08:44:03] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:03] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:03] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Graph (trivial) has 110 edges and 122 vertex of which 25 / 122 are part of one of the 5 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions removed 45 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 85 transitions.
Graph (complete) has 310 edges and 102 vertex of which 96 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 96 transition count 140
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 27 place count 96 transition count 115
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 97 place count 51 transition count 115
Graph (trivial) has 30 edges and 51 vertex of which 25 / 51 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 31 transition count 115
Drop transitions removed 25 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 133 place count 31 transition count 80
Applied a total of 133 rules in 25 ms. Remains 31 /122 variables (removed 91) and now considering 80/250 (removed 170) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 31 cols
[2022-05-17 08:44:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 08:44:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 08:44:04] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:44:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-17 08:44:04] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:44:04] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 08:44:04] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:44:04] [INFO ] Flatten gal took : 5 ms
[2022-05-17 08:44:04] [INFO ] Flatten gal took : 5 ms
[2022-05-17 08:44:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16582665782159732989.gal : 21 ms
[2022-05-17 08:44:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14219323769745714016.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5446891320320432171;'/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/ReachabilityCardinality16582665782159732989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14219323769745714016.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/ReachabilityCardinality14219323769745714016.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 108
Reachability property AtomicPropp10 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1404,0.018767,4372,2,67,9,486,6,0,207,258,0
Total reachable state count : 1404

Verifying 1 reachability properties.
Reachability property AtomicPropp10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,2,0.019051,4372,2,33,9,486,7,0,213,258,0
Computed a total of 1 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:44:04] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:44:04] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:44:04] [INFO ] Implicit Places using invariants in 121 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(LEQ 3 (ADD s57 s58 s59 s60 s61))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-01 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(G(p0))))))'
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 15 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
[2022-05-17 08:44:04] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 08:44:04] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-17 08:44:04] [INFO ] Implicit Places using invariants in 171 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 173 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/137 places, 255/260 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 127 transition count 250
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 250
Applied a total of 10 rules in 9 ms. Remains 122 /127 variables (removed 5) and now considering 250/255 (removed 5) transitions.
[2022-05-17 08:44:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:04] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-17 08:44:05] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:05] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:05] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/137 places, 250/260 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/137 places, 250/260 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s107 s108 s109 s110 s111) (ADD s32 s33 s34 s35 s36))], 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 299 ms.
Stack based approach found an accepted trace after 410 steps with 0 reset with depth 411 and stack size 411 in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-02 finished in 805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(!(p0 U G(p1)) U X(p2)))||G(p0))))'
Support contains 45 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:44:05] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:44:05] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:44:05] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-17 08:44:05] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:44:05] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:44:05] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:44:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2022-05-17 08:44:05] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:44:05] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:44:05] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) p2), false, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 4}, { cond=p1, acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p0 p2), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86)), p0:(LEQ (ADD s87 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1336 reset in 470 ms.
Stack based approach found an accepted trace after 65137 steps with 856 reset with depth 114 and stack size 114 in 343 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-05 finished in 1499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 35 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:44:07] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:44:07] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-17 08:44:07] [INFO ] Implicit Places using invariants in 123 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 125 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4) 1), p0:(GT (ADD s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-06 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 30 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 0 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:44:07] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:44:07] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:44:07] [INFO ] Implicit Places using invariants in 87 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86) (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-10 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 10 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
[2022-05-17 08:44:07] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 08:44:07] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:44:07] [INFO ] Implicit Places using invariants in 99 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 99 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/137 places, 255/260 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 127 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 250
Applied a total of 10 rules in 6 ms. Remains 122 /127 variables (removed 5) and now considering 250/255 (removed 5) transitions.
[2022-05-17 08:44:07] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:07] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-17 08:44:07] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-05-17 08:44:07] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:07] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:07] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/137 places, 250/260 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/137 places, 250/260 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s117 s118 s119 s120 s121))], 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 3049 reset in 183 ms.
Product exploration explored 100000 steps with 3051 reset in 170 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2022-05-17 08:44:08] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:08] [INFO ] Computed 32 place invariants in 2 ms
[2022-05-17 08:44:08] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2022-05-17 08:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:44:08] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-17 08:44:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:44:08] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2022-05-17 08:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:44:09] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-17 08:44:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:09] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2022-05-17 08:44:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-17 08:44:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-17 08:44:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-17 08:44:09] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2022-05-17 08:44:09] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-17 08:44:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 238 ms
[2022-05-17 08:44:09] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2022-05-17 08:44:09] [INFO ] Added : 75 causal constraints over 15 iterations in 243 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2022-05-17 08:44:09] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:09] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-05-17 08:44:09] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:09] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2022-05-17 08:44:09] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 08:44:09] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:09] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:09] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 71 ms :[(NOT p0), (NOT p0)]
[2022-05-17 08:44:10] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:10] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:10] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2022-05-17 08:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:44:10] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-17 08:44:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:44:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2022-05-17 08:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:44:10] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 08:44:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:10] [INFO ] [Nat]Added 30 Read/Feed constraints in 13 ms returned sat
[2022-05-17 08:44:10] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-17 08:44:10] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-17 08:44:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-17 08:44:10] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2022-05-17 08:44:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2022-05-17 08:44:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 232 ms
[2022-05-17 08:44:10] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 11 ms.
[2022-05-17 08:44:11] [INFO ] Added : 75 causal constraints over 15 iterations in 244 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3031 reset in 171 ms.
Product exploration explored 100000 steps with 3044 reset in 171 ms.
Built C files in :
/tmp/ltsmin9111078176927510082
[2022-05-17 08:44:11] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 08:44:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:44:11] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 08:44:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:44:11] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 08:44:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:44:11] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9111078176927510082
Running compilation step : cd /tmp/ltsmin9111078176927510082;'/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 634 ms.
Running link step : cd /tmp/ltsmin9111078176927510082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9111078176927510082;'/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/stateBased1314677648309755766.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2022-05-17 08:44:26] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:26] [INFO ] Computed 32 place invariants in 3 ms
[2022-05-17 08:44:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-17 08:44:26] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:26] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:44:26] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2022-05-17 08:44:26] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 08:44:26] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:44:26] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:44:26] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Built C files in :
/tmp/ltsmin2999122076161539711
[2022-05-17 08:44:26] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 08:44:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:44:27] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 08:44:27] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:44:27] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 08:44:27] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:44:27] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2999122076161539711
Running compilation step : cd /tmp/ltsmin2999122076161539711;'/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 479 ms.
Running link step : cd /tmp/ltsmin2999122076161539711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2999122076161539711;'/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/stateBased5009229938578506046.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 08:44:42] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:44:42] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:44:42] [INFO ] Time to serialize gal into /tmp/LTL17344981385918137767.gal : 3 ms
[2022-05-17 08:44:42] [INFO ] Time to serialize properties into /tmp/LTL9253616433167421156.ltl : 0 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/LTL17344981385918137767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9253616433167421156.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/LTL1734498...267
Read 1 LTL properties
Checking formula 0 : !((G(F("((((P_setbi_24_1+P_setbi_24_2)+(P_setbi_24_3+P_setbi_24_4))+P_setbi_24_5)>=1)"))))
Formula 0 simplified : !GF"((((P_setbi_24_1+P_setbi_24_2)+(P_setbi_24_3+P_setbi_24_4))+P_setbi_24_5)>=1)"
Detected timeout of ITS tools.
[2022-05-17 08:44:57] [INFO ] Flatten gal took : 14 ms
[2022-05-17 08:44:57] [INFO ] Applying decomposition
[2022-05-17 08:44:57] [INFO ] Flatten gal took : 14 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/graph8098662601759094876.txt' '-o' '/tmp/graph8098662601759094876.bin' '-w' '/tmp/graph8098662601759094876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8098662601759094876.bin' '-l' '-1' '-v' '-w' '/tmp/graph8098662601759094876.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:44:57] [INFO ] Decomposing Gal with order
[2022-05-17 08:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:44:57] [INFO ] Removed a total of 293 redundant transitions.
[2022-05-17 08:44:57] [INFO ] Flatten gal took : 48 ms
[2022-05-17 08:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 8 ms.
[2022-05-17 08:44:57] [INFO ] Time to serialize gal into /tmp/LTL12121186099897351149.gal : 3 ms
[2022-05-17 08:44:57] [INFO ] Time to serialize properties into /tmp/LTL15048098270375075838.ltl : 0 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/LTL12121186099897351149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15048098270375075838.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/LTL1212118...268
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu20.P_setbi_24_1+gu20.P_setbi_24_2)+(gu20.P_setbi_24_3+gu20.P_setbi_24_4))+gu20.P_setbi_24_5)>=1)"))))
Formula 0 simplified : !GF"((((gu20.P_setbi_24_1+gu20.P_setbi_24_2)+(gu20.P_setbi_24_3+gu20.P_setbi_24_4))+gu20.P_setbi_24_5)>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4343537549706492195
[2022-05-17 08:45:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4343537549706492195
Running compilation step : cd /tmp/ltsmin4343537549706492195;'/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 365 ms.
Running link step : cd /tmp/ltsmin4343537549706492195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4343537549706492195;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-11 finished in 80052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(G(p0))))))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 13 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
[2022-05-17 08:45:27] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 08:45:27] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:45:27] [INFO ] Implicit Places using invariants in 92 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 93 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/137 places, 255/260 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 127 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 250
Applied a total of 10 rules in 6 ms. Remains 122 /127 variables (removed 5) and now considering 250/255 (removed 5) transitions.
[2022-05-17 08:45:27] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:45:27] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:45:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-17 08:45:27] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:45:27] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:45:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:45:27] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/137 places, 250/260 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/137 places, 250/260 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-12 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 3 (ADD s0 s1 s2 s3 s4))], 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 167 ms.
Stack based approach found an accepted trace after 195 steps with 0 reset with depth 196 and stack size 196 in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-12 finished in 579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:45:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:45:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:45:28] [INFO ] Implicit Places using invariants in 84 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 85 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s122 s123 s124 s125 s126))], 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 0 reset in 168 ms.
Stack based approach found an accepted trace after 173 steps with 0 reset with depth 174 and stack size 174 in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-13 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(G(X(G((G(p0)||!p0))))))))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:45:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:45:28] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-17 08:45:28] [INFO ] Implicit Places using invariants in 85 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 85 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), false, false, false]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-15 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=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT (ADD s57 s58 s59 s60 s61) 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-15 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-17 08:45:28] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
[2022-05-17 08:45:28] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17579347535951516668
[2022-05-17 08:45:28] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-17 08:45:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:45:28] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-17 08:45:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:45:28] [INFO ] Flatten gal took : 17 ms
[2022-05-17 08:45:28] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-17 08:45:28] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:45:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17579347535951516668
Running compilation step : cd /tmp/ltsmin17579347535951516668;'/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'
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/graph10651538507805784884.txt' '-o' '/tmp/graph10651538507805784884.bin' '-w' '/tmp/graph10651538507805784884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10651538507805784884.bin' '-l' '-1' '-v' '-w' '/tmp/graph10651538507805784884.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:45:28] [INFO ] Decomposing Gal with order
[2022-05-17 08:45:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:45:28] [INFO ] Removed a total of 295 redundant transitions.
[2022-05-17 08:45:29] [INFO ] Flatten gal took : 33 ms
[2022-05-17 08:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 7 ms.
[2022-05-17 08:45:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality404981884955638701.gal : 3 ms
[2022-05-17 08:45:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality14575584052520897237.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/LTLCardinality404981884955638701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14575584052520897237.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...288
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu46.P_setbi_24_1+gu46.P_setbi_24_2)+(gu46.P_setbi_24_3+gu46.P_setbi_24_4))+gu46.P_setbi_24_5)>=1)"))))
Formula 0 simplified : !GF"((((gu46.P_setbi_24_1+gu46.P_setbi_24_2)+(gu46.P_setbi_24_3+gu46.P_setbi_24_4))+gu46.P_setbi_24_5)>=1)"
Compilation finished in 462 ms.
Running link step : cd /tmp/ltsmin17579347535951516668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17579347535951516668;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gu6.t15, gi0.gu7.t21, gi0.gu8.t27, gi0.gu9.t33, gi0.gu10.t39, gi0.t214, gi0.t213, gi0.t21...1040
Detected timeout of ITS tools.
[2022-05-17 09:06:00] [INFO ] Applying decomposition
[2022-05-17 09:06:00] [INFO ] Flatten gal took : 42 ms
[2022-05-17 09:06:00] [INFO ] Decomposing Gal with order
[2022-05-17 09:06:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:06:00] [INFO ] Removed a total of 365 redundant transitions.
[2022-05-17 09:06:00] [INFO ] Flatten gal took : 77 ms
[2022-05-17 09:06:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 3 ms.
[2022-05-17 09:06:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality18364337354478116294.gal : 1 ms
[2022-05-17 09:06:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality8017694215655319411.ltl : 0 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/LTLCardinality18364337354478116294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8017694215655319411.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(F("((((gpid1.P_setbi_24_1+gpid2.P_setbi_24_2)+(gpid3.P_setbi_24_3+gpid4.P_setbi_24_4))+gpid5.P_setbi_24_5)>=1)"))))
Formula 0 simplified : !GF"((((gpid1.P_setbi_24_1+gpid2.P_setbi_24_2)+(gpid3.P_setbi_24_3+gpid4.P_setbi_24_4))+gpid5.P_setbi_24_5)>=1)"
Reverse transition relation is NOT exact ! Due to transitions gpid1.t15, gpid1.t210, gpid2.t21, gpid2.t211, gpid3.t27, gpid3.t212, gpid4.t33, gpid4.t213, g...919
Detected timeout of ITS tools.
[2022-05-17 09:26:32] [INFO ] Flatten gal took : 11 ms
[2022-05-17 09:26:32] [INFO ] Input system was already deterministic with 260 transitions.
[2022-05-17 09:26:32] [INFO ] Transformed 137 places.
[2022-05-17 09:26:32] [INFO ] Transformed 260 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 09:26:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality15452240553769273296.gal : 2 ms
[2022-05-17 09:26:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality5390482500321309365.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/LTLCardinality15452240553769273296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5390482500321309365.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(F("((((P_setbi_24_1+P_setbi_24_2)+(P_setbi_24_3+P_setbi_24_4))+P_setbi_24_5)>=1)"))))
Formula 0 simplified : !GF"((((P_setbi_24_1+P_setbi_24_2)+(P_setbi_24_3+P_setbi_24_4))+P_setbi_24_5)>=1)"
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28...920

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="LamportFastMutEx-COL-5"
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 LamportFastMutEx-COL-5, 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 r132-tall-165271820800363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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