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-167814397600132.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-010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.8K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:36 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.7K 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.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:41 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-010000-LTLFireability-00
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-01
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-02
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-03
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-04
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-05
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-06
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-07
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-08
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-09
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-10
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-11
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-12
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-13
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-14
FORMULA_NAME CircadianClock-PT-010000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678245191259

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-010000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:13:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 03:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:13:14] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-08 03:13:14] [INFO ] Transformed 14 places.
[2023-03-08 03:13:14] [INFO ] Transformed 16 transitions.
[2023-03-08 03:13:14] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircadianClock-PT-010000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-LTLFireability-14 FALSE 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 18 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 03:13:15] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 03:13:15] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-08 03:13:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:15] [INFO ] Invariant cache hit.
[2023-03-08 03:13:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:15] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-08 03:13:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:15] [INFO ] Invariant cache hit.
[2023-03-08 03:13:15] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 03:13:15] [INFO ] Flatten gal took : 32 ms
[2023-03-08 03:13:15] [INFO ] Flatten gal took : 10 ms
[2023-03-08 03:13:15] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 03:13:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:15] [INFO ] Invariant cache hit.
[2023-03-08 03:13:16] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-08 03:13:16] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 03:13:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-08 03:13:16] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 03:13:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:16] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 03:13:16] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 03:13:16] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 250 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 489988 steps, run visited all 1 properties in 846 ms. (steps per millisecond=579 )
Probabilistic random walk after 489988 steps, saw 366290 distinct states, run finished after 846 ms. (steps per millisecond=579 ) properties seen :1
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(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 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:17] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:17] [INFO ] Invariant cache hit.
[2023-03-08 03:13:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 03:13:17] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:17] [INFO ] Invariant cache hit.
[2023-03-08 03:13:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-08 03:13:17] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:17] [INFO ] Invariant cache hit.
[2023-03-08 03:13:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 442 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-010000-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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (LT s8 1) (GEQ s7 1) (GEQ s9 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 3 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-00 finished in 677 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(F(p0))||G(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 3 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:18] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:18] [INFO ] Invariant cache hit.
[2023-03-08 03:13:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 03:13:18] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:18] [INFO ] Invariant cache hit.
[2023-03-08 03:13:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 03:13:18] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 03:13:18] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:18] [INFO ] Invariant cache hit.
[2023-03-08 03:13:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s0 1), p0:(OR (LT s2 1) (LT s11 1) (LT s0 1) (LT s2 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 0 reset in 743 ms.
Product exploration explored 100000 steps with 0 reset in 396 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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 03:13:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:20] [INFO ] Invariant cache hit.
[2023-03-08 03:13:20] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-010000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-010000-LTLFireability-02 finished in 2185 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' '!((((p0 U p1) U p2)||F(p0)))'
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 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:20] [INFO ] Invariant cache hit.
[2023-03-08 03:13:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 03:13:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:20] [INFO ] Invariant cache hit.
[2023-03-08 03:13:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-08 03:13:20] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-08 03:13:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:20] [INFO ] Invariant cache hit.
[2023-03-08 03:13:20] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)), p2:(GEQ s7 1), p1:(AND (GEQ s7 1) (GEQ s0 1) (GEQ s2 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, null][true, true]]
Product exploration explored 100000 steps with 4275 reset in 501 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-010000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-03 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U (p1||X(p1)))&&X(X(X(G(p2))))))'
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 03:13:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:21] [INFO ] Invariant cache hit.
[2023-03-08 03:13:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 03:13:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:21] [INFO ] Invariant cache hit.
[2023-03-08 03:13:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:21] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-08 03:13:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:21] [INFO ] Invariant cache hit.
[2023-03-08 03:13:21] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s13 1)), p0:(AND (GEQ s0 1) (GEQ s4 1)), p2:(OR (LT s3 1) (LT s11 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-04 finished in 543 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((!p0&&X(p1)&&F(p2))))'
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 03:13:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:21] [INFO ] Invariant cache hit.
[2023-03-08 03:13:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 03:13:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:21] [INFO ] Invariant cache hit.
[2023-03-08 03:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 03:13:22] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:22] [INFO ] Invariant cache hit.
[2023-03-08 03:13:22] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (NOT p1) p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s13 1)), p2:(AND (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14596 reset in 308 ms.
Stack based approach found an accepted trace after 16 steps with 3 reset with depth 3 and stack size 3 in 1 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-05 finished in 682 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 U p1) U X(G(p2)))||F(p3))))'
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 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:22] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:22] [INFO ] Invariant cache hit.
[2023-03-08 03:13:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:13:22] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:22] [INFO ] Invariant cache hit.
[2023-03-08 03:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:22] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 03:13:22] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:22] [INFO ] Invariant cache hit.
[2023-03-08 03:13:22] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p3) p2) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s9 1)), p0:(OR (LT s3 1) (LT s11 1)), p3:(AND (GEQ s6 1) (GEQ s13 1)), p2:(AND (GEQ s3 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 534 reset in 265 ms.
Stack based approach found an accepted trace after 50 steps with 10 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-06 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' '!((G(p0)||(X((p0||((p1 U p2) U G(p0)))) U G(p3))))'
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 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:23] [INFO ] Invariant cache hit.
[2023-03-08 03:13:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 03:13:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:23] [INFO ] Invariant cache hit.
[2023-03-08 03:13:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-08 03:13:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:23] [INFO ] Invariant cache hit.
[2023-03-08 03:13:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 691 ms :[(AND (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3)), true, (NOT p2), (NOT p0), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=3 dest: 10}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=6 dest: 6}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 4}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 5}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=9 dest: 10}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=10 dest: 5}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p0) p3), acceptance={} source=11 dest: 8}, { cond=(AND p0 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s10 1)), p3:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s12 1)), p2:(GEQ s7 1), p1:(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, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 188 steps with 0 reset in 1 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-08 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||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 03:13:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:24] [INFO ] Invariant cache hit.
[2023-03-08 03:13:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 03:13:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:24] [INFO ] Invariant cache hit.
[2023-03-08 03:13:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:24] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 03:13:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:24] [INFO ] Invariant cache hit.
[2023-03-08 03:13:24] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (GEQ s0 1) (GEQ s4 1))) (LT s6 1)), p0:(LT s6 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-10 finished in 316 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 4 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 03:13:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:24] [INFO ] Invariant cache hit.
[2023-03-08 03:13:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 03:13:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:24] [INFO ] Invariant cache hit.
[2023-03-08 03:13:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:24] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-08 03:13:24] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 03:13:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:24] [INFO ] Invariant cache hit.
[2023-03-08 03:13:24] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. 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-010000-LTLFireability-11 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 s3 1) (GEQ s13 1) (LT s8 1) (OR (LT s3 1) (LT s11 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 224 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-010000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-11 finished in 464 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)&&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 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:13:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:25] [INFO ] Invariant cache hit.
[2023-03-08 03:13:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 03:13:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:25] [INFO ] Invariant cache hit.
[2023-03-08 03:13:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:25] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 03:13:25] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 03:13:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:25] [INFO ] Invariant cache hit.
[2023-03-08 03:13:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s4 1) (GEQ s10 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 11017 reset in 181 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 16 in 0 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-13 finished in 539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0)) U 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 03:13:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:25] [INFO ] Invariant cache hit.
[2023-03-08 03:13:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 03:13:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:25] [INFO ] Invariant cache hit.
[2023-03-08 03:13:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:13:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-08 03:13:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:13:25] [INFO ] Invariant cache hit.
[2023-03-08 03:13:25] [INFO ] Dead Transitions using invariants and state equation in 44 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 160 ms :[p1, p1, p0]
Running random walk in product with property : CircadianClock-PT-010000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s10 1)), p0:(AND (GEQ s5 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 24279 reset in 272 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA CircadianClock-PT-010000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLFireability-15 finished in 602 ms.
All properties solved by simple procedures.
Total runtime 11678 ms.
ITS solved all properties within timeout

BK_STOP 1678245207357

--------------------
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-010000"
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-010000, 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-167814397600132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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