Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 11K Apr 30 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 05:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652663748710

Running Version 202205111006
[2022-05-16 01:15:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:15:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:15:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 01:15:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:15:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 546 ms
[2022-05-16 01:15:50] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:15:50] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2022-05-16 01:15:50] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 4159 steps, including 130 resets, run visited all 17 properties in 73 ms. (steps per millisecond=56 )
[2022-05-16 01:15:50] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:15:50] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 3
[2022-05-16 01:15:50] [INFO ] Unfolded HLPN to a Petri net with 38 places and 45 transitions 135 arcs in 7 ms.
[2022-05-16 01:15:50] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 29 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:50] [INFO ] Computed 10 place invariants in 12 ms
[2022-05-16 01:15:50] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 01:15:51] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Support contains 29 out of 38 places after structural reductions.
[2022-05-16 01:15:51] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:15:51] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:15:51] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 507 steps, including 19 resets, run visited all 17 properties in 11 ms. (steps per millisecond=46 )
FORMULA CSRepetitions-COL-03-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-COL-03-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 35 place count 12 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 12 transition count 28
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 51 place count 4 transition count 12
Iterating global reduction 0 with 8 rules applied. Total rules applied 59 place count 4 transition count 12
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 67 place count 4 transition count 4
Applied a total of 67 rules in 11 ms. Remains 4 /38 variables (removed 34) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 01:15:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:15:51] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 01:15:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:15:51] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-16 01:15:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 01:15:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:15:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/38 places, 4/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/38 places, 4/45 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 2 s0) (GT 2 s2))], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-01 finished in 282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(G(p0))))))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 01:15:51] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:51] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 01:15:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:51] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-16 01:15:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 01:15:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3646 reset in 286 ms.
Stack based approach found an accepted trace after 736 steps with 28 reset with depth 33 and stack size 33 in 2 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-02 finished in 799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:52] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 01:15:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:52] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-16 01:15:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(OR (LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)) (LEQ 2 s19)), p1:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3680 reset in 285 ms.
Product exploration explored 100000 steps with 3677 reset in 230 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)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 357 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1199 steps, including 50 resets, run visited all 1 properties in 3 ms. (steps per millisecond=399 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 393 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:54] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 01:15:54] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:54] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:54] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:54] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 362 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 3719 steps, including 140 resets, run visited all 1 properties in 20 ms. (steps per millisecond=185 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3699 reset in 175 ms.
Product exploration explored 100000 steps with 3680 reset in 186 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-16 01:15:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:55] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 01:15:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Entered a terminal (fully accepting) state of product in 87721 steps with 3221 reset in 173 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-03 finished in 3516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X((F(p0)||F(X(p1)))))))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:56] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:56] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:56] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-16 01:15:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:56] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p1:(LEQ (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4132 reset in 242 ms.
Product exploration explored 100000 steps with 4118 reset in 184 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 298 steps, including 12 resets, run visited all 2 properties in 4 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 358 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:57] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:57] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:57] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 01:15:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:57] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 171 steps, including 7 resets, run visited all 2 properties in 5 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4096 reset in 167 ms.
Product exploration explored 100000 steps with 4132 reset in 153 ms.
Built C files in :
/tmp/ltsmin16343692843001825232
[2022-05-16 01:15:58] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2022-05-16 01:15:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:15:58] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2022-05-16 01:15:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:15:58] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2022-05-16 01:15:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:15:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16343692843001825232
Running compilation step : cd /tmp/ltsmin16343692843001825232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin16343692843001825232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16343692843001825232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5442813203578675823.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:13] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:13] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 01:16:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:13] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin17631769675655134626
[2022-05-16 01:16:13] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2022-05-16 01:16:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:13] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2022-05-16 01:16:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:13] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2022-05-16 01:16:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17631769675655134626
Running compilation step : cd /tmp/ltsmin17631769675655134626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin17631769675655134626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17631769675655134626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5262246844243333884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:16:28] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:16:28] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:16:28] [INFO ] Time to serialize gal into /tmp/LTL18343253818300693778.gal : 2 ms
[2022-05-16 01:16:28] [INFO ] Time to serialize properties into /tmp/LTL18046696526126006398.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18343253818300693778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18046696526126006398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1834325...268
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X((F("(RequestBufferSlots_0<=((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4...453
Formula 0 simplified : !GXGFX(F"(RequestBufferSlots_0<=((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4+Clien...434
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36...295
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
76 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.779977,40824,1,0,142,135641,125,59,1867,142373,142
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-03-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CSRepetitions-COL-03-LTLCardinality-04 finished in 33590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))||(p1 U p0))))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:29] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:29] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:29] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:29] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 667 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=6, aps=[p0:(LEQ 2 s19), p1:(LEQ s19 (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37))], 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 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 116 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)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLCardinality-05 finished in 1135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(p0) U G(p1))))'
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:30] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:30] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LEQ s19 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)) (GT (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))), p0:(LEQ (ADD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-06 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 35 place count 12 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 12 transition count 28
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 51 place count 4 transition count 12
Iterating global reduction 0 with 8 rules applied. Total rules applied 59 place count 4 transition count 12
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 67 place count 4 transition count 4
Applied a total of 67 rules in 4 ms. Remains 4 /38 variables (removed 34) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 01:16:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:16:30] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 01:16:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 01:16:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 01:16:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:16:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/38 places, 4/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/38 places, 4/45 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6320 reset in 53 ms.
Stack based approach found an accepted trace after 23 steps with 2 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-07 finished in 160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(G((G((F(p0)||p1))||p1)))))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 01:16:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 01:16:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s19), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3760 reset in 145 ms.
Stack based approach found an accepted trace after 1178 steps with 42 reset with depth 30 and stack size 30 in 2 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-09 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(G(p0)))&&p1)))'
Support contains 27 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 01:16:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(LEQ (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28) (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3707 reset in 220 ms.
Stack based approach found an accepted trace after 4132 steps with 155 reset with depth 5 and stack size 5 in 8 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-10 finished in 410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 01:16:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:31] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4418 reset in 158 ms.
Stack based approach found an accepted trace after 36984 steps with 1643 reset with depth 25 and stack size 25 in 74 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-12 finished in 408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0))) U X(((X((p1 U F(p2)))||p0) U p2))))'
Support contains 9 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:32] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 3 (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37))], 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][false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-14 finished in 159 ms.
All properties solved by simple procedures.
Total runtime 42606 ms.

BK_STOP 1652663792487

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918700579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 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 ;