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.r394-oct2-167903717900474.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 marciexred
Input is ShieldPPPs-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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 ShieldPPPs-PT-030B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679517226852

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=ShieldPPPs-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:33:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:33:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:33:49] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-22 20:33:49] [INFO ] Transformed 2043 places.
[2023-03-22 20:33:49] [INFO ] Transformed 1893 transitions.
[2023-03-22 20:33:49] [INFO ] Found NUPN structural information;
[2023-03-22 20:33:49] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 174 out of 2043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Discarding 183 places :
Symmetric choice reduction at 0 with 183 rule applications. Total rules 183 place count 1860 transition count 1710
Iterating global reduction 0 with 183 rules applied. Total rules applied 366 place count 1860 transition count 1710
Applied a total of 366 rules in 430 ms. Remains 1860 /2043 variables (removed 183) and now considering 1710/1893 (removed 183) transitions.
// Phase 1: matrix 1710 rows 1860 cols
[2023-03-22 20:33:49] [INFO ] Computed 331 place invariants in 30 ms
[2023-03-22 20:33:51] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2023-03-22 20:33:51] [INFO ] Invariant cache hit.
[2023-03-22 20:33:53] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 3941 ms to find 0 implicit places.
[2023-03-22 20:33:53] [INFO ] Invariant cache hit.
[2023-03-22 20:33:54] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1860/2043 places, 1710/1893 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5781 ms. Remains : 1860/2043 places, 1710/1893 transitions.
Support contains 174 out of 1860 places after structural reductions.
[2023-03-22 20:33:55] [INFO ] Flatten gal took : 165 ms
[2023-03-22 20:33:55] [INFO ] Flatten gal took : 82 ms
[2023-03-22 20:33:55] [INFO ] Input system was already deterministic with 1710 transitions.
Support contains 172 out of 1860 places (down from 174) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 101) seen :77
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-22 20:33:56] [INFO ] Invariant cache hit.
[2023-03-22 20:33:57] [INFO ] [Real]Absence check using 331 positive place invariants in 208 ms returned sat
[2023-03-22 20:33:57] [INFO ] After 1460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-22 20:33:59] [INFO ] [Nat]Absence check using 331 positive place invariants in 168 ms returned sat
[2023-03-22 20:34:03] [INFO ] After 3117ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2023-03-22 20:34:03] [INFO ] Deduced a trap composed of 23 places in 481 ms of which 31 ms to minimize.
[2023-03-22 20:34:04] [INFO ] Deduced a trap composed of 17 places in 476 ms of which 1 ms to minimize.
[2023-03-22 20:34:05] [INFO ] Deduced a trap composed of 21 places in 820 ms of which 2 ms to minimize.
[2023-03-22 20:34:05] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 1 ms to minimize.
[2023-03-22 20:34:05] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 3 ms to minimize.
[2023-03-22 20:34:06] [INFO ] Deduced a trap composed of 24 places in 467 ms of which 1 ms to minimize.
[2023-03-22 20:34:06] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 1 ms to minimize.
[2023-03-22 20:34:07] [INFO ] Deduced a trap composed of 18 places in 367 ms of which 1 ms to minimize.
[2023-03-22 20:34:07] [INFO ] Deduced a trap composed of 24 places in 334 ms of which 1 ms to minimize.
[2023-03-22 20:34:08] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 1 ms to minimize.
[2023-03-22 20:34:08] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 1 ms to minimize.
[2023-03-22 20:34:10] [INFO ] Deduced a trap composed of 22 places in 1508 ms of which 13 ms to minimize.
[2023-03-22 20:34:10] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 1 ms to minimize.
[2023-03-22 20:34:10] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 1 ms to minimize.
[2023-03-22 20:34:11] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 1 ms to minimize.
[2023-03-22 20:34:11] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2023-03-22 20:34:11] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 1 ms to minimize.
[2023-03-22 20:34:12] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2023-03-22 20:34:12] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 1 ms to minimize.
[2023-03-22 20:34:12] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 1 ms to minimize.
[2023-03-22 20:34:13] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2023-03-22 20:34:13] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 4 ms to minimize.
[2023-03-22 20:34:14] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 1 ms to minimize.
[2023-03-22 20:34:14] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 1 ms to minimize.
[2023-03-22 20:34:14] [INFO ] Deduced a trap composed of 51 places in 354 ms of which 1 ms to minimize.
[2023-03-22 20:34:15] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 2 ms to minimize.
[2023-03-22 20:34:15] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 1 ms to minimize.
[2023-03-22 20:34:15] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 0 ms to minimize.
[2023-03-22 20:34:16] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 1 ms to minimize.
[2023-03-22 20:34:16] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 1 ms to minimize.
[2023-03-22 20:34:16] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 1 ms to minimize.
[2023-03-22 20:34:16] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 0 ms to minimize.
[2023-03-22 20:34:17] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 1 ms to minimize.
[2023-03-22 20:34:17] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 19 ms to minimize.
[2023-03-22 20:34:17] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 1 ms to minimize.
[2023-03-22 20:34:17] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2023-03-22 20:34:18] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 1 ms to minimize.
[2023-03-22 20:34:18] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 0 ms to minimize.
[2023-03-22 20:34:18] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 0 ms to minimize.
[2023-03-22 20:34:18] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 4 ms to minimize.
[2023-03-22 20:34:19] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 0 ms to minimize.
[2023-03-22 20:34:19] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 16161 ms
[2023-03-22 20:34:19] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2023-03-22 20:34:19] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 0 ms to minimize.
[2023-03-22 20:34:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-22 20:34:20] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 1 ms to minimize.
[2023-03-22 20:34:20] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2023-03-22 20:34:20] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 1 ms to minimize.
[2023-03-22 20:34:21] [INFO ] Deduced a trap composed of 34 places in 323 ms of which 1 ms to minimize.
[2023-03-22 20:34:21] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2023-03-22 20:34:22] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 1 ms to minimize.
[2023-03-22 20:34:22] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 1 ms to minimize.
[2023-03-22 20:34:22] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 2 ms to minimize.
[2023-03-22 20:34:23] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 0 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.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-22 20:34:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 20:34:23] [INFO ] After 25270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 2 properties in 904 ms.
Support contains 47 out of 1860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1860/1860 places, 1710/1710 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 1860 transition count 1511
Reduce places removed 199 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 201 rules applied. Total rules applied 400 place count 1661 transition count 1509
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 402 place count 1659 transition count 1509
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 402 place count 1659 transition count 1359
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 702 place count 1509 transition count 1359
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 723 place count 1488 transition count 1338
Iterating global reduction 3 with 21 rules applied. Total rules applied 744 place count 1488 transition count 1338
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 744 place count 1488 transition count 1327
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 766 place count 1477 transition count 1327
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 3 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 1786 place count 967 transition count 817
Partial Free-agglomeration rule applied 247 times.
Drop transitions removed 247 transitions
Iterating global reduction 3 with 247 rules applied. Total rules applied 2033 place count 967 transition count 817
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2034 place count 966 transition count 816
Applied a total of 2034 rules in 650 ms. Remains 966 /1860 variables (removed 894) and now considering 816/1710 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 966/1860 places, 816/1710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 816 rows 966 cols
[2023-03-22 20:34:25] [INFO ] Computed 331 place invariants in 35 ms
[2023-03-22 20:34:25] [INFO ] [Real]Absence check using 316 positive place invariants in 50 ms returned sat
[2023-03-22 20:34:25] [INFO ] [Real]Absence check using 316 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 20:34:25] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 20:34:26] [INFO ] [Nat]Absence check using 316 positive place invariants in 91 ms returned sat
[2023-03-22 20:34:26] [INFO ] [Nat]Absence check using 316 positive and 15 generalized place invariants in 29 ms returned sat
[2023-03-22 20:34:26] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 20:34:26] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-22 20:34:27] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:34:28] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-22 20:34:28] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2023-03-22 20:34:28] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-22 20:34:28] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 13 ms to minimize.
[2023-03-22 20:34:28] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2023-03-22 20:34:28] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:34:29] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2023-03-22 20:34:29] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:34:29] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 20 ms to minimize.
[2023-03-22 20:34:29] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 13 ms to minimize.
[2023-03-22 20:34:29] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-22 20:34:30] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-03-22 20:34:31] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:34:31] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-22 20:34:31] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-22 20:34:31] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-22 20:34:31] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-22 20:34:31] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-22 20:34:32] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-22 20:34:32] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-22 20:34:32] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:34:32] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2023-03-22 20:34:32] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-22 20:34:32] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-22 20:34:33] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-22 20:34:33] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-22 20:34:33] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-22 20:34:33] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2023-03-22 20:34:33] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-22 20:34:33] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 7842 ms
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 7 ms to minimize.
[2023-03-22 20:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2023-03-22 20:34:34] [INFO ] After 8802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-22 20:34:35] [INFO ] After 9251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 9 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 816/816 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 966 transition count 813
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 963 transition count 813
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 963 transition count 808
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 958 transition count 808
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 52 place count 940 transition count 790
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 940 transition count 790
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 937 transition count 787
Applied a total of 65 rules in 143 ms. Remains 937 /966 variables (removed 29) and now considering 787/816 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 937/966 places, 787/816 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 787 rows 937 cols
[2023-03-22 20:34:35] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-22 20:34:35] [INFO ] [Real]Absence check using 307 positive place invariants in 65 ms returned sat
[2023-03-22 20:34:35] [INFO ] [Real]Absence check using 307 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-22 20:34:36] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:34:36] [INFO ] [Nat]Absence check using 307 positive place invariants in 76 ms returned sat
[2023-03-22 20:34:36] [INFO ] [Nat]Absence check using 307 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-22 20:34:37] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:34:37] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-22 20:34:37] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2023-03-22 20:34:37] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:34:37] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:34:37] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-22 20:34:38] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-22 20:34:39] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:34:40] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2942 ms
[2023-03-22 20:34:40] [INFO ] After 3470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-22 20:34:40] [INFO ] After 3823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 937/937 places, 787/787 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 937 transition count 786
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 936 transition count 786
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 2 with 4 rules applied. Total rules applied 6 place count 934 transition count 784
Applied a total of 6 rules in 68 ms. Remains 934 /937 variables (removed 3) and now considering 784/787 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 934/937 places, 784/787 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 213794 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213794 steps, saw 185701 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 784 rows 934 cols
[2023-03-22 20:34:43] [INFO ] Computed 331 place invariants in 9 ms
[2023-03-22 20:34:43] [INFO ] [Real]Absence check using 315 positive place invariants in 168 ms returned sat
[2023-03-22 20:34:43] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-22 20:34:44] [INFO ] After 816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:34:44] [INFO ] [Nat]Absence check using 315 positive place invariants in 87 ms returned sat
[2023-03-22 20:34:44] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 17 ms returned sat
[2023-03-22 20:34:44] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:34:44] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-22 20:34:44] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-22 20:34:45] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:34:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2111 ms
[2023-03-22 20:34:46] [INFO ] After 2463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-22 20:34:46] [INFO ] After 2745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 26 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 934/934 places, 784/784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 39 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-22 20:34:46] [INFO ] Invariant cache hit.
[2023-03-22 20:34:47] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-22 20:34:47] [INFO ] Invariant cache hit.
[2023-03-22 20:34:49] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2023-03-22 20:34:49] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 20:34:49] [INFO ] Invariant cache hit.
[2023-03-22 20:34:49] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2886 ms. Remains : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 21 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 20:34:49] [INFO ] Invariant cache hit.
[2023-03-22 20:34:50] [INFO ] [Real]Absence check using 315 positive place invariants in 45 ms returned sat
[2023-03-22 20:34:50] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-22 20:34:50] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:34:50] [INFO ] [Nat]Absence check using 315 positive place invariants in 101 ms returned sat
[2023-03-22 20:34:50] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-22 20:34:51] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:34:51] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-22 20:34:52] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-22 20:34:53] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-22 20:34:53] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2023-03-22 20:34:53] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2023-03-22 20:34:53] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:34:53] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:34:53] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2023-03-22 20:34:54] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-22 20:34:54] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 0 ms to minimize.
[2023-03-22 20:34:54] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2023-03-22 20:34:55] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4282 ms
[2023-03-22 20:34:55] [INFO ] After 4990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-22 20:34:56] [INFO ] After 5340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-22 20:34:56] [INFO ] Flatten gal took : 74 ms
[2023-03-22 20:34:56] [INFO ] Flatten gal took : 56 ms
[2023-03-22 20:34:56] [INFO ] Input system was already deterministic with 1710 transitions.
Computed a total of 373 stabilizing places and 373 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 1859 transition count 1500
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1650 transition count 1500
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 418 place count 1650 transition count 1350
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 718 place count 1500 transition count 1350
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 744 place count 1474 transition count 1324
Iterating global reduction 2 with 26 rules applied. Total rules applied 770 place count 1474 transition count 1324
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 770 place count 1474 transition count 1312
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 794 place count 1462 transition count 1312
Performed 525 Post agglomeration using F-continuation condition.Transition count delta: 525
Deduced a syphon composed of 525 places in 1 ms
Reduce places removed 525 places and 0 transitions.
Iterating global reduction 2 with 1050 rules applied. Total rules applied 1844 place count 937 transition count 787
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 1846 place count 935 transition count 785
Applied a total of 1846 rules in 272 ms. Remains 935 /1860 variables (removed 925) and now considering 785/1710 (removed 925) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 273 ms. Remains : 935/1860 places, 785/1710 transitions.
[2023-03-22 20:34:56] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:34:56] [INFO ] Flatten gal took : 40 ms
[2023-03-22 20:34:56] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1835 transition count 1685
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1835 transition count 1685
Applied a total of 50 rules in 123 ms. Remains 1835 /1860 variables (removed 25) and now considering 1685/1710 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 1835/1860 places, 1685/1710 transitions.
[2023-03-22 20:34:56] [INFO ] Flatten gal took : 55 ms
[2023-03-22 20:34:56] [INFO ] Flatten gal took : 45 ms
[2023-03-22 20:34:57] [INFO ] Input system was already deterministic with 1685 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1859 transition count 1499
Reduce places removed 210 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 421 place count 1649 transition count 1498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 1648 transition count 1498
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 422 place count 1648 transition count 1348
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 722 place count 1498 transition count 1348
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 750 place count 1470 transition count 1320
Iterating global reduction 3 with 28 rules applied. Total rules applied 778 place count 1470 transition count 1320
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 778 place count 1470 transition count 1308
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 802 place count 1458 transition count 1308
Performed 526 Post agglomeration using F-continuation condition.Transition count delta: 526
Deduced a syphon composed of 526 places in 0 ms
Reduce places removed 526 places and 0 transitions.
Iterating global reduction 3 with 1052 rules applied. Total rules applied 1854 place count 932 transition count 782
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 1856 place count 930 transition count 780
Applied a total of 1856 rules in 220 ms. Remains 930 /1860 variables (removed 930) and now considering 780/1710 (removed 930) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 221 ms. Remains : 930/1860 places, 780/1710 transitions.
[2023-03-22 20:34:57] [INFO ] Flatten gal took : 23 ms
[2023-03-22 20:34:57] [INFO ] Flatten gal took : 24 ms
[2023-03-22 20:34:57] [INFO ] Input system was already deterministic with 780 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1832 transition count 1682
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1832 transition count 1682
Applied a total of 56 rules in 136 ms. Remains 1832 /1860 variables (removed 28) and now considering 1682/1710 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 1832/1860 places, 1682/1710 transitions.
[2023-03-22 20:34:57] [INFO ] Flatten gal took : 74 ms
[2023-03-22 20:34:57] [INFO ] Flatten gal took : 51 ms
[2023-03-22 20:34:57] [INFO ] Input system was already deterministic with 1682 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1835 transition count 1685
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1835 transition count 1685
Applied a total of 50 rules in 116 ms. Remains 1835 /1860 variables (removed 25) and now considering 1685/1710 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 1835/1860 places, 1685/1710 transitions.
[2023-03-22 20:34:57] [INFO ] Flatten gal took : 40 ms
[2023-03-22 20:34:58] [INFO ] Flatten gal took : 40 ms
[2023-03-22 20:34:58] [INFO ] Input system was already deterministic with 1685 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1836 transition count 1686
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1836 transition count 1686
Applied a total of 48 rules in 111 ms. Remains 1836 /1860 variables (removed 24) and now considering 1686/1710 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 1836/1860 places, 1686/1710 transitions.
[2023-03-22 20:34:58] [INFO ] Flatten gal took : 38 ms
[2023-03-22 20:34:58] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:34:58] [INFO ] Input system was already deterministic with 1686 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1842 transition count 1692
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1842 transition count 1692
Applied a total of 36 rules in 110 ms. Remains 1842 /1860 variables (removed 18) and now considering 1692/1710 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 1842/1860 places, 1692/1710 transitions.
[2023-03-22 20:34:58] [INFO ] Flatten gal took : 45 ms
[2023-03-22 20:34:58] [INFO ] Flatten gal took : 39 ms
[2023-03-22 20:34:58] [INFO ] Input system was already deterministic with 1692 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1859 transition count 1501
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1651 transition count 1501
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 416 place count 1651 transition count 1351
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 716 place count 1501 transition count 1351
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 744 place count 1473 transition count 1323
Iterating global reduction 2 with 28 rules applied. Total rules applied 772 place count 1473 transition count 1323
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 772 place count 1473 transition count 1311
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 796 place count 1461 transition count 1311
Performed 522 Post agglomeration using F-continuation condition.Transition count delta: 522
Deduced a syphon composed of 522 places in 1 ms
Reduce places removed 522 places and 0 transitions.
Iterating global reduction 2 with 1044 rules applied. Total rules applied 1840 place count 939 transition count 789
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 1842 place count 937 transition count 787
Applied a total of 1842 rules in 288 ms. Remains 937 /1860 variables (removed 923) and now considering 787/1710 (removed 923) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 301 ms. Remains : 937/1860 places, 787/1710 transitions.
[2023-03-22 20:34:59] [INFO ] Flatten gal took : 35 ms
[2023-03-22 20:34:59] [INFO ] Flatten gal took : 21 ms
[2023-03-22 20:34:59] [INFO ] Input system was already deterministic with 787 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1859 transition count 1501
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1651 transition count 1501
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 416 place count 1651 transition count 1352
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 714 place count 1502 transition count 1352
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 742 place count 1474 transition count 1324
Iterating global reduction 2 with 28 rules applied. Total rules applied 770 place count 1474 transition count 1324
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 770 place count 1474 transition count 1312
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 794 place count 1462 transition count 1312
Performed 523 Post agglomeration using F-continuation condition.Transition count delta: 523
Deduced a syphon composed of 523 places in 1 ms
Reduce places removed 523 places and 0 transitions.
Iterating global reduction 2 with 1046 rules applied. Total rules applied 1840 place count 939 transition count 789
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 1842 place count 937 transition count 787
Applied a total of 1842 rules in 204 ms. Remains 937 /1860 variables (removed 923) and now considering 787/1710 (removed 923) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 217 ms. Remains : 937/1860 places, 787/1710 transitions.
[2023-03-22 20:34:59] [INFO ] Flatten gal took : 20 ms
[2023-03-22 20:34:59] [INFO ] Flatten gal took : 21 ms
[2023-03-22 20:34:59] [INFO ] Input system was already deterministic with 787 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1832 transition count 1682
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1832 transition count 1682
Applied a total of 56 rules in 133 ms. Remains 1832 /1860 variables (removed 28) and now considering 1682/1710 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 1832/1860 places, 1682/1710 transitions.
[2023-03-22 20:34:59] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:34:59] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:34:59] [INFO ] Input system was already deterministic with 1682 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1833 transition count 1683
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1833 transition count 1683
Applied a total of 54 rules in 138 ms. Remains 1833 /1860 variables (removed 27) and now considering 1683/1710 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 1833/1860 places, 1683/1710 transitions.
[2023-03-22 20:35:00] [INFO ] Flatten gal took : 53 ms
[2023-03-22 20:35:00] [INFO ] Flatten gal took : 56 ms
[2023-03-22 20:35:00] [INFO ] Input system was already deterministic with 1683 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1832 transition count 1682
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1832 transition count 1682
Applied a total of 56 rules in 113 ms. Remains 1832 /1860 variables (removed 28) and now considering 1682/1710 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 1832/1860 places, 1682/1710 transitions.
[2023-03-22 20:35:00] [INFO ] Flatten gal took : 91 ms
[2023-03-22 20:35:00] [INFO ] Flatten gal took : 44 ms
[2023-03-22 20:35:00] [INFO ] Input system was already deterministic with 1682 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1859 transition count 1501
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1651 transition count 1501
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 416 place count 1651 transition count 1350
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 718 place count 1500 transition count 1350
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 746 place count 1472 transition count 1322
Iterating global reduction 2 with 28 rules applied. Total rules applied 774 place count 1472 transition count 1322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 774 place count 1472 transition count 1310
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 798 place count 1460 transition count 1310
Performed 519 Post agglomeration using F-continuation condition.Transition count delta: 519
Deduced a syphon composed of 519 places in 2 ms
Reduce places removed 519 places and 0 transitions.
Iterating global reduction 2 with 1038 rules applied. Total rules applied 1836 place count 941 transition count 791
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 1838 place count 939 transition count 789
Applied a total of 1838 rules in 303 ms. Remains 939 /1860 variables (removed 921) and now considering 789/1710 (removed 921) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 304 ms. Remains : 939/1860 places, 789/1710 transitions.
[2023-03-22 20:35:00] [INFO ] Flatten gal took : 21 ms
[2023-03-22 20:35:00] [INFO ] Flatten gal took : 23 ms
[2023-03-22 20:35:01] [INFO ] Input system was already deterministic with 789 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1833 transition count 1683
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1833 transition count 1683
Applied a total of 54 rules in 103 ms. Remains 1833 /1860 variables (removed 27) and now considering 1683/1710 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1833/1860 places, 1683/1710 transitions.
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 65 ms
[2023-03-22 20:35:01] [INFO ] Input system was already deterministic with 1683 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1832 transition count 1682
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1832 transition count 1682
Applied a total of 56 rules in 110 ms. Remains 1832 /1860 variables (removed 28) and now considering 1682/1710 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 1832/1860 places, 1682/1710 transitions.
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 35 ms
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:35:01] [INFO ] Input system was already deterministic with 1682 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1860/1860 places, 1710/1710 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1837 transition count 1687
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1837 transition count 1687
Applied a total of 46 rules in 149 ms. Remains 1837 /1860 variables (removed 23) and now considering 1687/1710 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 1837/1860 places, 1687/1710 transitions.
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 48 ms
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:35:01] [INFO ] Input system was already deterministic with 1687 transitions.
[2023-03-22 20:35:01] [INFO ] Flatten gal took : 50 ms
[2023-03-22 20:35:02] [INFO ] Flatten gal took : 50 ms
[2023-03-22 20:35:02] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 20:35:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1860 places, 1710 transitions and 4860 arcs took 7 ms.
Total runtime 73299 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: 1860 NrTr: 1710 NrArc: 4860)

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

net check time: 0m 0.000sec

init dd package: 0m 2.889sec


before gc: list nodes free: 1352062

after gc: idd nodes used:44050596, unused:19949404; list nodes free:88026389

RS generation: 21m 4.627sec


-> last computed set: #nodes 44048738 (4.4e+07) #states 24,739,006,899,037 (13)


CANNOT_COMPUTE


BK_STOP 1679518594771

--------------------
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.009sec

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B 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 ;