Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 6.8K Apr 29 20:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 20:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 20:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 29 20:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 11K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652681226636

Running Version 202205111006
[2022-05-16 06:07:07] [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-16 06:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:07:07] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2022-05-16 06:07:07] [INFO ] Transformed 14 places.
[2022-05-16 06:07:07] [INFO ] Transformed 16 transitions.
[2022-05-16 06:07:07] [INFO ] Parsed PT model containing 14 places and 16 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircadianClock-PT-100000-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:08] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-16 06:07:08] [INFO ] Implicit Places using invariants in 104 ms returned []
[2022-05-16 06:07:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:08] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-05-16 06:07:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2022-05-16 06:07:08] [INFO ] Flatten gal took : 15 ms
[2022-05-16 06:07:08] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:07:08] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 63 ms. (steps per millisecond=1587 ) properties (out of 16) seen :3
Finished Best-First random walk after 7199 steps, including 2 resets, run visited all 13 properties in 36 ms. (steps per millisecond=199 )
FORMULA CircadianClock-PT-100000-LTLFireability-08 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(G(F(p0))))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 6 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:08] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 06:07:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-16 06:07:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:08] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-16 06:07:08] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-16 06:07:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:08] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-00 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:(GEQ s6 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]]
Product exploration explored 100000 steps with 170 reset in 266 ms.
Stack based approach found an accepted trace after 19 steps with 3 reset with depth 10 and stack size 10 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-00 finished in 631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(p0))))||(F(p0) U !G(X(p1)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:09] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-16 06:07:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:09] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-16 06:07:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:09] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 180 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s13 1)), p0:(AND (GEQ s1 1) (GEQ s9 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 92 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 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CircadianClock-PT-100000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-100000-LTLFireability-01 finished in 561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 16 ms
[2022-05-16 06:07:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-16 06:07:10] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7676 reset in 121 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-04 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p1) U p2)&&p0)))'
Support contains 7 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 06:07:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:10] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-16 06:07:10] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1)), p2:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)), p1:(AND (OR (AND (GEQ s0 1) (GEQ s2 1) (GEQ s2 1) (GEQ s11 1)) (NOT (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3949 reset in 141 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-05 finished in 623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U X(p0)) U p1))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:10] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:11] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s10 1) (NOT (AND (GEQ s6 1) (GEQ s13 1)))), p0:(AND (GEQ s6 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-06 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U G(p1)))&&((X(!p0)&&p3)||p2))))'
Support contains 7 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), (NOT p1), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p0) p2) (AND p1 (NOT p0) p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p3), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)), p0:(GEQ s8 1), p2:(OR (LT s7 1) (LT s9 1)), p3:(OR (LT s5 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 140 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-07 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(X(G(X(!(p0 U p1))))) U p2))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 06:07:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:11] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s3 1) (GEQ s13 1)), p2:(OR (AND (GEQ s7 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s9 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3286 reset in 96 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-10 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(p0)&&X((F(p1)||p2)))))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:12] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-16 06:07:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:12] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:12] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-16 06:07:12] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-16 06:07:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:12] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s13 1)), p1:(AND (GEQ s3 1) (GEQ s11 1)), p2:(LT s6 1)], 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]]
Product exploration explored 100000 steps with 3461 reset in 122 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-12 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(F(p0)) U p1)||X(X(p2))))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:12] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-16 06:07:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:12] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-16 06:07:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:12] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-14 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=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s11 1)), p0:(OR (AND (GEQ s3 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s9 1))), p2:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3992 reset in 112 ms.
Stack based approach found an accepted trace after 111 steps with 17 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-14 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(X(G(!(p0 U F(p0))))))&&F(p1)))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-16 06:07:13] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:13] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 06:07:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-16 06:07:13] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:13] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 06:07:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-16 06:07:13] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-16 06:07:13] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 06:07:13] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 06:07:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s7 1) (LT s9 1)), p0:(AND (GEQ s1 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 171 reset in 103 ms.
Stack based approach found an accepted trace after 43 steps with 3 reset with depth 8 and stack size 8 in 1 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-15 finished in 331 ms.
All properties solved by simple procedures.
Total runtime 5846 ms.

BK_STOP 1652681233657

--------------------
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="CircadianClock-PT-100000"
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 CircadianClock-PT-100000, 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 r024-tall-165251918900708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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