About the Execution of ITS-Tools for Eratosthenes-PT-500
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
266.319 | 10370.00 | 10586.00 | 2346.40 | TFFTFFTTFTTTFFFT | normal |
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-162048875800724.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-500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875800724
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.5K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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 1006K 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-500-00
FORMULA_NAME Eratosthenes-PT-500-01
FORMULA_NAME Eratosthenes-PT-500-02
FORMULA_NAME Eratosthenes-PT-500-03
FORMULA_NAME Eratosthenes-PT-500-04
FORMULA_NAME Eratosthenes-PT-500-05
FORMULA_NAME Eratosthenes-PT-500-06
FORMULA_NAME Eratosthenes-PT-500-07
FORMULA_NAME Eratosthenes-PT-500-08
FORMULA_NAME Eratosthenes-PT-500-09
FORMULA_NAME Eratosthenes-PT-500-10
FORMULA_NAME Eratosthenes-PT-500-11
FORMULA_NAME Eratosthenes-PT-500-12
FORMULA_NAME Eratosthenes-PT-500-13
FORMULA_NAME Eratosthenes-PT-500-14
FORMULA_NAME Eratosthenes-PT-500-15
=== Now, execution of the tool begins
BK_START 1620659418443
Running Version 0
[2021-05-10 15:10:21] [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 15:10:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:10:21] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2021-05-10 15:10:21] [INFO ] Transformed 499 places.
[2021-05-10 15:10:21] [INFO ] Transformed 2191 transitions.
[2021-05-10 15:10:21] [INFO ] Parsed PT model containing 499 places and 2191 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:10:21] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 509 transitions
Reduce redundant transitions removed 509 transitions.
FORMULA Eratosthenes-PT-500-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 404 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 404/404 places, 1682/1682 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 337 transition count 1615
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 337 transition count 1615
Drop transitions removed 1278 transitions
Redundant transition composition rules discarded 1278 transitions
Iterating global reduction 0 with 1278 rules applied. Total rules applied 1412 place count 337 transition count 337
Discarding 305 places :
Symmetric choice reduction at 0 with 305 rule applications. Total rules 1717 place count 32 transition count 32
Iterating global reduction 0 with 305 rules applied. Total rules applied 2022 place count 32 transition count 32
Applied a total of 2022 rules in 61 ms. Remains 32 /404 variables (removed 372) and now considering 32/1682 (removed 1650) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-10 15:10:21] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-10 15:10:21] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 32 rows 32 cols
[2021-05-10 15:10:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-10 15:10:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/404 places, 32/1682 transitions.
[2021-05-10 15:10:21] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-10 15:10:21] [INFO ] Flatten gal took : 20 ms
FORMULA Eratosthenes-PT-500-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:10:21] [INFO ] Flatten gal took : 4 ms
[2021-05-10 15:10:21] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 100270 steps, including 246 resets, run finished after 84 ms. (steps per millisecond=1193 ) properties (out of 17) seen :11
Running SMT prover for 6 properties.
// Phase 1: matrix 32 rows 32 cols
[2021-05-10 15:10:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:10:21] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-10 15:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:10:21] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-10 15:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:10:21] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-10 15:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:10:22] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-10 15:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:10:22] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-10 15:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:10:22] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2021-05-10 15:10:22] [INFO ] Initial state test concluded for 1 properties.
FORMULA Eratosthenes-PT-500-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-01 FALSE 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3 transition count 3
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 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 57 place count 2 transition count 2
Applied a total of 57 rules in 5 ms. Remains 2 /32 variables (removed 30) and now considering 2/32 (removed 30) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:26] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-10 15:10:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:26] [INFO ] Computed 0 place invariants in 16 ms
[2021-05-10 15:10:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/32 places, 2/32 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Product exploration explored 100000 steps with 33333 reset in 98 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)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-500-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-03 finished in 4730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&G(p1)) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 7 transition count 7
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 7 transition count 7
Applied a total of 50 rules in 1 ms. Remains 7 /32 variables (removed 25) and now considering 7/32 (removed 25) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:10:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:26] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:10:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:26] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:10:26] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/32 places, 7/32 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-04 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s3 s5), p1:(GT s6 s1), p2:(LEQ s4 s2)], 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]]
Entered a terminal (fully accepting) state of product in 41 steps with 20 reset in 1 ms.
FORMULA Eratosthenes-PT-500-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-04 finished in 183 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2 transition count 2
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 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 59 place count 1 transition count 1
Applied a total of 59 rules in 2 ms. Remains 1 /32 variables (removed 31) and now considering 1/32 (removed 31) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [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.
[2021-05-10 15:10:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/32 places, 1/32 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-05 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (X((p0 U p1))&&(!p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 6 transition count 6
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 6 transition count 6
Applied a total of 52 rules in 1 ms. Remains 6 /32 variables (removed 26) and now considering 6/32 (removed 26) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/32 places, 6/32 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ s2 s1), p2:(LEQ s3 s5)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 116 steps with 33 reset in 1 ms.
FORMULA Eratosthenes-PT-500-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-12 finished in 289 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2 transition count 2
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 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 59 place count 1 transition count 1
Applied a total of 59 rules in 1 ms. Remains 1 /32 variables (removed 31) and now considering 1/32 (removed 31) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 15:10:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/32 places, 1/32 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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-500-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-14 finished in 57 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3 transition count 3
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 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 57 place count 2 transition count 2
Applied a total of 57 rules in 3 ms. Remains 2 /32 variables (removed 30) and now considering 2/32 (removed 30) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:27] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-10 15:10:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:27] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/32 places, 2/32 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Product exploration explored 100000 steps with 33333 reset in 56 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)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-500-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-15 finished in 262 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620659428813
--------------------
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="Eratosthenes-PT-500"
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 Eratosthenes-PT-500, 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-162048875800724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-500.tgz
mv Eratosthenes-PT-500 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 '
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 ;