Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625200237.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GPPP-PT-C0010N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C0010N0000000010-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716543921927

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 09:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 09:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:45:23] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2024-05-24 09:45:23] [INFO ] Transformed 33 places.
[2024-05-24 09:45:23] [INFO ] Transformed 22 transitions.
[2024-05-24 09:45:23] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:45:23] [INFO ] Computed 12 invariants in 11 ms
[2024-05-24 09:45:24] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
[2024-05-24 09:45:24] [INFO ] Invariant cache hit.
[2024-05-24 09:45:24] [INFO ] Implicit Places using invariants in 41 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 21 out of 32 places after structural reductions.
[2024-05-24 09:45:24] [INFO ] Flatten gal took : 18 ms
[2024-05-24 09:45:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 09:45:24] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 09:45:24] [INFO ] Computed 11 invariants in 5 ms
[2024-05-24 09:45:24] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-24 09:45:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 09:45:24] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 09:45:35] [INFO ] After 10297ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X(X(X(F(!p0))))&&p1))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:35] [INFO ] Invariant cache hit.
[2024-05-24 09:45:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-24 09:45:35] [INFO ] Invariant cache hit.
[2024-05-24 09:45:35] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 31/32 places, 22/22 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) (NOT p0)), false, true, p0, p0, p0, false]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(AND (GT 1 s18) (LEQ 1 s12)), p0:(GT 1 s18)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2498 reset in 335 ms.
Product exploration explored 100000 steps with 2512 reset in 211 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 (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 113 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), p0, false, p0, false, true, p0]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:45:36] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 09:45:36] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 13 factoid took 283 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), p0, false, true, p0, false]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), p0, false, true, p0, false]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:37] [INFO ] Invariant cache hit.
[2024-05-24 09:45:37] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-24 09:45:37] [INFO ] Invariant cache hit.
[2024-05-24 09:45:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 09:45:37] [INFO ] Invariant cache hit.
[2024-05-24 09:45:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 30/31 places, 22/22 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)), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), p0, false, true, p0, false]
Finished random walk after 216 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=72 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND p1 p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 170 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), p0, false, true, p0, false]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), p0, false, true, p0, false]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), p0, false, true, p0, false]
Product exploration explored 100000 steps with 2484 reset in 143 ms.
Stack based approach found an accepted trace after 6530 steps with 156 reset with depth 57 and stack size 56 in 17 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-01 finished in 3677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((p1&&F(p2))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 09:45:39] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 09:45:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2024-05-24 09:45:39] [INFO ] Invariant cache hit.
[2024-05-24 09:45:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 09:45:39] [INFO ] Invariant cache hit.
[2024-05-24 09:45:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s30), p1:(LEQ 1 s2), p2:(AND (LEQ s12 s13) (LEQ s15 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2642 reset in 126 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-03 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:39] [INFO ] Invariant cache hit.
[2024-05-24 09:45:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 09:45:39] [INFO ] Invariant cache hit.
[2024-05-24 09:45:39] [INFO ] Implicit Places using invariants in 41 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s26 s18), p0:(LEQ 1 s26)], 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][false, false, false]]
Product exploration explored 100000 steps with 383 reset in 135 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-05 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:39] [INFO ] Invariant cache hit.
[2024-05-24 09:45:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-24 09:45:39] [INFO ] Invariant cache hit.
[2024-05-24 09:45:39] [INFO ] Implicit Places using invariants in 31 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s30), p1:(GT s18 s16)], 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][false, false, false]]
Product exploration explored 100000 steps with 2621 reset in 127 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-06 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((G(F((G(F(p1))||(!p0&&F(p1)))))||(!p0&&X(F((G(F(p1))||(!p0&&F(p1))))))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:40] [INFO ] Invariant cache hit.
[2024-05-24 09:45:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-24 09:45:40] [INFO ] Invariant cache hit.
[2024-05-24 09:45:40] [INFO ] Implicit Places using invariants in 36 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s4 s20), p1:(GT 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-08 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G((p1&&F(p2)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:40] [INFO ] Invariant cache hit.
[2024-05-24 09:45:40] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-24 09:45:40] [INFO ] Invariant cache hit.
[2024-05-24 09:45:40] [INFO ] Implicit Places using invariants in 32 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s5), p0:(LEQ 2 s30), p2:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 736 steps with 4 reset in 2 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-10 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(G(p1)&&X(X(G(p2))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:45:40] [INFO ] Invariant cache hit.
[2024-05-24 09:45:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:45:40] [INFO ] Invariant cache hit.
[2024-05-24 09:45:40] [INFO ] Implicit Places using invariants in 27 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p0:(LEQ s13 s23), p1:(LEQ 2 s21), p2:(OR (LEQ s13 s23) (LEQ 2 s21))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 77 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) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0010N0000000010-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0010N0000000010-LTLCardinality-11 finished in 643 ms.
All properties solved by simple procedures.
Total runtime 18007 ms.

BK_STOP 1716543942318

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="GPPP-PT-C0010N0000000010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is GPPP-PT-C0010N0000000010, 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 r197-tall-171640625200237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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