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.r071-smll-167814397600140.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 lolaxred
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 r071-smll-167814397600140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 10:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 10:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K Mar 5 18:22 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 1678249117434

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-100000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:18:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:18:40] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-08 04:18:40] [INFO ] Transformed 14 places.
[2023-03-08 04:18:40] [INFO ] Transformed 16 transitions.
[2023-03-08 04:18:40] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Support contains 13 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 20 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 04:18:40] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 04:18:40] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 04:18:41] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-08 04:18:41] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:41] [INFO ] Invariant cache hit.
[2023-03-08 04:18:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:41] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-08 04:18:41] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:41] [INFO ] Invariant cache hit.
[2023-03-08 04:18:41] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 13 out of 14 places after structural reductions.
[2023-03-08 04:18:41] [INFO ] Flatten gal took : 33 ms
[2023-03-08 04:18:41] [INFO ] Flatten gal took : 11 ms
[2023-03-08 04:18:41] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 178 ms. (steps per millisecond=561 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 16) seen :12
Finished Best-First random walk after 329 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=36 )
Computed a total of 0 stabilizing places and 0 stable transitions
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(G(p0))))'
Support contains 3 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.
[2023-03-08 04:18:42] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:42] [INFO ] Invariant cache hit.
[2023-03-08 04:18:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 04:18:42] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:42] [INFO ] Invariant cache hit.
[2023-03-08 04:18:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 04:18:42] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:42] [INFO ] Invariant cache hit.
[2023-03-08 04:18:43] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 418 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s0 1) (LT s4 1) (AND (OR (LT s0 1) (LT s4 1)) (OR (LT s4 1) (LT s10 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 3 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-00 finished in 723 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' '!(G(((X(p2)&&p1)||p0)))'
Support contains 6 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.
[2023-03-08 04:18:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:43] [INFO ] Invariant cache hit.
[2023-03-08 04:18:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 04:18:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:43] [INFO ] Invariant cache hit.
[2023-03-08 04:18:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-08 04:18:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:43] [INFO ] Invariant cache hit.
[2023-03-08 04:18:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s13 1)), p1:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s3 1) (LT s11 1))), p2:(AND (GEQ s3 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 2 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-01 finished in 404 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 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.
[2023-03-08 04:18:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:43] [INFO ] Invariant cache hit.
[2023-03-08 04:18:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 04:18:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:43] [INFO ] Invariant cache hit.
[2023-03-08 04:18:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:43] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 04:18:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:43] [INFO ] Invariant cache hit.
[2023-03-08 04:18:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-02 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 (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8610 reset in 525 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 4 and stack size 4 in 1 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-02 finished in 817 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 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 9 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 04:18:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:44] [INFO ] Invariant cache hit.
[2023-03-08 04:18:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 04:18:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:44] [INFO ] Invariant cache hit.
[2023-03-08 04:18:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:44] [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.
[2023-03-08 04:18:44] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-08 04:18:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:44] [INFO ] Invariant cache hit.
[2023-03-08 04:18:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 32 in 1 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-03 finished in 661 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' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 6 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.
[2023-03-08 04:18:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:45] [INFO ] Invariant cache hit.
[2023-03-08 04:18:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 04:18:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:45] [INFO ] Invariant cache hit.
[2023-03-08 04:18:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-08 04:18:45] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 04:18:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:45] [INFO ] Invariant cache hit.
[2023-03-08 04:18:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s7 1) (AND (GEQ s4 1) (GEQ s10 1)))) (NOT (AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)))), p0:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1))], 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 39 reset in 249 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 50 in 1 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-04 finished in 583 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)||F(G(p1)))))'
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.
[2023-03-08 04:18:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:45] [INFO ] Invariant cache hit.
[2023-03-08 04:18:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 04:18:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:45] [INFO ] Invariant cache hit.
[2023-03-08 04:18:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 04:18:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:46] [INFO ] Invariant cache hit.
[2023-03-08 04:18:46] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)), p1:(OR (LT s5 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 35 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-05 finished in 594 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(((X(p0) U p1)&&(G(X(p0)) U 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.
[2023-03-08 04:18:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:46] [INFO ] Invariant cache hit.
[2023-03-08 04:18:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 04:18:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:46] [INFO ] Invariant cache hit.
[2023-03-08 04:18:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:46] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 04:18:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:46] [INFO ] Invariant cache hit.
[2023-03-08 04:18:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) p2), (OR (NOT p1) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
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=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1)), p0:(AND (GEQ s4 1) (GEQ s10 1)), p2:(AND (GEQ s5 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14468 reset in 97 ms.
Stack based approach found an accepted trace after 6 steps with 1 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 495 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(p1)&&p0) U p2)&&(G(p3)||G(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.
[2023-03-08 04:18:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:47] [INFO ] Invariant cache hit.
[2023-03-08 04:18:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 04:18:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:47] [INFO ] Invariant cache hit.
[2023-03-08 04:18:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-08 04:18:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:47] [INFO ] Invariant cache hit.
[2023-03-08 04:18:47] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 p3 (NOT p1)) (AND p0 p3 (NOT p1))), acceptance={} source=1 dest: 5}, { cond=(OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)), acceptance={} source=1 dest: 6}, { cond=(OR (AND p2 p3 p1) (AND p0 p3 p1)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 6}, { cond=(AND p3 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)), p0:(AND (GEQ s0 1) (GEQ s2 1)), p3:(AND (GEQ s0 1) (GEQ s2 1)), p1:(GEQ s8 1)], 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-07 finished in 592 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 3 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.
[2023-03-08 04:18:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:47] [INFO ] Invariant cache hit.
[2023-03-08 04:18:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 04:18:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:47] [INFO ] Invariant cache hit.
[2023-03-08 04:18:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:47] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 04:18:47] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:47] [INFO ] Invariant cache hit.
[2023-03-08 04:18:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s9 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 152 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-100000-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-100000-LTLFireability-08 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(F(p0)))'
Support contains 1 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.
[2023-03-08 04:18:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:48] [INFO ] Invariant cache hit.
[2023-03-08 04:18:48] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 04:18:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:48] [INFO ] Invariant cache hit.
[2023-03-08 04:18:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:48] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 04:18:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:48] [INFO ] Invariant cache hit.
[2023-03-08 04:18:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23931 reset in 120 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-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-09 finished in 383 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' '!(G(F((G((F(!p1)&&F(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 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 04:18:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:48] [INFO ] Invariant cache hit.
[2023-03-08 04:18:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 04:18:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:48] [INFO ] Invariant cache hit.
[2023-03-08 04:18:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 04:18:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 04:18:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:48] [INFO ] Invariant cache hit.
[2023-03-08 04:18:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s5 1) (LT s10 1)), p0:(OR (LT s0 1) (LT s8 1) (LT s12 1)), p1:(AND (GEQ s7 1) (GEQ s9 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 3005 reset in 154 ms.
Stack based approach found an accepted trace after 132 steps with 4 reset with depth 49 and stack size 37 in 1 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-10 finished in 446 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)||G(!p1)))'
Support contains 3 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.
[2023-03-08 04:18:49] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:49] [INFO ] Invariant cache hit.
[2023-03-08 04:18:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 04:18:49] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:49] [INFO ] Invariant cache hit.
[2023-03-08 04:18:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 04:18:49] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:49] [INFO ] Invariant cache hit.
[2023-03-08 04:18:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), p1]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s4 1) (GEQ s10 1)), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 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 : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-100000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-100000-LTLFireability-11 finished in 896 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(((p1 U X(p1))&&p0))||G((G(p1) U p2))))'
Support contains 3 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.
[2023-03-08 04:18:49] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:49] [INFO ] Invariant cache hit.
[2023-03-08 04:18:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 04:18:49] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:49] [INFO ] Invariant cache hit.
[2023-03-08 04:18:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 04:18:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:50] [INFO ] Invariant cache hit.
[2023-03-08 04:18:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1)), p1:(AND (GEQ s0 1) (GEQ s2 1)), p2:(OR (AND (GEQ s0 1) (GEQ s2 1)) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6051 reset in 219 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-12 finished in 851 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(G(!p0))))'
Support contains 1 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.
[2023-03-08 04:18:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:50] [INFO ] Invariant cache hit.
[2023-03-08 04:18:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 04:18:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:50] [INFO ] Invariant cache hit.
[2023-03-08 04:18:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:50] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 04:18:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:50] [INFO ] Invariant cache hit.
[2023-03-08 04:18:50] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, p0, p0, p0]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s7 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-13 finished in 477 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(X(X(G(!p0))))))))'
Support contains 1 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.
[2023-03-08 04:18:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:51] [INFO ] Invariant cache hit.
[2023-03-08 04:18:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 04:18:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:51] [INFO ] Invariant cache hit.
[2023-03-08 04:18:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-08 04:18:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:51] [INFO ] Invariant cache hit.
[2023-03-08 04:18:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : CircadianClock-PT-100000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(GEQ s7 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-14 finished in 506 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' '!(G((p0||X(((p1||F(G(!p2))) U (p0&&(p1||F(G(!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.
[2023-03-08 04:18:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:51] [INFO ] Invariant cache hit.
[2023-03-08 04:18:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 04:18:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:51] [INFO ] Invariant cache hit.
[2023-03-08 04:18:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:18:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 04:18:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 04:18:51] [INFO ] Invariant cache hit.
[2023-03-08 04:18:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) p2)), p2]
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 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s3 1) (GEQ s11 1)), p2:(GEQ s8 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 239 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 37 in 0 ms.
FORMULA CircadianClock-PT-100000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-100000-LTLFireability-15 finished in 601 ms.
All properties solved by simple procedures.
Total runtime 11869 ms.
ITS solved all properties within timeout

BK_STOP 1678249133498

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="lolaxred"
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 lolaxred"
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 r071-smll-167814397600140"
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 ;