About the Execution of LoLa+red for Peterson-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 797.336 | 419271.00 | 465406.00 | 1481.80 | T?FFFFTF?TFFTFFF | 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.r263-smll-167863538400579.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 Peterson-COL-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538400579
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 45K 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 Peterson-COL-5-LTLCardinality-00
FORMULA_NAME Peterson-COL-5-LTLCardinality-01
FORMULA_NAME Peterson-COL-5-LTLCardinality-02
FORMULA_NAME Peterson-COL-5-LTLCardinality-03
FORMULA_NAME Peterson-COL-5-LTLCardinality-04
FORMULA_NAME Peterson-COL-5-LTLCardinality-05
FORMULA_NAME Peterson-COL-5-LTLCardinality-06
FORMULA_NAME Peterson-COL-5-LTLCardinality-07
FORMULA_NAME Peterson-COL-5-LTLCardinality-08
FORMULA_NAME Peterson-COL-5-LTLCardinality-09
FORMULA_NAME Peterson-COL-5-LTLCardinality-10
FORMULA_NAME Peterson-COL-5-LTLCardinality-11
FORMULA_NAME Peterson-COL-5-LTLCardinality-12
FORMULA_NAME Peterson-COL-5-LTLCardinality-13
FORMULA_NAME Peterson-COL-5-LTLCardinality-14
FORMULA_NAME Peterson-COL-5-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678846523911
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=Peterson-COL-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 02:15:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 02:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:15:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 02:15:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 02:15:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1068 ms
[2023-03-15 02:15:28] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 02:15:28] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2023-03-15 02:15:28] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-COL-5-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-5-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10004 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 02:15:29] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-15 02:15:29] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-15 02:15:29] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-15 02:15:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-15 02:15:29] [INFO ] Flatten gal took : 33 ms
FORMULA Peterson-COL-5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 02:15:30] [INFO ] Flatten gal took : 6 ms
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 02:15:30] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 111 ms.
[2023-03-15 02:15:30] [INFO ] Unfolded 10 HLPN properties in 2 ms.
Deduced a syphon composed of 30 places in 22 ms
Reduce places removed 30 places and 60 transitions.
Support contains 792 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 46 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:15:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:15:30] [INFO ] Computed 23 place invariants in 38 ms
[2023-03-15 02:15:30] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-15 02:15:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:15:30] [INFO ] Invariant cache hit.
[2023-03-15 02:15:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:15:32] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2023-03-15 02:15:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:15:32] [INFO ] Invariant cache hit.
[2023-03-15 02:15:33] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3166 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 792 out of 834 places after structural reductions.
[2023-03-15 02:15:33] [INFO ] Flatten gal took : 125 ms
[2023-03-15 02:15:33] [INFO ] Flatten gal took : 107 ms
[2023-03-15 02:15:34] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 02:15:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:15:35] [INFO ] Invariant cache hit.
[2023-03-15 02:15:35] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2023-03-15 02:15:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 16 ms returned sat
[2023-03-15 02:15:38] [INFO ] After 2856ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-15 02:15:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2023-03-15 02:15:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 16 ms returned sat
[2023-03-15 02:15:41] [INFO ] After 2504ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-15 02:15:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:15:43] [INFO ] After 2142ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-15 02:15:44] [INFO ] Deduced a trap composed of 20 places in 892 ms of which 18 ms to minimize.
[2023-03-15 02:15:45] [INFO ] Deduced a trap composed of 90 places in 806 ms of which 2 ms to minimize.
[2023-03-15 02:15:46] [INFO ] Deduced a trap composed of 112 places in 784 ms of which 2 ms to minimize.
[2023-03-15 02:15:46] [INFO ] Deduced a trap composed of 16 places in 761 ms of which 3 ms to minimize.
[2023-03-15 02:15:47] [INFO ] Deduced a trap composed of 47 places in 749 ms of which 2 ms to minimize.
[2023-03-15 02:15:48] [INFO ] Deduced a trap composed of 59 places in 635 ms of which 1 ms to minimize.
[2023-03-15 02:15:48] [INFO ] Deduced a trap composed of 73 places in 496 ms of which 2 ms to minimize.
[2023-03-15 02:15:49] [INFO ] Deduced a trap composed of 68 places in 498 ms of which 2 ms to minimize.
[2023-03-15 02:15:50] [INFO ] Deduced a trap composed of 41 places in 559 ms of which 1 ms to minimize.
[2023-03-15 02:15:50] [INFO ] Deduced a trap composed of 30 places in 680 ms of which 1 ms to minimize.
[2023-03-15 02:15:51] [INFO ] Deduced a trap composed of 128 places in 502 ms of which 2 ms to minimize.
[2023-03-15 02:15:52] [INFO ] Deduced a trap composed of 44 places in 626 ms of which 2 ms to minimize.
[2023-03-15 02:15:52] [INFO ] Deduced a trap composed of 67 places in 737 ms of which 1 ms to minimize.
[2023-03-15 02:15:53] [INFO ] Deduced a trap composed of 25 places in 707 ms of which 1 ms to minimize.
[2023-03-15 02:15:54] [INFO ] Deduced a trap composed of 15 places in 725 ms of which 1 ms to minimize.
[2023-03-15 02:15:55] [INFO ] Deduced a trap composed of 37 places in 737 ms of which 2 ms to minimize.
[2023-03-15 02:15:56] [INFO ] Deduced a trap composed of 19 places in 694 ms of which 1 ms to minimize.
[2023-03-15 02:15:56] [INFO ] Deduced a trap composed of 97 places in 684 ms of which 2 ms to minimize.
[2023-03-15 02:15:57] [INFO ] Deduced a trap composed of 97 places in 671 ms of which 2 ms to minimize.
[2023-03-15 02:15:58] [INFO ] Deduced a trap composed of 39 places in 561 ms of which 1 ms to minimize.
[2023-03-15 02:15:58] [INFO ] Deduced a trap composed of 113 places in 521 ms of which 1 ms to minimize.
[2023-03-15 02:15:59] [INFO ] Deduced a trap composed of 23 places in 703 ms of which 2 ms to minimize.
[2023-03-15 02:16:00] [INFO ] Deduced a trap composed of 63 places in 602 ms of which 4 ms to minimize.
[2023-03-15 02:16:01] [INFO ] Deduced a trap composed of 63 places in 570 ms of which 1 ms to minimize.
[2023-03-15 02:16:01] [INFO ] Deduced a trap composed of 98 places in 559 ms of which 1 ms to minimize.
[2023-03-15 02:16:02] [INFO ] Deduced a trap composed of 89 places in 527 ms of which 1 ms to minimize.
[2023-03-15 02:16:02] [INFO ] Deduced a trap composed of 89 places in 524 ms of which 1 ms to minimize.
[2023-03-15 02:16:03] [INFO ] Deduced a trap composed of 93 places in 569 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-15 02:16:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:16:03] [INFO ] After 25421ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 396 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 684 transition count 1092
Applied a total of 300 rules in 188 ms. Remains 684 /834 variables (removed 150) and now considering 1092/1242 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 684/834 places, 1092/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 124698 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124698 steps, saw 63446 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 02:16:07] [INFO ] Flow matrix only has 972 transitions (discarded 120 similar events)
// Phase 1: matrix 972 rows 684 cols
[2023-03-15 02:16:07] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 02:16:07] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2023-03-15 02:16:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-15 02:16:09] [INFO ] After 2253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 02:16:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2023-03-15 02:16:10] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-15 02:16:12] [INFO ] After 1822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 02:16:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:16:13] [INFO ] After 1851ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 02:16:14] [INFO ] Deduced a trap composed of 45 places in 551 ms of which 1 ms to minimize.
[2023-03-15 02:16:15] [INFO ] Deduced a trap composed of 49 places in 580 ms of which 2 ms to minimize.
[2023-03-15 02:16:15] [INFO ] Deduced a trap composed of 94 places in 540 ms of which 1 ms to minimize.
[2023-03-15 02:16:16] [INFO ] Deduced a trap composed of 100 places in 539 ms of which 2 ms to minimize.
[2023-03-15 02:16:17] [INFO ] Deduced a trap composed of 102 places in 586 ms of which 1 ms to minimize.
[2023-03-15 02:16:17] [INFO ] Deduced a trap composed of 110 places in 560 ms of which 2 ms to minimize.
[2023-03-15 02:16:18] [INFO ] Deduced a trap composed of 19 places in 567 ms of which 3 ms to minimize.
[2023-03-15 02:16:18] [INFO ] Deduced a trap composed of 91 places in 595 ms of which 2 ms to minimize.
[2023-03-15 02:16:19] [INFO ] Deduced a trap composed of 76 places in 575 ms of which 2 ms to minimize.
[2023-03-15 02:16:20] [INFO ] Deduced a trap composed of 90 places in 574 ms of which 1 ms to minimize.
[2023-03-15 02:16:20] [INFO ] Deduced a trap composed of 93 places in 586 ms of which 1 ms to minimize.
[2023-03-15 02:16:21] [INFO ] Deduced a trap composed of 94 places in 559 ms of which 3 ms to minimize.
[2023-03-15 02:16:22] [INFO ] Deduced a trap composed of 68 places in 570 ms of which 1 ms to minimize.
[2023-03-15 02:16:22] [INFO ] Deduced a trap composed of 109 places in 581 ms of which 1 ms to minimize.
[2023-03-15 02:16:23] [INFO ] Deduced a trap composed of 79 places in 538 ms of which 1 ms to minimize.
[2023-03-15 02:16:24] [INFO ] Deduced a trap composed of 51 places in 597 ms of which 2 ms to minimize.
[2023-03-15 02:16:24] [INFO ] Deduced a trap composed of 43 places in 579 ms of which 2 ms to minimize.
[2023-03-15 02:16:25] [INFO ] Deduced a trap composed of 64 places in 536 ms of which 1 ms to minimize.
[2023-03-15 02:16:25] [INFO ] Deduced a trap composed of 79 places in 515 ms of which 1 ms to minimize.
[2023-03-15 02:16:26] [INFO ] Deduced a trap composed of 38 places in 532 ms of which 2 ms to minimize.
[2023-03-15 02:16:27] [INFO ] Deduced a trap composed of 13 places in 460 ms of which 2 ms to minimize.
[2023-03-15 02:16:27] [INFO ] Deduced a trap composed of 58 places in 527 ms of which 2 ms to minimize.
[2023-03-15 02:16:28] [INFO ] Deduced a trap composed of 34 places in 552 ms of which 3 ms to minimize.
[2023-03-15 02:16:28] [INFO ] Deduced a trap composed of 24 places in 493 ms of which 1 ms to minimize.
[2023-03-15 02:16:29] [INFO ] Deduced a trap composed of 40 places in 498 ms of which 1 ms to minimize.
[2023-03-15 02:16:29] [INFO ] Deduced a trap composed of 48 places in 550 ms of which 1 ms to minimize.
[2023-03-15 02:16:30] [INFO ] Deduced a trap composed of 24 places in 534 ms of which 1 ms to minimize.
[2023-03-15 02:16:31] [INFO ] Deduced a trap composed of 91 places in 498 ms of which 2 ms to minimize.
[2023-03-15 02:16:31] [INFO ] Deduced a trap composed of 21 places in 533 ms of which 3 ms to minimize.
[2023-03-15 02:16:32] [INFO ] Deduced a trap composed of 34 places in 482 ms of which 1 ms to minimize.
[2023-03-15 02:16:32] [INFO ] Deduced a trap composed of 67 places in 409 ms of which 1 ms to minimize.
[2023-03-15 02:16:33] [INFO ] Deduced a trap composed of 90 places in 426 ms of which 1 ms to minimize.
[2023-03-15 02:16:33] [INFO ] Deduced a trap composed of 63 places in 409 ms of which 2 ms to minimize.
[2023-03-15 02:16:34] [INFO ] Deduced a trap composed of 73 places in 392 ms of which 1 ms to minimize.
[2023-03-15 02:16:34] [INFO ] Deduced a trap composed of 88 places in 387 ms of which 1 ms to minimize.
[2023-03-15 02:16:35] [INFO ] Deduced a trap composed of 134 places in 401 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-15 02:16:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:16:35] [INFO ] After 25372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 65 ms.
Support contains 396 out of 684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 1092/1092 transitions.
Applied a total of 0 rules in 60 ms. Remains 684 /684 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 684/684 places, 1092/1092 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 1092/1092 transitions.
Applied a total of 0 rules in 50 ms. Remains 684 /684 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
[2023-03-15 02:16:35] [INFO ] Flow matrix only has 972 transitions (discarded 120 similar events)
[2023-03-15 02:16:35] [INFO ] Invariant cache hit.
[2023-03-15 02:16:35] [INFO ] Implicit Places using invariants in 458 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 464 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 678/684 places, 1092/1092 transitions.
Applied a total of 0 rules in 46 ms. Remains 678 /678 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 563 ms. Remains : 678/684 places, 1092/1092 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 142044 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142044 steps, saw 72064 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 02:16:39] [INFO ] Flow matrix only has 972 transitions (discarded 120 similar events)
// Phase 1: matrix 972 rows 678 cols
[2023-03-15 02:16:39] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 02:16:39] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 02:16:41] [INFO ] After 1737ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 02:16:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:16:41] [INFO ] After 113ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 02:16:41] [INFO ] After 2075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 02:16:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 02:16:43] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 02:16:45] [INFO ] After 1819ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 02:16:46] [INFO ] Deduced a trap composed of 93 places in 575 ms of which 3 ms to minimize.
[2023-03-15 02:16:46] [INFO ] Deduced a trap composed of 80 places in 549 ms of which 1 ms to minimize.
[2023-03-15 02:16:47] [INFO ] Deduced a trap composed of 13 places in 525 ms of which 1 ms to minimize.
[2023-03-15 02:16:47] [INFO ] Deduced a trap composed of 46 places in 482 ms of which 1 ms to minimize.
[2023-03-15 02:16:48] [INFO ] Deduced a trap composed of 56 places in 503 ms of which 1 ms to minimize.
[2023-03-15 02:16:48] [INFO ] Deduced a trap composed of 64 places in 513 ms of which 1 ms to minimize.
[2023-03-15 02:16:49] [INFO ] Deduced a trap composed of 60 places in 534 ms of which 2 ms to minimize.
[2023-03-15 02:16:50] [INFO ] Deduced a trap composed of 104 places in 505 ms of which 2 ms to minimize.
[2023-03-15 02:16:50] [INFO ] Deduced a trap composed of 40 places in 540 ms of which 1 ms to minimize.
[2023-03-15 02:16:51] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 1 ms to minimize.
[2023-03-15 02:16:51] [INFO ] Deduced a trap composed of 13 places in 480 ms of which 1 ms to minimize.
[2023-03-15 02:16:52] [INFO ] Deduced a trap composed of 19 places in 468 ms of which 1 ms to minimize.
[2023-03-15 02:16:52] [INFO ] Deduced a trap composed of 57 places in 500 ms of which 1 ms to minimize.
[2023-03-15 02:16:53] [INFO ] Deduced a trap composed of 37 places in 529 ms of which 1 ms to minimize.
[2023-03-15 02:16:54] [INFO ] Deduced a trap composed of 89 places in 516 ms of which 2 ms to minimize.
[2023-03-15 02:16:54] [INFO ] Deduced a trap composed of 43 places in 513 ms of which 1 ms to minimize.
[2023-03-15 02:16:55] [INFO ] Deduced a trap composed of 55 places in 478 ms of which 1 ms to minimize.
[2023-03-15 02:16:55] [INFO ] Deduced a trap composed of 61 places in 445 ms of which 1 ms to minimize.
[2023-03-15 02:16:56] [INFO ] Deduced a trap composed of 43 places in 439 ms of which 1 ms to minimize.
[2023-03-15 02:16:56] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2023-03-15 02:16:57] [INFO ] Deduced a trap composed of 16 places in 514 ms of which 2 ms to minimize.
[2023-03-15 02:16:57] [INFO ] Deduced a trap composed of 37 places in 522 ms of which 1 ms to minimize.
[2023-03-15 02:16:58] [INFO ] Deduced a trap composed of 19 places in 525 ms of which 1 ms to minimize.
[2023-03-15 02:16:59] [INFO ] Deduced a trap composed of 25 places in 546 ms of which 1 ms to minimize.
[2023-03-15 02:16:59] [INFO ] Deduced a trap composed of 66 places in 551 ms of which 2 ms to minimize.
[2023-03-15 02:17:00] [INFO ] Deduced a trap composed of 57 places in 496 ms of which 1 ms to minimize.
[2023-03-15 02:17:00] [INFO ] Deduced a trap composed of 62 places in 531 ms of which 1 ms to minimize.
[2023-03-15 02:17:01] [INFO ] Deduced a trap composed of 42 places in 507 ms of which 1 ms to minimize.
[2023-03-15 02:17:01] [INFO ] Deduced a trap composed of 108 places in 511 ms of which 1 ms to minimize.
[2023-03-15 02:17:02] [INFO ] Deduced a trap composed of 58 places in 537 ms of which 1 ms to minimize.
[2023-03-15 02:17:03] [INFO ] Deduced a trap composed of 67 places in 541 ms of which 1 ms to minimize.
[2023-03-15 02:17:03] [INFO ] Deduced a trap composed of 103 places in 539 ms of which 2 ms to minimize.
[2023-03-15 02:17:04] [INFO ] Deduced a trap composed of 38 places in 491 ms of which 1 ms to minimize.
[2023-03-15 02:17:04] [INFO ] Deduced a trap composed of 48 places in 502 ms of which 1 ms to minimize.
[2023-03-15 02:17:05] [INFO ] Deduced a trap composed of 63 places in 475 ms of which 1 ms to minimize.
[2023-03-15 02:17:05] [INFO ] Deduced a trap composed of 64 places in 467 ms of which 1 ms to minimize.
[2023-03-15 02:17:06] [INFO ] Deduced a trap composed of 67 places in 491 ms of which 2 ms to minimize.
[2023-03-15 02:17:06] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 21379 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-15 02:17:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:17:06] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 68 ms.
Support contains 396 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1092/1092 transitions.
Applied a total of 0 rules in 45 ms. Remains 678 /678 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 678/678 places, 1092/1092 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1092/1092 transitions.
Applied a total of 0 rules in 37 ms. Remains 678 /678 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
[2023-03-15 02:17:07] [INFO ] Flow matrix only has 972 transitions (discarded 120 similar events)
[2023-03-15 02:17:07] [INFO ] Invariant cache hit.
[2023-03-15 02:17:07] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-15 02:17:07] [INFO ] Flow matrix only has 972 transitions (discarded 120 similar events)
[2023-03-15 02:17:07] [INFO ] Invariant cache hit.
[2023-03-15 02:17:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:17:10] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3362 ms to find 0 implicit places.
[2023-03-15 02:17:10] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-15 02:17:10] [INFO ] Flow matrix only has 972 transitions (discarded 120 similar events)
[2023-03-15 02:17:10] [INFO ] Invariant cache hit.
[2023-03-15 02:17:11] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4577 ms. Remains : 678/678 places, 1092/1092 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 678 transition count 972
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 666 transition count 966
Partial Post-agglomeration rule applied 150 times.
Drop transitions removed 150 transitions
Iterating global reduction 1 with 150 rules applied. Total rules applied 288 place count 666 transition count 966
Applied a total of 288 rules in 133 ms. Remains 666 /678 variables (removed 12) and now considering 966/1092 (removed 126) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 966 rows 666 cols
[2023-03-15 02:17:11] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-15 02:17:12] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-15 02:17:14] [INFO ] After 2337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 02:17:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-15 02:17:16] [INFO ] After 1719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 02:17:17] [INFO ] After 3091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1145 ms.
[2023-03-15 02:17:18] [INFO ] After 4503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||G(p1)||(p1&&F(p2))))))'
Support contains 540 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:17:19] [INFO ] Computed 23 place invariants in 17 ms
[2023-03-15 02:17:19] [INFO ] Implicit Places using invariants in 385 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 388 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 467 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 5 (ADD s498 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 634 ms.
Product exploration explored 100000 steps with 0 reset in 687 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X p1), (X (AND p1 (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 514 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 464 ms :[true, (OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 02:17:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 02:17:22] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 02:17:22] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 02:17:22] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X p1), (X (AND p1 (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 878 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 249 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:24] [INFO ] Invariant cache hit.
[2023-03-15 02:17:24] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-15 02:17:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:24] [INFO ] Invariant cache hit.
[2023-03-15 02:17:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:17:26] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2023-03-15 02:17:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:26] [INFO ] Invariant cache hit.
[2023-03-15 02:17:28] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3869 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p1), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 710 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 02:17:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:29] [INFO ] Invariant cache hit.
[2023-03-15 02:17:29] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 02:17:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-15 02:17:31] [INFO ] After 1820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 02:17:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:17:33] [INFO ] After 1147ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 02:17:34] [INFO ] Deduced a trap composed of 19 places in 548 ms of which 2 ms to minimize.
[2023-03-15 02:17:35] [INFO ] Deduced a trap composed of 18 places in 769 ms of which 0 ms to minimize.
[2023-03-15 02:17:36] [INFO ] Deduced a trap composed of 16 places in 494 ms of which 1 ms to minimize.
[2023-03-15 02:17:36] [INFO ] Deduced a trap composed of 113 places in 491 ms of which 1 ms to minimize.
[2023-03-15 02:17:37] [INFO ] Deduced a trap composed of 80 places in 515 ms of which 1 ms to minimize.
[2023-03-15 02:17:37] [INFO ] Deduced a trap composed of 112 places in 466 ms of which 1 ms to minimize.
[2023-03-15 02:17:38] [INFO ] Deduced a trap composed of 84 places in 352 ms of which 1 ms to minimize.
[2023-03-15 02:17:39] [INFO ] Deduced a trap composed of 70 places in 583 ms of which 2 ms to minimize.
[2023-03-15 02:17:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6336 ms
[2023-03-15 02:17:40] [INFO ] After 8381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1099 ms.
[2023-03-15 02:17:41] [INFO ] After 11564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 510 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 828 transition count 1212
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 798 transition count 1212
Applied a total of 60 rules in 41 ms. Remains 798 /828 variables (removed 30) and now considering 1212/1242 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 798/828 places, 1212/1242 transitions.
Finished random walk after 1311 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=163 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p1), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 10 factoid took 893 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 358 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 349 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 526 ms.
Product exploration explored 100000 steps with 0 reset in 499 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 72 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:45] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-15 02:17:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:45] [INFO ] Invariant cache hit.
[2023-03-15 02:17:46] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1468 ms. Remains : 828/828 places, 1242/1242 transitions.
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:46] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:46] [INFO ] Invariant cache hit.
[2023-03-15 02:17:46] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-15 02:17:46] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:46] [INFO ] Invariant cache hit.
[2023-03-15 02:17:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:17:48] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
[2023-03-15 02:17:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:48] [INFO ] Invariant cache hit.
[2023-03-15 02:17:50] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3719 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-COL-5-LTLCardinality-01 finished in 31500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 36 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 720 place count 474 transition count 732
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 1020 place count 324 transition count 732
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1080 place count 294 transition count 702
Applied a total of 1080 rules in 52 ms. Remains 294 /834 variables (removed 540) and now considering 702/1242 (removed 540) transitions.
[2023-03-15 02:17:50] [INFO ] Flow matrix only has 582 transitions (discarded 120 similar events)
// Phase 1: matrix 582 rows 294 cols
[2023-03-15 02:17:50] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-15 02:17:50] [INFO ] Implicit Places using invariants in 298 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 301 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 288/834 places, 702/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 288 /288 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 366 ms. Remains : 288/834 places, 702/1242 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 1 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41)), p0:(LEQ 3 (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 62 in 1 ms.
FORMULA Peterson-COL-5-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLCardinality-02 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 570 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:17:51] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-15 02:17:51] [INFO ] Implicit Places using invariants in 364 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 366 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101) (ADD s282 s283 s284...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2776 reset in 3299 ms.
Stack based approach found an accepted trace after 739 steps with 18 reset with depth 34 and stack size 34 in 25 ms.
FORMULA Peterson-COL-5-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLCardinality-03 finished in 3864 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((p0&&G(p1)))))'
Support contains 156 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:55] [INFO ] Invariant cache hit.
[2023-03-15 02:17:55] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-15 02:17:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:55] [INFO ] Invariant cache hit.
[2023-03-15 02:17:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:17:57] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-15 02:17:57] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:57] [INFO ] Invariant cache hit.
[2023-03-15 02:17:58] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3205 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5)), p0:(LEQ (ADD s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-5-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLCardinality-04 finished in 3442 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||(G(F(!p0))&&F(p1)))))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:17:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:58] [INFO ] Invariant cache hit.
[2023-03-15 02:17:59] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-15 02:17:59] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:17:59] [INFO ] Invariant cache hit.
[2023-03-15 02:18:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:02] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
[2023-03-15 02:18:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:02] [INFO ] Invariant cache hit.
[2023-03-15 02:18:03] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4884 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (NOT p1), p0]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 440 steps with 3 reset with depth 374 and stack size 374 in 3 ms.
FORMULA Peterson-COL-5-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLCardinality-05 finished in 5332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 834 transition count 1032
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 624 transition count 1032
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 624 transition count 882
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 780 place count 444 transition count 852
Applied a total of 780 rules in 44 ms. Remains 444 /834 variables (removed 390) and now considering 852/1242 (removed 390) transitions.
[2023-03-15 02:18:03] [INFO ] Flow matrix only has 732 transitions (discarded 120 similar events)
// Phase 1: matrix 732 rows 444 cols
[2023-03-15 02:18:03] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-15 02:18:04] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-15 02:18:04] [INFO ] Flow matrix only has 732 transitions (discarded 120 similar events)
[2023-03-15 02:18:04] [INFO ] Invariant cache hit.
[2023-03-15 02:18:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:05] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2023-03-15 02:18:05] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 02:18:05] [INFO ] Flow matrix only has 732 transitions (discarded 120 similar events)
[2023-03-15 02:18:05] [INFO ] Invariant cache hit.
[2023-03-15 02:18:06] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 444/834 places, 852/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2129 ms. Remains : 444/834 places, 852/1242 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 3 (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 62 reset in 2748 ms.
Stack based approach found an accepted trace after 1033 steps with 0 reset with depth 1034 and stack size 986 in 29 ms.
FORMULA Peterson-COL-5-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLCardinality-07 finished in 5012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 396 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 834 transition count 1212
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 804 transition count 1212
Applied a total of 60 rules in 34 ms. Remains 804 /834 variables (removed 30) and now considering 1212/1242 (removed 30) transitions.
[2023-03-15 02:18:08] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
// Phase 1: matrix 1092 rows 804 cols
[2023-03-15 02:18:08] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-15 02:18:09] [INFO ] Implicit Places using invariants in 282 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 285 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 798/834 places, 1212/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 798 /798 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 798/834 places, 1212/1242 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ (ADD s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1192 ms.
Product exploration explored 100000 steps with 0 reset in 1105 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Finished Best-First random walk after 252 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=84 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 396 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 1212/1212 transitions.
Applied a total of 0 rules in 20 ms. Remains 798 /798 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2023-03-15 02:18:12] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
// Phase 1: matrix 1092 rows 798 cols
[2023-03-15 02:18:12] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 02:18:12] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-15 02:18:12] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
[2023-03-15 02:18:12] [INFO ] Invariant cache hit.
[2023-03-15 02:18:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:13] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
[2023-03-15 02:18:13] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 02:18:13] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
[2023-03-15 02:18:13] [INFO ] Invariant cache hit.
[2023-03-15 02:18:15] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2961 ms. Remains : 798/798 places, 1212/1212 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Finished Best-First random walk after 343 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1246 ms.
Product exploration explored 100000 steps with 0 reset in 1108 ms.
Support contains 396 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 1212/1212 transitions.
Applied a total of 0 rules in 16 ms. Remains 798 /798 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2023-03-15 02:18:18] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
[2023-03-15 02:18:18] [INFO ] Invariant cache hit.
[2023-03-15 02:18:18] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-15 02:18:18] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
[2023-03-15 02:18:18] [INFO ] Invariant cache hit.
[2023-03-15 02:18:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:20] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2023-03-15 02:18:20] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 02:18:20] [INFO ] Flow matrix only has 1092 transitions (discarded 120 similar events)
[2023-03-15 02:18:20] [INFO ] Invariant cache hit.
[2023-03-15 02:18:21] [INFO ] Dead Transitions using invariants and state equation in 1576 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3695 ms. Remains : 798/798 places, 1212/1212 transitions.
Treatment of property Peterson-COL-5-LTLCardinality-08 finished in 12953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 240 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:21] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:18:21] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-15 02:18:22] [INFO ] Implicit Places using invariants in 381 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 383 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 419 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41)), p1:(AND (GT 2 (A...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 126 reset in 264 ms.
Stack based approach found an accepted trace after 624 steps with 52 reset with depth 415 and stack size 415 in 5 ms.
FORMULA Peterson-COL-5-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLCardinality-11 finished in 883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X((F(p0)&&F(!p1)))))'
Support contains 396 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 6 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:22] [INFO ] Invariant cache hit.
[2023-03-15 02:18:23] [INFO ] Implicit Places using invariants in 543 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 545 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 5 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 557 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, true, (NOT p1), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s312 s313 s314 s315 s316 s317) (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 314 reset in 318 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA Peterson-COL-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLCardinality-13 finished in 1161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1 U (F(p3)&&p2))))))'
Support contains 570 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:23] [INFO ] Invariant cache hit.
[2023-03-15 02:18:24] [INFO ] Implicit Places using invariants in 442 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 445 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 460 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), true, (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Peterson-COL-5-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 7}], [{ cond=p0, acceptance={} source=1 dest: 5}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p2:(AND (LEQ 2 (ADD s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 126 steps with 3 reset in 2 ms.
FORMULA Peterson-COL-5-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLCardinality-14 finished in 905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||G(p1)||(p1&&F(p2))))))'
Found a Lengthening insensitive property : Peterson-COL-5-LTLCardinality-01
Stuttering acceptance computed with spot in 317 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Support contains 540 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 20 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:25] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:25] [INFO ] Invariant cache hit.
[2023-03-15 02:18:25] [INFO ] Implicit Places using invariants in 489 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 491 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 531 ms. Remains : 828/834 places, 1242/1242 transitions.
Running random walk in product with property : Peterson-COL-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 5 (ADD s498 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 506 ms.
Product exploration explored 100000 steps with 0 reset in 539 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X p1), (X (AND p1 (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 539 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 02:18:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 02:18:28] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-15 02:18:28] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 02:18:28] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X p1), (X (AND p1 (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 1090 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 313 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:30] [INFO ] Invariant cache hit.
[2023-03-15 02:18:31] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-15 02:18:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:31] [INFO ] Invariant cache hit.
[2023-03-15 02:18:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:32] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2023-03-15 02:18:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:32] [INFO ] Invariant cache hit.
[2023-03-15 02:18:33] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3363 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p1), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 511 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 02:18:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:35] [INFO ] Invariant cache hit.
[2023-03-15 02:18:35] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 02:18:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 02:18:37] [INFO ] After 1548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 02:18:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:38] [INFO ] After 987ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 02:18:39] [INFO ] Deduced a trap composed of 19 places in 635 ms of which 1 ms to minimize.
[2023-03-15 02:18:40] [INFO ] Deduced a trap composed of 18 places in 762 ms of which 1 ms to minimize.
[2023-03-15 02:18:41] [INFO ] Deduced a trap composed of 16 places in 682 ms of which 1 ms to minimize.
[2023-03-15 02:18:41] [INFO ] Deduced a trap composed of 113 places in 368 ms of which 1 ms to minimize.
[2023-03-15 02:18:42] [INFO ] Deduced a trap composed of 80 places in 512 ms of which 1 ms to minimize.
[2023-03-15 02:18:43] [INFO ] Deduced a trap composed of 112 places in 457 ms of which 1 ms to minimize.
[2023-03-15 02:18:43] [INFO ] Deduced a trap composed of 84 places in 442 ms of which 1 ms to minimize.
[2023-03-15 02:18:44] [INFO ] Deduced a trap composed of 70 places in 577 ms of which 1 ms to minimize.
[2023-03-15 02:18:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6518 ms
[2023-03-15 02:18:45] [INFO ] After 8213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1029 ms.
[2023-03-15 02:18:46] [INFO ] After 11010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 510 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 828 transition count 1212
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 798 transition count 1212
Applied a total of 60 rules in 23 ms. Remains 798 /828 variables (removed 30) and now considering 1212/1242 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 798/828 places, 1212/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69167 steps, run visited all 1 properties in 734 ms. (steps per millisecond=94 )
Probabilistic random walk after 69167 steps, saw 39098 distinct states, run finished after 734 ms. (steps per millisecond=94 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p1), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 10 factoid took 873 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 358 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 353 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 505 ms.
Product exploration explored 100000 steps with 0 reset in 566 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:50] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 02:18:50] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:50] [INFO ] Invariant cache hit.
[2023-03-15 02:18:52] [INFO ] Dead Transitions using invariants and state equation in 1446 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1488 ms. Remains : 828/828 places, 1242/1242 transitions.
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 4 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:18:52] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:52] [INFO ] Invariant cache hit.
[2023-03-15 02:18:52] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-15 02:18:52] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:52] [INFO ] Invariant cache hit.
[2023-03-15 02:18:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:18:55] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2023-03-15 02:18:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:18:55] [INFO ] Invariant cache hit.
[2023-03-15 02:18:56] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4159 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-COL-5-LTLCardinality-01 finished in 31652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-15 02:18:56] [INFO ] Flatten gal took : 73 ms
[2023-03-15 02:18:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-15 02:18:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 10 ms.
Total runtime 209338 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-COL-5
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLCardinality
BK_STOP 1678846943182
--------------------
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/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-COL-5-LTLCardinality-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1799 3/32 Peterson-COL-5-LTLCardinality-08 196815 m, 39363 m/sec, 686846 t fired, .
Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1799 5/32 Peterson-COL-5-LTLCardinality-08 335526 m, 27742 m/sec, 1518511 t fired, .
Time elapsed: 11 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1799 6/32 Peterson-COL-5-LTLCardinality-08 474306 m, 27756 m/sec, 2344820 t fired, .
Time elapsed: 16 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1799 8/32 Peterson-COL-5-LTLCardinality-08 612463 m, 27631 m/sec, 3156300 t fired, .
Time elapsed: 21 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1799 10/32 Peterson-COL-5-LTLCardinality-08 756569 m, 28821 m/sec, 3958291 t fired, .
Time elapsed: 26 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1799 11/32 Peterson-COL-5-LTLCardinality-08 883229 m, 25332 m/sec, 4808956 t fired, .
Time elapsed: 31 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1799 12/32 Peterson-COL-5-LTLCardinality-08 973172 m, 17988 m/sec, 5638923 t fired, .
Time elapsed: 36 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1799 15/32 Peterson-COL-5-LTLCardinality-08 1156337 m, 36633 m/sec, 6414202 t fired, .
Time elapsed: 41 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1799 16/32 Peterson-COL-5-LTLCardinality-08 1290248 m, 26782 m/sec, 7221434 t fired, .
Time elapsed: 46 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1799 17/32 Peterson-COL-5-LTLCardinality-08 1423594 m, 26669 m/sec, 8016288 t fired, .
Time elapsed: 51 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1799 19/32 Peterson-COL-5-LTLCardinality-08 1558473 m, 26975 m/sec, 8811459 t fired, .
Time elapsed: 56 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1799 20/32 Peterson-COL-5-LTLCardinality-08 1699167 m, 28138 m/sec, 9617169 t fired, .
Time elapsed: 61 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1799 22/32 Peterson-COL-5-LTLCardinality-08 1832402 m, 26647 m/sec, 10477440 t fired, .
Time elapsed: 66 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1799 23/32 Peterson-COL-5-LTLCardinality-08 1931128 m, 19745 m/sec, 11314949 t fired, .
Time elapsed: 71 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1799 25/32 Peterson-COL-5-LTLCardinality-08 2102497 m, 34273 m/sec, 12125796 t fired, .
Time elapsed: 76 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1799 27/32 Peterson-COL-5-LTLCardinality-08 2235706 m, 26641 m/sec, 12925587 t fired, .
Time elapsed: 81 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1799 29/32 Peterson-COL-5-LTLCardinality-08 2374525 m, 27763 m/sec, 13757616 t fired, .
Time elapsed: 86 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1799 30/32 Peterson-COL-5-LTLCardinality-08 2514954 m, 28085 m/sec, 14577487 t fired, .
Time elapsed: 91 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1799 32/32 Peterson-COL-5-LTLCardinality-08 2649917 m, 26992 m/sec, 15410673 t fired, .
Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Peterson-COL-5-LTLCardinality-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-COL-5-LTLCardinality-01
lola: time limit : 3499 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3499 3/32 Peterson-COL-5-LTLCardinality-01 213150 m, 42630 m/sec, 755668 t fired, .
Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3499 5/32 Peterson-COL-5-LTLCardinality-01 363764 m, 30122 m/sec, 1587556 t fired, .
Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3499 7/32 Peterson-COL-5-LTLCardinality-01 518694 m, 30986 m/sec, 2412781 t fired, .
Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3499 9/32 Peterson-COL-5-LTLCardinality-01 680632 m, 32387 m/sec, 3229439 t fired, .
Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3499 11/32 Peterson-COL-5-LTLCardinality-01 845817 m, 33037 m/sec, 4046707 t fired, .
Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3499 13/32 Peterson-COL-5-LTLCardinality-01 995807 m, 29998 m/sec, 4886725 t fired, .
Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3499 14/32 Peterson-COL-5-LTLCardinality-01 1074052 m, 15649 m/sec, 5739924 t fired, .
Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3499 15/32 Peterson-COL-5-LTLCardinality-01 1275867 m, 40363 m/sec, 6452385 t fired, .
Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3499 16/32 Peterson-COL-5-LTLCardinality-01 1416479 m, 28122 m/sec, 7223486 t fired, .
Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3499 17/32 Peterson-COL-5-LTLCardinality-01 1560505 m, 28805 m/sec, 7996063 t fired, .
Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3499 18/32 Peterson-COL-5-LTLCardinality-01 1707651 m, 29429 m/sec, 8760566 t fired, .
Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3499 19/32 Peterson-COL-5-LTLCardinality-01 1862805 m, 31030 m/sec, 9516525 t fired, .
Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3499 20/32 Peterson-COL-5-LTLCardinality-01 2006633 m, 28765 m/sec, 10286705 t fired, .
Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3499 21/32 Peterson-COL-5-LTLCardinality-01 2144699 m, 27613 m/sec, 11102024 t fired, .
Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3499 23/32 Peterson-COL-5-LTLCardinality-01 2289774 m, 29015 m/sec, 11907215 t fired, .
Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3499 24/32 Peterson-COL-5-LTLCardinality-01 2441377 m, 30320 m/sec, 12745562 t fired, .
Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3499 26/32 Peterson-COL-5-LTLCardinality-01 2593978 m, 30520 m/sec, 13571192 t fired, .
Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3499 28/32 Peterson-COL-5-LTLCardinality-01 2751809 m, 31566 m/sec, 14396061 t fired, .
Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3499 30/32 Peterson-COL-5-LTLCardinality-01 2915522 m, 32742 m/sec, 15213901 t fired, .
Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3499 31/32 Peterson-COL-5-LTLCardinality-01 3074360 m, 31767 m/sec, 16041056 t fired, .
Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Peterson-COL-5-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Peterson-COL-5-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-5-LTLCardinality-01: LTL unknown AGGR
Peterson-COL-5-LTLCardinality-08: LTL unknown AGGR
Time elapsed: 206 secs. Pages in use: 32
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="Peterson-COL-5"
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 Peterson-COL-5, 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 r263-smll-167863538400579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;