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-167856415700196.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-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 613K 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-0200-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679436918971

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-0200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 22:15:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:15:20] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-21 22:15:20] [INFO ] Transformed 1001 places.
[2023-03-21 22:15:20] [INFO ] Transformed 1601 transitions.
[2023-03-21 22:15:20] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 83 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-21 22:15:20] [INFO ] Computed 200 place invariants in 20 ms
[2023-03-21 22:15:21] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
[2023-03-21 22:15:21] [INFO ] Invariant cache hit.
[2023-03-21 22:15:21] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-21 22:15:21] [INFO ] Invariant cache hit.
[2023-03-21 22:15:22] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:22] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-21 22:15:22] [INFO ] Invariant cache hit.
[2023-03-21 22:15:23] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2416 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 31 out of 1000 places after structural reductions.
[2023-03-21 22:15:23] [INFO ] Flatten gal took : 109 ms
[2023-03-21 22:15:23] [INFO ] Flatten gal took : 57 ms
[2023-03-21 22:15:23] [INFO ] Input system was already deterministic with 1601 transitions.
Support contains 30 out of 1000 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10148 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=79 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-21 22:15:24] [INFO ] Invariant cache hit.
[2023-03-21 22:15:24] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-21 22:15:25] [INFO ] After 1446ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-21 22:15:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-21 22:15:33] [INFO ] After 7374ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2023-03-21 22:15:33] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:39] [INFO ] After 6400ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :1 sat :20
[2023-03-21 22:15:48] [INFO ] After 15157ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 1762 ms.
[2023-03-21 22:15:50] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Finished Parikh walk after 891 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=34 )
Parikh walk visited 20 properties in 17122 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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' '!(X((X(F(p0))&&(p0||F(G(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 27 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:08] [INFO ] Invariant cache hit.
[2023-03-21 22:16:08] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
[2023-03-21 22:16:08] [INFO ] Invariant cache hit.
[2023-03-21 22:16:08] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-21 22:16:08] [INFO ] Invariant cache hit.
[2023-03-21 22:16:09] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:09] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-21 22:16:09] [INFO ] Invariant cache hit.
[2023-03-21 22:16:10] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1989 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s182 1), p1:(GEQ s847 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3210 ms.
Product exploration explored 100000 steps with 33333 reset in 3273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLFireability-00 finished in 10592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(F(p2)&&G(F(p3)))))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 66 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:18] [INFO ] Invariant cache hit.
[2023-03-21 22:16:19] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
[2023-03-21 22:16:19] [INFO ] Invariant cache hit.
[2023-03-21 22:16:19] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-21 22:16:19] [INFO ] Invariant cache hit.
[2023-03-21 22:16:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:19] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-21 22:16:20] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-21 22:16:20] [INFO ] Invariant cache hit.
[2023-03-21 22:16:20] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2093 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s912 2), p2:(GEQ s568 3), p3:(OR (GEQ s547 2) (GEQ s872 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 90420 steps with 0 reset in 10001 ms.
Product exploration timeout after 86600 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10070 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:16:43] [INFO ] Invariant cache hit.
[2023-03-21 22:16:43] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-21 22:16:43] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:16:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-21 22:16:44] [INFO ] After 1465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:45] [INFO ] After 205ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:45] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-21 22:16:45] [INFO ] After 2276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17315 steps, including 0 resets, run visited all 1 properties in 375 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 375 ms.
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 5 factoid took 360 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 78 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:46] [INFO ] Invariant cache hit.
[2023-03-21 22:16:47] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
[2023-03-21 22:16:47] [INFO ] Invariant cache hit.
[2023-03-21 22:16:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-21 22:16:47] [INFO ] Invariant cache hit.
[2023-03-21 22:16:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:47] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-21 22:16:47] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-21 22:16:47] [INFO ] Invariant cache hit.
[2023-03-21 22:16:48] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2040 ms. Remains : 1000/1000 places, 1601/1601 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 p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10075 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=118 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:16:50] [INFO ] Invariant cache hit.
[2023-03-21 22:16:50] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:16:50] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:16:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-21 22:16:52] [INFO ] After 1426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:52] [INFO ] After 471ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:52] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-21 22:16:53] [INFO ] After 2423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17385 steps, including 0 resets, run visited all 1 properties in 361 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 360 ms.
Knowledge obtained : [(AND (NOT p2) p1 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Product exploration timeout after 92150 steps with 0 reset in 10001 ms.
Product exploration timeout after 89010 steps with 0 reset in 10001 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 43 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:17:14] [INFO ] Invariant cache hit.
[2023-03-21 22:17:14] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
[2023-03-21 22:17:14] [INFO ] Invariant cache hit.
[2023-03-21 22:17:14] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-21 22:17:14] [INFO ] Invariant cache hit.
[2023-03-21 22:17:15] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:15] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-21 22:17:15] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-21 22:17:15] [INFO ] Invariant cache hit.
[2023-03-21 22:17:15] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1859 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-01 finished in 57482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((F(p1)&&X(G(!p0)))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:17:16] [INFO ] Invariant cache hit.
[2023-03-21 22:17:16] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2023-03-21 22:17:16] [INFO ] Invariant cache hit.
[2023-03-21 22:17:16] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-21 22:17:16] [INFO ] Invariant cache hit.
[2023-03-21 22:17:17] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:17] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-21 22:17:17] [INFO ] Invariant cache hit.
[2023-03-21 22:17:17] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s52 2), p1:(GEQ s626 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-02 finished in 2084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:17:18] [INFO ] Invariant cache hit.
[2023-03-21 22:17:18] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
[2023-03-21 22:17:18] [INFO ] Invariant cache hit.
[2023-03-21 22:17:18] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-21 22:17:18] [INFO ] Invariant cache hit.
[2023-03-21 22:17:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:19] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-21 22:17:19] [INFO ] Invariant cache hit.
[2023-03-21 22:17:20] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1886 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s453 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2210 steps with 0 reset in 150 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-03 finished in 2131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G((p1&&X(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:17:20] [INFO ] Invariant cache hit.
[2023-03-21 22:17:20] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
[2023-03-21 22:17:20] [INFO ] Invariant cache hit.
[2023-03-21 22:17:21] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-21 22:17:21] [INFO ] Invariant cache hit.
[2023-03-21 22:17:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:21] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-21 22:17:21] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 22:17:21] [INFO ] Invariant cache hit.
[2023-03-21 22:17:22] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1930 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LT s300 3), p0:(GEQ s622 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 90520 steps with 0 reset in 10001 ms.
Product exploration timeout after 86760 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:17:44] [INFO ] Invariant cache hit.
[2023-03-21 22:17:44] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:17:45] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:17:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-21 22:17:47] [INFO ] After 1946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:17:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:48] [INFO ] After 571ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:17:48] [INFO ] After 962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 368 ms.
[2023-03-21 22:17:49] [INFO ] After 3501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 17447 steps, including 0 resets, run visited all 1 properties in 397 ms. (steps per millisecond=43 )
Parikh walk visited 3 properties in 1304 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLFireability-04 finished in 30333 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(G(p0))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:17:50] [INFO ] Invariant cache hit.
[2023-03-21 22:17:51] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2023-03-21 22:17:51] [INFO ] Invariant cache hit.
[2023-03-21 22:17:51] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-21 22:17:51] [INFO ] Invariant cache hit.
[2023-03-21 22:17:51] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:51] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-21 22:17:51] [INFO ] Invariant cache hit.
[2023-03-21 22:17:52] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1935 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s442 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 91700 steps with 0 reset in 10001 ms.
Product exploration timeout after 88280 steps with 0 reset in 10001 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 : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192678 steps, run timeout after 3002 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192678 steps, saw 191913 distinct states, run finished after 3003 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:18:17] [INFO ] Invariant cache hit.
[2023-03-21 22:18:17] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:18:18] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:18:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:18:19] [INFO ] After 1423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:18:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:18:21] [INFO ] After 1607ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:18:21] [INFO ] After 1838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-21 22:18:21] [INFO ] After 3576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14669 steps, including 0 resets, run visited all 1 properties in 389 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 390 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:18:22] [INFO ] Invariant cache hit.
[2023-03-21 22:18:23] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
[2023-03-21 22:18:23] [INFO ] Invariant cache hit.
[2023-03-21 22:18:23] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-21 22:18:23] [INFO ] Invariant cache hit.
[2023-03-21 22:18:23] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:18:23] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-21 22:18:23] [INFO ] Invariant cache hit.
[2023-03-21 22:18:24] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1836 ms. Remains : 1000/1000 places, 1601/1601 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10127 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193887 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193887 steps, saw 193116 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:18:29] [INFO ] Invariant cache hit.
[2023-03-21 22:18:29] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:18:29] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:18:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-21 22:18:31] [INFO ] After 1377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:18:31] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:18:33] [INFO ] After 1605ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:18:33] [INFO ] After 1840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-21 22:18:33] [INFO ] After 3516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15088 steps, including 0 resets, run visited all 1 properties in 384 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 384 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 90570 steps with 0 reset in 10001 ms.
Product exploration timeout after 89180 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 77 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:18:54] [INFO ] Invariant cache hit.
[2023-03-21 22:18:55] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-21 22:18:55] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 22:18:55] [INFO ] Invariant cache hit.
[2023-03-21 22:18:55] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 25 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:18:55] [INFO ] Invariant cache hit.
[2023-03-21 22:18:56] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
[2023-03-21 22:18:56] [INFO ] Invariant cache hit.
[2023-03-21 22:18:56] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-21 22:18:56] [INFO ] Invariant cache hit.
[2023-03-21 22:18:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:18:57] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-21 22:18:57] [INFO ] Invariant cache hit.
[2023-03-21 22:18:57] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1874 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-05 finished in 67226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:18:57] [INFO ] Invariant cache hit.
[2023-03-21 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2023-03-21 22:18:58] [INFO ] Invariant cache hit.
[2023-03-21 22:18:58] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-21 22:18:58] [INFO ] Invariant cache hit.
[2023-03-21 22:18:59] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:18:59] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-03-21 22:18:59] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-21 22:18:59] [INFO ] Invariant cache hit.
[2023-03-21 22:18:59] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1979 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s862 1), p1:(GEQ s73 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-07 finished in 2154 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 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:00] [INFO ] Invariant cache hit.
[2023-03-21 22:19:00] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
[2023-03-21 22:19:00] [INFO ] Invariant cache hit.
[2023-03-21 22:19:00] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-21 22:19:00] [INFO ] Invariant cache hit.
[2023-03-21 22:19:01] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:01] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2023-03-21 22:19:01] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-21 22:19:01] [INFO ] Invariant cache hit.
[2023-03-21 22:19:01] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1926 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-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 s808 4)], 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-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-08 finished in 1973 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 X(G((p1&&F(p2)&&F(p3))))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:01] [INFO ] Invariant cache hit.
[2023-03-21 22:19:02] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2023-03-21 22:19:02] [INFO ] Invariant cache hit.
[2023-03-21 22:19:02] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-21 22:19:02] [INFO ] Invariant cache hit.
[2023-03-21 22:19:03] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:03] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-21 22:19:03] [INFO ] Invariant cache hit.
[2023-03-21 22:19:03] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1900 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1) (NOT p2)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s210 5), p1:(OR (GEQ s485 5) (GEQ s517 2)), p2:(GEQ s517 2), p3:(GEQ s866 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-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-09 finished in 2177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:04] [INFO ] Invariant cache hit.
[2023-03-21 22:19:04] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
[2023-03-21 22:19:04] [INFO ] Invariant cache hit.
[2023-03-21 22:19:04] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-21 22:19:04] [INFO ] Invariant cache hit.
[2023-03-21 22:19:05] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:05] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-21 22:19:05] [INFO ] Invariant cache hit.
[2023-03-21 22:19:06] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1929 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s380 5), p1:(GEQ s275 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-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-10 finished in 2052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 45 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:06] [INFO ] Invariant cache hit.
[2023-03-21 22:19:06] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
[2023-03-21 22:19:06] [INFO ] Invariant cache hit.
[2023-03-21 22:19:06] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-21 22:19:06] [INFO ] Invariant cache hit.
[2023-03-21 22:19:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:07] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-21 22:19:07] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 22:19:07] [INFO ] Invariant cache hit.
[2023-03-21 22:19:08] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1890 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s804 5) (LT s945 3)), p0:(LT s945 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 43 reset in 7663 ms.
Stack based approach found an accepted trace after 7556 steps with 3 reset with depth 1829 and stack size 1828 in 534 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-11 finished in 10169 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(G(p0))&&F(p1)))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:16] [INFO ] Invariant cache hit.
[2023-03-21 22:19:17] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2023-03-21 22:19:17] [INFO ] Invariant cache hit.
[2023-03-21 22:19:17] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-21 22:19:17] [INFO ] Invariant cache hit.
[2023-03-21 22:19:17] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:17] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-21 22:19:17] [INFO ] Invariant cache hit.
[2023-03-21 22:19:18] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2017 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s558 3), p0:(GEQ s727 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-12 finished in 2241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 41 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:18] [INFO ] Invariant cache hit.
[2023-03-21 22:19:19] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
[2023-03-21 22:19:19] [INFO ] Invariant cache hit.
[2023-03-21 22:19:19] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-21 22:19:19] [INFO ] Invariant cache hit.
[2023-03-21 22:19:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:19] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-21 22:19:19] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 22:19:19] [INFO ] Invariant cache hit.
[2023-03-21 22:19:20] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1967 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s765 3), p0:(GEQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-13 finished in 2058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:20] [INFO ] Invariant cache hit.
[2023-03-21 22:19:21] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
[2023-03-21 22:19:21] [INFO ] Invariant cache hit.
[2023-03-21 22:19:21] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-21 22:19:21] [INFO ] Invariant cache hit.
[2023-03-21 22:19:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:21] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-21 22:19:21] [INFO ] Invariant cache hit.
[2023-03-21 22:19:22] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1905 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-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:(LT s112 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-15 finished in 2006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(F(p2)&&G(F(p3)))))))'
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(G(p0))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0200-LTLFireability-05
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:22] [INFO ] Invariant cache hit.
[2023-03-21 22:19:23] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
[2023-03-21 22:19:23] [INFO ] Invariant cache hit.
[2023-03-21 22:19:23] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-21 22:19:23] [INFO ] Invariant cache hit.
[2023-03-21 22:19:24] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:24] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-21 22:19:24] [INFO ] Invariant cache hit.
[2023-03-21 22:19:24] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1992 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s442 2)], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 92350 steps with 0 reset in 10001 ms.
Product exploration timeout after 89100 steps with 0 reset in 10001 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 : []
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199131 steps, run timeout after 3008 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199131 steps, saw 198341 distinct states, run finished after 3010 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:19:49] [INFO ] Invariant cache hit.
[2023-03-21 22:19:49] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:19:50] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:19:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:19:52] [INFO ] After 1440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:19:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:53] [INFO ] After 1607ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:19:53] [INFO ] After 1846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-21 22:19:54] [INFO ] After 3606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15545 steps, including 0 resets, run visited all 1 properties in 362 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 363 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:19:54] [INFO ] Invariant cache hit.
[2023-03-21 22:19:55] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2023-03-21 22:19:55] [INFO ] Invariant cache hit.
[2023-03-21 22:19:55] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-21 22:19:55] [INFO ] Invariant cache hit.
[2023-03-21 22:19:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:19:56] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-21 22:19:56] [INFO ] Invariant cache hit.
[2023-03-21 22:19:56] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1843 ms. Remains : 1000/1000 places, 1601/1601 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10119 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 225757 steps, run timeout after 3004 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225757 steps, saw 224866 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:20:01] [INFO ] Invariant cache hit.
[2023-03-21 22:20:01] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-21 22:20:02] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:20:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-21 22:20:03] [INFO ] After 1410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:20:03] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:20:05] [INFO ] After 1595ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:20:05] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-21 22:20:05] [INFO ] After 3538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15031 steps, including 0 resets, run visited all 1 properties in 335 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 335 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 91040 steps with 0 reset in 10001 ms.
Product exploration timeout after 88090 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 32 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:20:26] [INFO ] Invariant cache hit.
[2023-03-21 22:20:27] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2023-03-21 22:20:27] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-21 22:20:27] [INFO ] Invariant cache hit.
[2023-03-21 22:20:27] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1270 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:20:27] [INFO ] Invariant cache hit.
[2023-03-21 22:20:28] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2023-03-21 22:20:28] [INFO ] Invariant cache hit.
[2023-03-21 22:20:28] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-21 22:20:28] [INFO ] Invariant cache hit.
[2023-03-21 22:20:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:20:29] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2023-03-21 22:20:29] [INFO ] Invariant cache hit.
[2023-03-21 22:20:29] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1917 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-05 finished in 66961 ms.
[2023-03-21 22:20:29] [INFO ] Flatten gal took : 51 ms
[2023-03-21 22:20:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 22:20:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1601 transitions and 4600 arcs took 11 ms.
Total runtime 309413 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-0200
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1679437291201

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 6 (type SKEL/SRCH) for 3 JoinFreeModules-PT-0200-LTLFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SKEL/SRCH) for JoinFreeModules-PT-0200-LTLFireability-05
lola: result : false
lola: markings : 866
lola: fired transitions : 987
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 JoinFreeModules-PT-0200-LTLFireability-05
lola: time limit : 1799 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-0200-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0200-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/1799 14/32 JoinFreeModules-PT-0200-LTLFireability-05 436514 m, 87302 m/sec, 655402 t fired, .

