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-162048875800717.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 Eratosthenes-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875800717
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.7K Mar 23 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 311K 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 Eratosthenes-PT-200-00
FORMULA_NAME Eratosthenes-PT-200-01
FORMULA_NAME Eratosthenes-PT-200-02
FORMULA_NAME Eratosthenes-PT-200-03
FORMULA_NAME Eratosthenes-PT-200-04
FORMULA_NAME Eratosthenes-PT-200-05
FORMULA_NAME Eratosthenes-PT-200-06
FORMULA_NAME Eratosthenes-PT-200-07
FORMULA_NAME Eratosthenes-PT-200-08
FORMULA_NAME Eratosthenes-PT-200-09
FORMULA_NAME Eratosthenes-PT-200-10
FORMULA_NAME Eratosthenes-PT-200-11
FORMULA_NAME Eratosthenes-PT-200-12
FORMULA_NAME Eratosthenes-PT-200-13
FORMULA_NAME Eratosthenes-PT-200-14
FORMULA_NAME Eratosthenes-PT-200-15

=== Now, execution of the tool begins

BK_START 1620659335561

Running Version 0
[2021-05-10 15:08:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 15:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:08:57] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2021-05-10 15:08:57] [INFO ] Transformed 199 places.
[2021-05-10 15:08:57] [INFO ] Transformed 699 transitions.
[2021-05-10 15:08:57] [INFO ] Parsed PT model containing 199 places and 699 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:08:57] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA Eratosthenes-PT-200-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 126 transition count 502
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 126 transition count 502
Drop transitions removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 430 place count 126 transition count 126
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 515 place count 41 transition count 41
Iterating global reduction 0 with 85 rules applied. Total rules applied 600 place count 41 transition count 41
Applied a total of 600 rules in 31 ms. Remains 41 /153 variables (removed 112) and now considering 41/529 (removed 488) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-10 15:08:57] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-10 15:08:57] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-10 15:08:57] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-10 15:08:57] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:57] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/153 places, 41/529 transitions.
[2021-05-10 15:08:57] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-10 15:08:57] [INFO ] Flatten gal took : 19 ms
FORMULA Eratosthenes-PT-200-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:08:57] [INFO ] Flatten gal took : 4 ms
[2021-05-10 15:08:57] [INFO ] Input system was already deterministic with 41 transitions.
Incomplete random walk after 100089 steps, including 645 resets, run finished after 147 ms. (steps per millisecond=680 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 41 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 1 ms
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3 transition count 3
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 75 place count 2 transition count 2
Applied a total of 75 rules in 5 ms. Remains 2 /41 variables (removed 39) and now considering 2/41 (removed 39) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:58] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:58] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-10 15:08:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:58] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/41 places, 2/41 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 151 ms.
Product exploration explored 100000 steps with 33333 reset in 102 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-200-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-200-00 finished in 527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F((G(p0)||(p0&&G(F(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 3 transition count 3
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 3 transition count 3
Applied a total of 76 rules in 2 ms. Remains 3 /41 variables (removed 38) and now considering 3/41 (removed 38) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:58] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:58] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:58] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/41 places, 3/41 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(LT s2 1), p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 694 reset in 143 ms.
Product exploration explored 100000 steps with 690 reset in 103 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-200-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-200-01 finished in 591 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(p0)))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 5 transition count 5
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 5 transition count 5
Applied a total of 72 rules in 1 ms. Remains 5 /41 variables (removed 36) and now considering 5/41 (removed 36) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:59] [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.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/41 places, 5/41 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Eratosthenes-PT-200-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s2 1) (LT s3 1)), p0:(OR (LT s1 1) (LT s4 1))], 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 1095 steps with 11 reset in 1 ms.
FORMULA Eratosthenes-PT-200-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-02 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 7 transition count 7
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 7 transition count 7
Applied a total of 68 rules in 1 ms. Remains 7 /41 variables (removed 34) and now considering 7/41 (removed 34) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/41 places, 7/41 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-200-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1 1) (LT s2 1)) (LT s6 1)), p0:(AND (LT s6 1) (LT s3 1) (OR (LT s4 1) (LT s5 1)))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-05 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 3 transition count 3
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 75 place count 2 transition count 2
Applied a total of 75 rules in 1 ms. Remains 2 /41 variables (removed 39) and now considering 2/41 (removed 39) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-10 15:08:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/41 places, 2/41 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], 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 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-07 finished in 85 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)&&X(X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 5 transition count 5
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 5 transition count 5
Applied a total of 72 rules in 1 ms. Remains 5 /41 variables (removed 36) and now considering 5/41 (removed 36) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/41 places, 5/41 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : Eratosthenes-PT-200-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(LT s3 1), p2:(GEQ s4 1)], 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 6 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-200-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-08 finished in 167 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 4 transition count 4
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 4 transition count 4
Applied a total of 74 rules in 1 ms. Remains 4 /41 variables (removed 37) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/41 places, 4/41 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-200-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 167 steps with 7 reset in 0 ms.
FORMULA Eratosthenes-PT-200-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-10 finished in 76 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 4 transition count 4
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 4 transition count 4
Applied a total of 74 rules in 1 ms. Remains 4 /41 variables (removed 37) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/41 places, 4/41 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s3 1)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-11 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 2 transition count 2
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 1 transition count 1
Applied a total of 77 rules in 2 ms. Remains 1 /41 variables (removed 40) and now considering 1/41 (removed 40) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
[2021-05-10 15:08:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/41 places, 1/41 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-13 finished in 57 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 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 2 transition count 2
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 1 transition count 1
Applied a total of 77 rules in 2 ms. Remains 1 /41 variables (removed 40) and now considering 1/41 (removed 40) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-10 15:08:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:59] [INFO ] Dead Transitions using invariants and state equation in 4 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/41 places, 1/41 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], 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 Eratosthenes-PT-200-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-14 finished in 57 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 3 transition count 3
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 3 transition count 3
Applied a total of 76 rules in 1 ms. Remains 3 /41 variables (removed 38) and now considering 3/41 (removed 38) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:09:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:09:00] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:09:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:09:00] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:09:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:09:00] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/41 places, 3/41 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-15 finished in 97 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659341288

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Eratosthenes-PT-200"
export BK_EXAMINATION="LTLFireability"
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 Eratosthenes-PT-200, examination is LTLFireability"
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-162048875800717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;