Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 17:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 17:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 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 TwoPhaseLocking-PT-nC05000vD-LTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679303664890

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC05000vD
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 09:14:26] [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]
[2023-03-20 09:14:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:14:26] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-20 09:14:26] [INFO ] Transformed 8 places.
[2023-03-20 09:14:26] [INFO ] Transformed 6 transitions.
[2023-03-20 09:14:26] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 74 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 4 formulas.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 09:14:26] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-20 09:14:26] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 09:14:26] [INFO ] Invariant cache hit.
[2023-03-20 09:14:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-20 09:14:26] [INFO ] Invariant cache hit.
[2023-03-20 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-20 09:14:27] [INFO ] Flatten gal took : 12 ms
[2023-03-20 09:14:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 09:14:27] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 09:14:27] [INFO ] Invariant cache hit.
[2023-03-20 09:14:27] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 09:14:27] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 09:14:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 09:14:27] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-20 09:14:27] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 09:14:27] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 10005 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=714 )
Parikh walk visited 6 properties in 481 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-09 TRUE 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 3 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-20 09:14:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 09:14:28] [INFO ] Implicit Places using invariants in 20 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25 ms. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-04 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 6 transition count 4
Applied a total of 4 rules in 6 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-20 09:14:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 09:14:29] [INFO ] Implicit Places using invariants in 33 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5330 reset in 96 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-05 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 09:14:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 09:14:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 09:14:29] [INFO ] Invariant cache hit.
[2023-03-20 09:14:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-20 09:14:29] [INFO ] Invariant cache hit.
[2023-03-20 09:14:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s5 s3), p1:(LEQ 3 s6)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-06 finished in 300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(p1))&&G((G(p2) U p3)))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:14:29] [INFO ] Invariant cache hit.
[2023-03-20 09:14:29] [INFO ] Implicit Places using invariants in 28 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p3), (NOT p3), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}]], initial=0, aps=[p0:(LEQ s1 s3), p3:(OR (LEQ s3 s6) (LEQ 3 s0)), p2:(LEQ s0 s3), p1:(LEQ s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 198 ms.
Product exploration explored 100000 steps with 0 reset in 277 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 p3 p2 (NOT p1)), (X (OR (AND p0 p3) (AND p0 p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 429 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p3) (AND (NOT p1) p2))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6 rows 7 cols
[2023-03-20 09:14:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 09:14:31] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 09:14:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 09:14:31] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 09:14:31] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 09:14:31] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 5000 steps, including 0 resets, run visited all 4 properties in 55 ms. (steps per millisecond=90 )
Parikh walk visited 4 properties in 54 ms.
Knowledge obtained : [(AND p0 p3 p2 (NOT p1)), (X (OR (AND p0 p3) (AND p0 p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT (OR p2 p3))), (F (AND p2 (NOT p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 559 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p3) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p3) (AND (NOT p1) p2))]
[2023-03-20 09:14:32] [INFO ] Invariant cache hit.
[2023-03-20 09:14:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 09:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:14:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-20 09:14:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:14:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 09:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:14:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-20 09:14:32] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 09:14:32] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) p3)
Support contains 3 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:14:32] [INFO ] Invariant cache hit.
[2023-03-20 09:14:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-20 09:14:32] [INFO ] Invariant cache hit.
[2023-03-20 09:14:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-20 09:14:32] [INFO ] Invariant cache hit.
[2023-03-20 09:14:32] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 7/7 places, 6/6 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 p3 p2 (NOT p1)), (X p3), (X (X p3)), (X (X (OR p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 09:14:33] [INFO ] Invariant cache hit.
[2023-03-20 09:14:33] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:14:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 09:14:33] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:14:33] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 09:14:33] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 4996 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=999 )
Parikh walk visited 3 properties in 94 ms.
Knowledge obtained : [(AND p3 p2 (NOT p1)), (X p3), (X (X p3)), (X (X (OR p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3))]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3))]
[2023-03-20 09:14:34] [INFO ] Invariant cache hit.
[2023-03-20 09:14:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 09:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:14:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-20 09:14:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:14:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 09:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:14:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-20 09:14:34] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 09:14:34] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3))]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-08 finished in 5639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((!X(p0) U p1))&&(G(p2)||p0)))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 09:14:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 09:14:35] [INFO ] Implicit Places using invariants in 25 ms returned [5]
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 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (AND p0 (NOT p2)), (OR (NOT p1) p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s4 s2), p2:(LEQ s0 s1), p1:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-10 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F(p1))||X(G(p0))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s3 s1), p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-11 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p0||F(p1)))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 3 s7), p1:(LEQ s5 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-12 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((p0&&F(p1)))||(p0&&F(p1)&&F(p2)))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-20 09:14:35] [INFO ] Invariant cache hit.
[2023-03-20 09:14:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-20 09:14:36] [INFO ] Invariant cache hit.
[2023-03-20 09:14:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 2 s6), p1:(GT s5 s0), p2:(LEQ s2 s5)], 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]]
Product exploration explored 100000 steps with 33333 reset in 51 ms.
Product exploration explored 100000 steps with 33333 reset in 71 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 p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p2)
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-14 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((p1||G(p2)))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 09:14:36] [INFO ] Invariant cache hit.
[2023-03-20 09:14:36] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vD-LTLCardinality-15 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) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s5), p1:(AND (LEQ 1 s6) (GT 1 s0)), p2:(GT 1 s6)], 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 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vD-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vD-LTLCardinality-15 finished in 177 ms.
All properties solved by simple procedures.
Total runtime 10420 ms.

BK_STOP 1679303677655

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="TwoPhaseLocking-PT-nC05000vD"
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-5348"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC05000vD, 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 r485-tall-167912700000915"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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