Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 11K Apr 30 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 05:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652663749761

Running Version 202205111006
[2022-05-16 01:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:15:51] [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.
[2022-05-16 01:15:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:15:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2022-05-16 01:15:51] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:15:51] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2022-05-16 01:15:51] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 78 steps, including 3 resets, run visited all 7 properties in 30 ms. (steps per millisecond=2 )
[2022-05-16 01:15:51] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:15:51] [INFO ] Flatten gal took : 2 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 3
[2022-05-16 01:15:51] [INFO ] Unfolded HLPN to a Petri net with 38 places and 45 transitions 135 arcs in 8 ms.
[2022-05-16 01:15:51] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:51] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 01:15:51] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:51] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 01:15:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Support contains 38 out of 38 places after structural reductions.
[2022-05-16 01:15:52] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:15:52] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:15:52] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 13 properties in 6 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((G(X(p1))||p0)))))'
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 01:15:52] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 01:15:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s4 1) (GEQ s32 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-01 finished in 428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F((X(G(F((p1 U p2)))) U p2))||p0))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:52] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 01:15:53] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:53] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 01:15:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:53] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:53] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s17 1) (GEQ s19 1)) (AND (GEQ s16 1) (GEQ s19 1)) (AND (GEQ s18 1) (GEQ s19 1)) (AND (GEQ s15 1) (GEQ s19 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 233 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 3 factoid took 311 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLFireability-02 finished in 945 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(X(p0))))))'
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:53] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:53] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:53] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:53] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:54] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-03 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s35 1)) (AND (GEQ s4 1) (GEQ s32 1)) (A...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 17825 reset in 291 ms.
Product exploration explored 100000 steps with 17928 reset in 180 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:55] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 01:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:15:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 01:15:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:55] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-16 01:15:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:15:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 01:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:15:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 01:15:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-16 01:15:55] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 01:15:55] [INFO ] Added : 10 causal constraints over 2 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:55] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:55] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 01:15:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:55] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:56] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:56] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 01:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:15:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 01:15:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:56] [INFO ] [Real]Added 9 Read/Feed constraints in 14 ms returned sat
[2022-05-16 01:15:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:15:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 01:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:15:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 01:15:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-16 01:15:56] [INFO ] Computed and/alt/rep : 36/45/36 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 01:15:56] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17817 reset in 226 ms.
Product exploration explored 100000 steps with 17839 reset in 134 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-16 01:15:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:57] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Product exploration explored 100000 steps with 17810 reset in 267 ms.
Product exploration explored 100000 steps with 17824 reset in 241 ms.
Built C files in :
/tmp/ltsmin2434292426793117865
[2022-05-16 01:15:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2434292426793117865
Running compilation step : cd /tmp/ltsmin2434292426793117865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin2434292426793117865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2434292426793117865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13767349200362849513.hoa' '--buchi-type=spotba'
LTSmin run took 1055 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-03 finished in 5317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(G(p2) U p3)||p0)))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:59] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p2), (NOT p3)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1)), p3:(AND (OR (GEQ s16 1) (GEQ s17 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-04 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F(X(X(G(p1))))||p0)))))'
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:15:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:15:59] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 01:15:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:15:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:15:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s10 1) (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 1)), p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (G...], 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 3692 reset in 284 ms.
Stack based approach found an accepted trace after 5129 steps with 190 reset with depth 30 and stack size 30 in 15 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-05 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(X(X((F(p0)||G(p1))))))))'
Support contains 27 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:00] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:00] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-16 01:16:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p0:(AND (OR (LT s2 1) (LT s30 1)) (OR...], 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 4369 reset in 205 ms.
Stack based approach found an accepted trace after 8052 steps with 346 reset with depth 24 and stack size 24 in 19 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-07 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (F(p1)||!p0))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:00] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:00] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:00] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (G...], 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 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLFireability-10 finished in 579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p0)))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 ...], 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 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-11 finished in 187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||p1)))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:01] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s12 1) (LT s19 1)) (OR (LT s17 1) (LT s19 1)) (OR (LT s16 1) (LT s19 1)) (OR (LT s18 1) (LT s19 1)) (OR (LT s15 1) (LT s19 1)) (OR (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-12 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(p0)))))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 35 place count 12 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 12 transition count 28
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 46 place count 10 transition count 27
Applied a total of 46 rules in 11 ms. Remains 10 /38 variables (removed 28) and now considering 27/45 (removed 18) transitions.
// Phase 1: matrix 27 rows 10 cols
[2022-05-16 01:16:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 27 rows 10 cols
[2022-05-16 01:16:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 01:16:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 10 cols
[2022-05-16 01:16:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/38 places, 27/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/38 places, 27/45 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10733 reset in 164 ms.
Stack based approach found an accepted trace after 15 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-13 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (F(p1)&&!p2))))'
Support contains 28 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s1 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 122 steps with 10 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLFireability-14 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&X(G(F(!p1)))))||G(p2)||p0)))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:02] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:02] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:02] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 01:16:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:02] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:02] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-COL-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p2:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18326 reset in 146 ms.
Product exploration explored 100000 steps with 18393 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p2 p1 (NOT p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 472 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 387 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:03] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:03] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p2 p1 (NOT p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1 p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 956 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 18 out of 38 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 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 01:16:04] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:16:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-16 01:16:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 38 cols
[2022-05-16 01:16:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 01:16:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 18232 reset in 160 ms.
Product exploration explored 100000 steps with 18321 reset in 168 ms.
Built C files in :
/tmp/ltsmin532619058107199339
[2022-05-16 01:16:05] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2022-05-16 01:16:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:05] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2022-05-16 01:16:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:05] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2022-05-16 01:16:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin532619058107199339
Running compilation step : cd /tmp/ltsmin532619058107199339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin532619058107199339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin532619058107199339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8949122007314648811.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA CSRepetitions-COL-03-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-03-LTLFireability-15 finished in 3822 ms.
All properties solved by simple procedures.
Total runtime 14933 ms.

BK_STOP 1652663765944

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918700580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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