Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151300212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Diffusion2D-PT-D50N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151300212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M May 18 16:42 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 Diffusion2D-PT-D50N050-LTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D50N050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716419996018

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:19:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:19:57] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2024-05-22 23:19:58] [INFO ] Transformed 2500 places.
[2024-05-22 23:19:58] [INFO ] Transformed 19404 transitions.
[2024-05-22 23:19:58] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 545 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 763 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:19:59] [INFO ] Computed 1 invariants in 168 ms
[2024-05-22 23:19:59] [INFO ] Implicit Places using invariants in 615 ms returned []
Implicit Place search using SMT only with invariants took 638 ms to find 0 implicit places.
[2024-05-22 23:19:59] [INFO ] Invariant cache hit.
[2024-05-22 23:20:06] [INFO ] Dead Transitions using invariants and state equation in 7084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8493 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 53 out of 2500 places after structural reductions.
[2024-05-22 23:20:07] [INFO ] Flatten gal took : 604 ms
[2024-05-22 23:20:08] [INFO ] Flatten gal took : 336 ms
[2024-05-22 23:20:08] [INFO ] Input system was already deterministic with 19404 transitions.
Support contains 52 out of 2500 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10038 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 122611 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{1=1, 8=1}
Probabilistic random walk after 122611 steps, saw 101632 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :2
Running SMT prover for 29 properties.
[2024-05-22 23:20:12] [INFO ] Invariant cache hit.
[2024-05-22 23:20:13] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-22 23:20:13] [INFO ] After 1658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2024-05-22 23:20:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2024-05-22 23:20:37] [INFO ] After 20954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2024-05-22 23:20:40] [INFO ] Deduced a trap composed of 2500 places in 1487 ms of which 5 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 23:20:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 23:20:40] [INFO ] After 26530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Finished Parikh walk after 14452 steps, including 0 resets, run visited all 1 properties in 209 ms. (steps per millisecond=69 )
Parikh walk visited 29 properties in 15673 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||G(p1)))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 371 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:20:57] [INFO ] Invariant cache hit.
[2024-05-22 23:20:57] [INFO ] Implicit Places using invariants in 363 ms returned []
Implicit Place search using SMT only with invariants took 365 ms to find 0 implicit places.
[2024-05-22 23:20:57] [INFO ] Invariant cache hit.
[2024-05-22 23:21:04] [INFO ] Dead Transitions using invariants and state equation in 7069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7833 ms. Remains : 2500/2500 places, 19404/19404 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s2076 s96), p1:(GT 3 s676)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3023 ms.
Product exploration explored 100000 steps with 0 reset in 2900 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 243699 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 243699 steps, saw 195998 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :2
Running SMT prover for 2 properties.
[2024-05-22 23:21:14] [INFO ] Invariant cache hit.
[2024-05-22 23:21:14] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2024-05-22 23:21:22] [INFO ] After 7955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:21:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-22 23:21:32] [INFO ] After 10255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:21:35] [INFO ] After 12834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 846 ms.
[2024-05-22 23:21:36] [INFO ] After 14038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 5263 steps, including 0 resets, run visited all 1 properties in 76 ms. (steps per millisecond=69 )
Parikh walk visited 2 properties in 341 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 218 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 363 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:21:37] [INFO ] Invariant cache hit.
[2024-05-22 23:21:37] [INFO ] Implicit Places using invariants in 259 ms returned []
Implicit Place search using SMT only with invariants took 260 ms to find 0 implicit places.
[2024-05-22 23:21:37] [INFO ] Invariant cache hit.
[2024-05-22 23:21:44] [INFO ] Dead Transitions using invariants and state equation in 7186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7811 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 198459 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 198459 steps, saw 160473 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :2
Running SMT prover for 2 properties.
[2024-05-22 23:21:48] [INFO ] Invariant cache hit.
[2024-05-22 23:21:48] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-22 23:21:56] [INFO ] After 7816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:21:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-22 23:22:05] [INFO ] After 9405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:22:08] [INFO ] After 12119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 852 ms.
[2024-05-22 23:22:09] [INFO ] After 13390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 5263 steps, including 0 resets, run visited all 1 properties in 61 ms. (steps per millisecond=86 )
Parikh walk visited 2 properties in 291 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 205 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2780 ms.
Product exploration explored 100000 steps with 0 reset in 2821 ms.
Built C files in :
/tmp/ltsmin2686344218166019280
[2024-05-22 23:22:16] [INFO ] Built C files in 206ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2686344218166019280
Running compilation step : cd /tmp/ltsmin2686344218166019280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2686344218166019280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2686344218166019280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 356 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:22:19] [INFO ] Invariant cache hit.
[2024-05-22 23:22:19] [INFO ] Implicit Places using invariants in 227 ms returned []
Implicit Place search using SMT only with invariants took 229 ms to find 0 implicit places.
[2024-05-22 23:22:19] [INFO ] Invariant cache hit.
[2024-05-22 23:22:26] [INFO ] Dead Transitions using invariants and state equation in 7034 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7626 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Built C files in :
/tmp/ltsmin3532051956392259735
[2024-05-22 23:22:27] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3532051956392259735
Running compilation step : cd /tmp/ltsmin3532051956392259735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3532051956392259735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3532051956392259735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:22:30] [INFO ] Flatten gal took : 299 ms
[2024-05-22 23:22:31] [INFO ] Flatten gal took : 273 ms
[2024-05-22 23:22:31] [INFO ] Time to serialize gal into /tmp/LTL6109460648130794427.gal : 83 ms
[2024-05-22 23:22:31] [INFO ] Time to serialize properties into /tmp/LTL17394967397326089186.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6109460648130794427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1436516230876702850.hoa' '-atoms' '/tmp/LTL17394967397326089186.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17394967397326089186.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1436516230876702850.hoa
Detected timeout of ITS tools.
[2024-05-22 23:22:46] [INFO ] Flatten gal took : 251 ms
[2024-05-22 23:22:47] [INFO ] Flatten gal took : 266 ms
[2024-05-22 23:22:47] [INFO ] Time to serialize gal into /tmp/LTL5124184512487236466.gal : 49 ms
[2024-05-22 23:22:47] [INFO ] Time to serialize properties into /tmp/LTL11822199005980555155.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5124184512487236466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11822199005980555155.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(cAMP__22_34_<3)"))||(("(cAMP__48_34_>cAMP__11_6_)")&&(X("(cAMP__22_34_<3)")))))))
Formula 0 simplified : G(F!"(cAMP__22_34_<3)" & FG(!"(cAMP__48_34_>cAMP__11_6_)" | X!"(cAMP__22_34_<3)"))
Detected timeout of ITS tools.
[2024-05-22 23:23:02] [INFO ] Flatten gal took : 250 ms
[2024-05-22 23:23:02] [INFO ] Applying decomposition
[2024-05-22 23:23:02] [INFO ] Flatten gal took : 264 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16225004945817674155.txt' '-o' '/tmp/graph16225004945817674155.bin' '-w' '/tmp/graph16225004945817674155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16225004945817674155.bin' '-l' '-1' '-v' '-w' '/tmp/graph16225004945817674155.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:23:03] [INFO ] Decomposing Gal with order
[2024-05-22 23:23:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:23:05] [INFO ] Removed a total of 13532 redundant transitions.
[2024-05-22 23:23:05] [INFO ] Flatten gal took : 1280 ms
[2024-05-22 23:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 158 ms.
[2024-05-22 23:23:07] [INFO ] Time to serialize gal into /tmp/LTL11043032017704277932.gal : 176 ms
[2024-05-22 23:23:07] [INFO ] Time to serialize properties into /tmp/LTL13002973665444692314.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11043032017704277932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13002973665444692314.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(gi2.gi0.gi5.gu104.cAMP__22_34_<3)"))||(("(gu301.cAMP__48_34_>gu301.cAMP__11_6_)")&&(X("(gi2.gi0.gi5.gu104.cAMP__22_34_<3)"...162
Formula 0 simplified : G(F!"(gi2.gi0.gi5.gu104.cAMP__22_34_<3)" & FG(!"(gu301.cAMP__48_34_>gu301.cAMP__11_6_)" | X!"(gi2.gi0.gi5.gu104.cAMP__22_34_<3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1337069176364651216
[2024-05-22 23:23:22] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1337069176364651216
Running compilation step : cd /tmp/ltsmin1337069176364651216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1337069176364651216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1337069176364651216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-00 finished in 149004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 50 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 23:23:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:23:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:23:25] [INFO ] Invariant cache hit.
[2024-05-22 23:23:25] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-22 23:23:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:23:25] [INFO ] Invariant cache hit.
[2024-05-22 23:23:25] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-01 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 s0)], 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 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-01 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 11 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 29 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-22 23:23:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:23:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 23:23:26] [INFO ] Invariant cache hit.
[2024-05-22 23:23:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-22 23:23:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:23:26] [INFO ] Invariant cache hit.
[2024-05-22 23:23:26] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s0) (LEQ 3 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-02 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 35 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 23:23:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:23:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 23:23:26] [INFO ] Invariant cache hit.
[2024-05-22 23:23:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-22 23:23:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:23:26] [INFO ] Invariant cache hit.
[2024-05-22 23:23:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-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:(OR (GT 3 s2) (GT s0 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-03 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)||G(p2)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 354 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:23:27] [INFO ] Computed 1 invariants in 156 ms
[2024-05-22 23:23:27] [INFO ] Implicit Places using invariants in 425 ms returned []
Implicit Place search using SMT only with invariants took 446 ms to find 0 implicit places.
[2024-05-22 23:23:27] [INFO ] Invariant cache hit.
[2024-05-22 23:23:34] [INFO ] Dead Transitions using invariants and state equation in 7184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7986 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(OR (GT 3 s1206) (LEQ s916 s1465)), p1:(LEQ 1 s287), p2:(LEQ 1 s1440)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2020 ms.
Product exploration explored 100000 steps with 33333 reset in 1692 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-05 finished in 12168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 345 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:23:39] [INFO ] Invariant cache hit.
[2024-05-22 23:23:39] [INFO ] Implicit Places using invariants in 308 ms returned []
Implicit Place search using SMT only with invariants took 320 ms to find 0 implicit places.
[2024-05-22 23:23:39] [INFO ] Invariant cache hit.
[2024-05-22 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 7231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7911 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1323 s1027), p1:(GT s361 s184)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 44 reset in 1739 ms.
Stack based approach found an accepted trace after 107 steps with 0 reset with depth 108 and stack size 108 in 2 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-06 finished in 9805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&X((p2&&G(p3)))&&(p2 U G(p3))))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 352 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:23:49] [INFO ] Invariant cache hit.
[2024-05-22 23:23:49] [INFO ] Implicit Places using invariants in 330 ms returned []
Implicit Place search using SMT only with invariants took 345 ms to find 0 implicit places.
[2024-05-22 23:23:49] [INFO ] Invariant cache hit.
[2024-05-22 23:23:56] [INFO ] Dead Transitions using invariants and state equation in 7307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8019 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p3 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s1058 s314), p1:(LEQ 3 s1604), p3:(LEQ 2 s1987), p2:(LEQ s2474 s1052)], 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]]
Product exploration explored 100000 steps with 50000 reset in 2248 ms.
Product exploration explored 100000 steps with 50000 reset in 2083 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), true, (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-08 finished in 12646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G((p1||X(p0))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 366 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:24:01] [INFO ] Invariant cache hit.
[2024-05-22 23:24:01] [INFO ] Implicit Places using invariants in 250 ms returned []
Implicit Place search using SMT only with invariants took 255 ms to find 0 implicit places.
[2024-05-22 23:24:01] [INFO ] Invariant cache hit.
[2024-05-22 23:24:09] [INFO ] Dead Transitions using invariants and state equation in 7307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7935 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(GT s298 s2482), p1:(GT s2338 s1119)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-09 finished in 8095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 337 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:24:09] [INFO ] Invariant cache hit.
[2024-05-22 23:24:09] [INFO ] Implicit Places using invariants in 232 ms returned []
Implicit Place search using SMT only with invariants took 255 ms to find 0 implicit places.
[2024-05-22 23:24:09] [INFO ] Invariant cache hit.
[2024-05-22 23:24:17] [INFO ] Dead Transitions using invariants and state equation in 7207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7813 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s733 s315)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11873 steps with 0 reset in 255 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-10 finished in 8222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 38 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 23:24:17] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:24:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 23:24:17] [INFO ] Invariant cache hit.
[2024-05-22 23:24:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-22 23:24:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:24:17] [INFO ] Invariant cache hit.
[2024-05-22 23:24:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s1), p0:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-11 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 386 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:24:18] [INFO ] Computed 1 invariants in 104 ms
[2024-05-22 23:24:18] [INFO ] Implicit Places using invariants in 361 ms returned []
Implicit Place search using SMT only with invariants took 376 ms to find 0 implicit places.
[2024-05-22 23:24:18] [INFO ] Invariant cache hit.
[2024-05-22 23:24:25] [INFO ] Dead Transitions using invariants and state equation in 7252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8024 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ 2 s1584), p0:(OR (GT 1 s635) (GT 2 s786))], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 2708 ms.
Product exploration explored 100000 steps with 0 reset in 2840 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=323 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 245939 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245939 steps, saw 197784 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 23:24:35] [INFO ] Invariant cache hit.
[2024-05-22 23:24:35] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2024-05-22 23:24:41] [INFO ] After 6496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 23:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-22 23:24:49] [INFO ] After 7214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 23:24:51] [INFO ] After 9365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1156 ms.
[2024-05-22 23:24:52] [INFO ] After 10958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 11906 steps, including 1 resets, run visited all 3 properties in 116 ms. (steps per millisecond=102 )
Parikh walk visited 3 properties in 118 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 357 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:24:53] [INFO ] Invariant cache hit.
[2024-05-22 23:24:54] [INFO ] Implicit Places using invariants in 243 ms returned []
Implicit Place search using SMT only with invariants took 258 ms to find 0 implicit places.
[2024-05-22 23:24:54] [INFO ] Invariant cache hit.
[2024-05-22 23:25:01] [INFO ] Dead Transitions using invariants and state equation in 7354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7972 ms. Remains : 2500/2500 places, 19404/19404 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) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 258472 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258472 steps, saw 207400 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 23:25:04] [INFO ] Invariant cache hit.
[2024-05-22 23:25:05] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-22 23:25:10] [INFO ] After 5949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 23:25:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 16 ms returned sat
[2024-05-22 23:25:18] [INFO ] After 7020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 23:25:20] [INFO ] After 9053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1153 ms.
[2024-05-22 23:25:21] [INFO ] After 10662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 9156 steps, including 0 resets, run visited all 1 properties in 75 ms. (steps per millisecond=122 )
Parikh walk visited 3 properties in 232 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 2731 ms.
Product exploration explored 100000 steps with 1 reset in 2668 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 30 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2024-05-22 23:25:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 23:25:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:25:28] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 4/2500 places, 7/19404 transitions.
Built C files in :
/tmp/ltsmin5334741018989590112
[2024-05-22 23:25:28] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5334741018989590112
Running compilation step : cd /tmp/ltsmin5334741018989590112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5334741018989590112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5334741018989590112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 514 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:25:31] [INFO ] Computed 1 invariants in 88 ms
[2024-05-22 23:25:32] [INFO ] Implicit Places using invariants in 341 ms returned []
Implicit Place search using SMT only with invariants took 355 ms to find 0 implicit places.
[2024-05-22 23:25:32] [INFO ] Invariant cache hit.
[2024-05-22 23:25:39] [INFO ] Dead Transitions using invariants and state equation in 6968 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7837 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Built C files in :
/tmp/ltsmin14712761981263046931
[2024-05-22 23:25:39] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14712761981263046931
Running compilation step : cd /tmp/ltsmin14712761981263046931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14712761981263046931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14712761981263046931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:25:42] [INFO ] Flatten gal took : 400 ms
[2024-05-22 23:25:43] [INFO ] Flatten gal took : 353 ms
[2024-05-22 23:25:43] [INFO ] Time to serialize gal into /tmp/LTL16227419744623082088.gal : 49 ms
[2024-05-22 23:25:43] [INFO ] Time to serialize properties into /tmp/LTL16949878247053527071.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16227419744623082088.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10711136853296987368.hoa' '-atoms' '/tmp/LTL16949878247053527071.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16949878247053527071.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10711136853296987368.hoa
Detected timeout of ITS tools.
[2024-05-22 23:25:58] [INFO ] Flatten gal took : 272 ms
[2024-05-22 23:25:59] [INFO ] Flatten gal took : 281 ms
[2024-05-22 23:25:59] [INFO ] Time to serialize gal into /tmp/LTL9813847074308020521.gal : 48 ms
[2024-05-22 23:25:59] [INFO ] Time to serialize properties into /tmp/LTL15889649717450602814.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9813847074308020521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15889649717450602814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((cAMP__21_42_<1)||(cAMP__24_43_<2))"))||(X(X(F("(cAMP__39_41_>=2)")))))))
Formula 0 simplified : X(F!"((cAMP__21_42_<1)||(cAMP__24_43_<2))" & XXG!"(cAMP__39_41_>=2)")
Detected timeout of ITS tools.
[2024-05-22 23:26:14] [INFO ] Flatten gal took : 259 ms
[2024-05-22 23:26:14] [INFO ] Applying decomposition
[2024-05-22 23:26:14] [INFO ] Flatten gal took : 273 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9877083274206572871.txt' '-o' '/tmp/graph9877083274206572871.bin' '-w' '/tmp/graph9877083274206572871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9877083274206572871.bin' '-l' '-1' '-v' '-w' '/tmp/graph9877083274206572871.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:26:15] [INFO ] Decomposing Gal with order
[2024-05-22 23:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:26:16] [INFO ] Removed a total of 13864 redundant transitions.
[2024-05-22 23:26:16] [INFO ] Flatten gal took : 545 ms
[2024-05-22 23:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 72 ms.
[2024-05-22 23:26:16] [INFO ] Time to serialize gal into /tmp/LTL11146350524281634484.gal : 75 ms
[2024-05-22 23:26:16] [INFO ] Time to serialize properties into /tmp/LTL9011171094320484879.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11146350524281634484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9011171094320484879.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i6.i1.i0.u107.cAMP__21_42_<1)||(i6.i1.i1.u128.cAMP__24_43_<2))"))||(X(X(F("(i11.u239.cAMP__39_41_>=2)")))))))
Formula 0 simplified : X(F!"((i6.i1.i0.u107.cAMP__21_42_<1)||(i6.i1.i1.u128.cAMP__24_43_<2))" & XXG!"(i11.u239.cAMP__39_41_>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10247986943255442571
[2024-05-22 23:26:31] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10247986943255442571
Running compilation step : cd /tmp/ltsmin10247986943255442571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10247986943255442571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10247986943255442571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-12 finished in 136764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((p1&&(p2 U X(p3))))))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 484 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:26:35] [INFO ] Invariant cache hit.
[2024-05-22 23:26:35] [INFO ] Implicit Places using invariants in 267 ms returned []
Implicit Place search using SMT only with invariants took 268 ms to find 0 implicit places.
[2024-05-22 23:26:35] [INFO ] Invariant cache hit.
[2024-05-22 23:26:42] [INFO ] Dead Transitions using invariants and state equation in 6686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7442 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 3 s1205), p2:(LEQ 2 s726), p0:(LEQ 2 s898), p3:(LEQ s1262 s1274)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2681 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-13 finished in 10446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(((p1 U (p2||G(p1))) U ((p3&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 479 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:26:45] [INFO ] Invariant cache hit.
[2024-05-22 23:26:45] [INFO ] Implicit Places using invariants in 260 ms returned []
Implicit Place search using SMT only with invariants took 265 ms to find 0 implicit places.
[2024-05-22 23:26:45] [INFO ] Invariant cache hit.
[2024-05-22 23:26:52] [INFO ] Dead Transitions using invariants and state equation in 7007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7761 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(GT 2 s711), p2:(AND (GT s1265 s1156) (GT 2 s1203)), p1:(GT 2 s1203), p3:(GT s1219 s1420)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 71 reset in 1491 ms.
Product exploration explored 100000 steps with 55 reset in 1641 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3)))))), (X (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 185 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 13 states, 41 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 587 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-22 23:26:57] [INFO ] Invariant cache hit.
[2024-05-22 23:26:58] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2024-05-22 23:26:58] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2024-05-22 23:26:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-22 23:27:23] [INFO ] After 24070ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2024-05-22 23:27:23] [INFO ] After 24075ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-22 23:27:23] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 12 Parikh solutions to 7 different solutions.
Finished Parikh walk after 10413 steps, including 0 resets, run visited all 1 properties in 115 ms. (steps per millisecond=90 )
Parikh walk visited 8 properties in 1202 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2495 places
Drop transitions removed 19340 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 19396 transitions.
Applied a total of 1 rules in 18 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/19404 (removed 19396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 5/2500 places, 8/19404 transitions.
Finished random walk after 51 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3)))))), (X (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))]
False Knowledge obtained : [(F (AND p2 p3 p1 (NOT p0))), (F (AND p2 p3 (NOT p1) p0)), (F (AND p2 p3 p1 p0)), (F (AND (NOT p2) p3 p1)), (F (NOT (OR (AND p2 p3) (AND p2 p0) (AND p3 p1) (AND p1 p0)))), (F (NOT (AND (NOT p2) p1 p0))), (F (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0)))), (F (AND p2 p3 (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) p3 p1 p0)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (F (AND (NOT p2) p3 p1 (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 24 factoid took 875 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter insensitive) to 13 states, 41 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 556 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 612 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19308 edges and 2500 vertex of which 2494 / 2500 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2493 places
Ensure Unique test removed 19391 transitions
Reduce isomorphic transitions removed 19391 transitions.
Applied a total of 1 rules in 25 ms. Remains 7 /2500 variables (removed 2493) and now considering 13/19404 (removed 19391) transitions.
// Phase 1: matrix 13 rows 7 cols
[2024-05-22 23:27:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:27:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 23:27:26] [INFO ] Invariant cache hit.
[2024-05-22 23:27:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-22 23:27:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:27:26] [INFO ] Invariant cache hit.
[2024-05-22 23:27:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/2500 places, 13/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 7/2500 places, 13/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X p0), (X (NOT (AND p2 p3 p1 p0))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 p3 p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (NOT (AND p2 p3 (NOT p1) p0))), (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p3 p1 (NOT p0))))), true, (X (X (NOT (AND p2 p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))))]
False Knowledge obtained : [(X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))), (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (AND (NOT p2) p3 p1)), (X (NOT (AND (NOT p2) p3 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) p3 p1 p0)), (X (NOT (AND (NOT p2) p3 p1 p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 p3 p1 p0))), (X (X (NOT (AND p2 p3 p1 p0)))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p1))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p3 p1 p0))), (X (X (NOT (AND (NOT p2) p3 p1 p0))))]
Knowledge based reduction with 17 factoid took 1239 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter insensitive) to 13 states, 41 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 501 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 23:27:28] [INFO ] Invariant cache hit.
[2024-05-22 23:27:28] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X p0), (X (NOT (AND p2 p3 p1 p0))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 p3 p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (NOT (AND p2 p3 (NOT p1) p0))), (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p3 p1 (NOT p0))))), true, (X (X (NOT (AND p2 p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p3 p1 (NOT p0))))), (G (NOT (AND p0 (NOT p1) p2 p3))), (G (NOT (AND (NOT p0) (NOT p1) p2 p3)))]
False Knowledge obtained : [(X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))), (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (AND (NOT p2) p3 p1)), (X (NOT (AND (NOT p2) p3 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) p3 p1 p0)), (X (NOT (AND (NOT p2) p3 p1 p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 p3 p1 p0))), (X (X (NOT (AND p2 p3 p1 p0)))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p3) p1))))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p1))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p3 p1 p0))), (X (X (NOT (AND (NOT p2) p3 p1 p0)))), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1 p2 p3)), (F (AND p1 (NOT p2) p3)), (F (NOT (OR (AND p0 p1) (AND p0 p2) (AND p1 p3) (AND p2 p3)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2 p3)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1809 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter insensitive) to 13 states, 41 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 568 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 640 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 610 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-14 finished in 46931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((F(p1)&&G((p2&&F(p3))))))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 487 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:27:32] [INFO ] Computed 1 invariants in 80 ms
[2024-05-22 23:27:32] [INFO ] Implicit Places using invariants in 357 ms returned []
Implicit Place search using SMT only with invariants took 363 ms to find 0 implicit places.
[2024-05-22 23:27:32] [INFO ] Invariant cache hit.
[2024-05-22 23:27:39] [INFO ] Dead Transitions using invariants and state equation in 6964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7817 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s2179), p2:(LEQ 1 s1398), p1:(LEQ s152 s961), p3:(LEQ 2 s1726)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2611 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA Diffusion2D-PT-D50N050-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-15 finished in 10720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||G(p1)))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N050-LTLCardinality-00
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 13 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 23:27:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:27:43] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 23:27:43] [INFO ] Invariant cache hit.
[2024-05-22 23:27:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 23:27:43] [INFO ] Invariant cache hit.
[2024-05-22 23:27:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 83 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s2 s0), p1:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
Treatment of property Diffusion2D-PT-D50N050-LTLCardinality-00 finished in 304 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
[2024-05-22 23:27:43] [INFO ] Flatten gal took : 255 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18043329581831680355
[2024-05-22 23:27:43] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2024-05-22 23:27:43] [INFO ] Applying decomposition
[2024-05-22 23:27:43] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18043329581831680355
Running compilation step : cd /tmp/ltsmin18043329581831680355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 23:27:44] [INFO ] Flatten gal took : 289 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7452427914548764564.txt' '-o' '/tmp/graph7452427914548764564.bin' '-w' '/tmp/graph7452427914548764564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7452427914548764564.bin' '-l' '-1' '-v' '-w' '/tmp/graph7452427914548764564.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:27:44] [INFO ] Decomposing Gal with order
[2024-05-22 23:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:27:45] [INFO ] Removed a total of 13258 redundant transitions.
[2024-05-22 23:27:45] [INFO ] Flatten gal took : 538 ms
[2024-05-22 23:27:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 88 ms.
[2024-05-22 23:27:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality12495560094785772243.gal : 54 ms
[2024-05-22 23:27:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality7860603247556290781.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12495560094785772243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7860603247556290781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F((("(gu288.cAMP__48_34_>gu288.cAMP__11_6_)")&&(X("(gi3.gu106.cAMP__22_34_<3)")))||(G("(gi3.gu106.cAMP__22_34_<3)"))))))
Formula 0 simplified : G(F!"(gi3.gu106.cAMP__22_34_<3)" & FG(!"(gu288.cAMP__48_34_>gu288.cAMP__11_6_)" | X!"(gi3.gu106.cAMP__22_34_<3)"))
Compilation finished in 180295 ms.
Running link step : cd /tmp/ltsmin18043329581831680355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 162 ms.
Running LTSmin : cd /tmp/ltsmin18043329581831680355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.495: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.495: LTL layer: formula: [](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.496: "[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.529: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.578: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.602: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.629: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.688: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.696: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.703: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.716: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 10.499: There are 19409 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 10.499: State length is 2501, there are 19415 groups
pins2lts-mc-linux64( 0/ 8), 10.499: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 10.499: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 10.499: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 10.499: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 12.178: [Blue] ~120 levels ~960 states ~16704 transitions
pins2lts-mc-linux64( 7/ 8), 13.821: [Blue] ~240 levels ~1920 states ~40064 transitions
pins2lts-mc-linux64( 0/ 8), 17.195: [Blue] ~480 levels ~3840 states ~90688 transitions
pins2lts-mc-linux64( 7/ 8), 23.476: [Blue] ~960 levels ~7680 states ~178304 transitions
pins2lts-mc-linux64( 7/ 8), 35.594: [Blue] ~1920 levels ~15360 states ~357464 transitions
pins2lts-mc-linux64( 7/ 8), 60.738: [Blue] ~3840 levels ~30720 states ~694440 transitions
pins2lts-mc-linux64( 7/ 8), 109.683: [Blue] ~7680 levels ~61440 states ~1690520 transitions
pins2lts-mc-linux64( 7/ 8), 205.839: [Blue] ~15360 levels ~122880 states ~4106592 transitions
pins2lts-mc-linux64( 7/ 8), 406.627: [Blue] ~30720 levels ~245760 states ~9474456 transitions
pins2lts-mc-linux64( 7/ 8), 802.484: [Blue] ~61440 levels ~491520 states ~20749992 transitions
pins2lts-mc-linux64( 2/ 8), 1079.599: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1081.215:
pins2lts-mc-linux64( 0/ 8), 1081.216: Explored 644961 states 49621791 transitions, fanout: 76.938
pins2lts-mc-linux64( 0/ 8), 1081.216: Total exploration time 1070.690 sec (1069.120 sec minimum, 1069.615 sec on average)
pins2lts-mc-linux64( 0/ 8), 1081.216: States per second: 602, Transitions per second: 46346
pins2lts-mc-linux64( 0/ 8), 1081.216:
pins2lts-mc-linux64( 0/ 8), 1081.216: State space has 42765228 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1081.216: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1081.216: blue states: 644961 (1.51%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1081.216: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1081.216: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1081.216:
pins2lts-mc-linux64( 0/ 8), 1081.216: Total memory used for local state coloring: 9.8MB
pins2lts-mc-linux64( 0/ 8), 1081.216:
pins2lts-mc-linux64( 0/ 8), 1081.216: Queue width: 8B, total height: 644961, memory: 4.92MB
pins2lts-mc-linux64( 0/ 8), 1081.216: Tree memory: 582.3MB, 14.3 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 1081.216: Tree fill ratio (roots/leafs): 31.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 1081.216: Stored 20743 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1081.216: Total memory used for chunk indexing: 1MB
pins2lts-mc-linux64( 0/ 8), 1081.216: Est. total memory use: 588.2MB (~1029.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18043329581831680355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18043329581831680355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 23:50:21] [INFO ] Flatten gal took : 289 ms
[2024-05-22 23:50:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality9768920837629656058.gal : 49 ms
[2024-05-22 23:50:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality15885328450004701901.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9768920837629656058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15885328450004701901.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F((("(cAMP__48_34_>cAMP__11_6_)")&&(X("(cAMP__22_34_<3)")))||(G("(cAMP__22_34_<3)"))))))
Formula 0 simplified : G(F!"(cAMP__22_34_<3)" & FG(!"(cAMP__48_34_>cAMP__11_6_)" | X!"(cAMP__22_34_<3)"))
Detected timeout of ITS tools.
[2024-05-23 00:12:57] [INFO ] Flatten gal took : 332 ms
[2024-05-23 00:12:58] [INFO ] Input system was already deterministic with 19404 transitions.
[2024-05-23 00:12:58] [INFO ] Transformed 2500 places.
[2024-05-23 00:12:58] [INFO ] Transformed 19404 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 00:13:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality3195547452727047682.gal : 44 ms
[2024-05-23 00:13:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality2963517594083323332.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3195547452727047682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2963517594083323332.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((("(cAMP__48_34_>cAMP__11_6_)")&&(X("(cAMP__22_34_<3)")))||(G("(cAMP__22_34_<3)"))))))
Formula 0 simplified : G(F!"(cAMP__22_34_<3)" & FG(!"(cAMP__48_34_>cAMP__11_6_)" | X!"(cAMP__22_34_<3)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10239088 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16026820 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D50N050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Diffusion2D-PT-D50N050, 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 r153-tall-171631151300212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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