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.r233-tall-167856418500203.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 ltsminxred
Input is JoinFreeModules-PT-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418500203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K 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 1.6M 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-0500-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679468436411

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:00:38] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2023-03-22 07:00:38] [INFO ] Transformed 2501 places.
[2023-03-22 07:00:38] [INFO ] Transformed 4001 transitions.
[2023-03-22 07:00:38] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 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-0500-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 276 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:00:39] [INFO ] Computed 500 place invariants in 57 ms
[2023-03-22 07:00:41] [INFO ] Dead Transitions using invariants and state equation in 2098 ms found 0 transitions.
[2023-03-22 07:00:41] [INFO ] Invariant cache hit.
[2023-03-22 07:00:41] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-22 07:00:41] [INFO ] Invariant cache hit.
[2023-03-22 07:00:43] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:00:43] [INFO ] Implicit Places using invariants and state equation in 1870 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2023-03-22 07:00:43] [INFO ] Invariant cache hit.
[2023-03-22 07:00:45] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6701 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 39 out of 2500 places after structural reductions.
[2023-03-22 07:00:45] [INFO ] Flatten gal took : 228 ms
[2023-03-22 07:00:46] [INFO ] Flatten gal took : 136 ms
[2023-03-22 07:00:46] [INFO ] Input system was already deterministic with 4001 transitions.
Support contains 38 out of 2500 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10028 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Probabilistic random walk after 45174 steps, saw 45105 distinct states, run finished after 3011 ms. (steps per millisecond=15 ) properties seen :3
Running SMT prover for 19 properties.
[2023-03-22 07:00:50] [INFO ] Invariant cache hit.
[2023-03-22 07:00:51] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-22 07:00:51] [INFO ] After 1472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 07:00:52] [INFO ] [Nat]Absence check using 500 positive place invariants in 96 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:01:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:01:16] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 34 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 165 are kept as prefixes of interest. Removing 2335 places using SCC suffix rule.15 ms
Discarding 2335 places :
Also discarding 3736 output transitions
Drop transitions removed 3736 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 264
Applied a total of 2 rules in 47 ms. Remains 165 /2500 variables (removed 2335) and now considering 264/4001 (removed 3737) transitions.
// Phase 1: matrix 264 rows 165 cols
[2023-03-22 07:01:16] [INFO ] Computed 33 place invariants in 0 ms
[2023-03-22 07:01:17] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 165/2500 places, 264/4001 transitions.
Incomplete random walk after 10038 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :2
Running SMT prover for 5 properties.
[2023-03-22 07:01:17] [INFO ] Invariant cache hit.
[2023-03-22 07:01:17] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-22 07:01:17] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 07:01:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-22 07:01:17] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 07:01:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-22 07:01:17] [INFO ] After 86ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 07:01:18] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-22 07:01:18] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 6854 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=201 )
Parikh walk visited 5 properties in 453 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-11 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' '!((G(p0) U (X(p1)&&G(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 149 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:01:19] [INFO ] Computed 500 place invariants in 19 ms
[2023-03-22 07:01:21] [INFO ] Dead Transitions using invariants and state equation in 2087 ms found 0 transitions.
[2023-03-22 07:01:21] [INFO ] Invariant cache hit.
[2023-03-22 07:01:21] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-22 07:01:21] [INFO ] Invariant cache hit.
[2023-03-22 07:01:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:01:23] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
[2023-03-22 07:01:23] [INFO ] Invariant cache hit.
[2023-03-22 07:01:25] [INFO ] Dead Transitions using invariants and state equation in 1966 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6756 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s657), p0:(LEQ 2 s894), p1:(LEQ 1 s830)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 33630 steps with 0 reset in 10001 ms.
Product exploration timeout after 32250 steps with 0 reset in 10003 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 p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1053 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Probabilistic random walk after 76312 steps, saw 76194 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:02:14] [INFO ] Invariant cache hit.
[2023-03-22 07:02:15] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 07:02:16] [INFO ] After 1940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:02:17] [INFO ] [Nat]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-22 07:02:35] [INFO ] After 18147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:02:35] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:02:36] [INFO ] After 1044ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:02:37] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-22 07:02:37] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-03-22 07:02:38] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2023-03-22 07:02:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2023-03-22 07:02:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1552 ms
[2023-03-22 07:02:38] [INFO ] After 2962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 357 ms.
[2023-03-22 07:02:38] [INFO ] After 21965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.5 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 12 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 07:02:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 07:02:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT p2))]
Knowledge based reduction with 21 factoid took 931 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:02:42] [INFO ] Computed 500 place invariants in 10 ms
[2023-03-22 07:02:44] [INFO ] Dead Transitions using invariants and state equation in 2056 ms found 0 transitions.
[2023-03-22 07:02:44] [INFO ] Invariant cache hit.
[2023-03-22 07:02:44] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-22 07:02:44] [INFO ] Invariant cache hit.
[2023-03-22 07:02:46] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:02:46] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2023-03-22 07:02:46] [INFO ] Invariant cache hit.
[2023-03-22 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 1930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6234 ms. Remains : 2500/2500 places, 4001/4001 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 : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10367 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Probabilistic random walk after 77317 steps, saw 77196 distinct states, run finished after 3027 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:03:17] [INFO ] Invariant cache hit.
[2023-03-22 07:03:17] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-22 07:03:19] [INFO ] After 1890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:03:19] [INFO ] [Nat]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-22 07:03:37] [INFO ] After 17605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:03:37] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:03:38] [INFO ] After 1030ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:03:38] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 07:03:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 07:03:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 07:03:39] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-03-22 07:03:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1436 ms
[2023-03-22 07:03:40] [INFO ] After 2819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 316 ms.
[2023-03-22 07:03:40] [INFO ] After 21135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2003 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 7 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 07:03:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 07:03:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p2), (NOT p2)]
Product exploration timeout after 33640 steps with 0 reset in 10001 ms.
Product exploration timeout after 32890 steps with 0 reset in 10004 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 529 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:04:03] [INFO ] Computed 500 place invariants in 10 ms
[2023-03-22 07:04:05] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
[2023-03-22 07:04:05] [INFO ] Redundant transitions in 258 ms returned []
[2023-03-22 07:04:05] [INFO ] Invariant cache hit.
[2023-03-22 07:04:07] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4727 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 64 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:04:07] [INFO ] Invariant cache hit.
[2023-03-22 07:04:09] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
[2023-03-22 07:04:09] [INFO ] Invariant cache hit.
[2023-03-22 07:04:10] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-22 07:04:10] [INFO ] Invariant cache hit.
[2023-03-22 07:04:12] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:04:12] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
[2023-03-22 07:04:12] [INFO ] Invariant cache hit.
[2023-03-22 07:04:14] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6316 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-00 finished in 175612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 318 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:04:14] [INFO ] Invariant cache hit.
[2023-03-22 07:04:16] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
[2023-03-22 07:04:16] [INFO ] Invariant cache hit.
[2023-03-22 07:04:17] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-22 07:04:17] [INFO ] Invariant cache hit.
[2023-03-22 07:04:19] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:04:19] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
[2023-03-22 07:04:19] [INFO ] Redundant transitions in 363 ms returned []
[2023-03-22 07:04:19] [INFO ] Invariant cache hit.
[2023-03-22 07:04:21] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7208 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LEQ s20 s1370) (LEQ s2432 s700)), p1:(LEQ 1 s785)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 33670 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 7130 steps with 0 reset with depth 7131 and stack size 2507 in 1610 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-01 finished in 18982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 184 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:04:33] [INFO ] Invariant cache hit.
[2023-03-22 07:04:35] [INFO ] Dead Transitions using invariants and state equation in 2165 ms found 0 transitions.
[2023-03-22 07:04:35] [INFO ] Invariant cache hit.
[2023-03-22 07:04:36] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-22 07:04:36] [INFO ] Invariant cache hit.
[2023-03-22 07:04:38] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:04:38] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-22 07:04:38] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-22 07:04:38] [INFO ] Invariant cache hit.
[2023-03-22 07:04:40] [INFO ] Dead Transitions using invariants and state equation in 2048 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6824 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s881 s742)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 33760 steps with 0 reset in 10002 ms.
Product exploration timeout after 32530 steps with 0 reset in 10002 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 116 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 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6352 steps, including 1 resets, run visited all 1 properties in 130 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:05:25] [INFO ] Invariant cache hit.
[2023-03-22 07:05:27] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
[2023-03-22 07:05:27] [INFO ] Invariant cache hit.
[2023-03-22 07:05:27] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-22 07:05:27] [INFO ] Invariant cache hit.
[2023-03-22 07:05:29] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:05:29] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
[2023-03-22 07:05:29] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-22 07:05:29] [INFO ] Invariant cache hit.
[2023-03-22 07:05:31] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6366 ms. Remains : 2500/2500 places, 4001/4001 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 124 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 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10276 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Probabilistic random walk after 77317 steps, saw 77196 distinct states, run finished after 3034 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:05:59] [INFO ] Invariant cache hit.
[2023-03-22 07:06:00] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:06:00] [INFO ] [Nat]Absence check using 500 positive place invariants in 110 ms returned sat
[2023-03-22 07:06:18] [INFO ] After 17616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:06:18] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:06:19] [INFO ] After 1289ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:06:19] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 07:06:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 07:06:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 07:06:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 895 ms
[2023-03-22 07:06:20] [INFO ] After 2588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-22 07:06:21] [INFO ] After 20972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 6 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 07:06:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 07:06:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 34560 steps with 0 reset in 10002 ms.
Product exploration timeout after 33260 steps with 0 reset in 10001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 142 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:06:43] [INFO ] Computed 500 place invariants in 10 ms
[2023-03-22 07:06:45] [INFO ] Dead Transitions using invariants and state equation in 1911 ms found 0 transitions.
[2023-03-22 07:06:45] [INFO ] Invariant cache hit.
[2023-03-22 07:06:45] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-22 07:06:45] [INFO ] Invariant cache hit.
[2023-03-22 07:06:47] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:06:47] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2023-03-22 07:06:47] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 07:06:47] [INFO ] Invariant cache hit.
[2023-03-22 07:06:49] [INFO ] Dead Transitions using invariants and state equation in 1852 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6082 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-02 finished in 136001 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 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 155 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:06:49] [INFO ] Invariant cache hit.
[2023-03-22 07:06:51] [INFO ] Dead Transitions using invariants and state equation in 2001 ms found 0 transitions.
[2023-03-22 07:06:51] [INFO ] Invariant cache hit.
[2023-03-22 07:06:52] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-22 07:06:52] [INFO ] Invariant cache hit.
[2023-03-22 07:06:53] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:06:53] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2023-03-22 07:06:53] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-22 07:06:53] [INFO ] Invariant cache hit.
[2023-03-22 07:06:55] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6197 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1162 s1976)], 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 35000 steps with 0 reset in 10003 ms.
Product exploration timeout after 33750 steps with 0 reset in 10002 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Probabilistic random walk after 81330 steps, saw 81203 distinct states, run finished after 3028 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:07:43] [INFO ] Invariant cache hit.
[2023-03-22 07:07:43] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-22 07:07:45] [INFO ] After 1995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:07:45] [INFO ] [Nat]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 07:08:03] [INFO ] After 17283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:08:03] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:08:03] [INFO ] After 731ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:08:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 07:08:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 07:08:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 07:08:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2023-03-22 07:08:05] [INFO ] After 1978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 384 ms.
[2023-03-22 07:08:05] [INFO ] After 20068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 6 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 07:08:07] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 07:08:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 670 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=335 )
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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:08:07] [INFO ] Computed 500 place invariants in 25 ms
[2023-03-22 07:08:09] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
[2023-03-22 07:08:09] [INFO ] Invariant cache hit.
[2023-03-22 07:08:10] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-22 07:08:10] [INFO ] Invariant cache hit.
[2023-03-22 07:08:11] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:08:11] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2023-03-22 07:08:11] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 07:08:11] [INFO ] Invariant cache hit.
[2023-03-22 07:08:13] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6029 ms. Remains : 2500/2500 places, 4001/4001 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 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Probabilistic random walk after 79324 steps, saw 79201 distinct states, run finished after 3054 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:08:41] [INFO ] Invariant cache hit.
[2023-03-22 07:08:42] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-22 07:08:43] [INFO ] After 1895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:08:44] [INFO ] [Nat]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-22 07:09:01] [INFO ] After 16903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:09:01] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:09:01] [INFO ] After 692ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:09:02] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-03-22 07:09:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 07:09:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 07:09:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 858 ms
[2023-03-22 07:09:03] [INFO ] After 1949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 368 ms.
[2023-03-22 07:09:03] [INFO ] After 19671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 7 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 07:09:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 07:09:05] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration timeout after 35100 steps with 0 reset in 10002 ms.
Product exploration timeout after 33580 steps with 0 reset in 10001 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 160 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:09:26] [INFO ] Computed 500 place invariants in 7 ms
[2023-03-22 07:09:28] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
[2023-03-22 07:09:28] [INFO ] Invariant cache hit.
[2023-03-22 07:09:28] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-22 07:09:28] [INFO ] Invariant cache hit.
[2023-03-22 07:09:30] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:09:30] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-22 07:09:30] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-22 07:09:30] [INFO ] Invariant cache hit.
[2023-03-22 07:09:32] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6173 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-03 finished in 162631 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 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:09:32] [INFO ] Invariant cache hit.
[2023-03-22 07:09:34] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
[2023-03-22 07:09:34] [INFO ] Invariant cache hit.
[2023-03-22 07:09:34] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-22 07:09:34] [INFO ] Invariant cache hit.
[2023-03-22 07:09:36] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:09:36] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
[2023-03-22 07:09:36] [INFO ] Invariant cache hit.
[2023-03-22 07:09:38] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5821 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s2441)], 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]]
Product exploration timeout after 34260 steps with 0 reset in 10003 ms.
Entered a terminal (fully accepting) state of product in 1131 steps with 0 reset in 151 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-04 finished in 16081 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 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:09:48] [INFO ] Invariant cache hit.
[2023-03-22 07:09:50] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
[2023-03-22 07:09:50] [INFO ] Invariant cache hit.
[2023-03-22 07:09:50] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-22 07:09:50] [INFO ] Invariant cache hit.
[2023-03-22 07:09:52] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:09:52] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2023-03-22 07:09:52] [INFO ] Invariant cache hit.
[2023-03-22 07:09:54] [INFO ] Dead Transitions using invariants and state equation in 1911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6077 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-06 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:(LEQ 1 s594)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-06 finished in 6183 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 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 143 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:09:54] [INFO ] Invariant cache hit.
[2023-03-22 07:09:56] [INFO ] Dead Transitions using invariants and state equation in 1991 ms found 0 transitions.
[2023-03-22 07:09:56] [INFO ] Invariant cache hit.
[2023-03-22 07:09:57] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-22 07:09:57] [INFO ] Invariant cache hit.
[2023-03-22 07:09:58] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:09:58] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
[2023-03-22 07:09:58] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-22 07:09:58] [INFO ] Invariant cache hit.
[2023-03-22 07:10:00] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6339 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-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:(LEQ 3 s488)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-08 finished in 6421 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 U p1)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 44 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:10:00] [INFO ] Invariant cache hit.
[2023-03-22 07:10:03] [INFO ] Dead Transitions using invariants and state equation in 2238 ms found 0 transitions.
[2023-03-22 07:10:03] [INFO ] Invariant cache hit.
[2023-03-22 07:10:03] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-22 07:10:03] [INFO ] Invariant cache hit.
[2023-03-22 07:10:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:10:05] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2023-03-22 07:10:05] [INFO ] Invariant cache hit.
[2023-03-22 07:10:07] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6222 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 398 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-10 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: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s984), p0:(GT 3 s1593)], 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-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-10 finished in 6635 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||X((p0 U X(p1))))))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:10:07] [INFO ] Invariant cache hit.
[2023-03-22 07:10:09] [INFO ] Dead Transitions using invariants and state equation in 1892 ms found 0 transitions.
[2023-03-22 07:10:09] [INFO ] Invariant cache hit.
[2023-03-22 07:10:09] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-22 07:10:09] [INFO ] Invariant cache hit.
[2023-03-22 07:10:11] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:10:11] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2023-03-22 07:10:11] [INFO ] Invariant cache hit.
[2023-03-22 07:10:13] [INFO ] Dead Transitions using invariants and state equation in 1941 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6116 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(LEQ s2177 s1215), p1:(AND (LEQ s2428 s1902) (LEQ s952 s1758))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-12 finished in 6303 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 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 151 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:10:13] [INFO ] Invariant cache hit.
[2023-03-22 07:10:15] [INFO ] Dead Transitions using invariants and state equation in 1971 ms found 0 transitions.
[2023-03-22 07:10:15] [INFO ] Invariant cache hit.
[2023-03-22 07:10:16] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-22 07:10:16] [INFO ] Invariant cache hit.
[2023-03-22 07:10:17] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:10:17] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2023-03-22 07:10:18] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 07:10:18] [INFO ] Invariant cache hit.
[2023-03-22 07:10:19] [INFO ] Dead Transitions using invariants and state equation in 1904 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6148 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s1804)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-13 finished in 6241 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||F(p1)) U G(p2)))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 158 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:10:20] [INFO ] Invariant cache hit.
[2023-03-22 07:10:21] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
[2023-03-22 07:10:21] [INFO ] Invariant cache hit.
[2023-03-22 07:10:22] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-22 07:10:22] [INFO ] Invariant cache hit.
[2023-03-22 07:10:24] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:10:24] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
[2023-03-22 07:10:24] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-22 07:10:24] [INFO ] Invariant cache hit.
[2023-03-22 07:10:26] [INFO ] Dead Transitions using invariants and state equation in 1757 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6027 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s1044 s925), p0:(LEQ s1854 s461), p1:(LEQ s2293 s2295)], 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 47710 steps with 7 reset in 10002 ms.
Stack based approach found an accepted trace after 7258 steps with 0 reset with depth 7259 and stack size 702 in 1563 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-14 finished in 17747 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)&&F(G(((p1||X(p0)) U p2)))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 47 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:10:37] [INFO ] Invariant cache hit.
[2023-03-22 07:10:39] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
[2023-03-22 07:10:39] [INFO ] Invariant cache hit.
[2023-03-22 07:10:40] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-22 07:10:40] [INFO ] Invariant cache hit.
[2023-03-22 07:10:41] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:10:41] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2023-03-22 07:10:41] [INFO ] Invariant cache hit.
[2023-03-22 07:10:43] [INFO ] Dead Transitions using invariants and state equation in 1743 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5850 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1783 s754), p2:(GT s1602 s1853), p1:(GT s1589 s2485)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 34310 steps with 0 reset in 10002 ms.
Product exploration timeout after 33480 steps with 0 reset in 10003 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 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10145 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 07:11:29] [INFO ] Invariant cache hit.
[2023-03-22 07:11:29] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 07:11:31] [INFO ] After 2071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:11:31] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-22 07:11:51] [INFO ] After 20077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:11:51] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:54] [INFO ] After 2618ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:11:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 07:11:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 07:11:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 07:11:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 794 ms
[2023-03-22 07:11:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 07:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-22 07:11:56] [INFO ] After 4161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-22 07:11:56] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4004 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 5 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 07:12:00] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 07:12:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 2466 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1233 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 470 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:12:01] [INFO ] Computed 500 place invariants in 16 ms
[2023-03-22 07:12:03] [INFO ] Dead Transitions using invariants and state equation in 1916 ms found 0 transitions.
[2023-03-22 07:12:03] [INFO ] Invariant cache hit.
[2023-03-22 07:12:03] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-22 07:12:03] [INFO ] Invariant cache hit.
[2023-03-22 07:12:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:12:05] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2023-03-22 07:12:05] [INFO ] Invariant cache hit.
[2023-03-22 07:12:07] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6020 ms. Remains : 2500/2500 places, 4001/4001 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 p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 427 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10280 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 07:12:34] [INFO ] Invariant cache hit.
[2023-03-22 07:12:35] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 07:12:36] [INFO ] After 2112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:12:37] [INFO ] [Nat]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-22 07:12:57] [INFO ] After 19792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:12:57] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:12:59] [INFO ] After 2719ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:13:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 07:13:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 07:13:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 07:13:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 800 ms
[2023-03-22 07:13:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 07:13:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-22 07:13:01] [INFO ] After 4267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 496 ms.
[2023-03-22 07:13:01] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4003 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 5 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 07:13:05] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 07:13:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 328 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration timeout after 35520 steps with 0 reset in 10001 ms.
Product exploration timeout after 34730 steps with 0 reset in 10002 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:13:26] [INFO ] Computed 500 place invariants in 13 ms
[2023-03-22 07:13:28] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
[2023-03-22 07:13:28] [INFO ] Invariant cache hit.
[2023-03-22 07:13:29] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-22 07:13:29] [INFO ] Invariant cache hit.
[2023-03-22 07:13:30] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:13:30] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
[2023-03-22 07:13:30] [INFO ] Invariant cache hit.
[2023-03-22 07:13:32] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5879 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 174889 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 (X(p1)&&G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
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)))'
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)&&F(G(((p1||X(p0)) U p2)))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0500-LTLCardinality-15
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:13:33] [INFO ] Invariant cache hit.
[2023-03-22 07:13:35] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
[2023-03-22 07:13:35] [INFO ] Invariant cache hit.
[2023-03-22 07:13:35] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-22 07:13:35] [INFO ] Invariant cache hit.
[2023-03-22 07:13:37] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:13:37] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
[2023-03-22 07:13:37] [INFO ] Invariant cache hit.
[2023-03-22 07:13:39] [INFO ] Dead Transitions using invariants and state equation in 1766 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5912 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1783 s754), p2:(GT s1602 s1853), p1:(GT s1589 s2485)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 35930 steps with 0 reset in 10002 ms.
Product exploration timeout after 34620 steps with 0 reset in 10002 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 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 391 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 07:14:24] [INFO ] Invariant cache hit.
[2023-03-22 07:14:24] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-22 07:14:26] [INFO ] After 2067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:14:26] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-22 07:14:47] [INFO ] After 20493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:14:47] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:14:49] [INFO ] After 2542ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:14:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2023-03-22 07:14:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 11 ms to minimize.
[2023-03-22 07:14:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 07:14:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 748 ms
[2023-03-22 07:14:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 07:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-22 07:14:51] [INFO ] After 4008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-22 07:14:51] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4003 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 4 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 07:14:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 07:14:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 1506 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=753 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 432 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:14:55] [INFO ] Computed 500 place invariants in 12 ms
[2023-03-22 07:14:57] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
[2023-03-22 07:14:57] [INFO ] Invariant cache hit.
[2023-03-22 07:14:58] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-22 07:14:58] [INFO ] Invariant cache hit.
[2023-03-22 07:14:59] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:15:00] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2023-03-22 07:15:00] [INFO ] Invariant cache hit.
[2023-03-22 07:15:01] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6030 ms. Remains : 2500/2500 places, 4001/4001 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 p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10277 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 07:15:27] [INFO ] Invariant cache hit.
[2023-03-22 07:15:28] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-22 07:15:29] [INFO ] After 2192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:15:30] [INFO ] [Nat]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-22 07:15:50] [INFO ] After 20485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:15:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:15:53] [INFO ] After 2607ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:15:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 07:15:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 07:15:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 07:15:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 742 ms
[2023-03-22 07:15:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 07:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-22 07:15:54] [INFO ] After 4061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 07:15:54] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4001 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 5 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 07:15:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:15:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 1002 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration timeout after 33940 steps with 0 reset in 10002 ms.
Product exploration timeout after 32530 steps with 0 reset in 10002 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:16:19] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-22 07:16:21] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
[2023-03-22 07:16:21] [INFO ] Invariant cache hit.
[2023-03-22 07:16:22] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-22 07:16:22] [INFO ] Invariant cache hit.
[2023-03-22 07:16:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:16:23] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2166 ms to find 0 implicit places.
[2023-03-22 07:16:23] [INFO ] Invariant cache hit.
[2023-03-22 07:16:25] [INFO ] Dead Transitions using invariants and state equation in 1962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6175 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 173059 ms.
[2023-03-22 07:16:26] [INFO ] Flatten gal took : 167 ms
[2023-03-22 07:16:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 07:16:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 4001 transitions and 11500 arcs took 20 ms.
Total runtime 948124 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2233/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2233/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2233/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2233/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : JoinFreeModules-PT-0500-LTLCardinality-00
Could not compute solution for formula : JoinFreeModules-PT-0500-LTLCardinality-02
Could not compute solution for formula : JoinFreeModules-PT-0500-LTLCardinality-03
Could not compute solution for formula : JoinFreeModules-PT-0500-LTLCardinality-15

BK_STOP 1679469394547

--------------------
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
mcc2023
ltl formula name JoinFreeModules-PT-0500-LTLCardinality-00
ltl formula formula --ltl=/tmp/2233/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 4001 transitions and 11500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.110 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2233/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2233/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2233/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2233/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name JoinFreeModules-PT-0500-LTLCardinality-02
ltl formula formula --ltl=/tmp/2233/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 4001 transitions and 11500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.120 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2233/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2233/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2233/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2233/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name JoinFreeModules-PT-0500-LTLCardinality-03
ltl formula formula --ltl=/tmp/2233/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 4001 transitions and 11500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.450 real 0.130 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2233/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2233/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2233/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2233/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-0500-LTLCardinality-15
ltl formula formula --ltl=/tmp/2233/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 4001 transitions and 11500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.150 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2233/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2233/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2233/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2233/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-0500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is JoinFreeModules-PT-0500, 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 r233-tall-167856418500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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