Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413900924.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413900924
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 16K Feb 26 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 02:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 24M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679623143786

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-24 01:59:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-24 01:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 01:59:06] [INFO ] Load time of PNML (sax parser for PT used): 748 ms
[2023-03-24 01:59:06] [INFO ] Transformed 22816 places.
[2023-03-24 01:59:06] [INFO ] Transformed 35015 transitions.
[2023-03-24 01:59:06] [INFO ] Parsed PT model containing 22816 places and 35015 transitions and 137470 arcs in 960 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 22816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22816/22816 places, 35015/35015 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 22768 transition count 35015
Applied a total of 48 rules in 2091 ms. Remains 22768 /22816 variables (removed 48) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 01:59:08] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 01:59:12] [INFO ] Computed 1565 place invariants in 3667 ms
[2023-03-24 01:59:14] [INFO ] Implicit Places using invariants in 5887 ms returned []
Implicit Place search using SMT only with invariants took 5916 ms to find 0 implicit places.
[2023-03-24 01:59:14] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 01:59:14] [INFO ] Invariant cache hit.
[2023-03-24 01:59:16] [INFO ] Dead Transitions using invariants and state equation in 2138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22768/22816 places, 35015/35015 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10163 ms. Remains : 22768/22816 places, 35015/35015 transitions.
Support contains 53 out of 22768 places after structural reductions.
[2023-03-24 01:59:18] [INFO ] Flatten gal took : 1254 ms
[2023-03-24 01:59:19] [INFO ] Flatten gal took : 976 ms
[2023-03-24 01:59:21] [INFO ] Input system was already deterministic with 35015 transitions.
Support contains 51 out of 22768 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 882 ms. (steps per millisecond=11 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-24 01:59:22] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 01:59:22] [INFO ] Invariant cache hit.
[2023-03-24 01:59:31] [INFO ] [Real]Absence check using 63 positive place invariants in 273 ms returned sat
[2023-03-24 01:59:32] [INFO ] [Real]Absence check using 63 positive and 1502 generalized place invariants in 1142 ms returned sat
[2023-03-24 01:59:47] [INFO ] After 9765ms SMT Verify possible using state equation in real domain returned unsat :2 sat :18
[2023-03-24 01:59:48] [INFO ] State equation strengthened by 11266 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 01:59:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 01:59:48] [INFO ] After 25205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 22768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6255 transitions
Trivial Post-agglo rules discarded 6255 transitions
Performed 6255 trivial Post agglomeration. Transition count delta: 6255
Iterating post reduction 0 with 6255 rules applied. Total rules applied 6255 place count 22768 transition count 28760
Reduce places removed 6255 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 6335 rules applied. Total rules applied 12590 place count 16513 transition count 28680
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 12670 place count 16433 transition count 28680
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 12670 place count 16433 transition count 28289
Deduced a syphon composed of 391 places in 28 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 13452 place count 16042 transition count 28289
Discarding 5934 places :
Symmetric choice reduction at 3 with 5934 rule applications. Total rules 19386 place count 10108 transition count 22355
Iterating global reduction 3 with 5934 rules applied. Total rules applied 25320 place count 10108 transition count 22355
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 25320 place count 10108 transition count 22348
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 25334 place count 10101 transition count 22348
Discarding 983 places :
Symmetric choice reduction at 3 with 983 rule applications. Total rules 26317 place count 9118 transition count 16450
Iterating global reduction 3 with 983 rules applied. Total rules applied 27300 place count 9118 transition count 16450
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 17 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 27364 place count 9086 transition count 16418
Free-agglomeration rule (complex) applied 568 times.
Iterating global reduction 3 with 568 rules applied. Total rules applied 27932 place count 9086 transition count 20765
Reduce places removed 568 places and 0 transitions.
Iterating post reduction 3 with 568 rules applied. Total rules applied 28500 place count 8518 transition count 20765
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 4 with 160 rules applied. Total rules applied 28660 place count 8518 transition count 20765
Applied a total of 28660 rules in 13620 ms. Remains 8518 /22768 variables (removed 14250) and now considering 20765/35015 (removed 14250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13624 ms. Remains : 8518/22768 places, 20765/35015 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 886 ms. (steps per millisecond=11 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 11007 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11007 steps, saw 5274 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 18 properties.
[2023-03-24 02:00:05] [INFO ] Flow matrix only has 19213 transitions (discarded 1552 similar events)
// Phase 1: matrix 19213 rows 8518 cols
[2023-03-24 02:00:06] [INFO ] Computed 1565 place invariants in 977 ms
[2023-03-24 02:00:09] [INFO ] [Real]Absence check using 65 positive place invariants in 150 ms returned sat
[2023-03-24 02:00:10] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 563 ms returned sat
[2023-03-24 02:00:12] [INFO ] After 5674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-24 02:00:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 141 ms returned sat
[2023-03-24 02:00:15] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 563 ms returned sat
[2023-03-24 02:00:37] [INFO ] After 19877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-24 02:00:37] [INFO ] State equation strengthened by 11266 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 02:00:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 02:00:37] [INFO ] After 25252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 35 out of 8518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8518/8518 places, 20765/20765 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8518 transition count 20764
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8517 transition count 20764
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8517 transition count 20763
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8516 transition count 20763
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 8515 transition count 20762
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 8515 transition count 20762
Applied a total of 6 rules in 3968 ms. Remains 8515 /8518 variables (removed 3) and now considering 20762/20765 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3970 ms. Remains : 8515/8518 places, 20762/20765 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 11031 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11031 steps, saw 5283 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 18 properties.
[2023-03-24 02:00:45] [INFO ] Flow matrix only has 19210 transitions (discarded 1552 similar events)
// Phase 1: matrix 19210 rows 8515 cols
[2023-03-24 02:00:46] [INFO ] Computed 1565 place invariants in 864 ms
[2023-03-24 02:00:49] [INFO ] [Real]Absence check using 65 positive place invariants in 148 ms returned sat
[2023-03-24 02:00:50] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 529 ms returned sat
[2023-03-24 02:01:11] [INFO ] After 19710ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:8
[2023-03-24 02:01:12] [INFO ] State equation strengthened by 11266 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 02:01:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 02:01:12] [INFO ] After 25269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 35 out of 8515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8515/8515 places, 20762/20762 transitions.
Applied a total of 0 rules in 1272 ms. Remains 8515 /8515 variables (removed 0) and now considering 20762/20762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1272 ms. Remains : 8515/8515 places, 20762/20762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8515/8515 places, 20762/20762 transitions.
Applied a total of 0 rules in 1214 ms. Remains 8515 /8515 variables (removed 0) and now considering 20762/20762 (removed 0) transitions.
[2023-03-24 02:01:14] [INFO ] Flow matrix only has 19210 transitions (discarded 1552 similar events)
[2023-03-24 02:01:14] [INFO ] Invariant cache hit.
[2023-03-24 02:01:15] [INFO ] Implicit Places using invariants in 752 ms returned []
Implicit Place search using SMT only with invariants took 756 ms to find 0 implicit places.
[2023-03-24 02:01:15] [INFO ] Flow matrix only has 19210 transitions (discarded 1552 similar events)
[2023-03-24 02:01:15] [INFO ] Invariant cache hit.
[2023-03-24 02:01:16] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2709 ms. Remains : 8515/8515 places, 20762/20762 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 16752 stabilizing places and 23046 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1724 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:01:18] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 02:01:21] [INFO ] Computed 1565 place invariants in 3262 ms
[2023-03-24 02:01:23] [INFO ] Implicit Places using invariants in 5008 ms returned []
Implicit Place search using SMT only with invariants took 5013 ms to find 0 implicit places.
[2023-03-24 02:01:23] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:01:23] [INFO ] Invariant cache hit.
[2023-03-24 02:01:24] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8467 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 14 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01 finished in 8772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p0)||G(p1))))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1772 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:01:26] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:01:26] [INFO ] Invariant cache hit.
[2023-03-24 02:01:28] [INFO ] Implicit Places using invariants in 1727 ms returned []
Implicit Place search using SMT only with invariants took 1728 ms to find 0 implicit places.
[2023-03-24 02:01:28] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:01:28] [INFO ] Invariant cache hit.
[2023-03-24 02:01:30] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5221 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s4545 1) (GEQ s5135 1)), p1:(OR (LT s7136 1) (LT s7689 1))], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 88756 steps with 1442 reset in 2414 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02 finished in 8029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6320 transitions
Trivial Post-agglo rules discarded 6320 transitions
Performed 6320 trivial Post agglomeration. Transition count delta: 6320
Iterating post reduction 0 with 6320 rules applied. Total rules applied 6320 place count 22768 transition count 28695
Reduce places removed 6320 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12656 place count 16448 transition count 28679
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28284
Deduced a syphon composed of 395 places in 24 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 13462 place count 16037 transition count 28284
Discarding 5939 places :
Symmetric choice reduction at 3 with 5939 rule applications. Total rules 19401 place count 10098 transition count 22345
Iterating global reduction 3 with 5939 rules applied. Total rules applied 25340 place count 10098 transition count 22345
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25340 place count 10098 transition count 22334
Deduced a syphon composed of 11 places in 16 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 25362 place count 10087 transition count 22334
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 26351 place count 9098 transition count 16400
Iterating global reduction 3 with 989 rules applied. Total rules applied 27340 place count 9098 transition count 16400
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27406 place count 9065 transition count 16367
Applied a total of 27406 rules in 9111 ms. Remains 9065 /22768 variables (removed 13703) and now considering 16367/35015 (removed 18648) transitions.
[2023-03-24 02:01:42] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
// Phase 1: matrix 15311 rows 9065 cols
[2023-03-24 02:01:42] [INFO ] Computed 1565 place invariants in 687 ms
[2023-03-24 02:01:43] [INFO ] Implicit Places using invariants in 1464 ms returned []
Implicit Place search using SMT only with invariants took 1465 ms to find 0 implicit places.
[2023-03-24 02:01:43] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2023-03-24 02:01:43] [INFO ] Invariant cache hit.
[2023-03-24 02:01:44] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9065/22768 places, 16367/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11353 ms. Remains : 9065/22768 places, 16367/35015 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7130 1) (GEQ s7541 1)), p1:(OR (LT s5093 1) (LT s5325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03 finished in 11546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1)) U X(p0)))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1709 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:01:46] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 02:01:49] [INFO ] Computed 1565 place invariants in 3245 ms
[2023-03-24 02:01:51] [INFO ] Implicit Places using invariants in 4931 ms returned []
Implicit Place search using SMT only with invariants took 4932 ms to find 0 implicit places.
[2023-03-24 02:01:51] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:01:51] [INFO ] Invariant cache hit.
[2023-03-24 02:01:53] [INFO ] Dead Transitions using invariants and state equation in 1681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8325 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3882 1) (GEQ s8275 1)), p1:(AND (GEQ s15234 1) (GEQ s19194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04 finished in 8591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6336 transitions
Trivial Post-agglo rules discarded 6336 transitions
Performed 6336 trivial Post agglomeration. Transition count delta: 6336
Iterating post reduction 0 with 6336 rules applied. Total rules applied 6336 place count 22768 transition count 28679
Reduce places removed 6336 places and 0 transitions.
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28283
Deduced a syphon composed of 396 places in 22 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 13464 place count 16036 transition count 28283
Discarding 5940 places :
Symmetric choice reduction at 2 with 5940 rule applications. Total rules 19404 place count 10096 transition count 22343
Iterating global reduction 2 with 5940 rules applied. Total rules applied 25344 place count 10096 transition count 22343
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25344 place count 10096 transition count 22331
Deduced a syphon composed of 12 places in 15 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 25368 place count 10084 transition count 22331
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 26358 place count 9094 transition count 16391
Iterating global reduction 2 with 990 rules applied. Total rules applied 27348 place count 9094 transition count 16391
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 27414 place count 9061 transition count 16358
Applied a total of 27414 rules in 8919 ms. Remains 9061 /22768 variables (removed 13707) and now considering 16358/35015 (removed 18657) transitions.
[2023-03-24 02:02:02] [INFO ] Flow matrix only has 15302 transitions (discarded 1056 similar events)
// Phase 1: matrix 15302 rows 9061 cols
[2023-03-24 02:02:02] [INFO ] Computed 1565 place invariants in 692 ms
[2023-03-24 02:02:03] [INFO ] Implicit Places using invariants in 1499 ms returned []
Implicit Place search using SMT only with invariants took 1501 ms to find 0 implicit places.
[2023-03-24 02:02:03] [INFO ] Flow matrix only has 15302 transitions (discarded 1056 similar events)
[2023-03-24 02:02:03] [INFO ] Invariant cache hit.
[2023-03-24 02:02:04] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9061/22768 places, 16358/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11188 ms. Remains : 9061/22768 places, 16358/35015 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s343 1) (GEQ s4569 1))], 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 42 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05 finished in 11290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X((p1&&G(F(p2))))))'
Support contains 7 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1736 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:02:06] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 02:02:09] [INFO ] Computed 1565 place invariants in 3268 ms
[2023-03-24 02:02:11] [INFO ] Implicit Places using invariants in 4996 ms returned []
Implicit Place search using SMT only with invariants took 4998 ms to find 0 implicit places.
[2023-03-24 02:02:11] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:02:11] [INFO ] Invariant cache hit.
[2023-03-24 02:02:13] [INFO ] Dead Transitions using invariants and state equation in 1689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8426 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p0), (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s5826 1) (LT s5829 1) (LT s12457 1)), p1:(OR (LT s22295 1) (LT s22720 1)), p2:(AND (GEQ s7721 1) (GEQ s8269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 1 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06 finished in 8734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6304 transitions
Trivial Post-agglo rules discarded 6304 transitions
Performed 6304 trivial Post agglomeration. Transition count delta: 6304
Iterating post reduction 0 with 6304 rules applied. Total rules applied 6304 place count 22768 transition count 28711
Reduce places removed 6304 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12640 place count 16464 transition count 28679
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28285
Deduced a syphon composed of 394 places in 22 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 13460 place count 16038 transition count 28285
Discarding 5938 places :
Symmetric choice reduction at 3 with 5938 rule applications. Total rules 19398 place count 10100 transition count 22347
Iterating global reduction 3 with 5938 rules applied. Total rules applied 25336 place count 10100 transition count 22347
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25336 place count 10100 transition count 22337
Deduced a syphon composed of 10 places in 15 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 25356 place count 10090 transition count 22337
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 26344 place count 9102 transition count 16409
Iterating global reduction 3 with 988 rules applied. Total rules applied 27332 place count 9102 transition count 16409
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27398 place count 9069 transition count 16376
Applied a total of 27398 rules in 9006 ms. Remains 9069 /22768 variables (removed 13699) and now considering 16376/35015 (removed 18639) transitions.
[2023-03-24 02:02:22] [INFO ] Flow matrix only has 15320 transitions (discarded 1056 similar events)
// Phase 1: matrix 15320 rows 9069 cols
[2023-03-24 02:02:23] [INFO ] Computed 1565 place invariants in 689 ms
[2023-03-24 02:02:23] [INFO ] Implicit Places using invariants in 1462 ms returned []
Implicit Place search using SMT only with invariants took 1463 ms to find 0 implicit places.
[2023-03-24 02:02:23] [INFO ] Flow matrix only has 15320 transitions (discarded 1056 similar events)
[2023-03-24 02:02:23] [INFO ] Invariant cache hit.
[2023-03-24 02:02:24] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9069/22768 places, 16376/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11238 ms. Remains : 9069/22768 places, 16376/35015 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4437 1) (GEQ s4460 1)), p0:(AND (GEQ s3827 1) (GEQ s3842 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07 finished in 11364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1698 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:02:26] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 02:02:29] [INFO ] Computed 1565 place invariants in 3190 ms
[2023-03-24 02:02:31] [INFO ] Implicit Places using invariants in 4911 ms returned []
Implicit Place search using SMT only with invariants took 4912 ms to find 0 implicit places.
[2023-03-24 02:02:31] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:02:31] [INFO ] Invariant cache hit.
[2023-03-24 02:02:33] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8321 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16523 1), p1:(AND (GEQ s10464 1) (GEQ s10905 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09 finished in 8581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||G(p1))))))'
Support contains 6 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1670 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:02:34] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:02:34] [INFO ] Invariant cache hit.
[2023-03-24 02:02:36] [INFO ] Implicit Places using invariants in 1792 ms returned []
Implicit Place search using SMT only with invariants took 1793 ms to find 0 implicit places.
[2023-03-24 02:02:36] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:02:36] [INFO ] Invariant cache hit.
[2023-03-24 02:02:38] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5156 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s968 1) (GEQ s22336 1)), p1:(OR (AND (GEQ s3325 1) (GEQ s22685 1)) (LT s11661 1) (LT s11916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43048 steps with 699 reset in 1056 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10 finished in 6547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p0 U X((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))'
Support contains 8 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1763 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:02:41] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:02:41] [INFO ] Invariant cache hit.
[2023-03-24 02:02:43] [INFO ] Implicit Places using invariants in 1719 ms returned []
Implicit Place search using SMT only with invariants took 1719 ms to find 0 implicit places.
[2023-03-24 02:02:43] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:02:43] [INFO ] Invariant cache hit.
[2023-03-24 02:02:45] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5191 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s5602 1) (GEQ s14639 1)), p2:(AND (GEQ s12978 1) (GEQ s16939 1)), p3:(AND (GEQ s8550 1) (GEQ s9363 1)), p1:(AND (GEQ s5135 1) (GEQ s19855 1))...], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 9882 ms.
Product exploration timeout after 99210 steps with 33070 reset in 10001 ms.
Computed a total of 16752 stabilizing places and 23046 stable transitions
Computed a total of 16752 stabilizing places and 23046 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))
Knowledge based reduction with 12 factoid took 348 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11 finished in 25903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X((!p1 U G(p2))))))))'
Support contains 6 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1712 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 02:03:07] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:03:07] [INFO ] Invariant cache hit.
[2023-03-24 02:03:09] [INFO ] Implicit Places using invariants in 1757 ms returned []
Implicit Place search using SMT only with invariants took 1758 ms to find 0 implicit places.
[2023-03-24 02:03:09] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 02:03:09] [INFO ] Invariant cache hit.
[2023-03-24 02:03:10] [INFO ] Dead Transitions using invariants and state equation in 1724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5195 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 454 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=9 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s17274 1) (GEQ s17912 1)), p2:(AND (GEQ s20547 1) (GEQ s21340 1)), p1:(AND (GEQ s12454 1) (GEQ s19878 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14 finished in 5744 ms.
All properties solved by simple procedures.
Total runtime 246119 ms.

BK_STOP 1679623392380

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="MultiCrashLeafsetExtension-PT-S32C06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-167856413900924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C06.tgz
mv MultiCrashLeafsetExtension-PT-S32C06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;