Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978500154.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679344129021

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:28:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:28:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:28:51] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-20 20:28:51] [INFO ] Transformed 2003 places.
[2023-03-20 20:28:51] [INFO ] Transformed 2253 transitions.
[2023-03-20 20:28:51] [INFO ] Found NUPN structural information;
[2023-03-20 20:28:51] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 136 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 325 places :
Symmetric choice reduction at 0 with 325 rule applications. Total rules 325 place count 1678 transition count 1928
Iterating global reduction 0 with 325 rules applied. Total rules applied 650 place count 1678 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 651 place count 1677 transition count 1927
Iterating global reduction 0 with 1 rules applied. Total rules applied 652 place count 1677 transition count 1927
Applied a total of 652 rules in 849 ms. Remains 1677 /2003 variables (removed 326) and now considering 1927/2253 (removed 326) transitions.
// Phase 1: matrix 1927 rows 1677 cols
[2023-03-20 20:28:52] [INFO ] Computed 201 place invariants in 47 ms
[2023-03-20 20:28:53] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2023-03-20 20:28:53] [INFO ] Invariant cache hit.
[2023-03-20 20:28:55] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned []
Implicit Place search using SMT with State Equation took 3007 ms to find 0 implicit places.
[2023-03-20 20:28:55] [INFO ] Invariant cache hit.
[2023-03-20 20:28:56] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1677/2003 places, 1927/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4933 ms. Remains : 1677/2003 places, 1927/2253 transitions.
Support contains 136 out of 1677 places after structural reductions.
[2023-03-20 20:28:57] [INFO ] Flatten gal took : 232 ms
[2023-03-20 20:28:57] [INFO ] Flatten gal took : 117 ms
[2023-03-20 20:28:57] [INFO ] Input system was already deterministic with 1927 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 72) seen :55
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-20 20:28:58] [INFO ] Invariant cache hit.
[2023-03-20 20:28:59] [INFO ] [Real]Absence check using 201 positive place invariants in 164 ms returned sat
[2023-03-20 20:28:59] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-20 20:29:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 100 ms returned sat
[2023-03-20 20:29:02] [INFO ] After 2456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-20 20:29:03] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 4 ms to minimize.
[2023-03-20 20:29:03] [INFO ] Deduced a trap composed of 52 places in 367 ms of which 2 ms to minimize.
[2023-03-20 20:29:04] [INFO ] Deduced a trap composed of 18 places in 356 ms of which 2 ms to minimize.
[2023-03-20 20:29:04] [INFO ] Deduced a trap composed of 39 places in 459 ms of which 1 ms to minimize.
[2023-03-20 20:29:05] [INFO ] Deduced a trap composed of 41 places in 432 ms of which 1 ms to minimize.
[2023-03-20 20:29:05] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 13 ms to minimize.
[2023-03-20 20:29:05] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2023-03-20 20:29:06] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 0 ms to minimize.
[2023-03-20 20:29:06] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 1 ms to minimize.
[2023-03-20 20:29:06] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 0 ms to minimize.
[2023-03-20 20:29:06] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2023-03-20 20:29:07] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2023-03-20 20:29:07] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:29:07] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 4 ms to minimize.
[2023-03-20 20:29:08] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 1 ms to minimize.
[2023-03-20 20:29:08] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:29:08] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:29:08] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 1 ms to minimize.
[2023-03-20 20:29:09] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:29:09] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 0 ms to minimize.
[2023-03-20 20:29:09] [INFO ] Deduced a trap composed of 63 places in 198 ms of which 1 ms to minimize.
[2023-03-20 20:29:09] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:29:10] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:29:10] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:29:10] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:29:10] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:29:11] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:29:11] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:29:11] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:29:11] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8747 ms
[2023-03-20 20:29:11] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:29:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-20 20:29:12] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 1 ms to minimize.
[2023-03-20 20:29:12] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:29:12] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
[2023-03-20 20:29:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 700 ms
[2023-03-20 20:29:13] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 3 ms to minimize.
[2023-03-20 20:29:13] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2023-03-20 20:29:14] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-20 20:29:14] [INFO ] Deduced a trap composed of 39 places in 505 ms of which 1 ms to minimize.
[2023-03-20 20:29:15] [INFO ] Deduced a trap composed of 37 places in 458 ms of which 1 ms to minimize.
[2023-03-20 20:29:15] [INFO ] Deduced a trap composed of 59 places in 399 ms of which 1 ms to minimize.
[2023-03-20 20:29:16] [INFO ] Deduced a trap composed of 45 places in 437 ms of which 2 ms to minimize.
[2023-03-20 20:29:16] [INFO ] Deduced a trap composed of 59 places in 381 ms of which 1 ms to minimize.
[2023-03-20 20:29:17] [INFO ] Deduced a trap composed of 60 places in 413 ms of which 3 ms to minimize.
[2023-03-20 20:29:17] [INFO ] Deduced a trap composed of 53 places in 428 ms of which 1 ms to minimize.
[2023-03-20 20:29:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3678 ms
[2023-03-20 20:29:18] [INFO ] Deduced a trap composed of 20 places in 408 ms of which 0 ms to minimize.
[2023-03-20 20:29:19] [INFO ] Deduced a trap composed of 26 places in 492 ms of which 1 ms to minimize.
[2023-03-20 20:29:19] [INFO ] Deduced a trap composed of 21 places in 472 ms of which 1 ms to minimize.
[2023-03-20 20:29:20] [INFO ] Deduced a trap composed of 21 places in 346 ms of which 0 ms to minimize.
[2023-03-20 20:29:20] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 0 ms to minimize.
[2023-03-20 20:29:20] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-20 20:29:21] [INFO ] Deduced a trap composed of 54 places in 308 ms of which 1 ms to minimize.
[2023-03-20 20:29:21] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 1 ms to minimize.
[2023-03-20 20:29:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3495 ms
[2023-03-20 20:29:22] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-20 20:29:22] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 1 ms to minimize.
[2023-03-20 20:29:22] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 0 ms to minimize.
[2023-03-20 20:29:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2023-03-20 20:29:23] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 6 ms to minimize.
[2023-03-20 20:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-20 20:29:23] [INFO ] After 23469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
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.Application.startNoEx(Application.java:626)
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 20:29:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:29:24] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 1 properties in 3129 ms.
Support contains 41 out of 1677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1677 transition count 1735
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 194 rules applied. Total rules applied 386 place count 1485 transition count 1733
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 388 place count 1483 transition count 1733
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 388 place count 1483 transition count 1484
Deduced a syphon composed of 249 places in 18 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 886 place count 1234 transition count 1484
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 904 place count 1216 transition count 1466
Iterating global reduction 3 with 18 rules applied. Total rules applied 922 place count 1216 transition count 1466
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 922 place count 1216 transition count 1457
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 940 place count 1207 transition count 1457
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 476
Deduced a syphon composed of 476 places in 2 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 3 with 952 rules applied. Total rules applied 1892 place count 731 transition count 981
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 3 with 95 rules applied. Total rules applied 1987 place count 731 transition count 981
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1988 place count 730 transition count 980
Applied a total of 1988 rules in 747 ms. Remains 730 /1677 variables (removed 947) and now considering 980/1927 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 748 ms. Remains : 730/1677 places, 980/1927 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 980 rows 730 cols
[2023-03-20 20:29:28] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-20 20:29:28] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 20:29:29] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:29:29] [INFO ] [Nat]Absence check using 201 positive place invariants in 43 ms returned sat
[2023-03-20 20:29:30] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:29:30] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:29:30] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:29:30] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:29:30] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:29:31] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:29:31] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2023-03-20 20:29:31] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:29:31] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2023-03-20 20:29:31] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 5 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:29:32] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:29:33] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 13 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-20 20:29:34] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4743 ms
[2023-03-20 20:29:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-20 20:29:35] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:29:35] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2023-03-20 20:29:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2023-03-20 20:29:35] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 20:29:35] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-20 20:29:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2023-03-20 20:29:35] [INFO ] After 6015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-20 20:29:35] [INFO ] After 6391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 68 ms.
Support contains 14 out of 730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 730/730 places, 980/980 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 730 transition count 978
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 728 transition count 978
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 28 place count 716 transition count 966
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 716 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 715 transition count 965
Applied a total of 35 rules in 618 ms. Remains 715 /730 variables (removed 15) and now considering 965/980 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 715/730 places, 965/980 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) 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 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 965 rows 715 cols
[2023-03-20 20:29:37] [INFO ] Computed 201 place invariants in 23 ms
[2023-03-20 20:29:37] [INFO ] [Real]Absence check using 201 positive place invariants in 40 ms returned sat
[2023-03-20 20:29:37] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:29:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 37 ms returned sat
[2023-03-20 20:29:38] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-20 20:29:38] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 4 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:29:39] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-20 20:29:40] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-03-20 20:29:41] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3777 ms
[2023-03-20 20:29:41] [INFO ] After 4205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-20 20:29:42] [INFO ] After 4464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 13 ms.
Support contains 2 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 965/965 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 715 transition count 963
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 713 transition count 963
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 713 transition count 959
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 709 transition count 959
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 18 place count 706 transition count 956
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 706 transition count 956
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 704 transition count 954
Applied a total of 21 rules in 183 ms. Remains 704 /715 variables (removed 11) and now considering 954/965 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 704/715 places, 954/965 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 409848 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409848 steps, saw 400810 distinct states, run finished after 3015 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-20 20:29:45] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-20 20:29:45] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-20 20:29:45] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 20:29:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 40 ms returned sat
[2023-03-20 20:29:46] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 20:29:46] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:29:46] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-20 20:29:47] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-20 20:29:48] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2023-03-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:29:49] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-03-20 20:29:49] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2785 ms
[2023-03-20 20:29:49] [INFO ] After 3249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 20:29:49] [INFO ] After 3529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 40 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 34 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-20 20:29:49] [INFO ] Invariant cache hit.
[2023-03-20 20:29:50] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-20 20:29:50] [INFO ] Invariant cache hit.
[2023-03-20 20:29:51] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2023-03-20 20:29:51] [INFO ] Redundant transitions in 240 ms returned []
[2023-03-20 20:29:51] [INFO ] Invariant cache hit.
[2023-03-20 20:29:52] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2555 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 43 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 20:29:52] [INFO ] Invariant cache hit.
[2023-03-20 20:29:52] [INFO ] [Real]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-20 20:29:52] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 20:29:52] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-20 20:29:53] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 20:29:53] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-20 20:29:53] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-20 20:29:53] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-20 20:29:53] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:29:53] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-20 20:29:54] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:29:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 819 ms
[2023-03-20 20:29:54] [INFO ] After 1195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-20 20:29:54] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 20:29:54] [INFO ] Flatten gal took : 86 ms
[2023-03-20 20:29:54] [INFO ] Flatten gal took : 106 ms
[2023-03-20 20:29:54] [INFO ] Input system was already deterministic with 1927 transitions.
Computed a total of 415 stabilizing places and 415 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1676 transition count 1727
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1477 transition count 1726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1476 transition count 1726
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 400 place count 1476 transition count 1475
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 902 place count 1225 transition count 1475
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 925 place count 1202 transition count 1452
Iterating global reduction 3 with 23 rules applied. Total rules applied 948 place count 1202 transition count 1452
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 948 place count 1202 transition count 1442
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 968 place count 1192 transition count 1442
Performed 486 Post agglomeration using F-continuation condition.Transition count delta: 486
Deduced a syphon composed of 486 places in 1 ms
Reduce places removed 486 places and 0 transitions.
Iterating global reduction 3 with 972 rules applied. Total rules applied 1940 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1942 place count 704 transition count 954
Applied a total of 1942 rules in 522 ms. Remains 704 /1677 variables (removed 973) and now considering 954/1927 (removed 973) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 523 ms. Remains : 704/1677 places, 954/1927 transitions.
[2023-03-20 20:29:55] [INFO ] Flatten gal took : 57 ms
[2023-03-20 20:29:55] [INFO ] Flatten gal took : 58 ms
[2023-03-20 20:29:55] [INFO ] Input system was already deterministic with 954 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1676 transition count 1727
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1477 transition count 1727
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1477 transition count 1477
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1227 transition count 1477
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 923 place count 1202 transition count 1452
Iterating global reduction 2 with 25 rules applied. Total rules applied 948 place count 1202 transition count 1452
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 948 place count 1202 transition count 1440
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 972 place count 1190 transition count 1440
Performed 484 Post agglomeration using F-continuation condition.Transition count delta: 484
Deduced a syphon composed of 484 places in 1 ms
Reduce places removed 484 places and 0 transitions.
Iterating global reduction 2 with 968 rules applied. Total rules applied 1940 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1942 place count 704 transition count 954
Applied a total of 1942 rules in 478 ms. Remains 704 /1677 variables (removed 973) and now considering 954/1927 (removed 973) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 481 ms. Remains : 704/1677 places, 954/1927 transitions.
[2023-03-20 20:29:55] [INFO ] Flatten gal took : 51 ms
[2023-03-20 20:29:56] [INFO ] Flatten gal took : 51 ms
[2023-03-20 20:29:56] [INFO ] Input system was already deterministic with 954 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1657 transition count 1907
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1657 transition count 1907
Applied a total of 40 rules in 207 ms. Remains 1657 /1677 variables (removed 20) and now considering 1907/1927 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 1657/1677 places, 1907/1927 transitions.
[2023-03-20 20:29:56] [INFO ] Flatten gal took : 83 ms
[2023-03-20 20:29:56] [INFO ] Flatten gal took : 100 ms
[2023-03-20 20:29:56] [INFO ] Input system was already deterministic with 1907 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1654 transition count 1904
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1654 transition count 1904
Applied a total of 46 rules in 139 ms. Remains 1654 /1677 variables (removed 23) and now considering 1904/1927 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 1654/1677 places, 1904/1927 transitions.
[2023-03-20 20:29:57] [INFO ] Flatten gal took : 81 ms
[2023-03-20 20:29:57] [INFO ] Flatten gal took : 97 ms
[2023-03-20 20:29:57] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1676 transition count 1727
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1477 transition count 1727
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1477 transition count 1477
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1227 transition count 1477
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 922 place count 1203 transition count 1453
Iterating global reduction 2 with 24 rules applied. Total rules applied 946 place count 1203 transition count 1453
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 946 place count 1203 transition count 1442
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 968 place count 1192 transition count 1442
Performed 483 Post agglomeration using F-continuation condition.Transition count delta: 483
Deduced a syphon composed of 483 places in 2 ms
Reduce places removed 483 places and 0 transitions.
Iterating global reduction 2 with 966 rules applied. Total rules applied 1934 place count 709 transition count 959
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1936 place count 707 transition count 957
Applied a total of 1936 rules in 513 ms. Remains 707 /1677 variables (removed 970) and now considering 957/1927 (removed 970) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 514 ms. Remains : 707/1677 places, 957/1927 transitions.
[2023-03-20 20:29:58] [INFO ] Flatten gal took : 49 ms
[2023-03-20 20:29:58] [INFO ] Flatten gal took : 85 ms
[2023-03-20 20:29:58] [INFO ] Input system was already deterministic with 957 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1676 transition count 1726
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1476 transition count 1725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1475 transition count 1725
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 402 place count 1475 transition count 1475
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 902 place count 1225 transition count 1475
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 925 place count 1202 transition count 1452
Iterating global reduction 3 with 23 rules applied. Total rules applied 948 place count 1202 transition count 1452
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 948 place count 1202 transition count 1442
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 968 place count 1192 transition count 1442
Performed 484 Post agglomeration using F-continuation condition.Transition count delta: 484
Deduced a syphon composed of 484 places in 2 ms
Reduce places removed 484 places and 0 transitions.
Iterating global reduction 3 with 968 rules applied. Total rules applied 1936 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1938 place count 706 transition count 956
Applied a total of 1938 rules in 473 ms. Remains 706 /1677 variables (removed 971) and now considering 956/1927 (removed 971) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 486 ms. Remains : 706/1677 places, 956/1927 transitions.
[2023-03-20 20:29:58] [INFO ] Flatten gal took : 41 ms
[2023-03-20 20:29:58] [INFO ] Flatten gal took : 37 ms
[2023-03-20 20:29:58] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1655 transition count 1905
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1655 transition count 1905
Applied a total of 44 rules in 137 ms. Remains 1655 /1677 variables (removed 22) and now considering 1905/1927 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 1655/1677 places, 1905/1927 transitions.
[2023-03-20 20:29:59] [INFO ] Flatten gal took : 55 ms
[2023-03-20 20:29:59] [INFO ] Flatten gal took : 57 ms
[2023-03-20 20:29:59] [INFO ] Input system was already deterministic with 1905 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1676 transition count 1725
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1475 transition count 1725
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1475 transition count 1475
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1225 transition count 1475
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 927 place count 1200 transition count 1450
Iterating global reduction 2 with 25 rules applied. Total rules applied 952 place count 1200 transition count 1450
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 952 place count 1200 transition count 1438
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 976 place count 1188 transition count 1438
Performed 483 Post agglomeration using F-continuation condition.Transition count delta: 483
Deduced a syphon composed of 483 places in 2 ms
Reduce places removed 483 places and 0 transitions.
Iterating global reduction 2 with 966 rules applied. Total rules applied 1942 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1944 place count 703 transition count 953
Applied a total of 1944 rules in 296 ms. Remains 703 /1677 variables (removed 974) and now considering 953/1927 (removed 974) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 296 ms. Remains : 703/1677 places, 953/1927 transitions.
[2023-03-20 20:29:59] [INFO ] Flatten gal took : 30 ms
[2023-03-20 20:29:59] [INFO ] Flatten gal took : 34 ms
[2023-03-20 20:29:59] [INFO ] Input system was already deterministic with 953 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA ShieldRVs-PT-050B-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1653 transition count 1903
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1653 transition count 1903
Applied a total of 48 rules in 152 ms. Remains 1653 /1677 variables (removed 24) and now considering 1903/1927 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 1653/1677 places, 1903/1927 transitions.
[2023-03-20 20:30:00] [INFO ] Flatten gal took : 52 ms
[2023-03-20 20:30:00] [INFO ] Flatten gal took : 54 ms
[2023-03-20 20:30:00] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1656 transition count 1906
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1656 transition count 1906
Applied a total of 42 rules in 133 ms. Remains 1656 /1677 variables (removed 21) and now considering 1906/1927 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 1656/1677 places, 1906/1927 transitions.
[2023-03-20 20:30:00] [INFO ] Flatten gal took : 51 ms
[2023-03-20 20:30:00] [INFO ] Flatten gal took : 54 ms
[2023-03-20 20:30:00] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1656 transition count 1906
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1656 transition count 1906
Applied a total of 42 rules in 125 ms. Remains 1656 /1677 variables (removed 21) and now considering 1906/1927 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 1656/1677 places, 1906/1927 transitions.
[2023-03-20 20:30:00] [INFO ] Flatten gal took : 44 ms
[2023-03-20 20:30:00] [INFO ] Flatten gal took : 43 ms
[2023-03-20 20:30:00] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1652 transition count 1902
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1652 transition count 1902
Applied a total of 50 rules in 92 ms. Remains 1652 /1677 variables (removed 25) and now considering 1902/1927 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 1652/1677 places, 1902/1927 transitions.
[2023-03-20 20:30:01] [INFO ] Flatten gal took : 39 ms
[2023-03-20 20:30:01] [INFO ] Flatten gal took : 41 ms
[2023-03-20 20:30:01] [INFO ] Input system was already deterministic with 1902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1654 transition count 1904
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1654 transition count 1904
Applied a total of 46 rules in 105 ms. Remains 1654 /1677 variables (removed 23) and now considering 1904/1927 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 1654/1677 places, 1904/1927 transitions.
[2023-03-20 20:30:01] [INFO ] Flatten gal took : 41 ms
[2023-03-20 20:30:01] [INFO ] Flatten gal took : 42 ms
[2023-03-20 20:30:01] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1654 transition count 1904
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1654 transition count 1904
Applied a total of 46 rules in 96 ms. Remains 1654 /1677 variables (removed 23) and now considering 1904/1927 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 1654/1677 places, 1904/1927 transitions.
[2023-03-20 20:30:01] [INFO ] Flatten gal took : 38 ms
[2023-03-20 20:30:01] [INFO ] Flatten gal took : 41 ms
[2023-03-20 20:30:01] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1676 transition count 1725
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1475 transition count 1725
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1475 transition count 1475
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1225 transition count 1475
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 927 place count 1200 transition count 1450
Iterating global reduction 2 with 25 rules applied. Total rules applied 952 place count 1200 transition count 1450
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 952 place count 1200 transition count 1438
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 976 place count 1188 transition count 1438
Performed 484 Post agglomeration using F-continuation condition.Transition count delta: 484
Deduced a syphon composed of 484 places in 3 ms
Reduce places removed 484 places and 0 transitions.
Iterating global reduction 2 with 968 rules applied. Total rules applied 1944 place count 704 transition count 954
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1946 place count 702 transition count 952
Applied a total of 1946 rules in 321 ms. Remains 702 /1677 variables (removed 975) and now considering 952/1927 (removed 975) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 321 ms. Remains : 702/1677 places, 952/1927 transitions.
[2023-03-20 20:30:02] [INFO ] Flatten gal took : 30 ms
[2023-03-20 20:30:02] [INFO ] Flatten gal took : 29 ms
[2023-03-20 20:30:02] [INFO ] Input system was already deterministic with 952 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1677/1677 places, 1927/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1676 transition count 1727
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1477 transition count 1727
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1477 transition count 1477
Deduced a syphon composed of 250 places in 4 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1227 transition count 1477
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 921 place count 1204 transition count 1454
Iterating global reduction 2 with 23 rules applied. Total rules applied 944 place count 1204 transition count 1454
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 944 place count 1204 transition count 1443
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 966 place count 1193 transition count 1443
Performed 484 Post agglomeration using F-continuation condition.Transition count delta: 484
Deduced a syphon composed of 484 places in 3 ms
Reduce places removed 484 places and 0 transitions.
Iterating global reduction 2 with 968 rules applied. Total rules applied 1934 place count 709 transition count 959
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1936 place count 707 transition count 957
Applied a total of 1936 rules in 301 ms. Remains 707 /1677 variables (removed 970) and now considering 957/1927 (removed 970) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 301 ms. Remains : 707/1677 places, 957/1927 transitions.
[2023-03-20 20:30:02] [INFO ] Flatten gal took : 29 ms
[2023-03-20 20:30:02] [INFO ] Flatten gal took : 32 ms
[2023-03-20 20:30:02] [INFO ] Input system was already deterministic with 957 transitions.
[2023-03-20 20:30:02] [INFO ] Flatten gal took : 60 ms
[2023-03-20 20:30:02] [INFO ] Flatten gal took : 59 ms
[2023-03-20 20:30:02] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-20 20:30:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1677 places, 1927 transitions and 6548 arcs took 12 ms.
Total runtime 71749 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1677 NrTr: 1927 NrArc: 6548)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.341sec

net check time: 0m 0.001sec

init dd package: 0m 3.195sec


before gc: list nodes free: 1156825

after gc: idd nodes used:48358036, unused:15641964; list nodes free:68625041

RS generation: 24m34.259sec


-> last computed set: #nodes 48356361 (4.8e+07) #states 17,179,012,737,733 (13)


CANNOT_COMPUTE


BK_STOP 1679345714030

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.038sec

idd.cc:820: DD Exception: No free nodes

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="ShieldRVs-PT-050B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldRVs-PT-050B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978500154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;