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.r132-tall-165271820400091.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 IBM703-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 11K Apr 30 02:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 02:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 02:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 203K May 10 09:34 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 IBM703-PT-none-LTLCardinality-00
FORMULA_NAME IBM703-PT-none-LTLCardinality-01
FORMULA_NAME IBM703-PT-none-LTLCardinality-02
FORMULA_NAME IBM703-PT-none-LTLCardinality-03
FORMULA_NAME IBM703-PT-none-LTLCardinality-04
FORMULA_NAME IBM703-PT-none-LTLCardinality-05
FORMULA_NAME IBM703-PT-none-LTLCardinality-06
FORMULA_NAME IBM703-PT-none-LTLCardinality-07
FORMULA_NAME IBM703-PT-none-LTLCardinality-08
FORMULA_NAME IBM703-PT-none-LTLCardinality-09
FORMULA_NAME IBM703-PT-none-LTLCardinality-10
FORMULA_NAME IBM703-PT-none-LTLCardinality-11
FORMULA_NAME IBM703-PT-none-LTLCardinality-12
FORMULA_NAME IBM703-PT-none-LTLCardinality-13
FORMULA_NAME IBM703-PT-none-LTLCardinality-14
FORMULA_NAME IBM703-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652745248922

Running Version 202205111006
[2022-05-16 23:54:10] [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 23:54:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:54:10] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-05-16 23:54:10] [INFO ] Transformed 262 places.
[2022-05-16 23:54:10] [INFO ] Transformed 284 transitions.
[2022-05-16 23:54:10] [INFO ] Found NUPN structural information;
[2022-05-16 23:54:10] [INFO ] Completing missing partition info from NUPN : creating a component with [merge_s00000450_activated, merge_s00000462_activated, merge_s00000319_activated, merge_s00000446_activated, merge_s00000449_activated, task_s00000720_input_s00000263, task_s00000721_input_s00000263, task_s00000704_input_s00000263, task_s00000714_input_s00000263, task_s00000724_input_s00000263, fork_s00000464_input_s00000263, task_s00000716_input_s00000263, task_s00000762_input_s00000263, task_s00000726_input_s00000263, task_s00000754_input_s00000263, task_s00000727_input_s00000263, task_s00000746_input_s00000263, task_s00000756_input_s00000263, task_s00000757_input_s00000263, merge_s00000320_input_s00000263, merge_s00000453_input_s00000290, merge_s00000319_input_s00000290, merge_s00000455_input_s00000290, merge_s00000446_input_s00000290, merge_s00000456_input_s00000263, merge_s00000458_input_s00000263, merge_s00000457_input_s00000285, task_s00000710_output_s00000264, task_s00000730_output_s00000264, task_s00000740_output_s00000264, task_s00000704_output_s00000264, task_s00000732_output_s00000264, task_s00000714_output_s00000264, task_s00000733_output_s00000264, task_s00000724_output_s00000264, task_s00000752_output_s00000264, task_s00000716_output_s00000264, task_s00000707_output_s00000264, task_s00000744_output_s00000264, task_s00000708_output_s00000264, task_s00000736_output_s00000264, task_s00000727_output_s00000264, task_s00000755_output_s00000264, task_s00000728_output_s00000264, task_s00000738_output_s00000264, task_s00000739_output_s00000264, task_s00000749_output_s00000264, decision_s00000801_activated, decision_s00000804_activated, decision_s00000772_activated, decision_s00000792_activated, decision_s00000793_activated, decision_s00000776_activated, decision_s00000796_activated, decision_s00000788_activated, fork_s00000463_activated_s00000272, fork_s00000464_activated_s00000272, fork_s00000466_activated_s00000272, fork_s00000466_activated_s00000274, decision_s00000773_input_s00000263, decision_s00000793_input_s00000263, decision_s00000775_input_s00000263, decision_s00000787_input_s00000263, process_s00000030__s00000703_input_s00000263, callToProcess_s00000807_output_s00000264, callToProcess_s00000808_output_s00000264, task_s00000710_inputCriterion_s00000257_used, task_s00000711_inputCriterion_s00000257_used, task_s00000721_inputCriterion_s00000257_used, task_s00000740_inputCriterion_s00000257_used, task_s00000722_inputCriterion_s00000257_used, task_s00000741_inputCriterion_s00000257_used, task_s00000732_inputCriterion_s00000257_used, task_s00000714_inputCriterion_s00000257_used, task_s00000760_inputCriterion_s00000257_used, task_s00000733_inputCriterion_s00000257_used, task_s00000724_inputCriterion_s00000257_used, task_s00000706_inputCriterion_s00000257_used, task_s00000752_inputCriterion_s00000257_used, task_s00000725_inputCriterion_s00000257_used, task_s00000707_inputCriterion_s00000257_used, task_s00000753_inputCriterion_s00000257_used, task_s00000735_inputCriterion_s00000257_used, task_s00000726_inputCriterion_s00000257_used, task_s00000708_inputCriterion_s00000257_used, task_s00000745_inputCriterion_s00000257_used, task_s00000736_inputCriterion_s00000257_used, task_s00000718_inputCriterion_s00000257_used, task_s00000755_inputCriterion_s00000257_used, task_s00000737_inputCriterion_s00000257_used, task_s00000719_inputCriterion_s00000257_used, task_s00000738_inputCriterion_s00000257_used, task_s00000757_inputCriterion_s00000257_used, task_s00000748_inputCriterion_s00000257_used, task_s00000758_inputCriterion_s00000257_used, callToProcess_s00000807_inputCriterion_s00000257_used, callToProcess_s00000808_inputCriterion_s00000257_used]
[2022-05-16 23:54:10] [INFO ] Parsed PT model containing 262 places and 284 transitions in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA IBM703-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 257 transition count 284
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 230 transition count 257
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 230 transition count 257
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 218 transition count 245
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 218 transition count 245
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 208 transition count 235
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 208 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 208 transition count 234
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 203 transition count 229
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 203 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 198 transition count 224
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 198 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 194 transition count 220
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 194 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 190 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 190 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 187 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 187 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 185 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 185 transition count 211
Applied a total of 150 rules in 92 ms. Remains 185 /262 variables (removed 77) and now considering 211/284 (removed 73) transitions.
// Phase 1: matrix 211 rows 185 cols
[2022-05-16 23:54:10] [INFO ] Computed 0 place invariants in 14 ms
[2022-05-16 23:54:10] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 211 rows 185 cols
[2022-05-16 23:54:10] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:10] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 211 rows 185 cols
[2022-05-16 23:54:10] [INFO ] Computed 0 place invariants in 12 ms
[2022-05-16 23:54:10] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/262 places, 211/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/262 places, 211/284 transitions.
Support contains 18 out of 185 places after structural reductions.
[2022-05-16 23:54:11] [INFO ] Flatten gal took : 37 ms
[2022-05-16 23:54:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA IBM703-PT-none-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 23:54:11] [INFO ] Flatten gal took : 14 ms
[2022-05-16 23:54:11] [INFO ] Input system was already deterministic with 211 transitions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 211 rows 185 cols
[2022-05-16 23:54:11] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:11] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 23:54:11] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-16 23:54:11] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-16 23:54:11] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 2 ms.
FORMULA IBM703-PT-none-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA IBM703-PT-none-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 185 stabilizing places and 211 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 185 transition count 211
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!X(p0))&&F(p1)) U G(p2)))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 211/211 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 181 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 181 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 179 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 179 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 179 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 178 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 178 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 178 transition count 203
Applied a total of 15 rules in 35 ms. Remains 178 /185 variables (removed 7) and now considering 203/211 (removed 8) transitions.
// Phase 1: matrix 203 rows 178 cols
[2022-05-16 23:54:11] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 23:54:12] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 203 rows 178 cols
[2022-05-16 23:54:12] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:12] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 178 cols
[2022-05-16 23:54:12] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:12] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 203/211 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/185 places, 203/211 transitions.
Stuttering acceptance computed with spot in 425 ms :[(NOT p2), (NOT p1), p0, (AND (NOT p2) p0), true, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s62 0) (EQ s87 1)), p1:(OR (EQ s20 0) (EQ s94 1)), p0:(OR (EQ s81 0) (EQ s151 1))], 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 25162 reset in 249 ms.
Product exploration explored 100000 steps with 25198 reset in 144 ms.
Computed a total of 178 stabilizing places and 203 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 203
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X p1)), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 963 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (AND p2 p0), true, (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 196 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 203 rows 178 cols
[2022-05-16 23:54:14] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:14] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 23:54:14] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X p1)), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0)), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (NOT (AND p2 p0))), (F (NOT p2)), (F (AND (NOT p2) p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 21 factoid took 292 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA IBM703-PT-none-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-02 finished in 3038 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 211/211 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 211
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 178 transition count 205
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 178 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 173 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 173 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 173 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 170 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 170 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 169 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 168 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 167 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 166 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 166 transition count 190
Applied a total of 40 rules in 76 ms. Remains 166 /185 variables (removed 19) and now considering 190/211 (removed 21) transitions.
// Phase 1: matrix 190 rows 166 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:15] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 190 rows 166 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 190 rows 166 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:15] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/185 places, 190/211 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/185 places, 190/211 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s106 0) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-06 finished in 347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U (X(p0) U F(X(X(p0)))))))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 211/211 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 180 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 180 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 176 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 176 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 176 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 174 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 174 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 173 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 173 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 172 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 172 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 171 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 171 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 170 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 170 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 170 transition count 195
Applied a total of 31 rules in 18 ms. Remains 170 /185 variables (removed 15) and now considering 195/211 (removed 16) transitions.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:15] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 23:54:15] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 170 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 23:54:15] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/185 places, 195/211 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/185 places, 195/211 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s88 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Computed a total of 170 stabilizing places and 195 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 195
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-10 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 211/211 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 179 transition count 206
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 179 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 175 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 175 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 172 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 172 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 172 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 171 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 171 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 170 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 170 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 169 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 169 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 168 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 168 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 168 transition count 193
Applied a total of 35 rules in 12 ms. Remains 168 /185 variables (removed 17) and now considering 193/211 (removed 18) transitions.
// Phase 1: matrix 193 rows 168 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:54:15] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 193 rows 168 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 168 cols
[2022-05-16 23:54:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:54:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/185 places, 193/211 transitions.
Finished structural reductions, in 1 iterations. Remains : 168/185 places, 193/211 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s147 0) (EQ s28 1))], 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]]
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 168 stabilizing places and 193 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM703-PT-none-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-11 finished in 556 ms.
All properties solved by simple procedures.
Total runtime 6322 ms.

BK_STOP 1652745256749

--------------------
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="IBM703-PT-none"
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 IBM703-PT-none, 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 r132-tall-165271820400091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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