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.r083-tall-162048875900796.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FMS-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-01000-00
FORMULA_NAME FMS-PT-01000-01
FORMULA_NAME FMS-PT-01000-02
FORMULA_NAME FMS-PT-01000-03
FORMULA_NAME FMS-PT-01000-04
FORMULA_NAME FMS-PT-01000-05
FORMULA_NAME FMS-PT-01000-06
FORMULA_NAME FMS-PT-01000-07
FORMULA_NAME FMS-PT-01000-08
FORMULA_NAME FMS-PT-01000-09
FORMULA_NAME FMS-PT-01000-10
FORMULA_NAME FMS-PT-01000-11
FORMULA_NAME FMS-PT-01000-12
FORMULA_NAME FMS-PT-01000-13
FORMULA_NAME FMS-PT-01000-14
FORMULA_NAME FMS-PT-01000-15

=== Now, execution of the tool begins

BK_START 1620666697304

Running Version 0
[2021-05-10 17:11:38] [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-10 17:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 17:11:38] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 17:11:38] [INFO ] Transformed 22 places.
[2021-05-10 17:11:38] [INFO ] Transformed 20 transitions.
[2021-05-10 17:11:38] [INFO ] Parsed PT model containing 22 places and 20 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 17:11:38] [INFO ] Initial state test concluded for 2 properties.
FORMULA FMS-PT-01000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-10 17:11:39] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 17:11:39] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 17:11:39] [INFO ] Flatten gal took : 18 ms
FORMULA FMS-PT-01000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 17:11:39] [INFO ] Flatten gal took : 5 ms
[2021-05-10 17:11:39] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100352 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=1374 ) properties (out of 26) seen :25
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:11:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2021-05-10 17:11:39] [INFO ] Initial state test concluded for 1 properties.
FORMULA FMS-PT-01000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 10 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 10 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 25 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 6 transition count 6
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 28 place count 5 transition count 6
Applied a total of 28 rules in 10 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 5 cols
[2021-05-10 17:11:39] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 17:11:39] [INFO ] Implicit Places using invariants in 11 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-10 17:11:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-10 17:11:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:11:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 4/22 places, 6/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-10 17:11:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-10 17:11:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 17:11:39] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 4/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-01000-00 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:(GT s0 s3)], 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 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-01000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-00 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||(F(p0) U G(p1))))&&X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:39] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 17:11:39] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:39] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:39] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FMS-PT-01000-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s6 s15), p1:(LEQ s2 s18), p2:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 826 reset in 249 ms.
Stack based approach found an accepted trace after 1820 steps with 11 reset with depth 4 and stack size 4 in 5 ms.
FORMULA FMS-PT-01000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-01 finished in 476 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&X(G((p0||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:40] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:11:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : FMS-PT-01000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s21 s11), p1:(GT s4 s6), p2:(GT s1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-02 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((G(p1)||p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:40] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:40] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:40] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : FMS-PT-01000-03 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ s5 s10), p0:(OR (LEQ s5 s10) (LEQ s5 s7))], 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]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 1 ms.
FORMULA FMS-PT-01000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-03 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:11:40] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:11:40] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:11:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FMS-PT-01000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s18), p1:(GT s20 s12), p2:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 22 transition count 23
Deduced a syphon composed of 8 places in 1 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 22 transition count 21
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 10 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 21/20 (removed -1) transitions.
[2021-05-10 17:11:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 22 cols
[2021-05-10 17:11:41] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:11:41] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 21/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
[2021-05-10 17:11:42] [INFO ] Flatten gal took : 3 ms
[2021-05-10 17:11:42] [INFO ] Flatten gal took : 3 ms
[2021-05-10 17:11:42] [INFO ] Time to serialize gal into /tmp/LTL8223401249781232069.gal : 1 ms
[2021-05-10 17:11:42] [INFO ] Time to serialize properties into /tmp/LTL3602019504126646948.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/LTL8223401249781232069.gal, -t, CGAL, -LTL, /tmp/LTL3602019504126646948.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/LTL8223401249781232069.gal -t CGAL -LTL /tmp/LTL3602019504126646948.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(P2wP1<2)")||(X(("(P3>P12M3)")||(G(F("(P12>=2)"))))))))
Formula 0 simplified : !X("(P2wP1<2)" | X("(P3>P12M3)" | GF"(P12>=2)"))
Detected timeout of ITS tools.
[2021-05-10 17:11:57] [INFO ] Flatten gal took : 3 ms
[2021-05-10 17:11:57] [INFO ] Applying decomposition
[2021-05-10 17:11:57] [INFO ] Flatten gal took : 13 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/graph2145544534393284316.txt, -o, /tmp/graph2145544534393284316.bin, -w, /tmp/graph2145544534393284316.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/graph2145544534393284316.bin, -l, -1, -v, -w, /tmp/graph2145544534393284316.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 17:11:57] [INFO ] Decomposing Gal with order
[2021-05-10 17:11:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 17:11:57] [INFO ] Flatten gal took : 131 ms
[2021-05-10 17:11:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 17:11:57] [INFO ] Time to serialize gal into /tmp/LTL1570174360854852214.gal : 1 ms
[2021-05-10 17:11:57] [INFO ] Time to serialize properties into /tmp/LTL9274826588089378524.ltl : 3 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/LTL1570174360854852214.gal, -t, CGAL, -LTL, /tmp/LTL9274826588089378524.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/LTL1570174360854852214.gal -t CGAL -LTL /tmp/LTL9274826588089378524.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gi0.gi1.gu7.P2wP1<2)")||(X(("(gu8.P3>gu8.P12M3)")||(G(F("(gi0.gi0.gu1.P12>=2)"))))))))
Formula 0 simplified : !X("(gi0.gi1.gu7.P2wP1<2)" | X("(gu8.P3>gu8.P12M3)" | GF"(gi0.gi0.gu1.P12>=2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9568155053151434175
[2021-05-10 17:12:12] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9568155053151434175
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/ltsmin9568155053151434175]
Compilation finished in 222 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9568155053151434175]
Link finished in 62 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)||X(((LTLAPp1==true)||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9568155053151434175]
LTSmin run took 410 ms.
FORMULA FMS-PT-01000-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-01000-04 finished in 32535 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:12:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FMS-PT-01000-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ s15 s2), p1:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-05 finished in 373 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 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 11 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 23 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 6 transition count 8
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 4 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 5 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:12:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:12:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-10 17:12:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:12:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-01000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s1)], 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 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-07 finished in 101 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(X(X(F(p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:13] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 17:12:13] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:12:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FMS-PT-01000-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p0:(LEQ s2 s1)], 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]]
Product exploration explored 100000 steps with 319 reset in 268 ms.
Stack based approach found an accepted trace after 2049 steps with 321 reset with depth 34 and stack size 34 in 5 ms.
FORMULA FMS-PT-01000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-09 finished in 641 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Applied a total of 26 rules in 1 ms. Remains 6 /22 variables (removed 16) and now considering 7/20 (removed 13) transitions.
[2021-05-10 17:12:14] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:12:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2021-05-10 17:12:14] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:12:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2021-05-10 17:12:14] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 17:12:14] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:12:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-01000-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s2)], 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][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-10 finished in 185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 11 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 8 transition count 8
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 24 place count 7 transition count 8
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 26 place count 6 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 6 transition count 5
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 30 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 11 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:12:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:12:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-10 17:12:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:12:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 17:12:14] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, true, p0]
Running random walk in product with property : FMS-PT-01000-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-12 finished in 189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 23 place count 9 transition count 9
Applied a total of 23 rules in 2 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:12:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:12:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-10 17:12:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:12:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-01000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s7 s5)], 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-13 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:14] [INFO ] Computed 6 place invariants in 14 ms
[2021-05-10 17:12:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:12:14] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:12:14] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-01000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s9 s15), p2:(GT 3 s16), p1:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1180 reset in 200 ms.
Stack based approach found an accepted trace after 77 steps with 1 reset with depth 56 and stack size 56 in 0 ms.
FORMULA FMS-PT-01000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-14 finished in 425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 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 3 place count 22 transition count 17
Reduce places removed 4 places and 0 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 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 19 place count 12 transition count 11
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 4 with 5 rules applied. Total rules applied 24 place count 9 transition count 9
Applied a total of 24 rules in 2 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:12:15] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:12:15] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:12:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 17:12:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-10 17:12:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:12:15] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:12:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-01000-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s0 s7), p0:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-15 finished in 247 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620666736604

--------------------
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="FMS-PT-01000"
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 FMS-PT-01000, 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 r083-tall-162048875900796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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