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-165281572500604.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-R003C003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572500604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 9.1K Apr 30 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 02:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 02:46 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.9K May 9 08:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:38 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 21K 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-R003C003-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653087453083

Running Version 202205111006
[2022-05-20 22:57:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 22:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:57:34] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-20 22:57:34] [INFO ] Transformed 18 places.
[2022-05-20 22:57:34] [INFO ] Transformed 12 transitions.
[2022-05-20 22:57:34] [INFO ] Found NUPN structural information;
[2022-05-20 22:57:34] [INFO ] Parsed PT model containing 18 places and 12 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R003C003-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 17 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-20 22:57:34] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-20 22:57:34] [INFO ] Implicit Places using invariants in 143 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 17/18 places, 12/12 transitions.
Support contains 16 out of 17 places after structural reductions.
[2022-05-20 22:57:35] [INFO ] Flatten gal took : 25 ms
[2022-05-20 22:57:35] [INFO ] Flatten gal took : 5 ms
[2022-05-20 22:57:35] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 243 steps, including 25 resets, run visited all 12 properties in 38 ms. (steps per millisecond=6 )
FORMULA ResAllocation-PT-R003C003-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ResAllocation-PT-R003C003-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(!(G(X(F(p0))) U p1)))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:35] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-20 22:57:35] [INFO ] Implicit Places using invariants in 41 ms returned [13, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 354 ms :[p1, p1, p1, (AND p1 p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s4 1), p0:(AND (EQ s3 1) (EQ s9 1) (EQ s10 1))], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 10257 reset in 227 ms.
Product exploration explored 100000 steps with 10374 reset in 174 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 p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 40 ms :[(AND p0 p1)]
Incomplete random walk after 10000 steps, including 1004 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 15 cols
[2022-05-20 22:57:36] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 22:57:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-20 22:57:36] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND p0 p1)]
Stuttering acceptance computed with spot in 23 ms :[(AND p0 p1)]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 12/12 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 13 transition count 10
Applied a total of 4 rules in 7 ms. Remains 13 /15 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-20 22:57:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:57:36] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-20 22:57:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:57:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-20 22:57:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-20 22:57:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:57:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/15 places, 10/12 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 10/12 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 383 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND p0 p1)]
Incomplete random walk after 10000 steps, including 1119 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 13 cols
[2022-05-20 22:57:37] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 22:57:37] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-20 22:57:37] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND p0 p1)]
Stuttering acceptance computed with spot in 29 ms :[(AND p0 p1)]
Stuttering acceptance computed with spot in 45 ms :[(AND p0 p1)]
Product exploration explored 100000 steps with 11201 reset in 129 ms.
Stack based approach found an accepted trace after 3665 steps with 415 reset with depth 7 and stack size 6 in 6 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-03 finished in 2677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:38] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:57:38] [INFO ] Implicit Places using invariants in 46 ms returned [13, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s9 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-07 finished in 142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(F(p0))))))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 12/12 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 14 transition count 10
Applied a total of 5 rules in 1 ms. Remains 14 /17 variables (removed 3) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-20 22:57:38] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-20 22:57:38] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2022-05-20 22:57:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:57:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-20 22:57:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2022-05-20 22:57:38] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-20 22:57:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/17 places, 10/12 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/17 places, 10/12 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-08 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:(AND (EQ s6 1) (EQ s12 1))], 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 5 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-08 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((G((G(p0)&&p0))||p1))||G(p0)))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 12/12 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 15 transition count 10
Applied a total of 4 rules in 3 ms. Remains 15 /17 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 15 cols
[2022-05-20 22:57:38] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:57:38] [INFO ] Implicit Places using invariants in 37 ms returned [11, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/17 places, 10/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/17 places, 10/12 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s7 0) (EQ s8 0)), p1:(EQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11245 reset in 92 ms.
Product exploration explored 100000 steps with 11321 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1122 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 13 cols
[2022-05-20 22:57:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:57:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-20 22:57:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ResAllocation-PT-R003C003-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C003-LTLFireability-09 finished in 848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:39] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:57:39] [INFO ] Implicit Places using invariants in 26 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s11 1) (EQ s13 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-10 finished in 118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0)&&X(p1)))&&X((X(p1)||p2)))))'
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:39] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 22:57:39] [INFO ] Implicit Places using invariants in 40 ms returned [13, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s8 0)), p1:(OR (EQ s0 0) (EQ s3 0))], 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 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-11 finished in 147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:39] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:57:39] [INFO ] Implicit Places using invariants in 28 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s11 1) (NEQ s13 1) (NEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31107 reset in 121 ms.
Stack based approach found an accepted trace after 2977 steps with 930 reset with depth 8 and stack size 8 in 3 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-13 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X(F(X((X(!F(p0))||p1))))) U X(G(p2))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:39] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:57:39] [INFO ] Implicit Places using invariants in 31 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/17 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (NOT p2), (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s6 1), p1:(EQ s4 1), p0:(AND (EQ s7 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-14 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-20 22:57:40] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 22:57:40] [INFO ] Implicit Places using invariants in 34 ms returned [13, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/17 places, 12/12 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C003-LTLFireability-15 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 (EQ s0 0) (EQ s3 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C003-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C003-LTLFireability-15 finished in 150 ms.
All properties solved by simple procedures.
Total runtime 5946 ms.

BK_STOP 1653087460463

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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-R003C003"
export BK_EXAMINATION="LTLFireability"
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-R003C003, examination is LTLFireability"
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-165281572500604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C003.tgz
mv ResAllocation-PT-R003C003 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;