About the Execution of LoLa+red for RingSingleMessageInMbox-PT-d2m080
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16219.775 | 3600000.00 | 3548400.00 | 405295.10 | ?F?T??FT?TFFF?FF | normal |
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.r327-tall-167889200200915.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is RingSingleMessageInMbox-PT-d2m080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889200200915
=====================================================================
--------------------
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 1679075554173
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d2m080
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 17:52:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 17:52:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 17:52:45] [INFO ] Load time of PNML (sax parser for PT used): 9557 ms
[2023-03-17 17:52:45] [INFO ] Transformed 66950 places.
[2023-03-17 17:52:45] [INFO ] Transformed 213625 transitions.
[2023-03-17 17:52:45] [INFO ] Parsed PT model containing 66950 places and 213625 transitions and 854500 arcs in 10142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 36863 places in 340 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 4157 ms. Remains 29744 /30087 variables (removed 343) and now considering 44681/213625 (removed 168944) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-17 17:53:10] [INFO ] Computed 3 place invariants in 19154 ms
[2023-03-17 17:53:12] [INFO ] Implicit Places using invariants in 21590 ms returned []
Implicit Place search using SMT only with invariants took 21617 ms to find 0 implicit places.
[2023-03-17 17:53:12] [INFO ] Invariant cache hit.
[2023-03-17 17:53:15] [INFO ] Dead Transitions using invariants and state equation in 2540 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 28338 ms. Remains : 29744/30087 places, 44681/213625 transitions.
Support contains 13 out of 29744 places after structural reductions.
[2023-03-17 17:53:17] [INFO ] Flatten gal took : 1544 ms
[2023-03-17 17:53:18] [INFO ] Flatten gal took : 1223 ms
[2023-03-17 17:53:21] [INFO ] Input system was already deterministic with 44681 transitions.
Incomplete random walk after 10000 steps, including 1484 resets, run finished after 3098 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) 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 10) seen :0
Interrupted probabilistic random walk after 63069 steps, run timeout after 9001 ms. (steps per millisecond=7 ) properties seen :{0=1}
Probabilistic random walk after 63069 steps, saw 38631 distinct states, run finished after 9002 ms. (steps per millisecond=7 ) properties seen :1
Running SMT prover for 9 properties.
[2023-03-17 17:53:34] [INFO ] Invariant cache hit.
[2023-03-17 17:53:41] [INFO ] After 7344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 17:53:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 111 ms returned sat
[2023-03-17 17:53:48] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-17 17:54:06] [INFO ] After 14766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 18:03:50] [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-17 18:03:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 18:03:50] [INFO ] After 608766ms 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 8 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.568 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 2944 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 8447 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.300 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 1631 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-17 18:04:01] [INFO ] Invariant cache hit.
[2023-03-17 18:04:10] [INFO ] Implicit Places using invariants in 9568 ms returned []
Implicit Place search using SMT only with invariants took 9570 ms to find 0 implicit places.
[2023-03-17 18:04:10] [INFO ] Invariant cache hit.
[2023-03-17 18:04:13] [INFO ] Dead Transitions using invariants and state equation in 2667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13884 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 516 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 27650 steps with 4044 reset in 10002 ms.
Product exploration timeout after 28320 steps with 4053 reset in 10002 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.137 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 686 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 345 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 1477 resets, run finished after 5653 ms. (steps per millisecond=1 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-17 18:04:41] [INFO ] Invariant cache hit.
[2023-03-17 18:04:45] [INFO ] After 4441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:04:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 115 ms returned sat
[2023-03-17 18:04:50] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 18 ms returned sat
[2023-03-17 18:05:10] [INFO ] After 25021ms 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.80 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 1261 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 1263 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1503 resets, run finished after 5014 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 48142 steps, run timeout after 15001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 48142 steps, saw 30906 distinct states, run finished after 15005 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-17 18:05:50] [INFO ] Computed 4 place invariants in 17925 ms
[2023-03-17 18:05:54] [INFO ] After 4200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:05:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 336 ms returned sat
[2023-03-17 18:06:19] [INFO ] After 25016ms 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 501 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 501 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 462 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-17 18:06:20] [INFO ] Invariant cache hit.
[2023-03-17 18:06:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-17 18:06:23] [INFO ] Implicit Places using invariants in 2401 ms returned []
Implicit Place search using SMT only with invariants took 2403 ms to find 0 implicit places.
[2023-03-17 18:06:23] [INFO ] Invariant cache hit.
[2023-03-17 18:06:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-17 18:06:25] [INFO ] Dead Transitions using invariants and state equation in 2417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5294 ms. Remains : 29713/29713 places, 44620/44620 transitions.
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 642 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 285 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 309 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-17 18:06:43] [INFO ] Computed 3 place invariants in 15846 ms
[2023-03-17 18:06:45] [INFO ] Implicit Places using invariants in 18213 ms returned []
Implicit Place search using SMT only with invariants took 18215 ms to find 0 implicit places.
[2023-03-17 18:06:45] [INFO ] Invariant cache hit.
[2023-03-17 18:06:47] [INFO ] Dead Transitions using invariants and state equation in 2335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20651 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.143 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 625 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 322 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 4132 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-17 18:06:53] [INFO ] Invariant cache hit.
[2023-03-17 18:06:57] [INFO ] After 4311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:07:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 103 ms returned sat
[2023-03-17 18:07:02] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-17 18:07:22] [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 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 1075 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 1076 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1502 resets, run finished after 3436 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 50927 steps, run timeout after 9001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 50927 steps, saw 32210 distinct states, run finished after 9001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-17 18:07:53] [INFO ] Computed 4 place invariants in 17518 ms
[2023-03-17 18:07:58] [INFO ] After 4355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:08:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 334 ms returned sat
[2023-03-17 18:08:23] [INFO ] After 25025ms 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 454 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 454 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 453 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-17 18:08:24] [INFO ] Invariant cache hit.
[2023-03-17 18:08:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-17 18:08:26] [INFO ] Implicit Places using invariants in 2419 ms returned []
Implicit Place search using SMT only with invariants took 2421 ms to find 0 implicit places.
[2023-03-17 18:08:26] [INFO ] Invariant cache hit.
[2023-03-17 18:08:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-17 18:08:28] [INFO ] Dead Transitions using invariants and state equation in 2430 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5315 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 20 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 15 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 14 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 21093 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-17 18:09:18] [INFO ] Computed 5 place invariants in 27945 ms
[2023-03-17 18:09:19] [INFO ] After 1672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:09:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 134 ms returned sat
[2023-03-17 18:09:21] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-17 18:12:12] [INFO ] After 170132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 18:12:12] [INFO ] After 170642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-17 18:12:12] [INFO ] After 172841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 1211 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 407 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 402 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 384 ms :[false, false, false, false, p0, true, (NOT p0), (NOT p0), p0]
Product exploration timeout after 14370 steps with 2046 reset in 10005 ms.
Product exploration timeout after 21590 steps with 3144 reset in 10008 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true, false]
Stuttering acceptance computed with spot in 388 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 590 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-17 18:13:02] [INFO ] Computed 3 place invariants in 23873 ms
[2023-03-17 18:13:04] [INFO ] Dead Transitions using invariants and state equation in 26252 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26848 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 87 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-17 18:13:05] [INFO ] Invariant cache hit.
[2023-03-17 18:13:08] [INFO ] Implicit Places using invariants in 2476 ms returned []
Implicit Place search using SMT only with invariants took 2489 ms to find 0 implicit places.
[2023-03-17 18:13:08] [INFO ] Invariant cache hit.
[2023-03-17 18:13:10] [INFO ] Dead Transitions using invariants and state equation in 2543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5125 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Treatment of property RingSingleMessageInMbox-PT-d2m080-LTLCardinality-00 finished in 553962 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-17 18:13:13] [INFO ] Invariant cache hit.
[2023-03-17 18:13:16] [INFO ] Implicit Places using invariants in 2745 ms returned []
Implicit Place search using SMT only with invariants took 2748 ms to find 0 implicit places.
[2023-03-17 18:13:16] [INFO ] Invariant cache hit.
[2023-03-17 18:13:18] [INFO ] Dead Transitions using invariants and state equation in 2551 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5420 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 192 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 40620 steps with 5890 reset in 10002 ms.
Product exploration timeout after 39930 steps with 5913 reset in 10002 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.119 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 349 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 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 2788 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42921 steps, run timeout after 6001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 42921 steps, saw 29056 distinct states, run finished after 6002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 18:13:48] [INFO ] Invariant cache hit.
[2023-03-17 18:13:52] [INFO ] [Real]Absence check using 2 positive place invariants in 107 ms returned sat
[2023-03-17 18:13:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-17 18:14:13] [INFO ] After 25025ms 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.74 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 1672 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 1673 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1545 resets, run finished after 2863 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42069 steps, run timeout after 6001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 42069 steps, saw 28219 distinct states, run finished after 6001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-17 18:14:39] [INFO ] Computed 4 place invariants in 14758 ms
[2023-03-17 18:14:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 416 ms returned sat
[2023-03-17 18:15:04] [INFO ] After 25021ms 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 469 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 469 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 448 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-17 18:15:04] [INFO ] Invariant cache hit.
[2023-03-17 18:15:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-17 18:15:07] [INFO ] Implicit Places using invariants in 2404 ms returned []
Implicit Place search using SMT only with invariants took 2406 ms to find 0 implicit places.
[2023-03-17 18:15:07] [INFO ] Invariant cache hit.
[2023-03-17 18:15:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-17 18:15:09] [INFO ] Dead Transitions using invariants and state equation in 2414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5280 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 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 15910 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-17 18:15:48] [INFO ] Computed 5 place invariants in 23160 ms
[2023-03-17 18:15:50] [INFO ] [Real]Absence check using 4 positive place invariants in 126 ms returned sat
[2023-03-17 18:15:50] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
starting LoLA
BK_INPUT RingSingleMessageInMbox-PT-d2m080
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
LTLCardinality
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12880836 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16258388 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:153
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:278
lola: rewrite Frontend/Parser/formula_rewrite.k:150
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:168
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:141
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:144
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:370
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:144
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:144
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:153
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:156
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:153
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:159
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:153
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:156
lola: rewrite Frontend/Parser/formula_rewrite.k:120
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: caught signal Terminated - aborting LoLA
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-00: LTL unknown AGGR
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-01: INITIAL unknown AGGR
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-02: CONJ unknown CONJ
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-03: CONJ unknown CONJ
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-04: LTL unknown AGGR
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-05: LTL unknown AGGR
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-06: AG unknown AGGR
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-07: LTL/CTL unknown AGGR
RingSingleMessageInMbox-PT-d2m080-LTLCardinality-08: CONJ unknown CONJ
Time elapsed: 2122 secs. Pages in use: 0
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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r327-tall-167889200200915"
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 '
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 ;