fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r071-smll-167814397600115
Last Updated
May 14, 2023

About the Execution of LoLa+red for CircadianClock-PT-000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
307.720 15003.00 26569.00 553.60 FTFFFFFFFFFFFFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:34 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.5K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:38 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-000100-LTLCardinality-00
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-01
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-02
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-03
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-04
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-05
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-06
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-07
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-08
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-09
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-10
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-11
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-12
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-13
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-14
FORMULA_NAME CircadianClock-PT-000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678244238132

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-000100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 02:57:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 02:57:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:57:21] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 02:57:21] [INFO ] Transformed 14 places.
[2023-03-08 02:57:21] [INFO ] Transformed 16 transitions.
[2023-03-08 02:57:21] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircadianClock-PT-000100-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000100-LTLCardinality-12 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 02:57:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 02:57:21] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 02:57:21] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-08 02:57:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:21] [INFO ] Invariant cache hit.
[2023-03-08 02:57:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:21] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-08 02:57:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:21] [INFO ] Invariant cache hit.
[2023-03-08 02:57:21] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 02:57:22] [INFO ] Flatten gal took : 30 ms
[2023-03-08 02:57:22] [INFO ] Flatten gal took : 10 ms
[2023-03-08 02:57:22] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10049 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=109 ) properties (out of 27) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 02:57:22] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:22] [INFO ] Invariant cache hit.
[2023-03-08 02:57:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-08 02:57:22] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA CircadianClock-PT-000100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircadianClock-PT-000100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(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 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 02:57:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:23] [INFO ] Invariant cache hit.
[2023-03-08 02:57:23] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 02:57:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:23] [INFO ] Invariant cache hit.
[2023-03-08 02:57:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 02:57:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:23] [INFO ] Invariant cache hit.
[2023-03-08 02:57:23] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s12), p1:(GT s8 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-00 finished in 639 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(p1)||p0)))'
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 02:57:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:23] [INFO ] Invariant cache hit.
[2023-03-08 02:57:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 02:57:23] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:23] [INFO ] Invariant cache hit.
[2023-03-08 02:57:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 02:57:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:24] [INFO ] Invariant cache hit.
[2023-03-08 02:57:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s12 s10), p0:(OR (GT s11 s4) (LEQ s12 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 315 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-000100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-000100-LTLCardinality-01 finished in 1450 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))))'
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 02:57:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:25] [INFO ] Invariant cache hit.
[2023-03-08 02:57:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:57:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:25] [INFO ] Invariant cache hit.
[2023-03-08 02:57:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:25] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 02:57:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:25] [INFO ] Invariant cache hit.
[2023-03-08 02:57:25] [INFO ] Dead Transitions using invariants and state equation in 37 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 127 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s3 s9), p1:(LEQ 1 s0)], 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]]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Entered a terminal (fully accepting) state of product in 20646 steps with 0 reset in 128 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-02 finished in 819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 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 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 02:57:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:26] [INFO ] Invariant cache hit.
[2023-03-08 02:57:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 02:57:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:26] [INFO ] Invariant cache hit.
[2023-03-08 02:57:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 02:57:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:26] [INFO ] Invariant cache hit.
[2023-03-08 02:57:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6665 reset in 175 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 2 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-04 finished in 612 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 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 14 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 02:57:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:26] [INFO ] Invariant cache hit.
[2023-03-08 02:57:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 02:57:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:26] [INFO ] Invariant cache hit.
[2023-03-08 02:57:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 02:57:26] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-08 02:57:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:26] [INFO ] Invariant cache hit.
[2023-03-08 02:57:27] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 3 s1) (AND (GT s8 s1) (GT 3 s4)))], 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 386 ms.
Stack based approach found an accepted trace after 33147 steps with 0 reset with depth 33148 and stack size 28730 in 146 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-05 finished in 853 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))||G(p1)))'
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 02:57:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:27] [INFO ] Invariant cache hit.
[2023-03-08 02:57:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 02:57:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:27] [INFO ] Invariant cache hit.
[2023-03-08 02:57:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:27] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 02:57:27] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 02:57:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:27] [INFO ] Invariant cache hit.
[2023-03-08 02:57:27] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s9 s8), p0:(AND (GT s5 s1) (GT 2 s6))], 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 57 reset in 174 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-06 finished in 526 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))'
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 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:28] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-08 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] Dead Transitions using invariants and state equation in 34 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 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s3 s12)], 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-000100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-09 finished in 205 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(G(p0)) U 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 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:28] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-08 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s10), p0:(GT s7 s1)], 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 224 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 23 in 0 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-10 finished in 512 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||(p1 U X(X(G(p2))))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 02:57:28] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:28] [INFO ] Invariant cache hit.
[2023-03-08 02:57:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 02:57:29] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 02:57:29] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:29] [INFO ] Invariant cache hit.
[2023-03-08 02:57:29] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s13 s0), p2:(LEQ s1 s0)], 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 257 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 35 in 1 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-13 finished in 595 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)||(F(p1)&&X(!p2))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 02:57:29] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:29] [INFO ] Invariant cache hit.
[2023-03-08 02:57:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 02:57:29] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:29] [INFO ] Invariant cache hit.
[2023-03-08 02:57:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:29] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 02:57:29] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:29] [INFO ] Invariant cache hit.
[2023-03-08 02:57:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2), true, (NOT p0)]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s5 s13), p1:(OR (LEQ 2 s0) (LEQ 1 s7)), p2:(GT 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34715 reset in 166 ms.
Stack based approach found an accepted trace after 18 steps with 8 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CircadianClock-PT-000100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-000100-LTLCardinality-14 finished in 680 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&&(G(p0)||X(X(p1))))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 02:57:30] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:30] [INFO ] Invariant cache hit.
[2023-03-08 02:57:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 02:57:30] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:30] [INFO ] Invariant cache hit.
[2023-03-08 02:57:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 02:57:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-08 02:57:30] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:30] [INFO ] Invariant cache hit.
[2023-03-08 02:57:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircadianClock-PT-000100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s2 s9), p1:(LEQ s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28324 reset in 278 ms.
Product exploration explored 100000 steps with 28349 reset in 315 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 372 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10038 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:57:31] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 02:57:31] [INFO ] Invariant cache hit.
[2023-03-08 02:57:31] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:57:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 02:57:31] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-000100-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-000100-LTLCardinality-15 finished in 1841 ms.
All properties solved by simple procedures.
Total runtime 11130 ms.
ITS solved all properties within timeout

BK_STOP 1678244253135

--------------------
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 LTLCardinality -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-000100"
export BK_EXAMINATION="LTLCardinality"
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-000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397600115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000100.tgz
mv CircadianClock-PT-000100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;