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.r329-tall-167889202700915.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RingSingleMessageInMbox-PT-d2m080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202700915
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 102M
-rw-r--r-- 1 mcc users 8.1K Feb 26 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 05:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 05:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 05:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 102M Mar 5 18:23 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 RingSingleMessageInMbox-PT-d2m080-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d2m080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679199033310

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d2m080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 04:10:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 04:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:10:37] [INFO ] Load time of PNML (sax parser for PT used): 3053 ms
[2023-03-19 04:10:38] [INFO ] Transformed 66950 places.
[2023-03-19 04:10:38] [INFO ] Transformed 213625 transitions.
[2023-03-19 04:10:38] [INFO ] Parsed PT model containing 66950 places and 213625 transitions and 854500 arcs in 3649 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 36863 places in 358 ms
Reduce places removed 36863 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m080-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 30087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30087/30087 places, 213625/213625 transitions.
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 30052 transition count 213325
Discarding 308 places :
Symmetric choice reduction at 1 with 308 rule applications. Total rules 643 place count 29744 transition count 44681
Iterating global reduction 1 with 308 rules applied. Total rules applied 951 place count 29744 transition count 44681
Applied a total of 951 rules in 3656 ms. Remains 29744 /30087 variables (removed 343) and now considering 44681/213625 (removed 168944) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-19 04:11:07] [INFO ] Computed 3 place invariants in 13044 ms
[2023-03-19 04:11:10] [INFO ] Implicit Places using invariants in 15548 ms returned []
Implicit Place search using SMT only with invariants took 26932 ms to find 0 implicit places.
[2023-03-19 04:11:10] [INFO ] Invariant cache hit.
[2023-03-19 04:11:12] [INFO ] Dead Transitions using invariants and state equation in 2246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29744/30087 places, 44681/213625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32847 ms. Remains : 29744/30087 places, 44681/213625 transitions.
Support contains 13 out of 29744 places after structural reductions.
[2023-03-19 04:11:15] [INFO ] Flatten gal took : 2176 ms
[2023-03-19 04:11:16] [INFO ] Flatten gal took : 1286 ms
[2023-03-19 04:11:19] [INFO ] Input system was already deterministic with 44681 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 3130 ms. (steps per millisecond=3 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 04:11:22] [INFO ] Invariant cache hit.
[2023-03-19 04:11:29] [INFO ] After 6649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 04:11:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 97 ms returned sat
[2023-03-19 04:11:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-19 04:11:54] [INFO ] After 12672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 04:35:52] [INFO ] State equation strengthened by 14909 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-19 04:35:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 04:35:53] [INFO ] After 1463688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.213 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 2432 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2440 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.311 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(p0)))||(p1 U X(G(!p0)))))'
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 224 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 04:35:56] [INFO ] Invariant cache hit.
[2023-03-19 04:36:24] [INFO ] Implicit Places using invariants in 27802 ms returned []
Implicit Place search using SMT only with invariants took 27804 ms to find 0 implicit places.
[2023-03-19 04:36:24] [INFO ] Invariant cache hit.
[2023-03-19 04:37:08] [INFO ] Dead Transitions using invariants and state equation in 44207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72240 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 423 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d2m080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}], [{ cond=(NOT p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ s22169 s8722), p0:(LEQ s17254 s16824)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 39170 steps with 5702 reset in 10001 ms.
Product exploration timeout after 40010 steps with 5836 reset in 10001 ms.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.136 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Detected a total of 14474/29744 stabilizing places and 21817/44681 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 568 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 4889 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-19 04:37:35] [INFO ] Invariant cache hit.
[2023-03-19 04:37:39] [INFO ] After 4080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:37:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 94 ms returned sat
[2023-03-19 04:37:43] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-19 04:38:04] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.79 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 1041 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1042 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1524 resets, run finished after 2651 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 32295 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 32295 steps, saw 20498 distinct states, run finished after 6002 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-19 04:38:27] [INFO ] Computed 4 place invariants in 13430 ms
[2023-03-19 04:38:31] [INFO ] After 3992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:38:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 303 ms returned sat
[2023-03-19 04:38:56] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 29713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 465 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 463 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-19 04:38:57] [INFO ] Invariant cache hit.
[2023-03-19 04:38:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 04:39:00] [INFO ] Implicit Places using invariants in 2705 ms returned []
Implicit Place search using SMT only with invariants took 2706 ms to find 0 implicit places.
[2023-03-19 04:39:00] [INFO ] Invariant cache hit.
[2023-03-19 04:39:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 04:39:02] [INFO ] Dead Transitions using invariants and state equation in 2504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5680 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 29713 transition count 44575
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 111 place count 29677 transition count 44545
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 111 place count 29677 transition count 44417
Deduced a syphon composed of 128 places in 17 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 367 place count 29549 transition count 44417
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 14 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 441 place count 29512 transition count 44380
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 591 place count 29512 transition count 44230
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 603 place count 29506 transition count 44224
Free-agglomeration rule applied 14397 times.
Iterating global reduction 3 with 14397 rules applied. Total rules applied 15000 place count 29506 transition count 29827
Reduce places removed 14397 places and 0 transitions.
Iterating post reduction 3 with 14397 rules applied. Total rules applied 29397 place count 15109 transition count 29827
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 29402 place count 15109 transition count 29827
Applied a total of 29402 rules in 14321 ms. Remains 15109 /29713 variables (removed 14604) and now considering 29827/44620 (removed 14793) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29827 rows 15109 cols
[2023-03-19 04:39:38] [INFO ] Computed 5 place invariants in 21712 ms
[2023-03-19 04:39:40] [INFO ] After 1664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:39:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 114 ms returned sat
[2023-03-19 04:39:42] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-19 04:43:37] [INFO ] After 237439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 1288 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 298 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 97 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-19 04:43:59] [INFO ] Computed 3 place invariants in 18962 ms
[2023-03-19 04:44:01] [INFO ] Implicit Places using invariants in 21359 ms returned []
Implicit Place search using SMT only with invariants took 21367 ms to find 0 implicit places.
[2023-03-19 04:44:01] [INFO ] Invariant cache hit.
[2023-03-19 04:44:04] [INFO ] Dead Transitions using invariants and state equation in 2970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24441 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.131 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Detected a total of 14474/29744 stabilizing places and 21817/44681 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 516 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 2862 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2023-03-19 04:44:08] [INFO ] Invariant cache hit.
[2023-03-19 04:44:13] [INFO ] After 4568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:44:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 102 ms returned sat
[2023-03-19 04:44:17] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-19 04:44:38] [INFO ] After 19883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:56:19] [INFO ] State equation strengthened by 14909 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 04:56:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 04:56:19] [INFO ] After 726306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.470 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 2939 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2940 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Error while executing :'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--small' '--given-formula=X(p0)' '-F' '/tmp/b4k14995898841774200038.hoa' '--given-strategy=relax'
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--small' '--given-formula=X(p0)' '-F' '/tmp/b4k14995898841774200038.hoa' '--given-strategy=relax' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:141)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:115)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.givenThat(SpotRunner.java:786)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.givenThat(SpotRunner.java:756)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.knowledgeLoop(LTLPropertySolver.java:808)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.spotIntegrateKnowledge(LTLPropertySolver.java:751)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:573)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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)
Knowledge based reduction with 12 factoid took 33649 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 329 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 704 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Product exploration timeout after 18250 steps with 2662 reset in 10966 ms.
Product exploration timeout after 15390 steps with 2261 reset in 11566 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true, false]
Stuttering acceptance computed with spot in 4597 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 2986 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 04:57:28] [INFO ] Invariant cache hit.
[2023-03-19 04:57:30] [INFO ] Dead Transitions using invariants and state equation in 2361 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5359 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 109 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 04:57:30] [INFO ] Invariant cache hit.
[2023-03-19 04:57:33] [INFO ] Implicit Places using invariants in 2520 ms returned []
Implicit Place search using SMT only with invariants took 2523 ms to find 0 implicit places.
[2023-03-19 04:57:33] [INFO ] Invariant cache hit.
[2023-03-19 04:57:35] [INFO ] Dead Transitions using invariants and state equation in 2293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4929 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Treatment of property RingSingleMessageInMbox-PT-d2m080-LTLCardinality-00 finished in 1301741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Support contains 2 out of 29744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 109 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 04:57:37] [INFO ] Invariant cache hit.
[2023-03-19 04:57:40] [INFO ] Implicit Places using invariants in 2296 ms returned []
Implicit Place search using SMT only with invariants took 2298 ms to find 0 implicit places.
[2023-03-19 04:57:40] [INFO ] Invariant cache hit.
[2023-03-19 04:57:42] [INFO ] Dead Transitions using invariants and state equation in 2252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4665 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d2m080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s4949 0), p0:(GT 3 s28896)], 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]]
Product exploration timeout after 42420 steps with 6170 reset in 10001 ms.
Product exploration timeout after 44150 steps with 6356 reset in 10001 ms.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1505 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Detected a total of 14474/29744 stabilizing places and 21817/44681 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 2581 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39438 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 39438 steps, saw 27231 distinct states, run finished after 6001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 04:58:13] [INFO ] Invariant cache hit.
[2023-03-19 04:58:17] [INFO ] [Real]Absence check using 2 positive place invariants in 100 ms returned sat
[2023-03-19 04:58:17] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-19 04:58:38] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.76 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 996 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 997 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1504 resets, run finished after 2442 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39919 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 39919 steps, saw 27221 distinct states, run finished after 6001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-19 04:59:01] [INFO ] Computed 4 place invariants in 13411 ms
[2023-03-19 04:59:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 292 ms returned sat
[2023-03-19 04:59:26] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 433 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 433 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-19 04:59:27] [INFO ] Invariant cache hit.
[2023-03-19 04:59:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 04:59:29] [INFO ] Implicit Places using invariants in 2396 ms returned []
Implicit Place search using SMT only with invariants took 2397 ms to find 0 implicit places.
[2023-03-19 04:59:29] [INFO ] Invariant cache hit.
[2023-03-19 04:59:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 04:59:32] [INFO ] Dead Transitions using invariants and state equation in 2450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5292 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 29713 transition count 44575
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 111 place count 29677 transition count 44545
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 111 place count 29677 transition count 44417
Deduced a syphon composed of 128 places in 16 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 367 place count 29549 transition count 44417
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 13 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 441 place count 29512 transition count 44380
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 591 place count 29512 transition count 44230
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 13 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 603 place count 29506 transition count 44224
Free-agglomeration rule applied 14399 times.
Iterating global reduction 3 with 14399 rules applied. Total rules applied 15002 place count 29506 transition count 29825
Reduce places removed 14399 places and 0 transitions.
Iterating post reduction 3 with 14399 rules applied. Total rules applied 29401 place count 15107 transition count 29825
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 29406 place count 15107 transition count 29825
Applied a total of 29406 rules in 14383 ms. Remains 15107 /29713 variables (removed 14606) and now considering 29825/44620 (removed 14795) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29825 rows 15107 cols
[2023-03-19 05:00:08] [INFO ] Computed 5 place invariants in 22165 ms
[2023-03-19 05:00:10] [INFO ] [Real]Absence check using 4 positive place invariants in 115 ms returned sat
[2023-03-19 05:00:10] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 05:04:15] [INFO ] After 246607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 923 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 29744 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 812 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-19 05:04:40] [INFO ] Computed 3 place invariants in 21593 ms
[2023-03-19 05:04:42] [INFO ] Implicit Places using invariants in 24001 ms returned []
Implicit Place search using SMT only with invariants took 24002 ms to find 0 implicit places.
[2023-03-19 05:04:42] [INFO ] Invariant cache hit.
[2023-03-19 05:04:45] [INFO ] Dead Transitions using invariants and state equation in 2483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27307 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.120 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1483 resets, run finished after 2566 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39507 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 39507 steps, saw 27264 distinct states, run finished after 6002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:04:54] [INFO ] Invariant cache hit.
[2023-03-19 05:04:58] [INFO ] [Real]Absence check using 2 positive place invariants in 96 ms returned sat
[2023-03-19 05:04:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-19 05:05:19] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.75 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 1057 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1058 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1512 resets, run finished after 2472 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40542 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 40542 steps, saw 27505 distinct states, run finished after 6003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-19 05:05:43] [INFO ] Computed 4 place invariants in 13994 ms
[2023-03-19 05:05:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 295 ms returned sat
[2023-03-19 05:06:08] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 432 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 443 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-19 05:06:09] [INFO ] Invariant cache hit.
[2023-03-19 05:06:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 05:06:11] [INFO ] Implicit Places using invariants in 2714 ms returned []
Implicit Place search using SMT only with invariants took 2715 ms to find 0 implicit places.
[2023-03-19 05:06:11] [INFO ] Invariant cache hit.
[2023-03-19 05:06:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 05:06:14] [INFO ] Dead Transitions using invariants and state equation in 2616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5788 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 29713 transition count 44575
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 111 place count 29677 transition count 44545
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 111 place count 29677 transition count 44417
Deduced a syphon composed of 128 places in 16 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 367 place count 29549 transition count 44417
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 12 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 441 place count 29512 transition count 44380
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 591 place count 29512 transition count 44230
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 603 place count 29506 transition count 44224
Free-agglomeration rule applied 14399 times.
Iterating global reduction 3 with 14399 rules applied. Total rules applied 15002 place count 29506 transition count 29825
Reduce places removed 14399 places and 0 transitions.
Iterating post reduction 3 with 14399 rules applied. Total rules applied 29401 place count 15107 transition count 29825
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 29406 place count 15107 transition count 29825
Applied a total of 29406 rules in 14576 ms. Remains 15107 /29713 variables (removed 14606) and now considering 29825/44620 (removed 14795) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29825 rows 15107 cols
[2023-03-19 05:06:50] [INFO ] Computed 5 place invariants in 21089 ms
[2023-03-19 05:06:51] [INFO ] [Real]Absence check using 4 positive place invariants in 137 ms returned sat
[2023-03-19 05:06:51] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1322/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136128 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11823916 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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="RingSingleMessageInMbox-PT-d2m080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d2m080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202700915"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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