Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331300268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 GPPP-PT-C0100N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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 GPPP-PT-C0100N0000100000-00
FORMULA_NAME GPPP-PT-C0100N0000100000-01
FORMULA_NAME GPPP-PT-C0100N0000100000-02
FORMULA_NAME GPPP-PT-C0100N0000100000-03
FORMULA_NAME GPPP-PT-C0100N0000100000-04
FORMULA_NAME GPPP-PT-C0100N0000100000-05
FORMULA_NAME GPPP-PT-C0100N0000100000-06
FORMULA_NAME GPPP-PT-C0100N0000100000-07
FORMULA_NAME GPPP-PT-C0100N0000100000-08
FORMULA_NAME GPPP-PT-C0100N0000100000-09
FORMULA_NAME GPPP-PT-C0100N0000100000-10
FORMULA_NAME GPPP-PT-C0100N0000100000-11
FORMULA_NAME GPPP-PT-C0100N0000100000-12
FORMULA_NAME GPPP-PT-C0100N0000100000-13
FORMULA_NAME GPPP-PT-C0100N0000100000-14
FORMULA_NAME GPPP-PT-C0100N0000100000-15

=== Now, execution of the tool begins

BK_START 1621227120908

Running Version 0
[2021-05-17 04:52:04] [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]
[2021-05-17 04:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:52:04] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2021-05-17 04:52:04] [INFO ] Transformed 33 places.
[2021-05-17 04:52:04] [INFO ] Transformed 22 transitions.
[2021-05-17 04:52:04] [INFO ] Parsed PT model containing 33 places and 22 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 04:52:04] [INFO ] Initial state test concluded for 6 properties.
FORMULA GPPP-PT-C0100N0000100000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 23 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:52:04] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-17 04:52:04] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:52:04] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 04:52:04] [INFO ] Implicit Places using invariants in 79 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:04] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 04:52:04] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:04] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 04:52:04] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
[2021-05-17 04:52:05] [INFO ] Flatten gal took : 43 ms
[2021-05-17 04:52:05] [INFO ] Flatten gal took : 13 ms
[2021-05-17 04:52:05] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100277 steps, including 34 resets, run finished after 136 ms. (steps per millisecond=737 ) properties (out of 16) seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:05] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned unsat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 04:52:05] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
[2021-05-17 04:52:05] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0100N0000100000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:05] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 04:52:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:05] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 04:52:05] [INFO ] Implicit Places using invariants in 45 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:52:05] [INFO ] Computed 8 place invariants in 10 ms
[2021-05-17 04:52:05] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:52:05] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:52:05] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s13 s6) (LEQ 1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9696 reset in 471 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 4 ms.
FORMULA GPPP-PT-C0100N0000100000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-05 finished in 1082 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 4 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 27 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 27 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 26 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 20 transition count 14
Applied a total of 17 rules in 30 ms. Remains 20 /30 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 04:52:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:52:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 04:52:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:52:06] [INFO ] Implicit Places using invariants in 46 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
[2021-05-17 04:52:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 04:52:06] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:52:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 19/30 places, 14/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Applied a total of 4 rules in 4 ms. Remains 17 /19 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:52:06] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 04:52:07] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:52:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 105 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/30 places, 12/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-17 04:52:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 04:52:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/30 places, 12/22 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-07 automaton TGBA [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 s1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000100000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-07 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 3 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 28 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 27 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 8 place count 25 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 11 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 22 transition count 16
Applied a total of 13 rules in 12 ms. Remains 22 /30 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:52:07] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:52:07] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] Implicit Places using invariants in 46 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
[2021-05-17 04:52:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-17 04:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 21/30 places, 16/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Applied a total of 4 rules in 4 ms. Remains 19 /21 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 04:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 04:52:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:52:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 18/30 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 04:52:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 04:52:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 04:52:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 3 iterations. Remains : 18/30 places, 14/22 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s12 s7), p0:(LEQ s4 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
[2021-05-17 04:52:08] [INFO ] Flatten gal took : 6 ms
[2021-05-17 04:52:08] [INFO ] Flatten gal took : 6 ms
[2021-05-17 04:52:08] [INFO ] Time to serialize gal into /tmp/LTL16211155974075552297.gal : 2 ms
[2021-05-17 04:52:08] [INFO ] Time to serialize properties into /tmp/LTL4680668310562459146.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16211155974075552297.gal, -t, CGAL, -LTL, /tmp/LTL4680668310562459146.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16211155974075552297.gal -t CGAL -LTL /tmp/LTL4680668310562459146.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(E4P<=Pyr)"))&&(F("(b1<=_3PG)"))))
Formula 0 simplified : !(F"(E4P<=Pyr)" & F"(b1<=_3PG)")
Detected timeout of ITS tools.
[2021-05-17 04:52:24] [INFO ] Flatten gal took : 4 ms
[2021-05-17 04:52:24] [INFO ] Applying decomposition
[2021-05-17 04:52:24] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3997520285087102175.txt, -o, /tmp/graph3997520285087102175.bin, -w, /tmp/graph3997520285087102175.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3997520285087102175.bin, -l, -1, -v, -w, /tmp/graph3997520285087102175.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:52:24] [INFO ] Decomposing Gal with order
[2021-05-17 04:52:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:52:24] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 04:52:24] [INFO ] Flatten gal took : 43 ms
[2021-05-17 04:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 04:52:24] [INFO ] Time to serialize gal into /tmp/LTL5063029072003250548.gal : 1 ms
[2021-05-17 04:52:24] [INFO ] Time to serialize properties into /tmp/LTL7789174394814974107.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5063029072003250548.gal, -t, CGAL, -LTL, /tmp/LTL7789174394814974107.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5063029072003250548.gal -t CGAL -LTL /tmp/LTL7789174394814974107.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gu2.E4P<=gu2.Pyr)"))&&(F("(gu3.b1<=gu3._3PG)"))))
Formula 0 simplified : !(F"(gu2.E4P<=gu2.Pyr)" & F"(gu3.b1<=gu3._3PG)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8161283388747459202
[2021-05-17 04:52:39] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8161283388747459202
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8161283388747459202]
Compilation finished in 350 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8161283388747459202]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))&&<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin8161283388747459202]
LTSmin run took 526 ms.
FORMULA GPPP-PT-C0100N0000100000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000100000-09 finished in 32976 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:40] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:40] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 04:52:40] [INFO ] Implicit Places using invariants in 50 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:52:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:52:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-12 automaton TGBA [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 3 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000100000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-12 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:40] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:52:40] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:52:40] [INFO ] Implicit Places using invariants in 45 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:52:40] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:52:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000100000-14 automaton TGBA [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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s16 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 249 ms.
Product exploration explored 100000 steps with 34 reset in 310 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 88631 steps with 30 reset in 184 ms.
FORMULA GPPP-PT-C0100N0000100000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-14 finished in 1378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G((G(p1) U (F(p2) U p3)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 4 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 27 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 25 transition count 17
Applied a total of 9 rules in 8 ms. Remains 25 /30 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:52:41] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 04:52:41] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:52:41] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:52:42] [INFO ] Implicit Places using invariants in 47 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
[2021-05-17 04:52:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 04:52:42] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:52:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 24/30 places, 17/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 24 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 15
Applied a total of 4 rules in 4 ms. Remains 22 /24 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 04:52:42] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 04:52:42] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 04:52:42] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:52:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:52:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [0, 1, 3]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 103 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 19/30 places, 15/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 19 /19 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-17 04:52:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2021-05-17 04:52:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 04:52:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/30 places, 15/22 transitions.
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : GPPP-PT-C0100N0000100000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) (NOT p2) p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LEQ 2 s10) (LEQ 1 s1)), p3:(LEQ s5 s10), p1:(LEQ 2 s10), p2:(LEQ 3 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000100000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000100000-15 finished in 719 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621227163687

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="GPPP-PT-C0100N0000100000"
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 GPPP-PT-C0100N0000100000, 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 r102-smll-162075331300268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 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 ;