Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600691.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R050C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 02:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 212K 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 ResAllocation-PT-R050C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653088695002

Running Version 202205111006
[2022-05-20 23:18:18] [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-20 23:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:18:19] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2022-05-20 23:18:19] [INFO ] Transformed 200 places.
[2022-05-20 23:18:19] [INFO ] Transformed 102 transitions.
[2022-05-20 23:18:19] [INFO ] Parsed PT model containing 200 places and 102 transitions in 616 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 60 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2022-05-20 23:18:20] [INFO ] Computed 100 place invariants in 16 ms
[2022-05-20 23:18:20] [INFO ] Implicit Places using invariants in 795 ms returned [101, 103, 105, 107, 109, 113, 115, 117, 119, 121, 123, 125, 127, 129, 133, 137, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 199]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 938 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/200 places, 102/102 transitions.
Applied a total of 0 rules in 24 ms. Remains 155 /155 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 155/200 places, 102/102 transitions.
Support contains 22 out of 155 places after structural reductions.
[2022-05-20 23:18:21] [INFO ] Flatten gal took : 92 ms
[2022-05-20 23:18:21] [INFO ] Flatten gal took : 36 ms
[2022-05-20 23:18:21] [INFO ] Input system was already deterministic with 102 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 102 rows 155 cols
[2022-05-20 23:18:23] [INFO ] Computed 55 place invariants in 7 ms
[2022-05-20 23:18:23] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 23:18:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 328 ms returned sat
[2022-05-20 23:18:26] [INFO ] After 1362ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :4
[2022-05-20 23:18:26] [INFO ] After 1669ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :4
Attempting to minimize the solution found.
Minimization took 268 ms.
[2022-05-20 23:18:27] [INFO ] After 3369ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :4
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 29 ms.
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 155/155 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 153 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 149 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 147 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 147 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 143 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 141 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 141 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 137 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 136 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 136 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 37 place count 133 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 132 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 132 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 42 place count 130 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 129 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 129 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 47 place count 127 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 49 place count 126 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 50 place count 126 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 52 place count 124 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 54 place count 123 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 55 place count 123 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 57 place count 121 transition count 79
Applied a total of 57 rules in 265 ms. Remains 121 /155 variables (removed 34) and now considering 79/102 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 121/155 places, 79/102 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1487662 steps, run timeout after 3003 ms. (steps per millisecond=495 ) properties seen :{1=1}
Probabilistic random walk after 1487662 steps, saw 298592 distinct states, run finished after 3013 ms. (steps per millisecond=493 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 121 cols
[2022-05-20 23:18:30] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-20 23:18:30] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:18:31] [INFO ] [Nat]Absence check using 44 positive place invariants in 139 ms returned sat
[2022-05-20 23:18:32] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:18:32] [INFO ] After 983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-20 23:18:32] [INFO ] After 1331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(!(p0 U F(F(X(F(!p0))))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 155 cols
[2022-05-20 23:18:32] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 23:18:35] [INFO ] Implicit Places using invariants in 2400 ms returned [106, 117, 123, 125]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2409 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/155 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 151/155 places, 102/102 transitions.
Stuttering acceptance computed with spot in 507 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-00 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:(GT s118 s61)], 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 2 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-00 finished in 3233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(!(((X(G(p0))&&p0) U p0) U F(p0)))))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 155 cols
[2022-05-20 23:18:35] [INFO ] Computed 55 place invariants in 8 ms
[2022-05-20 23:18:40] [INFO ] Implicit Places using invariants in 4476 ms returned [106, 117, 120, 123, 125]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 4480 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/155 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/155 places, 102/102 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s103 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-01 finished in 4786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(false U false))))'
Support contains 0 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 100
Applied a total of 4 rules in 45 ms. Remains 153 /155 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 153 cols
[2022-05-20 23:18:40] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 23:18:40] [INFO ] Implicit Places using invariants in 266 ms returned [104, 115, 118, 121, 123]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 277 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/155 places, 100/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/155 places, 100/102 transitions.
Stuttering acceptance computed with spot in 23 ms :[false]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-02 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-02 TRUE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-02 finished in 364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 155 cols
[2022-05-20 23:18:40] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-20 23:18:43] [INFO ] Implicit Places using invariants in 2682 ms returned [117, 120, 123, 125]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2701 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/155 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 151/155 places, 102/102 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT s109 s61), p1:(LEQ s25 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 150 reset in 773 ms.
Product exploration explored 100000 steps with 150 reset in 572 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 470 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3765 steps, run visited all 1 properties in 23 ms. (steps per millisecond=163 )
Probabilistic random walk after 3765 steps, saw 2815 distinct states, run finished after 23 ms. (steps per millisecond=163 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 440 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 140 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 151 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:18:46] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-20 23:18:46] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:18:46] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-20 23:18:47] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:18:47] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-20 23:18:50] [INFO ] Dead Transitions using invariants and state equation in 3000 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 102/102 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 239 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 114 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3765 steps, run visited all 1 properties in 25 ms. (steps per millisecond=150 )
Probabilistic random walk after 3765 steps, saw 2815 distinct states, run finished after 37 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 262 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 193 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 150 reset in 429 ms.
Product exploration explored 100000 steps with 151 reset in 466 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 27 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2022-05-20 23:18:52] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:18:52] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-20 23:18:53] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/151 places, 102/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 102/102 transitions.
Product exploration explored 100000 steps with 150 reset in 448 ms.
Product exploration explored 100000 steps with 151 reset in 414 ms.
Built C files in :
/tmp/ltsmin5447266223427749141
[2022-05-20 23:18:54] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5447266223427749141
Running compilation step : cd /tmp/ltsmin5447266223427749141;'/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 1373 ms.
Running link step : cd /tmp/ltsmin5447266223427749141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin5447266223427749141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3233913211052914431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:09] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-20 23:19:10] [INFO ] Implicit Places using invariants in 1191 ms returned []
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:10] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-20 23:19:10] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:10] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-20 23:19:10] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin2373144667754417460
[2022-05-20 23:19:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2373144667754417460
Running compilation step : cd /tmp/ltsmin2373144667754417460;'/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 291 ms.
Running link step : cd /tmp/ltsmin2373144667754417460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2373144667754417460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12688077110072871916.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:19:26] [INFO ] Flatten gal took : 31 ms
[2022-05-20 23:19:26] [INFO ] Flatten gal took : 33 ms
[2022-05-20 23:19:26] [INFO ] Time to serialize gal into /tmp/LTL11237658137016360899.gal : 23 ms
[2022-05-20 23:19:26] [INFO ] Time to serialize properties into /tmp/LTL6130488699207263906.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/LTL11237658137016360899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6130488699207263906.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/LTL1123765...267
Read 1 LTL properties
Checking formula 0 : !(((X("(p_1_8>r_0_30)"))||(G("(r_0_12<=r_1_5)"))))
Formula 0 simplified : !(X"(p_1_8>r_0_30)" | G"(r_0_12<=r_1_5)")
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1223 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,12.3445,313396,1,0,2801,1.72158e+06,241,3283,4873,2.46849e+06,6612
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-03 finished in 60436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 155 cols
[2022-05-20 23:19:41] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-20 23:19:42] [INFO ] Implicit Places using invariants in 1134 ms returned [106, 117, 120, 123, 125]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1159 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/155 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/155 places, 102/102 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s44 s9), p0:(GT s64 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1446 steps with 4 reset in 5 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-04 finished in 1394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||F(p0))) U X(X(X(G(p1))))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 155 cols
[2022-05-20 23:19:42] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-20 23:19:42] [INFO ] Implicit Places using invariants in 292 ms returned [106, 117, 120, 123]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 294 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/155 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 151/155 places, 102/102 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s2 s38), p1:(AND (GT s2 s38) (LEQ s121 s106))], 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]]
Product exploration explored 100000 steps with 7852 reset in 380 ms.
Product exploration explored 100000 steps with 8002 reset in 492 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 p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 2796 steps, including 4 resets, run visited all 3 properties in 22 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 488 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:45] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-20 23:19:46] [INFO ] [Real]Absence check using 51 positive place invariants in 18 ms returned sat
[2022-05-20 23:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:19:46] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-05-20 23:19:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:19:46] [INFO ] [Nat]Absence check using 51 positive place invariants in 14 ms returned sat
[2022-05-20 23:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:19:46] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-05-20 23:19:46] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-20 23:19:47] [INFO ] Added : 93 causal constraints over 19 iterations in 616 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:47] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-20 23:19:47] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:47] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-20 23:19:53] [INFO ] Implicit Places using invariants and state equation in 6264 ms returned []
Implicit Place search using SMT with State Equation took 6439 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:54] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-20 23:19:54] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 2281 steps, including 3 resets, run visited all 3 properties in 22 ms. (steps per millisecond=103 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 565 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:55] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-20 23:19:56] [INFO ] [Real]Absence check using 51 positive place invariants in 14 ms returned sat
[2022-05-20 23:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:19:56] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-20 23:19:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:19:56] [INFO ] [Nat]Absence check using 51 positive place invariants in 14 ms returned sat
[2022-05-20 23:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:19:56] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-05-20 23:19:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-20 23:19:56] [INFO ] Added : 93 causal constraints over 19 iterations in 285 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 8068 reset in 352 ms.
Product exploration explored 100000 steps with 7947 reset in 560 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2022-05-20 23:19:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 151 cols
[2022-05-20 23:19:58] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-20 23:19:59] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/151 places, 102/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 102/102 transitions.
Product exploration explored 100000 steps with 8053 reset in 660 ms.
Product exploration explored 100000 steps with 7948 reset in 667 ms.
Built C files in :
/tmp/ltsmin13974587833047942939
[2022-05-20 23:20:00] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13974587833047942939
Running compilation step : cd /tmp/ltsmin13974587833047942939;'/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 390 ms.
Running link step : cd /tmp/ltsmin13974587833047942939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin13974587833047942939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9284421581473742496.hoa' '--buchi-type=spotba'
LTSmin run took 2655 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-12 finished in 20999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(p0)))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 100
Applied a total of 4 rules in 5 ms. Remains 153 /155 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 153 cols
[2022-05-20 23:20:03] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-20 23:20:03] [INFO ] Implicit Places using invariants in 149 ms returned [104, 115, 118, 121, 123]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 167 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/155 places, 100/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/155 places, 100/102 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-14 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:(GT s106 s140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 666 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-14 finished in 342 ms.
All properties solved by simple procedures.
Total runtime 104974 ms.

BK_STOP 1653088804043

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r186-tajo-165281572600691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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