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.r073-smll-167814399000004.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 ltsminxred
Input is CSRepetitions-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399000004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 8.4K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 CSRepetitions-COL-02-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678218677117

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-07 19:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 19:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:51:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-07 19:51:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 19:51:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 688 ms
[2023-03-07 19:51:21] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 19:51:21] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 7 ms.
[2023-03-07 19:51:21] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 9 steps, including 0 resets, run visited all 9 properties in 14 ms. (steps per millisecond=0 )
[2023-03-07 19:51:21] [INFO ] Flatten gal took : 25 ms
[2023-03-07 19:51:21] [INFO ] Flatten gal took : 4 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 2
[2023-03-07 19:51:21] [INFO ] Unfolded HLPN to a Petri net with 18 places and 20 transitions 60 arcs in 12 ms.
[2023-03-07 19:51:21] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 12 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-07 19:51:21] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-07 19:51:21] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-07 19:51:21] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 18/18 places, 20/20 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-03-07 19:51:22] [INFO ] Flatten gal took : 7 ms
[2023-03-07 19:51:22] [INFO ] Flatten gal took : 12 ms
[2023-03-07 19:51:22] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 69 steps, including 4 resets, run visited all 13 properties in 9 ms. (steps per millisecond=7 )
FORMULA CSRepetitions-COL-02-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-COL-02-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-COL-02-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 4 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(G(p0))||G(p1)))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 689 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s0 1) (LT s2 1))), p0:(AND (OR (LT s2 1) (LT s15 1)) (OR (LT 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-00 finished in 955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(X(!p1)))))'
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:23] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 448 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s15 1)) (OR (LT s4 1) (LT s17 1)) (OR (LT s1 1) (LT s14 1)) (OR (LT s3 1) (LT s16 1))), p1:(AND (OR (LT s5 1) (LT s9 1)) (OR (LT...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21428 reset in 564 ms.
Product exploration explored 100000 steps with 21365 reset in 303 ms.
Computed a total of 0 stabilizing places and 4 stable transitions
Computed a total of 0 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 337 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 19 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 389 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 393 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
[2023-03-07 19:51:27] [INFO ] Invariant cache hit.
[2023-03-07 19:51:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-07 19:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:51:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-07 19:51:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:51:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-07 19:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:51:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-07 19:51:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:51:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:51:27] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG p1
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:27] [INFO ] Invariant cache hit.
[2023-03-07 19:51:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-07 19:51:27] [INFO ] Invariant cache hit.
[2023-03-07 19:51:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-07 19:51:27] [INFO ] Invariant cache hit.
[2023-03-07 19:51:27] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 18/18 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 4 stable transitions
Computed a total of 0 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 30 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 406 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
[2023-03-07 19:51:29] [INFO ] Invariant cache hit.
[2023-03-07 19:51:29] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-07 19:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 19:51:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-07 19:51:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 19:51:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-07 19:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 19:51:29] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-07 19:51:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:29] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-07 19:51:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-07 19:51:29] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 396 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 21369 reset in 210 ms.
Product exploration explored 100000 steps with 21392 reset in 138 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 267 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:51:30] [INFO ] Invariant cache hit.
[2023-03-07 19:51:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 18/18 places, 20/20 transitions.
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:30] [INFO ] Invariant cache hit.
[2023-03-07 19:51:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-07 19:51:30] [INFO ] Invariant cache hit.
[2023-03-07 19:51:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:30] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-07 19:51:30] [INFO ] Invariant cache hit.
[2023-03-07 19:51:30] [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 : 18/18 places, 20/20 transitions.
Treatment of property CSRepetitions-COL-02-LTLFireability-03 finished in 7286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (G(!p0) U X(X(p1)))))'
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:30] [INFO ] Invariant cache hit.
[2023-03-07 19:51:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1)), p1:(AND (OR (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1)) (OR (AND (GEQ s2 1) (GEQ s15 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 13 reset in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-05 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)||(G(p0)&&F(p1))))'
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:31] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, p0, (AND p0 (NOT p1)), false, (NOT p0), (AND p0 (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(AND (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1)), p1:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s0 1) (LT s2 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-06 finished in 493 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)))||(X(X(F((F(p0)&&p2))))&&F(p3))))'
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:32] [INFO ] Invariant cache hit.
[2023-03-07 19:51:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 19:51:32] [INFO ] Invariant cache hit.
[2023-03-07 19:51:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-07 19:51:32] [INFO ] Invariant cache hit.
[2023-03-07 19:51:32] [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 : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 580 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(NOT p3), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(OR (AND (LT s10 1) (LT s11 1) (LT s12 1) (LT s13 1)) (AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s0 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12196 reset in 336 ms.
Stack based approach found an accepted trace after 880 steps with 107 reset with depth 7 and stack size 7 in 4 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-07 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0) U !p1)))'
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:33] [INFO ] Invariant cache hit.
[2023-03-07 19:51:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-07 19:51:33] [INFO ] Invariant cache hit.
[2023-03-07 19:51:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-07 19:51:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:33] [INFO ] Invariant cache hit.
[2023-03-07 19:51:33] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 182 ms :[p1, p0, p1]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s15 1)) (OR (LT s4 1) (LT s17 1)) (OR (LT s1 1) (LT s14 1)) (OR (LT s3 1) (LT s16 1))), p0:(AND (OR (LT s5 1) (LT s9 1)) (OR (LT...], 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]]
Stuttering criterion allowed to conclude after 304 steps with 64 reset in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-08 finished in 361 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 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:33] [INFO ] Invariant cache hit.
[2023-03-07 19:51:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 19:51:33] [INFO ] Invariant cache hit.
[2023-03-07 19:51:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:33] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-07 19:51:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:51:33] [INFO ] Invariant cache hit.
[2023-03-07 19:51:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s5 1) (LT s9 1)) (OR (LT s6 1) (LT s9 1)) (OR (LT s8 1) (LT s9 1)) (OR (LT s7 1) (LT s9 1))), p0:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT 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 12615 reset in 477 ms.
Stack based approach found an accepted trace after 31 steps with 4 reset with depth 6 and stack size 6 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-09 finished in 782 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 U (!p2 U G(!p1))))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:34] [INFO ] Invariant cache hit.
[2023-03-07 19:51:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-07 19:51:34] [INFO ] Invariant cache hit.
[2023-03-07 19:51:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-07 19:51:34] [INFO ] Invariant cache hit.
[2023-03-07 19:51:34] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 241 ms :[p1, p1, true, p1, p1, p1]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1)), p0:(AND (OR (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1)) (NOT (OR (AND (GEQ s2 1) (GEQ s15 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-10 finished in 420 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&&G(F(p0))) U p0)))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 10 transition count 16
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 7 transition count 13
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 7 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 5 transition count 12
Applied a total of 21 rules in 13 ms. Remains 5 /18 variables (removed 13) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 5 cols
[2023-03-07 19:51:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 19:51:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-07 19:51:34] [INFO ] Invariant cache hit.
[2023-03-07 19:51:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-07 19:51:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:34] [INFO ] Invariant cache hit.
[2023-03-07 19:51:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/18 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 5/18 places, 12/20 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 16122 reset in 177 ms.
Stack based approach found an accepted trace after 236 steps with 37 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-11 finished in 429 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)||G(p1))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-07 19:51:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 19:51:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-07 19:51:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [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 139 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s10 1) (LT s11 1) (LT s12 1) (LT s13 1)), p1:(AND (OR (LT s5 1) (LT s9 1)) (OR (LT s6 1) (LT s9 1)) (OR (LT s8 1) (LT s9 1)) (OR (LT s7 1) (LT...], nbAcceptance=2, 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 6218 reset in 359 ms.
Stack based approach found an accepted trace after 479 steps with 32 reset with depth 8 and stack size 8 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-12 finished in 577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!p1)||p0)))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-13 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=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s2 1))), p1:(AND (OR (LT s0 1) (LT s4 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-13 finished in 312 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 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 10 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:36] [INFO ] Invariant cache hit.
[2023-03-07 19:51:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-07 19:51:36] [INFO ] Invariant cache hit.
[2023-03-07 19:51:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-07 19:51:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:36] [INFO ] Invariant cache hit.
[2023-03-07 19:51:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 50 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s0 1) (LT s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-14 finished in 228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(X(!p1)))))'
[2023-03-07 19:51:36] [INFO ] Flatten gal took : 6 ms
[2023-03-07 19:51:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-07 19:51:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 20 transitions and 60 arcs took 0 ms.
Total runtime 16077 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1208/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CSRepetitions-COL-02-LTLFireability-03

BK_STOP 1678218698226

--------------------
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
mcc2023
ltl formula name CSRepetitions-COL-02-LTLFireability-03
ltl formula formula --ltl=/tmp/1208/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 18 places, 20 transitions and 60 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1208/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="CSRepetitions-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CSRepetitions-COL-02, 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 r073-smll-167814399000004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;