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.r391-oct2-167903715500651.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 569K 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 ShieldPPPt-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679279641843

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=ShieldPPPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:34:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:34:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:34:04] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-20 02:34:04] [INFO ] Transformed 2343 places.
[2023-03-20 02:34:04] [INFO ] Transformed 2133 transitions.
[2023-03-20 02:34:04] [INFO ] Found NUPN structural information;
[2023-03-20 02:34:04] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 2020 transition count 1810
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 2020 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 2019 transition count 1809
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 2019 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 2018 transition count 1808
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 2018 transition count 1808
Applied a total of 650 rules in 844 ms. Remains 2018 /2343 variables (removed 325) and now considering 1808/2133 (removed 325) transitions.
// Phase 1: matrix 1808 rows 2018 cols
[2023-03-20 02:34:05] [INFO ] Computed 331 place invariants in 19 ms
[2023-03-20 02:34:07] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2023-03-20 02:34:07] [INFO ] Invariant cache hit.
[2023-03-20 02:34:09] [INFO ] Implicit Places using invariants and state equation in 2303 ms returned []
Implicit Place search using SMT with State Equation took 3479 ms to find 0 implicit places.
[2023-03-20 02:34:09] [INFO ] Invariant cache hit.
[2023-03-20 02:34:10] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2018/2343 places, 1808/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5691 ms. Remains : 2018/2343 places, 1808/2133 transitions.
Support contains 23 out of 2018 places after structural reductions.
[2023-03-20 02:34:11] [INFO ] Flatten gal took : 155 ms
[2023-03-20 02:34:11] [INFO ] Flatten gal took : 66 ms
[2023-03-20 02:34:11] [INFO ] Input system was already deterministic with 1808 transitions.
Support contains 22 out of 2018 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 02:34:12] [INFO ] Invariant cache hit.
[2023-03-20 02:34:12] [INFO ] [Real]Absence check using 331 positive place invariants in 142 ms returned sat
[2023-03-20 02:34:13] [INFO ] After 990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:34:13] [INFO ] [Nat]Absence check using 331 positive place invariants in 221 ms returned sat
[2023-03-20 02:34:15] [INFO ] After 1605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:34:16] [INFO ] Deduced a trap composed of 21 places in 532 ms of which 10 ms to minimize.
[2023-03-20 02:34:16] [INFO ] Deduced a trap composed of 24 places in 658 ms of which 5 ms to minimize.
[2023-03-20 02:34:17] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 1 ms to minimize.
[2023-03-20 02:34:18] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 1 ms to minimize.
[2023-03-20 02:34:18] [INFO ] Deduced a trap composed of 20 places in 462 ms of which 14 ms to minimize.
[2023-03-20 02:34:19] [INFO ] Deduced a trap composed of 20 places in 461 ms of which 1 ms to minimize.
[2023-03-20 02:34:19] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 2 ms to minimize.
[2023-03-20 02:34:20] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 1 ms to minimize.
[2023-03-20 02:34:20] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 1 ms to minimize.
[2023-03-20 02:34:20] [INFO ] Deduced a trap composed of 25 places in 426 ms of which 1 ms to minimize.
[2023-03-20 02:34:21] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:34:21] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 3 ms to minimize.
[2023-03-20 02:34:22] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2023-03-20 02:34:22] [INFO ] Deduced a trap composed of 18 places in 387 ms of which 1 ms to minimize.
[2023-03-20 02:34:23] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 2 ms to minimize.
[2023-03-20 02:34:23] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 2 ms to minimize.
[2023-03-20 02:34:24] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 1 ms to minimize.
[2023-03-20 02:34:24] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 0 ms to minimize.
[2023-03-20 02:34:24] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 0 ms to minimize.
[2023-03-20 02:34:25] [INFO ] Deduced a trap composed of 33 places in 379 ms of which 1 ms to minimize.
[2023-03-20 02:34:25] [INFO ] Deduced a trap composed of 28 places in 444 ms of which 1 ms to minimize.
[2023-03-20 02:34:26] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 1 ms to minimize.
[2023-03-20 02:34:26] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 0 ms to minimize.
[2023-03-20 02:34:27] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 1 ms to minimize.
[2023-03-20 02:34:27] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 2 ms to minimize.
[2023-03-20 02:34:28] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 1 ms to minimize.
[2023-03-20 02:34:28] [INFO ] Deduced a trap composed of 28 places in 367 ms of which 0 ms to minimize.
[2023-03-20 02:34:28] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:34:29] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 1 ms to minimize.
[2023-03-20 02:34:29] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:34:29] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 2 ms to minimize.
[2023-03-20 02:34:30] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 2 ms to minimize.
[2023-03-20 02:34:30] [INFO ] Deduced a trap composed of 35 places in 381 ms of which 3 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 11 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 0 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 0 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 13 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 0 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 1 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 38 places in 348 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:34:35] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 1 ms to minimize.
[2023-03-20 02:34:35] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 0 ms to minimize.
[2023-03-20 02:34:35] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:34:35] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 0 ms to minimize.
[2023-03-20 02:34:36] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:34:36] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:34:36] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 0 ms to minimize.
[2023-03-20 02:34:36] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 21107 ms
[2023-03-20 02:34:37] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 1 ms to minimize.
[2023-03-20 02:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2023-03-20 02:34:38] [INFO ] Deduced a trap composed of 50 places in 141 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-20 02:34:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:34:38] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 511 ms.
Support contains 12 out of 2018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 2018 transition count 1392
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 1602 transition count 1392
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 832 place count 1602 transition count 1156
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1304 place count 1366 transition count 1156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1306 place count 1364 transition count 1154
Iterating global reduction 2 with 2 rules applied. Total rules applied 1308 place count 1364 transition count 1154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1308 place count 1364 transition count 1153
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1310 place count 1363 transition count 1153
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 1 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2320 place count 858 transition count 648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2321 place count 858 transition count 647
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 place count 857 transition count 646
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2501 place count 768 transition count 646
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2502 place count 768 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2503 place count 767 transition count 645
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2591 place count 767 transition count 645
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2592 place count 766 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2593 place count 765 transition count 644
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2593 place count 765 transition count 642
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2597 place count 763 transition count 642
Applied a total of 2597 rules in 463 ms. Remains 763 /2018 variables (removed 1255) and now considering 642/1808 (removed 1166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 763/2018 places, 642/1808 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 642 rows 763 cols
[2023-03-20 02:34:40] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:34:40] [INFO ] [Real]Absence check using 330 positive place invariants in 48 ms returned sat
[2023-03-20 02:34:40] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:34:40] [INFO ] [Nat]Absence check using 330 positive place invariants in 48 ms returned sat
[2023-03-20 02:34:41] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:34:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-20 02:34:41] [INFO ] After 392ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:34:41] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:34:41] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-20 02:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2023-03-20 02:34:42] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-20 02:34:42] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-03-20 02:34:42] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-20 02:34:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 429 ms
[2023-03-20 02:34:42] [INFO ] After 1476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-20 02:34:42] [INFO ] After 2575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 11 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 642/642 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 641
Applied a total of 2 rules in 48 ms. Remains 762 /763 variables (removed 1) and now considering 641/642 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 762/763 places, 641/642 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 641 rows 762 cols
[2023-03-20 02:34:43] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:34:44] [INFO ] [Real]Absence check using 330 positive place invariants in 47 ms returned sat
[2023-03-20 02:34:44] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:34:44] [INFO ] [Nat]Absence check using 330 positive place invariants in 72 ms returned sat
[2023-03-20 02:34:45] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 02:34:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-20 02:34:45] [INFO ] After 284ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 02:34:45] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:34:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-20 02:34:46] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-20 02:34:46] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-20 02:34:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2023-03-20 02:34:46] [INFO ] After 1433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 301 ms.
[2023-03-20 02:34:46] [INFO ] After 2565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 9 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 641/641 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 760 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 759 transition count 638
Applied a total of 5 rules in 96 ms. Remains 759 /762 variables (removed 3) and now considering 638/641 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 759/762 places, 638/641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 92832 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{0=1}
Probabilistic random walk after 92832 steps, saw 77634 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 638 rows 759 cols
[2023-03-20 02:34:50] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:34:51] [INFO ] [Real]Absence check using 330 positive place invariants in 45 ms returned sat
[2023-03-20 02:34:51] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:34:51] [INFO ] [Nat]Absence check using 330 positive place invariants in 138 ms returned sat
[2023-03-20 02:34:52] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:34:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-20 02:34:52] [INFO ] After 241ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:34:52] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 235 ms.
[2023-03-20 02:34:52] [INFO ] After 1791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 90 ms.
Support contains 7 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 638/638 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 757 transition count 636
Applied a total of 4 rules in 28 ms. Remains 757 /759 variables (removed 2) and now considering 636/638 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 757/759 places, 636/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 636 rows 757 cols
[2023-03-20 02:34:53] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:34:53] [INFO ] [Real]Absence check using 330 positive place invariants in 53 ms returned sat
[2023-03-20 02:34:53] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:34:53] [INFO ] [Nat]Absence check using 330 positive place invariants in 51 ms returned sat
[2023-03-20 02:34:54] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:34:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-20 02:34:54] [INFO ] After 182ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:34:54] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-20 02:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-20 02:34:55] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-20 02:34:55] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 5 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 636/636 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 755 transition count 634
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 754 transition count 633
Applied a total of 5 rules in 42 ms. Remains 754 /757 variables (removed 3) and now considering 633/636 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 754/757 places, 633/636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 109529 steps, run timeout after 3003 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109529 steps, saw 91921 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 633 rows 754 cols
[2023-03-20 02:34:58] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:34:59] [INFO ] [Real]Absence check using 330 positive place invariants in 39 ms returned sat
[2023-03-20 02:34:59] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:34:59] [INFO ] [Nat]Absence check using 330 positive place invariants in 48 ms returned sat
[2023-03-20 02:35:00] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:35:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 02:35:00] [INFO ] After 138ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:35:00] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-20 02:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-20 02:35:00] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-20 02:35:00] [INFO ] After 1262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 5 out of 754 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 754/754 places, 633/633 transitions.
Applied a total of 0 rules in 58 ms. Remains 754 /754 variables (removed 0) and now considering 633/633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 754/754 places, 633/633 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 754/754 places, 633/633 transitions.
Applied a total of 0 rules in 30 ms. Remains 754 /754 variables (removed 0) and now considering 633/633 (removed 0) transitions.
[2023-03-20 02:35:00] [INFO ] Invariant cache hit.
[2023-03-20 02:35:01] [INFO ] Implicit Places using invariants in 785 ms returned [737, 741]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 788 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 752/754 places, 633/633 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 750 transition count 631
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 750 transition count 631
Applied a total of 4 rules in 26 ms. Remains 750 /752 variables (removed 2) and now considering 631/633 (removed 2) transitions.
// Phase 1: matrix 631 rows 750 cols
[2023-03-20 02:35:01] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-20 02:35:02] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-20 02:35:02] [INFO ] Invariant cache hit.
[2023-03-20 02:35:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 02:35:03] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 750/754 places, 631/633 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2318 ms. Remains : 750/754 places, 631/633 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 128545 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128545 steps, saw 106528 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:35:06] [INFO ] Invariant cache hit.
[2023-03-20 02:35:06] [INFO ] [Real]Absence check using 328 positive place invariants in 39 ms returned sat
[2023-03-20 02:35:06] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:35:07] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2023-03-20 02:35:07] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:35:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 02:35:07] [INFO ] After 110ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:35:07] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 02:35:07] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 631/631 transitions.
Applied a total of 0 rules in 33 ms. Remains 750 /750 variables (removed 0) and now considering 631/631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 750/750 places, 631/631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 631/631 transitions.
Applied a total of 0 rules in 13 ms. Remains 750 /750 variables (removed 0) and now considering 631/631 (removed 0) transitions.
[2023-03-20 02:35:08] [INFO ] Invariant cache hit.
[2023-03-20 02:35:08] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-20 02:35:08] [INFO ] Invariant cache hit.
[2023-03-20 02:35:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 02:35:09] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2023-03-20 02:35:09] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-20 02:35:09] [INFO ] Invariant cache hit.
[2023-03-20 02:35:10] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2096 ms. Remains : 750/750 places, 631/631 transitions.
Partial Free-agglomeration rule applied 178 times.
Drop transitions removed 178 transitions
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 750 transition count 631
Applied a total of 178 rules in 44 ms. Remains 750 /750 variables (removed 0) and now considering 631/631 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 631 rows 750 cols
[2023-03-20 02:35:10] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:35:10] [INFO ] [Real]Absence check using 328 positive place invariants in 61 ms returned sat
[2023-03-20 02:35:10] [INFO ] After 707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:35:11] [INFO ] [Nat]Absence check using 328 positive place invariants in 38 ms returned sat
[2023-03-20 02:35:11] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:35:11] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-20 02:35:11] [INFO ] After 228ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 592 ms
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2023-03-20 02:35:13] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-20 02:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2023-03-20 02:35:13] [INFO ] After 1562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-20 02:35:13] [INFO ] After 2359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 478 stabilizing places and 478 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(p0))||(G(p1)&&X(p0))))'
Support contains 3 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2012 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2012 transition count 1802
Applied a total of 12 rules in 236 ms. Remains 2012 /2018 variables (removed 6) and now considering 1802/1808 (removed 6) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:35:13] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-20 02:35:14] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-20 02:35:14] [INFO ] Invariant cache hit.
[2023-03-20 02:35:17] [INFO ] Implicit Places using invariants and state equation in 3115 ms returned []
Implicit Place search using SMT with State Equation took 3982 ms to find 0 implicit places.
[2023-03-20 02:35:17] [INFO ] Invariant cache hit.
[2023-03-20 02:35:19] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2018 places, 1802/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5540 ms. Remains : 2012/2018 places, 1802/1808 transitions.
Stuttering acceptance computed with spot in 542 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(EQ s1532 1), p0:(AND (EQ s1829 0) (EQ s1007 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-01 finished in 6239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2011 transition count 1801
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2011 transition count 1801
Applied a total of 14 rules in 287 ms. Remains 2011 /2018 variables (removed 7) and now considering 1801/1808 (removed 7) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-20 02:35:19] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-20 02:35:20] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-20 02:35:20] [INFO ] Invariant cache hit.
[2023-03-20 02:35:22] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
[2023-03-20 02:35:22] [INFO ] Invariant cache hit.
[2023-03-20 02:35:23] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2018 places, 1801/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4338 ms. Remains : 2011/2018 places, 1801/1808 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1828 0) (EQ s1306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 981 steps with 0 reset in 10 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-04 finished in 4475 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(X(G((F(p1)&&(!p2 U (p3||G(!p2)))))))))'
Support contains 5 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2012 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2012 transition count 1802
Applied a total of 12 rules in 205 ms. Remains 2012 /2018 variables (removed 6) and now considering 1802/1808 (removed 6) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:35:24] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-20 02:35:25] [INFO ] Implicit Places using invariants in 750 ms returned []
[2023-03-20 02:35:25] [INFO ] Invariant cache hit.
[2023-03-20 02:35:27] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
[2023-03-20 02:35:27] [INFO ] Invariant cache hit.
[2023-03-20 02:35:28] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2018 places, 1802/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4576 ms. Remains : 2012/2018 places, 1802/1808 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s718 1)), p3:(AND (NEQ s803 1) (NOT (OR (EQ s735 0) (EQ s1230 1)))), p2:(OR (EQ s735 0) (EQ s1230 1)), p1:(AND (EQ s1230 0) (EQ s735 ...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-07 finished in 4881 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(F((G((p1 U p2))||p0))))'
Support contains 5 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2014 transition count 1804
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2014 transition count 1804
Applied a total of 8 rules in 260 ms. Remains 2014 /2018 variables (removed 4) and now considering 1804/1808 (removed 4) transitions.
// Phase 1: matrix 1804 rows 2014 cols
[2023-03-20 02:35:29] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-20 02:35:30] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-20 02:35:30] [INFO ] Invariant cache hit.
[2023-03-20 02:35:32] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2023-03-20 02:35:32] [INFO ] Invariant cache hit.
[2023-03-20 02:35:33] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2014/2018 places, 1804/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4185 ms. Remains : 2014/2018 places, 1804/1808 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s1990 0) (EQ s1520 1)), p2:(OR (EQ s809 0) (EQ s168 1)), p1:(EQ s1970 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1266 ms.
Product exploration explored 100000 steps with 50000 reset in 1137 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 (NOT p1))
Knowledge based reduction with 7 factoid took 415 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-08 finished in 7211 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&&F(G(p0)))))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2017 transition count 1387
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1597 transition count 1387
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 840 place count 1597 transition count 1150
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1314 place count 1360 transition count 1150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1318 place count 1356 transition count 1146
Iterating global reduction 2 with 4 rules applied. Total rules applied 1322 place count 1356 transition count 1146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1322 place count 1356 transition count 1143
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1328 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2344 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2525 place count 755 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2527 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2528 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2528 place count 752 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2532 place count 750 transition count 629
Applied a total of 2532 rules in 453 ms. Remains 750 /2018 variables (removed 1268) and now considering 629/1808 (removed 1179) transitions.
// Phase 1: matrix 629 rows 750 cols
[2023-03-20 02:35:36] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:35:37] [INFO ] Implicit Places using invariants in 649 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 651 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2018 places, 629/1808 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 627
Applied a total of 4 rules in 25 ms. Remains 746 /748 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 746 cols
[2023-03-20 02:35:37] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:35:37] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-20 02:35:37] [INFO ] Invariant cache hit.
[2023-03-20 02:35:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:35:38] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2018 places, 627/1808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2633 ms. Remains : 746/2018 places, 627/1808 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-13 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 (EQ s433 0) (EQ s153 1))], 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 616 ms.
Stack based approach found an accepted trace after 27754 steps with 0 reset with depth 27755 and stack size 25342 in 223 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-13 finished in 3548 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(F(p0))))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2011 transition count 1801
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2011 transition count 1801
Applied a total of 14 rules in 184 ms. Remains 2011 /2018 variables (removed 7) and now considering 1801/1808 (removed 7) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-20 02:35:39] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 02:35:40] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-20 02:35:40] [INFO ] Invariant cache hit.
[2023-03-20 02:35:42] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2497 ms to find 0 implicit places.
[2023-03-20 02:35:42] [INFO ] Invariant cache hit.
[2023-03-20 02:35:43] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2018 places, 1801/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3695 ms. Remains : 2011/2018 places, 1801/1808 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s412 0) (EQ s1459 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 751 ms.
Product exploration explored 100000 steps with 33333 reset in 750 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2011 stabilizing places and 478/1801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-14 finished in 5451 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(((X(p1) U (G(p1)&&F(G(p2))))&&p0)))'
Support contains 4 out of 2018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2017 transition count 1390
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1600 transition count 1390
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 834 place count 1600 transition count 1153
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1308 place count 1363 transition count 1153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1311 place count 1360 transition count 1150
Iterating global reduction 2 with 3 rules applied. Total rules applied 1314 place count 1360 transition count 1150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1314 place count 1360 transition count 1148
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1318 place count 1358 transition count 1148
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2338 place count 848 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2339 place count 848 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2341 place count 847 transition count 636
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2519 place count 758 transition count 636
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2520 place count 758 transition count 636
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2522 place count 756 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2523 place count 755 transition count 634
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2523 place count 755 transition count 632
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2527 place count 753 transition count 632
Applied a total of 2527 rules in 498 ms. Remains 753 /2018 variables (removed 1265) and now considering 632/1808 (removed 1176) transitions.
// Phase 1: matrix 632 rows 753 cols
[2023-03-20 02:35:45] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-20 02:35:46] [INFO ] Implicit Places using invariants in 741 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 744 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2018 places, 632/1808 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 630
Applied a total of 4 rules in 33 ms. Remains 749 /751 variables (removed 2) and now considering 630/632 (removed 2) transitions.
// Phase 1: matrix 630 rows 749 cols
[2023-03-20 02:35:46] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:35:47] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-20 02:35:47] [INFO ] Invariant cache hit.
[2023-03-20 02:35:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 02:35:47] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2018 places, 630/1808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2746 ms. Remains : 749/2018 places, 630/1808 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s424 0) (EQ s725 1)), p1:(OR (EQ s210 0) (EQ s655 1)), p2:(OR (EQ s725 0) (EQ s424 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 599 ms.
Stack based approach found an accepted trace after 176 steps with 0 reset with depth 177 and stack size 177 in 2 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-15 finished in 3665 ms.
All properties solved by simple procedures.
Total runtime 104499 ms.
ITS solved all properties within timeout

BK_STOP 1679279749171

--------------------
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

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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r391-oct2-167903715500651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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