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

About the Execution of ITS-Tools for CSRepetitions-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
352.111 18189.00 35016.00 385.80 FFFFFFTFFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814395900060.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 itstools
Input is CSRepetitions-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814395900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 21K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 11:51 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 12K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 231K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 54K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 249K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 40K 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-PT-03-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678241512772

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 02:11:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 02:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:11:55] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 02:11:55] [INFO ] Transformed 58 places.
[2023-03-08 02:11:55] [INFO ] Transformed 81 transitions.
[2023-03-08 02:11:55] [INFO ] Parsed PT model containing 58 places and 81 transitions and 279 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-PT-03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 15 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2023-03-08 02:11:56] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-08 02:11:56] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 02:11:56] [INFO ] Invariant cache hit.
[2023-03-08 02:11:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-08 02:11:56] [INFO ] Invariant cache hit.
[2023-03-08 02:11:56] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 58/58 places, 81/81 transitions.
Support contains 58 out of 58 places after structural reductions.
[2023-03-08 02:11:56] [INFO ] Flatten gal took : 45 ms
[2023-03-08 02:11:56] [INFO ] Flatten gal took : 23 ms
[2023-03-08 02:11:56] [INFO ] Input system was already deterministic with 81 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:11:57] [INFO ] Invariant cache hit.
[2023-03-08 02:11:57] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CSRepetitions-PT-03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!X(X((p1 U F(p1)))) U p2))||p0)))'
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:57] [INFO ] Invariant cache hit.
[2023-03-08 02:11:57] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 02:11:57] [INFO ] Invariant cache hit.
[2023-03-08 02:11:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:58] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 02:11:58] [INFO ] Invariant cache hit.
[2023-03-08 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 530 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p2) p1), p1, true]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s16 1) (GEQ s33 1)) (AND (GEQ s2 1) (GEQ s56 1)) (AND (GEQ s47 1) (GEQ s56 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-03 finished in 903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 36 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:58] [INFO ] Invariant cache hit.
[2023-03-08 02:11:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 02:11:58] [INFO ] Invariant cache hit.
[2023-03-08 02:11:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-08 02:11:58] [INFO ] Invariant cache hit.
[2023-03-08 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-04 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 s12 1) (LT s44 1)) (OR (LT s32 1) (LT s49 1)) (OR (LT s18 1) (LT s49 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s29 1) (LT s31 1)) (OR (LT s0 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-04 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 18 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 16 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:59] [INFO ] Invariant cache hit.
[2023-03-08 02:11:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 02:11:59] [INFO ] Invariant cache hit.
[2023-03-08 02:11:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:59] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-08 02:11:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 02:11:59] [INFO ] Invariant cache hit.
[2023-03-08 02:11:59] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-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 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s16 1) (GEQ s2 1) (GEQ s21 1) (GEQ s38 1) (GEQ s41 1) (GEQ s8 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 1) (GEQ s36 1) (GEQ s53 1) (GEQ s55 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-05 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(F(p1)))) U p1))'
Support contains 12 out of 58 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 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:11:59] [INFO ] Invariant cache hit.
[2023-03-08 02:11:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 02:11:59] [INFO ] Invariant cache hit.
[2023-03-08 02:11:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:11:59] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 02:11:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:11:59] [INFO ] Invariant cache hit.
[2023-03-08 02:11:59] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s16 1) (GEQ s33 1)) (AND (GEQ s2 1) (GEQ s56 1)) (AND (GEQ s47 1) (GEQ s56 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18346 reset in 739 ms.
Product exploration explored 100000 steps with 18341 reset in 410 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2023-03-08 02:12:01] [INFO ] Invariant cache hit.
[2023-03-08 02:12:01] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-08 02:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:12:01] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 02:12:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:01] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-08 02:12:01] [INFO ] Computed and/alt/rep : 72/99/72 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-08 02:12:01] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 12 out of 58 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 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:12:01] [INFO ] Invariant cache hit.
[2023-03-08 02:12:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 02:12:01] [INFO ] Invariant cache hit.
[2023-03-08 02:12:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-08 02:12:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:12:02] [INFO ] Invariant cache hit.
[2023-03-08 02:12:02] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 58/58 places, 81/81 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
[2023-03-08 02:12:02] [INFO ] Invariant cache hit.
[2023-03-08 02:12:02] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-08 02:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:12:02] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-08 02:12:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:02] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-08 02:12:02] [INFO ] Computed and/alt/rep : 72/99/72 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-08 02:12:03] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18322 reset in 561 ms.
Product exploration explored 100000 steps with 18256 reset in 526 ms.
Built C files in :
/tmp/ltsmin12970282840223665254
[2023-03-08 02:12:04] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-08 02:12:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:12:04] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-08 02:12:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:12:04] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-08 02:12:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:12:04] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12970282840223665254
Running compilation step : cd /tmp/ltsmin12970282840223665254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin12970282840223665254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12970282840223665254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4621141589450775347.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-03-LTLFireability-06 finished in 5246 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||X((F(p2)&&p1)))))'
Support contains 46 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:12:04] [INFO ] Invariant cache hit.
[2023-03-08 02:12:04] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:12:04] [INFO ] Invariant cache hit.
[2023-03-08 02:12:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-08 02:12:05] [INFO ] Invariant cache hit.
[2023-03-08 02:12:05] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (OR (LT s13 1) (LT s48 1)) (OR (LT s17 1) (LT s48 1)) (OR (LT s31 1) (LT s48 1)) (OR (LT s0 1) (LT s48 1)) (OR (LT s10 1) (LT s48 1)) (OR (LT s5 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, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-07 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U G(p1))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:12:05] [INFO ] Invariant cache hit.
[2023-03-08 02:12:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 02:12:05] [INFO ] Invariant cache hit.
[2023-03-08 02:12:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:05] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-08 02:12:05] [INFO ] Invariant cache hit.
[2023-03-08 02:12:05] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s33 1)), p0:(AND (GEQ s0 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20814 reset in 396 ms.
Stack based approach found an accepted trace after 4509 steps with 943 reset with depth 5 and stack size 5 in 21 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-08 finished in 983 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)&&F((G(F(!p1))||(!p1&&X(!p2))))))'
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:12:06] [INFO ] Invariant cache hit.
[2023-03-08 02:12:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 02:12:06] [INFO ] Invariant cache hit.
[2023-03-08 02:12:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:06] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-08 02:12:06] [INFO ] Invariant cache hit.
[2023-03-08 02:12:06] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p1), (NOT p0), false, (AND p1 p2), p1, true]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s48 1) (GEQ s49 1)), p0:(AND (GEQ s33 1) (GEQ s38 1)), p2:(AND (GEQ s5 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-09 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F((F(G(p2))&&p1))))))'
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:12:07] [INFO ] Invariant cache hit.
[2023-03-08 02:12:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 02:12:07] [INFO ] Invariant cache hit.
[2023-03-08 02:12:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:07] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 02:12:07] [INFO ] Invariant cache hit.
[2023-03-08 02:12:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s37 1) (LT s48 1)), p1:(AND (GEQ s27 1) (GEQ s31 1)), p2:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-10 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)&&p1)))))'
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 46 transition count 75
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 33 place count 31 transition count 60
Iterating global reduction 0 with 15 rules applied. Total rules applied 48 place count 31 transition count 60
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 27 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 27 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 27 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 24 transition count 37
Applied a total of 66 rules in 27 ms. Remains 24 /58 variables (removed 34) and now considering 37/81 (removed 44) transitions.
[2023-03-08 02:12:07] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 24 cols
[2023-03-08 02:12:07] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 02:12:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 02:12:07] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2023-03-08 02:12:07] [INFO ] Invariant cache hit.
[2023-03-08 02:12:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 02:12:07] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 02:12:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:12:07] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2023-03-08 02:12:07] [INFO ] Invariant cache hit.
[2023-03-08 02:12:07] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/58 places, 37/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 24/58 places, 37/81 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s23 1) (GEQ s13 1) (GEQ s17 1)), p0:(AND (GEQ s0 1) (GEQ s1 1)), p2:(OR (LT s6 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 2 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-12 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(X(p0)&&(G((!p1&&(!p2||F(!p3))))||(!p1&&F(!p0)&&(!p2||F(!p3)))))))))'
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2023-03-08 02:12:08] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-08 02:12:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 02:12:08] [INFO ] Invariant cache hit.
[2023-03-08 02:12:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:08] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 02:12:08] [INFO ] Invariant cache hit.
[2023-03-08 02:12:08] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (NOT p0), true, (AND p3 (NOT p0)), p3]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p1 p3 p0) (AND p2 p3 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p2 p3 (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=p3, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s48 1)), p1:(AND (GEQ s18 1) (GEQ s49 1)), p3:(AND (GEQ s41 1) (GEQ s56 1)), p2:(AND (GEQ s41 1) (GEQ s50 1))], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-14 finished in 744 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||G(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-08 02:12:08] [INFO ] Invariant cache hit.
[2023-03-08 02:12:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 02:12:08] [INFO ] Invariant cache hit.
[2023-03-08 02:12:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 02:12:08] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 02:12:08] [INFO ] Invariant cache hit.
[2023-03-08 02:12:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LT s38 1), p0:(AND (GEQ s2 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4007 reset in 593 ms.
Stack based approach found an accepted trace after 16827 steps with 675 reset with depth 10 and stack size 10 in 53 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-15 finished in 1083 ms.
All properties solved by simple procedures.
Total runtime 14223 ms.

BK_STOP 1678241530961

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-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-5348"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-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 r069-smll-167814395900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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