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-167856415700195.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700195
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679436862095

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=LTLCardinality
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:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:14:23] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-21 22:14:23] [INFO ] Transformed 1001 places.
[2023-03-21 22:14:23] [INFO ] Transformed 1601 transitions.
[2023-03-21 22:14:23] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 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 79 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:14:24] [INFO ] Computed 200 place invariants in 25 ms
[2023-03-21 22:14:24] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
[2023-03-21 22:14:24] [INFO ] Invariant cache hit.
[2023-03-21 22:14:25] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-21 22:14:25] [INFO ] Invariant cache hit.
[2023-03-21 22:14:25] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:14:25] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-21 22:14:25] [INFO ] Invariant cache hit.
[2023-03-21 22:14:26] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2224 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 36 out of 1000 places after structural reductions.
[2023-03-21 22:14:26] [INFO ] Flatten gal took : 112 ms
[2023-03-21 22:14:26] [INFO ] Flatten gal took : 61 ms
[2023-03-21 22:14:26] [INFO ] Input system was already deterministic with 1601 transitions.
Incomplete random walk after 10167 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=69 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) 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 14) 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 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :1
Running SMT prover for 12 properties.
[2023-03-21 22:14:27] [INFO ] Invariant cache hit.
[2023-03-21 22:14:27] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:14:27] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 22:14:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-21 22:14:30] [INFO ] After 2259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-21 22:14:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:14:31] [INFO ] After 1136ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-21 22:14:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2023-03-21 22:14:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:14:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-03-21 22:14:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-21 22:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-21 22:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-21 22:14:33] [INFO ] After 2892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1407 ms.
[2023-03-21 22:14:34] [INFO ] After 7064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Finished Parikh walk after 1152 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=32 )
Parikh walk visited 12 properties in 10496 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(p1&&X(G((p1||X(G(p2)))))))))'
Support contains 3 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 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:14:45] [INFO ] Invariant cache hit.
[2023-03-21 22:14:46] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-21 22:14:46] [INFO ] Invariant cache hit.
[2023-03-21 22:14:46] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-21 22:14:46] [INFO ] Invariant cache hit.
[2023-03-21 22:14:46] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:14:46] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-21 22:14:46] [INFO ] Invariant cache hit.
[2023-03-21 22:14:47] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1851 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 2 s526), p0:(LEQ 2 s10), p2:(LEQ 1 s347)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2807 ms.
Product exploration explored 100000 steps with 50000 reset in 3013 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 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 11 factoid took 177 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-00 finished in 10020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U 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 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:14:55] [INFO ] Invariant cache hit.
[2023-03-21 22:14:56] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
[2023-03-21 22:14:56] [INFO ] Invariant cache hit.
[2023-03-21 22:14:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-21 22:14:56] [INFO ] Invariant cache hit.
[2023-03-21 22:14:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:14:56] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-21 22:14:56] [INFO ] Invariant cache hit.
[2023-03-21 22:14:57] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1934 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s698), p0:(LEQ 1 s802)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2815 ms.
Product exploration explored 100000 steps with 50000 reset in 2958 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 p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-01 finished in 9674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 3 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 69 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:15:05] [INFO ] Invariant cache hit.
[2023-03-21 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-21 22:15:05] [INFO ] Invariant cache hit.
[2023-03-21 22:15:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-21 22:15:05] [INFO ] Invariant cache hit.
[2023-03-21 22:15:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:06] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-21 22:15:06] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-21 22:15:06] [INFO ] Invariant cache hit.
[2023-03-21 22:15:07] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2038 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 1 s261) (LEQ 3 s902)), p0:(LEQ 1 s446)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 93300 steps with 0 reset in 10001 ms.
Entered a terminal (fully accepting) state of product in 791 steps with 0 reset in 55 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-02 finished in 12281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(X(G(!p0)))))'
Support contains 3 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 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:15:17] [INFO ] Invariant cache hit.
[2023-03-21 22:15:17] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2023-03-21 22:15:18] [INFO ] Invariant cache hit.
[2023-03-21 22:15:18] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-21 22:15:18] [INFO ] Invariant cache hit.
[2023-03-21 22:15:18] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:18] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-21 22:15:18] [INFO ] Invariant cache hit.
[2023-03-21 22:15:19] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1934 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) p0), true, (NOT p1), p0, p0]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s666 s280), p0:(LEQ 3 s183)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1341 steps with 0 reset in 77 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-03 finished in 2191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((p1 U G(p2))))))'
Support contains 6 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 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:15:19] [INFO ] Invariant cache hit.
[2023-03-21 22:15:20] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
[2023-03-21 22:15:20] [INFO ] Invariant cache hit.
[2023-03-21 22:15:20] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-21 22:15:20] [INFO ] Invariant cache hit.
[2023-03-21 22:15:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:20] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-03-21 22:15:20] [INFO ] Invariant cache hit.
[2023-03-21 22:15:21] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), true, (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s530 s279), p2:(AND (LEQ s886 s741) (LEQ s930 s703)), p1:(GT s930 s703)], 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 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-04 finished in 2126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 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:15:21] [INFO ] Invariant cache hit.
[2023-03-21 22:15:22] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2023-03-21 22:15:22] [INFO ] Invariant cache hit.
[2023-03-21 22:15:22] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-21 22:15:22] [INFO ] Invariant cache hit.
[2023-03-21 22:15:23] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:23] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2023-03-21 22:15:23] [INFO ] Invariant cache hit.
[2023-03-21 22:15:24] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2385 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s735 s723) (LEQ 1 s730))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2623 ms.
Product exploration explored 100000 steps with 50000 reset in 2761 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-05 finished in 9646 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))'
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 51 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:15:31] [INFO ] Invariant cache hit.
[2023-03-21 22:15:31] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
[2023-03-21 22:15:31] [INFO ] Invariant cache hit.
[2023-03-21 22:15:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-21 22:15:32] [INFO ] Invariant cache hit.
[2023-03-21 22:15:32] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:32] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-21 22:15:32] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-21 22:15:32] [INFO ] Invariant cache hit.
[2023-03-21 22:15:33] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2010 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s728)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-06 finished in 2055 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)))'
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 50 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:15:33] [INFO ] Invariant cache hit.
[2023-03-21 22:15:34] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2023-03-21 22:15:34] [INFO ] Invariant cache hit.
[2023-03-21 22:15:34] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-21 22:15:34] [INFO ] Invariant cache hit.
[2023-03-21 22:15:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:15:34] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-21 22:15:34] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-21 22:15:34] [INFO ] Invariant cache hit.
[2023-03-21 22:15:35] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1935 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s872 s176)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 96150 steps with 0 reset in 10001 ms.
Product exploration timeout after 89720 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10168 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 186623 steps, run timeout after 3004 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186623 steps, saw 185884 distinct states, run finished after 3005 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:16:00] [INFO ] Invariant cache hit.
[2023-03-21 22:16:00] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:16:01] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:16:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:16:02] [INFO ] After 1427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:02] [INFO ] After 176ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:03] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-21 22:16:03] [INFO ] After 2050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12809 steps, including 0 resets, run visited all 1 properties in 396 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 397 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT 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 54 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:03] [INFO ] Invariant cache hit.
[2023-03-21 22:16:04] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2023-03-21 22:16:04] [INFO ] Invariant cache hit.
[2023-03-21 22:16:04] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-21 22:16:04] [INFO ] Invariant cache hit.
[2023-03-21 22:16:05] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:05] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-21 22:16:05] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-21 22:16:05] [INFO ] Invariant cache hit.
[2023-03-21 22:16:05] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1933 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 201552 steps, run timeout after 3006 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201552 steps, saw 200753 distinct states, run finished after 3007 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:16:10] [INFO ] Invariant cache hit.
[2023-03-21 22:16:10] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-21 22:16:11] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:16:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:16:13] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:13] [INFO ] After 180ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:16:13] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-21 22:16:13] [INFO ] After 2100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14755 steps, including 0 resets, run visited all 1 properties in 449 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 452 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 95190 steps with 0 reset in 10001 ms.
Product exploration timeout after 91830 steps with 0 reset in 10001 ms.
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 35 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:34] [INFO ] Invariant cache hit.
[2023-03-21 22:16:34] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
[2023-03-21 22:16:34] [INFO ] Invariant cache hit.
[2023-03-21 22:16:35] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-21 22:16:35] [INFO ] Invariant cache hit.
[2023-03-21 22:16:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:35] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-21 22:16:35] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-21 22:16:35] [INFO ] Invariant cache hit.
[2023-03-21 22:16:36] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1794 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-08 finished in 62942 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)))'
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 47 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:36] [INFO ] Invariant cache hit.
[2023-03-21 22:16:36] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-21 22:16:36] [INFO ] Invariant cache hit.
[2023-03-21 22:16:37] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-21 22:16:37] [INFO ] Invariant cache hit.
[2023-03-21 22:16:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:37] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2023-03-21 22:16:37] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-21 22:16:37] [INFO ] Invariant cache hit.
[2023-03-21 22:16:38] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1815 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s74 s183)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 59 reset in 6315 ms.
Stack based approach found an accepted trace after 2665 steps with 0 reset with depth 2666 and stack size 2666 in 181 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-10 finished in 8393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 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 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2023-03-21 22:16:44] [INFO ] Invariant cache hit.
[2023-03-21 22:16:45] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
[2023-03-21 22:16:45] [INFO ] Invariant cache hit.
[2023-03-21 22:16:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-21 22:16:45] [INFO ] Invariant cache hit.
[2023-03-21 22:16:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:16:45] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-21 22:16:45] [INFO ] Invariant cache hit.
[2023-03-21 22:16:46] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1734 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (LEQ s137 s377) (LEQ 2 s307)), p1:(LEQ s137 s377)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2357 steps with 1178 reset in 67 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-14 finished in 1956 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 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 34 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 556 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 134 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 542 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-03-21 22:16:47] [INFO ] Redundant transitions in 16 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 563 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1863 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s589 s569)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 96150 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 1775 steps with 0 reset with depth 1776 and stack size 1776 in 118 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-15 finished in 12031 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)))'
[2023-03-21 22:16:58] [INFO ] Flatten gal took : 52 ms
[2023-03-21 22:16:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 22:16:58] [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 155426 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-0200
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA JoinFreeModules-PT-0200-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679437022965

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-0200-LTLCardinality-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for JoinFreeModules-PT-0200-LTLCardinality-08
lola: result : false
lola: markings : 64981
lola: fired transitions : 84261
lola: time used : 2.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-0200-LTLCardinality-08: LTL false LTL model checker


Time elapsed: 3 secs. Pages in use: 1

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="LTLCardinality"
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 LTLCardinality"
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-167856415700195"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;