Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679033380177

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R015C002
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 06:09:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 06:09:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 06:09:42] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-17 06:09:42] [INFO ] Transformed 60 places.
[2023-03-17 06:09:42] [INFO ] Transformed 32 transitions.
[2023-03-17 06:09:42] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2023-03-17 06:09:42] [INFO ] Computed 30 place invariants in 7 ms
[2023-03-17 06:09:42] [INFO ] Implicit Places using invariants in 162 ms returned [31, 33, 37, 43, 45, 47, 49, 51, 55, 59]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 187 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 50/60 places, 32/32 transitions.
Support contains 31 out of 50 places after structural reductions.
[2023-03-17 06:09:42] [INFO ] Flatten gal took : 27 ms
[2023-03-17 06:09:42] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:09:42] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 29) seen :14
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 32 rows 50 cols
[2023-03-17 06:09:43] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-17 06:09:43] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-17 06:09:43] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:3
[2023-03-17 06:09:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-17 06:09:43] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2023-03-17 06:09:43] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-17 06:09:43] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 32/32 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 31
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 46 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 46 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 45 transition count 28
Applied a total of 9 rules in 12 ms. Remains 45 /50 variables (removed 5) and now considering 28/32 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 45/50 places, 28/32 transitions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 138172 steps, run visited all 1 properties in 230 ms. (steps per millisecond=600 )
Probabilistic random walk after 138172 steps, saw 28693 distinct states, run finished after 230 ms. (steps per millisecond=600 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ResAllocation-PT-R015C002-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 32/32 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 48 transition count 30
Applied a total of 4 rules in 5 ms. Remains 48 /50 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 48 cols
[2023-03-17 06:09:44] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 06:09:44] [INFO ] Implicit Places using invariants in 65 ms returned [31, 34, 36, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/50 places, 30/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 44/50 places, 30/32 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s6 s42), p0:(GT s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2539 steps with 83 reset in 24 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-00 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((p1 U (p2||G(p1)))))))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 50 cols
[2023-03-17 06:09:44] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 06:09:44] [INFO ] Implicit Places using invariants in 96 ms returned [33, 38, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 47/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s43 s35), p2:(AND (GT 3 s21) (GT s24 s9)), p1:(GT s24 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1405 steps with 20 reset in 7 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-02 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p1)))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-17 06:09:44] [INFO ] Invariant cache hit.
[2023-03-17 06:09:44] [INFO ] Implicit Places using invariants in 46 ms returned [33, 36, 38, 45, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 48 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/50 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 45/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1, true]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GT s39 s15) (LEQ s24 s35)), p0:(LEQ s24 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-03 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-17 06:09:45] [INFO ] Invariant cache hit.
[2023-03-17 06:09:45] [INFO ] Implicit Places using invariants in 64 ms returned [33, 36, 38, 45, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 66 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/50 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 45/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s21 s33)], 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 6060 reset in 179 ms.
Product exploration explored 100000 steps with 6086 reset in 182 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 32 rows 45 cols
[2023-03-17 06:09:45] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 06:09:45] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-17 06:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:09:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 06:09:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:09:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-17 06:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:09:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-17 06:09:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-17 06:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-17 06:09:46] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 06:09:46] [INFO ] Added : 22 causal constraints over 5 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 32/32 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 43 transition count 30
Applied a total of 4 rules in 3 ms. Remains 43 /45 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 43 cols
[2023-03-17 06:09:46] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 06:09:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 06:09:46] [INFO ] Invariant cache hit.
[2023-03-17 06:09:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-17 06:09:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 06:09:46] [INFO ] Invariant cache hit.
[2023-03-17 06:09:46] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/45 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 43/45 places, 30/32 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-17 06:09:46] [INFO ] Invariant cache hit.
[2023-03-17 06:09:46] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-17 06:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:09:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 06:09:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:09:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-17 06:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:09:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 06:09:46] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 06:09:46] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6051 reset in 126 ms.
Product exploration explored 100000 steps with 6053 reset in 103 ms.
Built C files in :
/tmp/ltsmin6630730732463390601
[2023-03-17 06:09:47] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2023-03-17 06:09:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:09:47] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2023-03-17 06:09:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:09:47] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2023-03-17 06:09:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:09:47] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6630730732463390601
Running compilation step : cd /tmp/ltsmin6630730732463390601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin6630730732463390601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6630730732463390601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4289166632205604504.hoa' '--buchi-type=spotba'
LTSmin run took 574 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-05 finished in 2844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 50 cols
[2023-03-17 06:09:47] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 06:09:47] [INFO ] Implicit Places using invariants in 36 ms returned [33, 36, 38, 45, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 37 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/50 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 45/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-07 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:(OR (LEQ s34 s36) (LEQ s1 s11))], 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 14201 steps with 206 reset in 43 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-07 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-17 06:09:48] [INFO ] Invariant cache hit.
[2023-03-17 06:09:48] [INFO ] Implicit Places using invariants in 43 ms returned [33, 36, 38, 45, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 45 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/50 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 45/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-09 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:(GT s32 s20)], 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]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-09 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U (p1&&X(p2)))&&G(p2))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 32/32 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 48 transition count 30
Applied a total of 4 rules in 8 ms. Remains 48 /50 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 48 cols
[2023-03-17 06:09:48] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 06:09:48] [INFO ] Implicit Places using invariants in 42 ms returned [34, 36, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/50 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55 ms. Remains : 45/50 places, 30/32 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=0 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p1 p0 p2), acceptance={1} source=0 dest: 5}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=0 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p0 p2), acceptance={1} source=1 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 0}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=4 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 s31), p0:(LEQ s33 s15), p2:(LEQ s43 s32)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 76044 steps with 4549 reset in 143 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-10 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 50 cols
[2023-03-17 06:09:48] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 06:09:48] [INFO ] Implicit Places using invariants in 41 ms returned [33, 36, 38, 45, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 58 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/50 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 45/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT 1 s6)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Product exploration explored 100000 steps with 33333 reset in 84 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R015C002-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-11 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 32/32 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 48 transition count 30
Applied a total of 4 rules in 8 ms. Remains 48 /50 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 48 cols
[2023-03-17 06:09:49] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-17 06:09:49] [INFO ] Implicit Places using invariants in 41 ms returned [31, 34, 36, 43, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 42 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/50 places, 30/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 43/50 places, 30/32 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s12 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-13 finished in 95 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((F(p0)||X(G(p1)))))))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 50 cols
[2023-03-17 06:09:49] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-17 06:09:49] [INFO ] Implicit Places using invariants in 81 ms returned [33, 36, 38, 45, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/50 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 45/50 places, 32/32 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT 1 s14), p1:(GT s12 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 344 steps with 6 reset in 2 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-15 finished in 375 ms.
All properties solved by simple procedures.
Total runtime 7584 ms.

BK_STOP 1679033392290

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R015C002, 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 r325-tall-167889197600747"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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