Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918900731.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CircularTrains-PT-048, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918900731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.6K Apr 30 07:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K May 10 09:33 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 CircularTrains-PT-048-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652681959740

Running Version 202205111006
[2022-05-16 06:19:20] [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]
[2022-05-16 06:19:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:19:21] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2022-05-16 06:19:21] [INFO ] Transformed 96 places.
[2022-05-16 06:19:21] [INFO ] Transformed 48 transitions.
[2022-05-16 06:19:21] [INFO ] Parsed PT model containing 96 places and 48 transitions in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-048-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 12 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2022-05-16 06:19:21] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-16 06:19:21] [INFO ] Implicit Places using invariants in 193 ms returned [13, 22, 56, 81, 83, 89, 92]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 220 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 89/96 places, 48/48 transitions.
Support contains 42 out of 89 places after structural reductions.
[2022-05-16 06:19:21] [INFO ] Flatten gal took : 24 ms
[2022-05-16 06:19:21] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:19:21] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 40 out of 89 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 48 rows 89 cols
[2022-05-16 06:19:22] [INFO ] Computed 42 place invariants in 3 ms
[2022-05-16 06:19:22] [INFO ] [Real]Absence check using 29 positive place invariants in 4 ms returned sat
[2022-05-16 06:19:22] [INFO ] [Real]Absence check using 29 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-16 06:19:22] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA CircularTrains-PT-048-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-048-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||p1))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2022-05-16 06:19:22] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-16 06:19:23] [INFO ] Implicit Places using invariants in 74 ms returned [1, 3, 15, 60, 61, 79, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 76 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 1 s74), p1:(GT s4 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-02 finished in 445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G(X(X(G(p0))))) U (G(p1)||p0))&&X(p2))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2022-05-16 06:19:23] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-16 06:19:23] [INFO ] Implicit Places using invariants in 65 ms returned [1, 3, 15, 60, 79, 84, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 67 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 435 ms :[true, (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}, { cond=p1, acceptance={} source=7 dest: 10}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=3, aps=[p2:(LEQ s33 s35), p0:(LEQ s76 s64), p1:(LEQ s41 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 568 steps with 21 reset in 22 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-03 finished in 562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U p1)||p0) U p2)))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 21 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2022-05-16 06:19:23] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-16 06:19:23] [INFO ] Implicit Places using invariants in 66 ms returned [0, 2, 13, 56, 71, 75, 76, 78]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 67 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 37
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 70 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 69 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 69 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 66 transition count 33
Applied a total of 12 rules in 6 ms. Remains 66 /72 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:19:24] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:19:24] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 33 rows 66 cols
[2022-05-16 06:19:24] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 06:19:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions, in 2 iterations. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), true, (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 1 s10), p0:(LEQ s49 s63), p1:(GT s17 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-05 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||G(p1))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2022-05-16 06:19:24] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-16 06:19:24] [INFO ] Implicit Places using invariants in 55 ms returned [1, 3, 15, 60, 61, 79, 84, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 56 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s28 s3), p1:(GT s79 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CircularTrains-PT-048-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLCardinality-10 finished in 818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(X(p0)))))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 11 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2022-05-16 06:19:25] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-16 06:19:25] [INFO ] Implicit Places using invariants in 59 ms returned [0, 2, 13, 55, 56, 71, 74, 75, 77]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 61 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 70 transition count 33
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 65 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 65 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:25] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-16 06:19:25] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 32 rows 64 cols
[2022-05-16 06:19:25] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 06:19:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions, in 2 iterations. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s27 s59)], 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 0 reset in 208 ms.
Stack based approach found an accepted trace after 70983 steps with 0 reset with depth 70984 and stack size 35133 in 230 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-11 finished in 669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&p0))))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2022-05-16 06:19:25] [INFO ] Computed 42 place invariants in 3 ms
[2022-05-16 06:19:25] [INFO ] Implicit Places using invariants in 57 ms returned [3, 15, 60, 61, 79, 84, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 59 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s44 s3) (GT 2 s18)), p1:(LEQ s1 s68)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 238 ms.
Product exploration explored 100000 steps with 0 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:27] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:19:27] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-16 06:19:27] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:19:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:19:27] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 06:19:27] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:19:27] [INFO ] Added : 29 causal constraints over 6 iterations in 70 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:27] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:19:27] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:27] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-16 06:19:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:27] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:19:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 31 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 403 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:28] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 06:19:28] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2022-05-16 06:19:28] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 06:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:19:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 06:19:28] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:19:28] [INFO ] Added : 29 causal constraints over 6 iterations in 45 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 281 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 81 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 14 place count 81 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 81 transition count 48
Deduced a syphon composed of 16 places in 1 ms
Applied a total of 16 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-16 06:19:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 81 cols
[2022-05-16 06:19:29] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 06:19:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 48/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 48/48 transitions.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 22333 steps with 0 reset with depth 22334 and stack size 22333 in 59 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-14 finished in 4238 ms.
All properties solved by simple procedures.
Total runtime 9105 ms.

BK_STOP 1652681970035

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="CircularTrains-PT-048"
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 CircularTrains-PT-048, 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 r024-tall-165251918900731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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