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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K 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.6K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.5K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-00500-00
FORMULA_NAME FMS-PT-00500-01
FORMULA_NAME FMS-PT-00500-02
FORMULA_NAME FMS-PT-00500-03
FORMULA_NAME FMS-PT-00500-04
FORMULA_NAME FMS-PT-00500-05
FORMULA_NAME FMS-PT-00500-06
FORMULA_NAME FMS-PT-00500-07
FORMULA_NAME FMS-PT-00500-08
FORMULA_NAME FMS-PT-00500-09
FORMULA_NAME FMS-PT-00500-10
FORMULA_NAME FMS-PT-00500-11
FORMULA_NAME FMS-PT-00500-12
FORMULA_NAME FMS-PT-00500-13
FORMULA_NAME FMS-PT-00500-14
FORMULA_NAME FMS-PT-00500-15

=== Now, execution of the tool begins

BK_START 1620664758202

Running Version 0
[2021-05-10 16:39:19] [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 16:39:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 16:39:19] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 16:39:19] [INFO ] Transformed 22 places.
[2021-05-10 16:39:19] [INFO ] Transformed 20 transitions.
[2021-05-10 16:39:19] [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 16:39:19] [INFO ] Initial state test concluded for 3 properties.
FORMULA FMS-PT-00500-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 16:39:19] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-10 16:39:20] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:20] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 16:39:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:20] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 16:39:20] [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.
[2021-05-10 16:39:20] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 16:39:20] [INFO ] Flatten gal took : 19 ms
FORMULA FMS-PT-00500-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 16:39:20] [INFO ] Flatten gal took : 5 ms
[2021-05-10 16:39:20] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100477 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=1647 ) properties (out of 20) seen :14
Running SMT prover for 6 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 16:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-10 16:39:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 16:39:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 16:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 16:39:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-10 16:39:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 16:39:20] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 16:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-10 16:39:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 16:39:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 16:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 16:39:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-10 16:39:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 16:39:20] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-10 16:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 16:39:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 16:39:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 16:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 16:39:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 16:39:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 16:39:20] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
[2021-05-10 16:39:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA FMS-PT-00500-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 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 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 9 / 14 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 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 11 rules applied. Total rules applied 16 place count 8 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 4 transition count 4
Applied a total of 29 rules in 8 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:39:20] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:39:20] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:39:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 16:39:20] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-10 16:39:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:39:20] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:39:20] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00500-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s2)], 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 19713 steps with 0 reset in 61 ms.
FORMULA FMS-PT-00500-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-01 finished in 281 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 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 9 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
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 19 place count 10 transition count 10
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 21 place count 9 transition count 9
Applied a total of 21 rules in 5 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
[2021-05-10 16:39:20] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-10 16:39:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:39:20] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-10 16:39:20] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-10 16:39:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:39:20] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-10 16:39:20] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 16:39:20] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-10 16:39:20] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-10 16:39:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-04 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 s6) (LEQ s8 s2))], 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 0 ms.
FORMULA FMS-PT-00500-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-04 finished in 131 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 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 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 7 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 17 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 15 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Applied a total of 13 rules in 3 ms. Remains 15 /22 variables (removed 7) and now considering 14/20 (removed 6) transitions.
// Phase 1: matrix 14 rows 15 cols
[2021-05-10 16:39:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-10 16:39:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-10 16:39:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-10 16:39:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 16:39:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/22 places, 14/20 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s5 s11), p0:(AND (GT s10 s2) (GT s3 s9) (GT s5 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00500-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-05 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((p1||X(G(!p0))||G(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 16:39:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:21] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 16:39:21] [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 160 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FMS-PT-00500-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s4 s12), p1:(GT 1 s5), p2:(LEQ 2 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11976 steps with 8 reset in 42 ms.
FORMULA FMS-PT-00500-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-07 finished in 263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(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 16:39:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:39:21] [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 52 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s14), p1:(AND (LEQ s0 s14) (LEQ 2 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2757 reset in 190 ms.
Stack based approach found an accepted trace after 22 steps with 1 reset with depth 16 and stack size 16 in 0 ms.
FORMULA FMS-PT-00500-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-09 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((G(p0) U p1)&&X(F(!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 16:39:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:39:21] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:39:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:39:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FMS-PT-00500-10 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5 s20), p1:(LEQ 3 s17)], 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 16 reset in 141 ms.
Stack based approach found an accepted trace after 176 steps with 0 reset with depth 177 and stack size 177 in 1 ms.
FORMULA FMS-PT-00500-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-10 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 5 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 7 rules applied. Total rules applied 11 place count 17 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 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 3 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 3 with 6 rules applied. Total rules applied 19 place count 12 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 26 place count 8 transition count 8
Applied a total of 26 rules in 2 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 16:39:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 16:39:22] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 16:39:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 16:39:22] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-10 16:39:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 16:39:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:39:22] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00500-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s6)], 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-00500-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-11 finished in 87 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(F(p0))||(p1 U (p2||G(p1)))) U G(p3)))], 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.
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 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 16 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 14 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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 13 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 13 transition count 13
Applied a total of 17 rules in 3 ms. Remains 13 /22 variables (removed 9) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 13 cols
[2021-05-10 16:39:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 16:39:22] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-10 16:39:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:39:22] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-10 16:39:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-10 16:39:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:39:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/22 places, 13/20 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p0) p1)), (AND (NOT p0) p3 (NOT p2) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3)))]
Running random walk in product with property : FMS-PT-00500-14 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 1}, { cond=(OR p3 p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 3 s9), p0:(LEQ 2 s1), p2:(AND (GT s1 s4) (GT s5 s8)), p1:(GT s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2291 reset in 137 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA FMS-PT-00500-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-14 finished in 383 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620664763399

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

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