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.r231-tall-167856415700188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is JoinFreeModules-PT-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 304K 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 JoinFreeModules-PT-0100-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679436436860

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 22:07:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:07:18] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-21 22:07:18] [INFO ] Transformed 501 places.
[2023-03-21 22:07:18] [INFO ] Transformed 801 transitions.
[2023-03-21 22:07:18] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Support contains 36 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 42 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 500 cols
[2023-03-21 22:07:18] [INFO ] Computed 100 place invariants in 19 ms
[2023-03-21 22:07:19] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2023-03-21 22:07:19] [INFO ] Invariant cache hit.
[2023-03-21 22:07:19] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-21 22:07:19] [INFO ] Invariant cache hit.
[2023-03-21 22:07:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:19] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-21 22:07:19] [INFO ] Invariant cache hit.
[2023-03-21 22:07:19] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1406 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 36 out of 500 places after structural reductions.
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 75 ms
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 34 ms
[2023-03-21 22:07:20] [INFO ] Input system was already deterministic with 801 transitions.
Support contains 35 out of 500 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10050 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 34) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-21 22:07:20] [INFO ] Invariant cache hit.
[2023-03-21 22:07:20] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2023-03-21 22:07:21] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-21 22:07:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-21 22:07:22] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-21 22:07:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:25] [INFO ] After 2565ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-21 22:07:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 6 ms to minimize.
[2023-03-21 22:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-21 22:07:29] [INFO ] After 6300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 3398 ms.
[2023-03-21 22:07:32] [INFO ] After 11169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Finished Parikh walk after 318 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=53 )
Parikh walk visited 18 properties in 2973 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X((p2 U !p0))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:35] [INFO ] Invariant cache hit.
[2023-03-21 22:07:36] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
[2023-03-21 22:07:36] [INFO ] Invariant cache hit.
[2023-03-21 22:07:36] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-21 22:07:36] [INFO ] Invariant cache hit.
[2023-03-21 22:07:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:36] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-21 22:07:36] [INFO ] Invariant cache hit.
[2023-03-21 22:07:36] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 444 ms :[p0, (AND (NOT p1) p0 (NOT p2)), p0, (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s318 4), p0:(GEQ s120 3), p2:(OR (GEQ s318 4) (LT s398 3))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1349 ms.
Product exploration explored 100000 steps with 50000 reset in 1361 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) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLFireability-00 finished in 4636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(F(p2)))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:40] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-21 22:07:40] [INFO ] Invariant cache hit.
[2023-03-21 22:07:41] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 883 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p2:(GEQ s375 3), p1:(GEQ s415 5), p0:(GEQ s286 2)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-01 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U X(p1)))||X(p0))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:41] [INFO ] Invariant cache hit.
[2023-03-21 22:07:41] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
[2023-03-21 22:07:41] [INFO ] Invariant cache hit.
[2023-03-21 22:07:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-21 22:07:41] [INFO ] Invariant cache hit.
[2023-03-21 22:07:42] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-21 22:07:42] [INFO ] Invariant cache hit.
[2023-03-21 22:07:42] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s174 5), p1:(GEQ s7 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33539 reset in 1437 ms.
Product exploration explored 100000 steps with 33379 reset in 1579 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Finished random walk after 5211 steps, including 1 resets, run visited all 3 properties in 23 ms. (steps per millisecond=226 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:46] [INFO ] Invariant cache hit.
[2023-03-21 22:07:47] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
[2023-03-21 22:07:47] [INFO ] Invariant cache hit.
[2023-03-21 22:07:47] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-21 22:07:47] [INFO ] Invariant cache hit.
[2023-03-21 22:07:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:47] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-21 22:07:47] [INFO ] Invariant cache hit.
[2023-03-21 22:07:47] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 848 ms. Remains : 500/500 places, 801/801 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) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10057 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=218 ) properties (out of 3) seen :2
Finished Best-First random walk after 1008 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 339 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 33273 reset in 1434 ms.
Product exploration explored 100000 steps with 33325 reset in 1560 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 40 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:52] [INFO ] Invariant cache hit.
[2023-03-21 22:07:52] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
[2023-03-21 22:07:52] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-21 22:07:52] [INFO ] Invariant cache hit.
[2023-03-21 22:07:52] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:52] [INFO ] Invariant cache hit.
[2023-03-21 22:07:53] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-21 22:07:53] [INFO ] Invariant cache hit.
[2023-03-21 22:07:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:07:53] [INFO ] Invariant cache hit.
[2023-03-21 22:07:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:53] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-21 22:07:53] [INFO ] Invariant cache hit.
[2023-03-21 22:07:53] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-02 finished in 12401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 26 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:53] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:54] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-21 22:07:54] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:54] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s383 4) (GEQ s58 4)), p1:(GEQ s60 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-03 finished in 950 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 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:55] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 819 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s365 3), p1:(GEQ s94 5)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-04 finished in 931 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((X((p0||F(p1)))||(p0&&(p2 U p3))))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:07:55] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:07:56] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-21 22:07:56] [INFO ] Invariant cache hit.
[2023-03-21 22:07:56] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s48 4), p3:(GEQ s283 3), p2:(GEQ s17 1), p1:(GEQ s382 2)], 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]]
Product exploration explored 100000 steps with 24917 reset in 1444 ms.
Product exploration explored 100000 steps with 25030 reset in 1544 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) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 411 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:08:00] [INFO ] Invariant cache hit.
[2023-03-21 22:08:00] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2023-03-21 22:08:01] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:08:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2023-03-21 22:08:02] [INFO ] After 748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:08:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:02] [INFO ] After 119ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:08:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-21 22:08:02] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-21 22:08:02] [INFO ] After 1231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4835 steps, including 0 resets, run visited all 2 properties in 116 ms. (steps per millisecond=41 )
Parikh walk visited 2 properties in 116 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 645 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:03] [INFO ] Invariant cache hit.
[2023-03-21 22:08:03] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
[2023-03-21 22:08:03] [INFO ] Invariant cache hit.
[2023-03-21 22:08:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 22:08:03] [INFO ] Invariant cache hit.
[2023-03-21 22:08:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:04] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-21 22:08:04] [INFO ] Invariant cache hit.
[2023-03-21 22:08:04] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 836 ms. Remains : 500/500 places, 801/801 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 p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 450 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10033 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:08:05] [INFO ] Invariant cache hit.
[2023-03-21 22:08:05] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-21 22:08:05] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:08:05] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2023-03-21 22:08:06] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:08:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:06] [INFO ] After 88ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:08:06] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-21 22:08:06] [INFO ] After 1109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4901 steps, including 0 resets, run visited all 2 properties in 79 ms. (steps per millisecond=62 )
Parikh walk visited 2 properties in 79 ms.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 525 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 25033 reset in 1505 ms.
Product exploration explored 100000 steps with 24883 reset in 1645 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 28 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:11] [INFO ] Invariant cache hit.
[2023-03-21 22:08:12] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
[2023-03-21 22:08:12] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:08:12] [INFO ] Invariant cache hit.
[2023-03-21 22:08:12] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 570 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:12] [INFO ] Invariant cache hit.
[2023-03-21 22:08:12] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
[2023-03-21 22:08:12] [INFO ] Invariant cache hit.
[2023-03-21 22:08:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-21 22:08:12] [INFO ] Invariant cache hit.
[2023-03-21 22:08:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:12] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-21 22:08:12] [INFO ] Invariant cache hit.
[2023-03-21 22:08:13] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-05 finished in 17508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:13] [INFO ] Invariant cache hit.
[2023-03-21 22:08:13] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
[2023-03-21 22:08:13] [INFO ] Invariant cache hit.
[2023-03-21 22:08:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-21 22:08:13] [INFO ] Invariant cache hit.
[2023-03-21 22:08:13] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:13] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-21 22:08:13] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 22:08:13] [INFO ] Invariant cache hit.
[2023-03-21 22:08:14] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, true, p0]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s424 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1416 steps with 0 reset in 51 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-06 finished in 994 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(X(G(p1)))||p0)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:14] [INFO ] Invariant cache hit.
[2023-03-21 22:08:14] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
[2023-03-21 22:08:14] [INFO ] Invariant cache hit.
[2023-03-21 22:08:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-21 22:08:14] [INFO ] Invariant cache hit.
[2023-03-21 22:08:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:14] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-21 22:08:14] [INFO ] Invariant cache hit.
[2023-03-21 22:08:15] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (GEQ s117 2) (GEQ s330 3)), p1:(AND (LT s330 3) (LT s117 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1241 ms.
Product exploration explored 100000 steps with 50000 reset in 1333 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLFireability-07 finished in 3873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:18] [INFO ] Invariant cache hit.
[2023-03-21 22:08:18] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
[2023-03-21 22:08:18] [INFO ] Invariant cache hit.
[2023-03-21 22:08:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 22:08:18] [INFO ] Invariant cache hit.
[2023-03-21 22:08:18] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:18] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-21 22:08:18] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:08:18] [INFO ] Invariant cache hit.
[2023-03-21 22:08:18] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 831 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s389 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-08 finished in 875 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)||X(X(p1)))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:18] [INFO ] Invariant cache hit.
[2023-03-21 22:08:19] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-21 22:08:19] [INFO ] Invariant cache hit.
[2023-03-21 22:08:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-21 22:08:19] [INFO ] Invariant cache hit.
[2023-03-21 22:08:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:19] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-21 22:08:19] [INFO ] Invariant cache hit.
[2023-03-21 22:08:19] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(GEQ s20 3), p0:(GEQ s445 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-09 finished in 1063 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&&F(G(p1))) U (G((p0&&F(G(p1))))||(p0&&X((G(!p2)&&F(G(p1))))))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:20] [INFO ] Invariant cache hit.
[2023-03-21 22:08:20] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
[2023-03-21 22:08:20] [INFO ] Invariant cache hit.
[2023-03-21 22:08:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 22:08:20] [INFO ] Invariant cache hit.
[2023-03-21 22:08:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:20] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-21 22:08:20] [INFO ] Invariant cache hit.
[2023-03-21 22:08:20] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 822 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (AND (NOT p0) p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={1} source=1 dest: 3}], [{ cond=p1, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(LT s225 3), p1:(LT s182 1), p2:(GEQ s375 3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-10 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(G((F(p0)&&(!p0 U G(p1))))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:21] [INFO ] Invariant cache hit.
[2023-03-21 22:08:21] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
[2023-03-21 22:08:21] [INFO ] Invariant cache hit.
[2023-03-21 22:08:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-21 22:08:21] [INFO ] Invariant cache hit.
[2023-03-21 22:08:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:21] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-21 22:08:21] [INFO ] Invariant cache hit.
[2023-03-21 22:08:21] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s150 5), p1:(LT s201 2)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-11 finished in 1058 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(X((p0||F((G(!p0)||G(F(p1)))))))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:22] [INFO ] Invariant cache hit.
[2023-03-21 22:08:22] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
[2023-03-21 22:08:22] [INFO ] Invariant cache hit.
[2023-03-21 22:08:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-21 22:08:22] [INFO ] Invariant cache hit.
[2023-03-21 22:08:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:22] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-21 22:08:22] [INFO ] Invariant cache hit.
[2023-03-21 22:08:22] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 819 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 265 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GEQ s380 5), p1:(GEQ s193 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 3453 ms.
Stack based approach found an accepted trace after 16011 steps with 9 reset with depth 1582 and stack size 1580 in 520 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-12 finished in 5079 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(p1)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:27] [INFO ] Invariant cache hit.
[2023-03-21 22:08:27] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
[2023-03-21 22:08:27] [INFO ] Invariant cache hit.
[2023-03-21 22:08:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:08:27] [INFO ] Invariant cache hit.
[2023-03-21 22:08:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:27] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-21 22:08:27] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:08:27] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 846 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s348 3), p1:(GEQ s234 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-13 finished in 1052 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((p1&&G(p2))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:28] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-21 22:08:28] [INFO ] Invariant cache hit.
[2023-03-21 22:08:29] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 826 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-14 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(GEQ s155 5), p2:(LT s485 5), p1:(GEQ s242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-14 finished in 991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:29] [INFO ] Invariant cache hit.
[2023-03-21 22:08:29] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
[2023-03-21 22:08:29] [INFO ] Invariant cache hit.
[2023-03-21 22:08:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-21 22:08:29] [INFO ] Invariant cache hit.
[2023-03-21 22:08:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:29] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-21 22:08:29] [INFO ] Invariant cache hit.
[2023-03-21 22:08:30] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s12 2) (GEQ s225 5))], 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 33333 reset in 1295 ms.
Product exploration explored 100000 steps with 33333 reset in 1381 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 36 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0100-LTLFireability-15 finished in 3811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U X(p1)))||X(p0))))'
Found a Shortening insensitive property : JoinFreeModules-PT-0100-LTLFireability-02
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:33] [INFO ] Invariant cache hit.
[2023-03-21 22:08:33] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
[2023-03-21 22:08:33] [INFO ] Invariant cache hit.
[2023-03-21 22:08:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:08:33] [INFO ] Invariant cache hit.
[2023-03-21 22:08:33] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:33] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-21 22:08:33] [INFO ] Invariant cache hit.
[2023-03-21 22:08:34] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 850 ms. Remains : 500/500 places, 801/801 transitions.
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s174 5), p1:(GEQ s7 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33337 reset in 1355 ms.
Product exploration explored 100000 steps with 33444 reset in 1458 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Finished random walk after 8655 steps, including 2 resets, run visited all 3 properties in 54 ms. (steps per millisecond=160 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:38] [INFO ] Invariant cache hit.
[2023-03-21 22:08:38] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
[2023-03-21 22:08:38] [INFO ] Invariant cache hit.
[2023-03-21 22:08:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:08:38] [INFO ] Invariant cache hit.
[2023-03-21 22:08:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:38] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-21 22:08:38] [INFO ] Invariant cache hit.
[2023-03-21 22:08:39] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 500/500 places, 801/801 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) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Finished random walk after 5606 steps, including 1 resets, run visited all 3 properties in 36 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 33297 reset in 1327 ms.
Product exploration explored 100000 steps with 33342 reset in 1444 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:43] [INFO ] Invariant cache hit.
[2023-03-21 22:08:43] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-21 22:08:43] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:08:43] [INFO ] Invariant cache hit.
[2023-03-21 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:44] [INFO ] Invariant cache hit.
[2023-03-21 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
[2023-03-21 22:08:44] [INFO ] Invariant cache hit.
[2023-03-21 22:08:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 22:08:44] [INFO ] Invariant cache hit.
[2023-03-21 22:08:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:44] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-21 22:08:44] [INFO ] Invariant cache hit.
[2023-03-21 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 818 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-02 finished in 11860 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((X((p0||F(p1)))||(p0&&(p2 U p3))))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0100-LTLFireability-05
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:45] [INFO ] Invariant cache hit.
[2023-03-21 22:08:45] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
[2023-03-21 22:08:45] [INFO ] Invariant cache hit.
[2023-03-21 22:08:45] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-21 22:08:45] [INFO ] Invariant cache hit.
[2023-03-21 22:08:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:45] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-21 22:08:45] [INFO ] Invariant cache hit.
[2023-03-21 22:08:45] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 837 ms. Remains : 500/500 places, 801/801 transitions.
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s48 4), p3:(GEQ s283 3), p2:(GEQ s17 1), p1:(GEQ s382 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24975 reset in 1400 ms.
Product exploration explored 100000 steps with 24981 reset in 1511 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) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 407 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10036 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=159 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:08:49] [INFO ] Invariant cache hit.
[2023-03-21 22:08:50] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-21 22:08:50] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:08:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2023-03-21 22:08:51] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:08:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:51] [INFO ] After 119ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:08:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-21 22:08:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-21 22:08:51] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-21 22:08:51] [INFO ] After 1254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4720 steps, including 0 resets, run visited all 2 properties in 92 ms. (steps per millisecond=51 )
Parikh walk visited 2 properties in 92 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 p1), (X (NOT (AND p0 (NOT p3) p2))), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 658 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:52] [INFO ] Invariant cache hit.
[2023-03-21 22:08:53] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-21 22:08:53] [INFO ] Invariant cache hit.
[2023-03-21 22:08:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-21 22:08:53] [INFO ] Invariant cache hit.
[2023-03-21 22:08:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:08:53] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-21 22:08:53] [INFO ] Invariant cache hit.
[2023-03-21 22:08:53] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 500/500 places, 801/801 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 p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 471 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Finished random walk after 4054 steps, including 1 resets, run visited all 8 properties in 21 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (NOT p0))), true, (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 586 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 25000 reset in 1428 ms.
Product exploration explored 100000 steps with 25002 reset in 1521 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:59] [INFO ] Invariant cache hit.
[2023-03-21 22:08:59] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-21 22:08:59] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:08:59] [INFO ] Invariant cache hit.
[2023-03-21 22:08:59] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-21 22:08:59] [INFO ] Invariant cache hit.
[2023-03-21 22:08:59] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
[2023-03-21 22:08:59] [INFO ] Invariant cache hit.
[2023-03-21 22:08:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:08:59] [INFO ] Invariant cache hit.
[2023-03-21 22:09:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-21 22:09:00] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-21 22:09:00] [INFO ] Invariant cache hit.
[2023-03-21 22:09:00] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-05 finished in 15606 ms.
[2023-03-21 22:09:00] [INFO ] Flatten gal took : 32 ms
[2023-03-21 22:09:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 22:09:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 801 transitions and 2300 arcs took 12 ms.
Total runtime 102277 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-0100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1679436602005

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 JoinFreeModules-PT-0100-LTLFireability-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 6/32 JoinFreeModules-PT-0100-LTLFireability-05 898790 m, 179758 m/sec, 1350792 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 12/32 JoinFreeModules-PT-0100-LTLFireability-05 1784111 m, 177064 m/sec, 2681289 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 18/32 JoinFreeModules-PT-0100-LTLFireability-05 2665752 m, 176328 m/sec, 4006278 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 24/32 JoinFreeModules-PT-0100-LTLFireability-05 3544929 m, 175835 m/sec, 5327556 t fired, .

Time elapsed: 20 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 29/32 JoinFreeModules-PT-0100-LTLFireability-05 4422897 m, 175593 m/sec, 6647133 t fired, .

Time elapsed: 25 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for JoinFreeModules-PT-0100-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-0100-LTLFireability-02
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3570 6/32 JoinFreeModules-PT-0100-LTLFireability-02 887605 m, 177521 m/sec, 1333979 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3570 12/32 JoinFreeModules-PT-0100-LTLFireability-02 1749997 m, 172478 m/sec, 2629996 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3570 18/32 JoinFreeModules-PT-0100-LTLFireability-02 2600813 m, 170163 m/sec, 3908750 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3570 23/32 JoinFreeModules-PT-0100-LTLFireability-02 3453714 m, 170580 m/sec, 5190470 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3570 29/32 JoinFreeModules-PT-0100-LTLFireability-02 4303959 m, 170049 m/sec, 6468329 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for JoinFreeModules-PT-0100-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0100-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-0100-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0100-LTLFireability-02: LTL unknown AGGR
JoinFreeModules-PT-0100-LTLFireability-05: LTL unknown AGGR


Time elapsed: 60 secs. Pages in use: 32

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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is JoinFreeModules-PT-0100, 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 r231-tall-167856415700188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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