fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875700692
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Eratosthenes-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
251.880 5319.00 9118.00 299.00 FFTFFFFFTFFTFTFF 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-162048875700692.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-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875700692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.2K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 18:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 14K 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-020-00
FORMULA_NAME Eratosthenes-PT-020-01
FORMULA_NAME Eratosthenes-PT-020-02
FORMULA_NAME Eratosthenes-PT-020-03
FORMULA_NAME Eratosthenes-PT-020-04
FORMULA_NAME Eratosthenes-PT-020-05
FORMULA_NAME Eratosthenes-PT-020-06
FORMULA_NAME Eratosthenes-PT-020-07
FORMULA_NAME Eratosthenes-PT-020-08
FORMULA_NAME Eratosthenes-PT-020-09
FORMULA_NAME Eratosthenes-PT-020-10
FORMULA_NAME Eratosthenes-PT-020-11
FORMULA_NAME Eratosthenes-PT-020-12
FORMULA_NAME Eratosthenes-PT-020-13
FORMULA_NAME Eratosthenes-PT-020-14
FORMULA_NAME Eratosthenes-PT-020-15

=== Now, execution of the tool begins

BK_START 1620659202176

Running Version 0
[2021-05-10 15:06:43] [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:06:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:06:43] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-10 15:06:43] [INFO ] Transformed 19 places.
[2021-05-10 15:06:43] [INFO ] Transformed 27 transitions.
[2021-05-10 15:06:43] [INFO ] Parsed PT model containing 19 places and 27 transitions in 62 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:06:43] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA Eratosthenes-PT-020-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 20/20 transitions.
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 10 transition count 10
Applied a total of 11 rules in 10 ms. Remains 10 /11 variables (removed 1) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:06:43] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-10 15:06:43] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:06:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/11 places, 10/20 transitions.
[2021-05-10 15:06:44] [INFO ] Flatten gal took : 15 ms
[2021-05-10 15:06:44] [INFO ] Flatten gal took : 2 ms
[2021-05-10 15:06:44] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 100000 steps, including 7705 resets, run finished after 235 ms. (steps per millisecond=425 ) properties (out of 16) seen :13
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:06:44] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-10 15:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:06:44] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-10 15:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:06:44] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
[2021-05-10 15:06:44] [INFO ] Initial state test concluded for 3 properties.
FORMULA Eratosthenes-PT-020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-15 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 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2 transition count 2
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 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 15 place count 1 transition count 1
Applied a total of 15 rules in 4 ms. Remains 1 /10 variables (removed 9) and now considering 1/10 (removed 9) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-10 15:06:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:44] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/10 places, 1/10 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-020-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:(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 1 ms.
FORMULA Eratosthenes-PT-020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-04 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2 transition count 2
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2 transition count 2
Applied a total of 16 rules in 0 ms. Remains 2 /10 variables (removed 8) and now considering 2/10 (removed 8) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:44] [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.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/10 places, 2/10 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-020-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-06 finished in 112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(G((p1&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5 transition count 5
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5 transition count 5
Applied a total of 10 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:44] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:44] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:44] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 5/10 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-020-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3 s2), p1:(LEQ s1 s4), p2:(OR (LEQ s3 s2) (LEQ 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-07 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(p1 U X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 4 transition count 4
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 4 transition count 4
Applied a total of 12 rules in 1 ms. Remains 4 /10 variables (removed 6) and now considering 4/10 (removed 6) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [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.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/10 places, 4/10 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-020-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s3 s1), p1:(LEQ 1 s2)], 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 7 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-10 finished in 132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((G(p1)||p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5 transition count 5
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5 transition count 5
Applied a total of 10 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:45] [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:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 5/10 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-020-11 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ s1 s4), p0:(OR (LEQ 1 s2) (LEQ 3 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11756 reset in 179 ms.
Product exploration explored 100000 steps with 11756 reset in 127 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 (NOT p0))), p1, p0]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Eratosthenes-PT-020-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-020-11 finished in 503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((G(!p0) U p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3 transition count 3
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3 transition count 3
Applied a total of 14 rules in 2 ms. Remains 3 /10 variables (removed 7) and now considering 3/10 (removed 7) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/10 places, 3/10 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), p0]
Running random walk in product with property : Eratosthenes-PT-020-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(GT 1 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 4 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-020-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-12 finished in 190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3 transition count 3
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3 transition count 3
Applied a total of 14 rules in 1 ms. Remains 3 /10 variables (removed 7) and now considering 3/10 (removed 7) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:45] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/10 places, 3/10 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-020-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s1), p0:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-14 finished in 117 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659207495

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

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