Time elapsed: 6 secs. Pages in use: 14
# 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-0200-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0200-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/1799 29/32 JoinFreeModules-PT-0200-LTLFireability-05 885554 m, 89808 m/sec, 1329640 t fired, .

Time elapsed: 11 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for JoinFreeModules-PT-0200-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-0200-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-0200-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-0200-LTLFireability-01
lola: time limit : 3584 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-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/3584 4/32 JoinFreeModules-PT-0200-LTLFireability-01 119668 m, 23933 m/sec, 155180 t fired, .

Time elapsed: 21 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-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/3584 8/32 JoinFreeModules-PT-0200-LTLFireability-01 243404 m, 24747 m/sec, 315641 t fired, .

Time elapsed: 26 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-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/3584 11/32 JoinFreeModules-PT-0200-LTLFireability-01 381076 m, 27534 m/sec, 494187 t fired, .

Time elapsed: 31 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-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/3584 15/32 JoinFreeModules-PT-0200-LTLFireability-01 518292 m, 27443 m/sec, 672131 t fired, .

Time elapsed: 36 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-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/3584 19/32 JoinFreeModules-PT-0200-LTLFireability-01 656187 m, 27579 m/sec, 850961 t fired, .

Time elapsed: 41 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3584 23/32 JoinFreeModules-PT-0200-LTLFireability-01 794846 m, 27731 m/sec, 1030777 t fired, .

Time elapsed: 46 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3584 27/32 JoinFreeModules-PT-0200-LTLFireability-01 933468 m, 27724 m/sec, 1210552 t fired, .

Time elapsed: 51 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-0200-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-0200-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3584 31/32 JoinFreeModules-PT-0200-LTLFireability-01 1071494 m, 27605 m/sec, 1389548 t fired, .

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

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

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

Time elapsed: 61 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-0200-LTLFireability-01: LTL unknown AGGR
JoinFreeModules-PT-0200-LTLFireability-05: LTL unknown AGGR


Time elapsed: 61 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-0200"
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-0200, 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-167856415700196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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