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-162075331300212.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-C0010N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K 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.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 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.2K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:56 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-C0010N0000000010-00
FORMULA_NAME GPPP-PT-C0010N0000000010-01
FORMULA_NAME GPPP-PT-C0010N0000000010-02
FORMULA_NAME GPPP-PT-C0010N0000000010-03
FORMULA_NAME GPPP-PT-C0010N0000000010-04
FORMULA_NAME GPPP-PT-C0010N0000000010-05
FORMULA_NAME GPPP-PT-C0010N0000000010-06
FORMULA_NAME GPPP-PT-C0010N0000000010-07
FORMULA_NAME GPPP-PT-C0010N0000000010-08
FORMULA_NAME GPPP-PT-C0010N0000000010-09
FORMULA_NAME GPPP-PT-C0010N0000000010-10
FORMULA_NAME GPPP-PT-C0010N0000000010-11
FORMULA_NAME GPPP-PT-C0010N0000000010-12
FORMULA_NAME GPPP-PT-C0010N0000000010-13
FORMULA_NAME GPPP-PT-C0010N0000000010-14
FORMULA_NAME GPPP-PT-C0010N0000000010-15

=== Now, execution of the tool begins

BK_START 1621208465158

Running Version 0
[2021-05-16 23:41:08] [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-16 23:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 23:41:08] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-16 23:41:08] [INFO ] Transformed 33 places.
[2021-05-16 23:41:08] [INFO ] Transformed 22 transitions.
[2021-05-16 23:41:08] [INFO ] Parsed PT model containing 33 places and 22 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 23:41:08] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPPP-PT-C0010N0000000010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 14 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 23:41:08] [INFO ] Computed 12 place invariants in 15 ms
[2021-05-16 23:41:09] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 23:41:09] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 23:41:09] [INFO ] Implicit Places using invariants in 52 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:09] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 23:41:09] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:09] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 23:41:09] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
[2021-05-16 23:41:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 23:41:09] [INFO ] Flatten gal took : 45 ms
FORMULA GPPP-PT-C0010N0000000010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:41:09] [INFO ] Flatten gal took : 15 ms
[2021-05-16 23:41:09] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 238 resets, run finished after 303 ms. (steps per millisecond=330 ) properties (out of 16) seen :14
Running SMT prover for 2 properties.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:10] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 23:41:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 23:41:10] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 5 ms returned unsat
[2021-05-16 23:41:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 23:41:10] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 7 ms returned sat
[2021-05-16 23:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 23:41:10] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA GPPP-PT-C0010N0000000010-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:10] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 23:41:10] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:10] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 23:41:10] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:10] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 23:41:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 164 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:10] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-16 23:41:10] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:10] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s21), p1:(GT s27 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0010N0000000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-00 finished in 875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:11] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 23:41:11] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:11] [INFO ] Computed 10 place invariants in 9 ms
[2021-05-16 23:41:11] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 175 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:11] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-16 23:41:11] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 30/31 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-16 23:41:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:11] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ 3 s25), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-01 finished in 783 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1)||F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:11] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 23:41:12] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:12] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-16 23:41:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:12] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GT s2 s27), p1:(GT 2 s26), p2:(LEQ 1 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 383 steps with 0 reset in 14 ms.
FORMULA GPPP-PT-C0010N0000000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-04 finished in 609 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||F(((!p0&&X(F(p0)))||G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:12] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:12] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:12] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 30/31 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-16 23:41:12] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-16 23:41:12] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s6 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8300 reset in 536 ms.
Stack based approach found an accepted trace after 23 steps with 2 reset with depth 11 and stack size 11 in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-06 finished in 1002 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 12 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 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 20 place count 19 transition count 13
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 22 place count 18 transition count 12
Applied a total of 22 rules in 49 ms. Remains 18 /31 variables (removed 13) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 23:41:13] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-16 23:41:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 23:41:13] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:13] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 23:41:13] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 23:41:13] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 ms to find 1 implicit places.
[2021-05-16 23:41:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-16 23:41:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 23:41:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 17/31 places, 12/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-16 23:41:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-16 23:41:13] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-16 23:41:13] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 17/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-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:(OR (LEQ 2 s13) (AND (LEQ 1 s7) (LEQ 2 s6)))], 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 13 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-07 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:13] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:13] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:14] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:14] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:14] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 23:41:14] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 201 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:14] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:14] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 30/31 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-16 23:41:14] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-16 23:41:14] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Running random walk in product with property : GPPP-PT-C0010N0000000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s25)], 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 19950 reset in 400 ms.
Product exploration explored 100000 steps with 19983 reset in 319 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Product exploration explored 100000 steps with 19991 reset in 95 ms.
Product exploration explored 100000 steps with 19948 reset in 105 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 29 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 28 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 28 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 27 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 27 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 27 transition count 19
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 13 rules in 18 ms. Remains 27 /30 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 27 cols
[2021-05-16 23:41:15] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:15] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
[2021-05-16 23:41:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-16 23:41:15] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-16 23:41:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 19/22 transitions.
Product exploration explored 100000 steps with 20019 reset in 483 ms.
Product exploration explored 100000 steps with 20069 reset in 266 ms.
[2021-05-16 23:41:16] [INFO ] Flatten gal took : 6 ms
[2021-05-16 23:41:16] [INFO ] Flatten gal took : 5 ms
[2021-05-16 23:41:16] [INFO ] Time to serialize gal into /tmp/LTL7218607611044385945.gal : 2 ms
[2021-05-16 23:41:16] [INFO ] Time to serialize properties into /tmp/LTL246661925301910279.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/LTL7218607611044385945.gal, -t, CGAL, -LTL, /tmp/LTL246661925301910279.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/LTL7218607611044385945.gal -t CGAL -LTL /tmp/LTL246661925301910279.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(b2>=2)"))))
Formula 0 simplified : !XF"(b2>=2)"
Detected timeout of ITS tools.
[2021-05-16 23:41:31] [INFO ] Flatten gal took : 6 ms
[2021-05-16 23:41:31] [INFO ] Applying decomposition
[2021-05-16 23:41:31] [INFO ] Flatten gal took : 6 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/graph2086865316263787279.txt, -o, /tmp/graph2086865316263787279.bin, -w, /tmp/graph2086865316263787279.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/graph2086865316263787279.bin, -l, -1, -v, -w, /tmp/graph2086865316263787279.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 23:41:31] [INFO ] Decomposing Gal with order
[2021-05-16 23:41:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 23:41:31] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-16 23:41:32] [INFO ] Flatten gal took : 57 ms
[2021-05-16 23:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 23:41:32] [INFO ] Time to serialize gal into /tmp/LTL18063950092542886511.gal : 3 ms
[2021-05-16 23:41:32] [INFO ] Time to serialize properties into /tmp/LTL15837669797607143372.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/LTL18063950092542886511.gal, -t, CGAL, -LTL, /tmp/LTL15837669797607143372.ltl, -c, -stutter-deadlock], 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/LTL18063950092542886511.gal -t CGAL -LTL /tmp/LTL15837669797607143372.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i2.u8.b2>=2)"))))
Formula 0 simplified : !XF"(i2.u8.b2>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1572705673050453627
[2021-05-16 23:41:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1572705673050453627
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/ltsmin1572705673050453627]
Compilation finished in 510 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1572705673050453627]
Link finished in 70 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, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1572705673050453627]
LTSmin run took 265 ms.
FORMULA GPPP-PT-C0010N0000000010-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0010N0000000010-09 finished in 33993 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 20 place count 19 transition count 13
Applied a total of 20 rules in 8 ms. Remains 19 /31 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 23:41:47] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-16 23:41:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 23:41:47] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 23:41:48] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 23:41:48] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2021-05-16 23:41:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 23:41:48] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-16 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/31 places, 13/22 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-12 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}]], initial=1, aps=[p0:(LEQ s8 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-12 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 20 place count 19 transition count 13
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 22 place count 18 transition count 12
Applied a total of 22 rules in 8 ms. Remains 18 /31 variables (removed 13) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 23:41:48] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 23:41:48] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-16 23:41:48] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 23:41:48] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
[2021-05-16 23:41:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-16 23:41:48] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 17/31 places, 12/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-16 23:41:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-16 23:41:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 17/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-14 finished in 409 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 25 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 2 with 2 rules applied. Total rules applied 13 place count 24 transition count 15
Applied a total of 13 rules in 7 ms. Remains 24 /31 variables (removed 7) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 23:41:48] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 23:41:48] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:48] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-16 23:41:48] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 23:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 23:41:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 164 ms to find 2 implicit places.
[2021-05-16 23:41:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-16 23:41:48] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 22/31 places, 15/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-16 23:41:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-16 23:41:48] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 23:41:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/31 places, 15/22 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-15 finished in 574 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621208510288

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

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