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-167905978800329.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 ShieldRVt-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 614K 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 ShieldRVt-PT-050B-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679349776575

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:02:58] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-20 22:02:58] [INFO ] Transformed 2503 places.
[2023-03-20 22:02:58] [INFO ] Transformed 2503 transitions.
[2023-03-20 22:02:58] [INFO ] Found NUPN structural information;
[2023-03-20 22:02:58] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 94 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 521 places :
Symmetric choice reduction at 0 with 521 rule applications. Total rules 521 place count 1982 transition count 1982
Iterating global reduction 0 with 521 rules applied. Total rules applied 1042 place count 1982 transition count 1982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1043 place count 1981 transition count 1981
Iterating global reduction 0 with 1 rules applied. Total rules applied 1044 place count 1981 transition count 1981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1045 place count 1980 transition count 1980
Iterating global reduction 0 with 1 rules applied. Total rules applied 1046 place count 1980 transition count 1980
Applied a total of 1046 rules in 921 ms. Remains 1980 /2503 variables (removed 523) and now considering 1980/2503 (removed 523) transitions.
// Phase 1: matrix 1980 rows 1980 cols
[2023-03-20 22:02:59] [INFO ] Computed 201 place invariants in 53 ms
[2023-03-20 22:03:00] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-20 22:03:00] [INFO ] Invariant cache hit.
[2023-03-20 22:03:01] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2581 ms to find 0 implicit places.
[2023-03-20 22:03:01] [INFO ] Invariant cache hit.
[2023-03-20 22:03:03] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1980/2503 places, 1980/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4659 ms. Remains : 1980/2503 places, 1980/2503 transitions.
Support contains 94 out of 1980 places after structural reductions.
[2023-03-20 22:03:03] [INFO ] Flatten gal took : 127 ms
[2023-03-20 22:03:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldRVt-PT-050B-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:03:03] [INFO ] Flatten gal took : 67 ms
[2023-03-20 22:03:03] [INFO ] Input system was already deterministic with 1980 transitions.
Support contains 72 out of 1980 places (down from 94) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 41) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
[2023-03-20 22:03:04] [INFO ] Invariant cache hit.
[2023-03-20 22:03:05] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-20 22:03:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 72 ms returned sat
[2023-03-20 22:03:10] [INFO ] After 3905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-20 22:03:10] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 7 ms to minimize.
[2023-03-20 22:03:11] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 1 ms to minimize.
[2023-03-20 22:03:11] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 2 ms to minimize.
[2023-03-20 22:03:12] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 2 ms to minimize.
[2023-03-20 22:03:12] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 2 ms to minimize.
[2023-03-20 22:03:13] [INFO ] Deduced a trap composed of 58 places in 361 ms of which 1 ms to minimize.
[2023-03-20 22:03:13] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 2 ms to minimize.
[2023-03-20 22:03:14] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 1 ms to minimize.
[2023-03-20 22:03:14] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 1 ms to minimize.
[2023-03-20 22:03:14] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 1 ms to minimize.
[2023-03-20 22:03:15] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 1 ms to minimize.
[2023-03-20 22:03:15] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 1 ms to minimize.
[2023-03-20 22:03:15] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 1 ms to minimize.
[2023-03-20 22:03:16] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 1 ms to minimize.
[2023-03-20 22:03:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6146 ms
[2023-03-20 22:03:17] [INFO ] Deduced a trap composed of 20 places in 521 ms of which 1 ms to minimize.
[2023-03-20 22:03:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 702 ms
[2023-03-20 22:03:18] [INFO ] Deduced a trap composed of 37 places in 636 ms of which 2 ms to minimize.
[2023-03-20 22:03:18] [INFO ] Deduced a trap composed of 36 places in 651 ms of which 1 ms to minimize.
[2023-03-20 22:03:19] [INFO ] Deduced a trap composed of 42 places in 640 ms of which 2 ms to minimize.
[2023-03-20 22:03:20] [INFO ] Deduced a trap composed of 38 places in 596 ms of which 1 ms to minimize.
[2023-03-20 22:03:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2980 ms
[2023-03-20 22:03:21] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 0 ms to minimize.
[2023-03-20 22:03:21] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 1 ms to minimize.
[2023-03-20 22:03:21] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 1 ms to minimize.
[2023-03-20 22:03:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1206 ms
[2023-03-20 22:03:22] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 1 ms to minimize.
[2023-03-20 22:03:22] [INFO ] Deduced a trap composed of 63 places in 298 ms of which 1 ms to minimize.
[2023-03-20 22:03:23] [INFO ] Deduced a trap composed of 84 places in 402 ms of which 1 ms to minimize.
[2023-03-20 22:03:23] [INFO ] Deduced a trap composed of 61 places in 298 ms of which 1 ms to minimize.
[2023-03-20 22:03:24] [INFO ] Deduced a trap composed of 65 places in 322 ms of which 1 ms to minimize.
[2023-03-20 22:03:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2208 ms
[2023-03-20 22:03:24] [INFO ] Deduced a trap composed of 55 places in 447 ms of which 2 ms to minimize.
[2023-03-20 22:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 641 ms
[2023-03-20 22:03:25] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 1 ms to minimize.
[2023-03-20 22:03:25] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 1 ms to minimize.
[2023-03-20 22:03:26] [INFO ] Deduced a trap composed of 69 places in 275 ms of which 1 ms to minimize.
[2023-03-20 22:03:26] [INFO ] Deduced a trap composed of 72 places in 317 ms of which 1 ms to minimize.
[2023-03-20 22:03:27] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 1 ms to minimize.
[2023-03-20 22:03:27] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 0 ms to minimize.
[2023-03-20 22:03:27] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 1 ms to minimize.
[2023-03-20 22:03:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2768 ms
[2023-03-20 22:03:28] [INFO ] Deduced a trap composed of 40 places in 601 ms of which 2 ms to minimize.
[2023-03-20 22:03:29] [INFO ] Deduced a trap composed of 37 places in 575 ms of which 2 ms to minimize.
[2023-03-20 22:03:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1423 ms
[2023-03-20 22:03:30] [INFO ] Deduced a trap composed of 72 places in 441 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.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 22:03:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 22:03:30] [INFO ] After 25149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Parikh walk visited 0 properties in 1862 ms.
Support contains 44 out of 1980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Drop transitions removed 515 transitions
Trivial Post-agglo rules discarded 515 transitions
Performed 515 trivial Post agglomeration. Transition count delta: 515
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 1980 transition count 1465
Reduce places removed 515 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 525 rules applied. Total rules applied 1040 place count 1465 transition count 1455
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1050 place count 1455 transition count 1455
Performed 379 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 379 Pre rules applied. Total rules applied 1050 place count 1455 transition count 1076
Deduced a syphon composed of 379 places in 2 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1808 place count 1076 transition count 1076
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1821 place count 1063 transition count 1063
Iterating global reduction 3 with 13 rules applied. Total rules applied 1834 place count 1063 transition count 1063
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1834 place count 1063 transition count 1052
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1856 place count 1052 transition count 1052
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2750 place count 605 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2751 place count 605 transition count 604
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2753 place count 604 transition count 603
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2955 place count 503 transition count 688
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 3019 place count 471 transition count 715
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3020 place count 471 transition count 714
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3024 place count 471 transition count 710
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3028 place count 467 transition count 710
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3029 place count 467 transition count 709
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3030 place count 466 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3031 place count 465 transition count 708
Applied a total of 3031 rules in 478 ms. Remains 465 /1980 variables (removed 1515) and now considering 708/1980 (removed 1272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 465/1980 places, 708/1980 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 708 rows 465 cols
[2023-03-20 22:03:33] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-20 22:03:33] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 22:03:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-20 22:03:33] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 22:03:33] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-20 22:03:34] [INFO ] After 827ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-20 22:03:34] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-20 22:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-20 22:03:35] [INFO ] After 1698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 590 ms.
[2023-03-20 22:03:36] [INFO ] After 2909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 5 properties in 643 ms.
Support contains 13 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 708/708 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 465 transition count 700
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 457 transition count 700
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 457 transition count 690
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 447 transition count 690
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 431 transition count 674
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 424 transition count 684
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 424 transition count 683
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 421 transition count 680
Applied a total of 86 rules in 102 ms. Remains 421 /465 variables (removed 44) and now considering 680/708 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 421/465 places, 680/708 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 121592 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121592 steps, saw 78619 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 680 rows 421 cols
[2023-03-20 22:03:40] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-20 22:03:40] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 22:03:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 20 ms returned sat
[2023-03-20 22:03:41] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 22:03:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 22:03:41] [INFO ] After 167ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 22:03:41] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-20 22:03:42] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 1 properties in 554 ms.
Support contains 11 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 680/680 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 421 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 420 transition count 679
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 419 transition count 678
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 418 transition count 677
Applied a total of 5 rules in 31 ms. Remains 418 /421 variables (removed 3) and now considering 677/680 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 418/421 places, 677/680 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 137733 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137733 steps, saw 88049 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 677 rows 418 cols
[2023-03-20 22:03:46] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-20 22:03:46] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 22:03:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 20 ms returned sat
[2023-03-20 22:03:47] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 22:03:47] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-20 22:03:47] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 443 ms.
Support contains 11 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 677/677 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 418/418 places, 677/677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 677/677 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2023-03-20 22:03:47] [INFO ] Invariant cache hit.
[2023-03-20 22:03:48] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-20 22:03:48] [INFO ] Invariant cache hit.
[2023-03-20 22:03:48] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2023-03-20 22:03:48] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-20 22:03:48] [INFO ] Invariant cache hit.
[2023-03-20 22:03:48] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 418/418 places, 677/677 transitions.
Graph (trivial) has 181 edges and 418 vertex of which 4 / 418 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1411 edges and 416 vertex of which 414 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 178 edges and 412 vertex of which 4 / 412 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 410 transition count 668
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 177 edges and 408 vertex of which 6 / 408 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 405 transition count 659
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 175 edges and 402 vertex of which 8 / 402 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 398 transition count 648
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 394 vertex of which 8 / 394 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 390 transition count 634
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 382 transition count 620
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 374 transition count 606
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 366 transition count 592
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 358 transition count 578
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 350 transition count 564
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 342 transition count 550
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 334 transition count 536
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 326 transition count 522
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 322 vertex of which 6 / 322 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 319 transition count 508
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 131 edges and 316 vertex of which 4 / 316 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 239 place count 314 transition count 498
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 128 edges and 312 vertex of which 2 / 312 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 248 place count 311 transition count 492
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 253 place count 310 transition count 488
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 253 place count 310 transition count 487
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 256 place count 308 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 259 place count 306 transition count 486
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 125 edges and 306 vertex of which 2 / 306 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 263 place count 305 transition count 483
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 127 edges and 304 vertex of which 6 / 304 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 267 place count 301 transition count 481
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t341.t339.t355.t570.t353 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 123 edges and 296 vertex of which 6 / 296 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 14 rules applied. Total rules applied 281 place count 293 transition count 467
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 121 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 296 place count 286 transition count 456
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 117 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 315 place count 278 transition count 442
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 113 edges and 274 vertex of which 6 / 274 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 17 rules applied. Total rules applied 332 place count 271 transition count 430
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 110 edges and 268 vertex of which 6 / 268 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 22 with 17 rules applied. Total rules applied 349 place count 265 transition count 417
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 107 edges and 261 vertex of which 4 / 261 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 14 rules applied. Total rules applied 363 place count 259 transition count 408
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 106 edges and 257 vertex of which 6 / 257 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 24 with 12 rules applied. Total rules applied 375 place count 254 transition count 399
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 104 edges and 251 vertex of which 4 / 251 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 13 rules applied. Total rules applied 388 place count 249 transition count 390
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 103 edges and 247 vertex of which 6 / 247 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 26 with 12 rules applied. Total rules applied 400 place count 244 transition count 381
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 101 edges and 241 vertex of which 6 / 241 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 27 with 15 rules applied. Total rules applied 415 place count 238 transition count 370
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 99 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 15 rules applied. Total rules applied 430 place count 231 transition count 359
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 95 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 20 rules applied. Total rules applied 450 place count 223 transition count 344
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 469 place count 215 transition count 330
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 488 place count 207 transition count 316
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 507 place count 199 transition count 302
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 526 place count 191 transition count 288
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 187 vertex of which 6 / 187 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 545 place count 184 transition count 274
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 71 edges and 181 vertex of which 4 / 181 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 35 with 14 rules applied. Total rules applied 559 place count 179 transition count 264
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 68 edges and 177 vertex of which 2 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 36 with 9 rules applied. Total rules applied 568 place count 176 transition count 258
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 5 rules applied. Total rules applied 573 place count 175 transition count 254
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 38 with 5 Pre rules applied. Total rules applied 573 place count 175 transition count 249
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 38 with 15 rules applied. Total rules applied 588 place count 165 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 65 edges and 165 vertex of which 6 / 165 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 38 with 2 rules applied. Total rules applied 590 place count 162 transition count 248
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 511 edges and 161 vertex of which 159 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (trivial) has 60 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 39 with 10 rules applied. Total rules applied 600 place count 158 transition count 240
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 40 with 6 rules applied. Total rules applied 606 place count 157 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 608 place count 156 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 42 with 1 Pre rules applied. Total rules applied 608 place count 156 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 42 with 2 rules applied. Total rules applied 610 place count 155 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 42 with 3 rules applied. Total rules applied 613 place count 153 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 42 with 3 rules applied. Total rules applied 616 place count 153 transition count 229
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 43 with 6 rules applied. Total rules applied 622 place count 153 transition count 223
Applied a total of 622 rules in 135 ms. Remains 153 /418 variables (removed 265) and now considering 223/677 (removed 454) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 223 rows 153 cols
[2023-03-20 22:03:48] [INFO ] Computed 70 place invariants in 1 ms
[2023-03-20 22:03:48] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 22:03:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 6 ms returned sat
[2023-03-20 22:03:49] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 22:03:49] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 22:03:49] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-20 22:03:49] [INFO ] Flatten gal took : 55 ms
[2023-03-20 22:03:49] [INFO ] Flatten gal took : 54 ms
[2023-03-20 22:03:49] [INFO ] Input system was already deterministic with 1980 transitions.
Computed a total of 604 stabilizing places and 604 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1952 transition count 1952
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1952 transition count 1952
Applied a total of 56 rules in 148 ms. Remains 1952 /1980 variables (removed 28) and now considering 1952/1980 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 1952/1980 places, 1952/1980 transitions.
[2023-03-20 22:03:49] [INFO ] Flatten gal took : 38 ms
[2023-03-20 22:03:49] [INFO ] Flatten gal took : 38 ms
[2023-03-20 22:03:49] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1953 transition count 1953
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1953 transition count 1953
Applied a total of 54 rules in 146 ms. Remains 1953 /1980 variables (removed 27) and now considering 1953/1980 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 1953/1980 places, 1953/1980 transitions.
[2023-03-20 22:03:50] [INFO ] Flatten gal took : 37 ms
[2023-03-20 22:03:50] [INFO ] Flatten gal took : 35 ms
[2023-03-20 22:03:50] [INFO ] Input system was already deterministic with 1953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1979 transition count 1434
Reduce places removed 545 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 546 rules applied. Total rules applied 1091 place count 1434 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1092 place count 1433 transition count 1433
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 386 Pre rules applied. Total rules applied 1092 place count 1433 transition count 1047
Deduced a syphon composed of 386 places in 1 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 3 with 772 rules applied. Total rules applied 1864 place count 1047 transition count 1047
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1888 place count 1023 transition count 1023
Iterating global reduction 3 with 24 rules applied. Total rules applied 1912 place count 1023 transition count 1023
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1912 place count 1023 transition count 1003
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1952 place count 1003 transition count 1003
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 0 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 2746 place count 606 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2747 place count 606 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2749 place count 605 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2751 place count 603 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2752 place count 602 transition count 602
Applied a total of 2752 rules in 235 ms. Remains 602 /1980 variables (removed 1378) and now considering 602/1980 (removed 1378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 235 ms. Remains : 602/1980 places, 602/1980 transitions.
[2023-03-20 22:03:50] [INFO ] Flatten gal took : 14 ms
[2023-03-20 22:03:50] [INFO ] Flatten gal took : 15 ms
[2023-03-20 22:03:50] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1957 transition count 1957
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1957 transition count 1957
Applied a total of 46 rules in 147 ms. Remains 1957 /1980 variables (removed 23) and now considering 1957/1980 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 1957/1980 places, 1957/1980 transitions.
[2023-03-20 22:03:50] [INFO ] Flatten gal took : 43 ms
[2023-03-20 22:03:50] [INFO ] Flatten gal took : 35 ms
[2023-03-20 22:03:50] [INFO ] Input system was already deterministic with 1957 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1979 transition count 1434
Reduce places removed 545 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 546 rules applied. Total rules applied 1091 place count 1434 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1092 place count 1433 transition count 1433
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1092 place count 1433 transition count 1046
Deduced a syphon composed of 387 places in 1 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1866 place count 1046 transition count 1046
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1890 place count 1022 transition count 1022
Iterating global reduction 3 with 24 rules applied. Total rules applied 1914 place count 1022 transition count 1022
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1914 place count 1022 transition count 1002
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1954 place count 1002 transition count 1002
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 0 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2740 place count 609 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2741 place count 609 transition count 608
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2743 place count 608 transition count 607
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2745 place count 606 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2746 place count 605 transition count 605
Applied a total of 2746 rules in 213 ms. Remains 605 /1980 variables (removed 1375) and now considering 605/1980 (removed 1375) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 216 ms. Remains : 605/1980 places, 605/1980 transitions.
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 13 ms
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 14 ms
[2023-03-20 22:03:51] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 542 place count 1979 transition count 1437
Reduce places removed 542 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 544 rules applied. Total rules applied 1086 place count 1437 transition count 1435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1088 place count 1435 transition count 1435
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1088 place count 1435 transition count 1048
Deduced a syphon composed of 387 places in 1 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1862 place count 1048 transition count 1048
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1886 place count 1024 transition count 1024
Iterating global reduction 3 with 24 rules applied. Total rules applied 1910 place count 1024 transition count 1024
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1910 place count 1024 transition count 1004
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1950 place count 1004 transition count 1004
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2736 place count 611 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2737 place count 611 transition count 610
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2739 place count 610 transition count 609
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2741 place count 608 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2742 place count 607 transition count 607
Applied a total of 2742 rules in 200 ms. Remains 607 /1980 variables (removed 1373) and now considering 607/1980 (removed 1373) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 201 ms. Remains : 607/1980 places, 607/1980 transitions.
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 13 ms
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 13 ms
[2023-03-20 22:03:51] [INFO ] Input system was already deterministic with 607 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1954 transition count 1954
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1954 transition count 1954
Applied a total of 52 rules in 162 ms. Remains 1954 /1980 variables (removed 26) and now considering 1954/1980 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 1954/1980 places, 1954/1980 transitions.
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 32 ms
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 31 ms
[2023-03-20 22:03:51] [INFO ] Input system was already deterministic with 1954 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1979 transition count 1432
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1432 transition count 1432
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 387 Pre rules applied. Total rules applied 1094 place count 1432 transition count 1045
Deduced a syphon composed of 387 places in 2 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 2 with 774 rules applied. Total rules applied 1868 place count 1045 transition count 1045
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1891 place count 1022 transition count 1022
Iterating global reduction 2 with 23 rules applied. Total rules applied 1914 place count 1022 transition count 1022
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1914 place count 1022 transition count 1003
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1952 place count 1003 transition count 1003
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 1 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 2 with 794 rules applied. Total rules applied 2746 place count 606 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2747 place count 606 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2749 place count 605 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2751 place count 603 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2752 place count 602 transition count 602
Applied a total of 2752 rules in 271 ms. Remains 602 /1980 variables (removed 1378) and now considering 602/1980 (removed 1378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 272 ms. Remains : 602/1980 places, 602/1980 transitions.
[2023-03-20 22:03:51] [INFO ] Flatten gal took : 18 ms
[2023-03-20 22:03:52] [INFO ] Flatten gal took : 18 ms
[2023-03-20 22:03:52] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1954 transition count 1954
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1954 transition count 1954
Applied a total of 52 rules in 189 ms. Remains 1954 /1980 variables (removed 26) and now considering 1954/1980 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 1954/1980 places, 1954/1980 transitions.
[2023-03-20 22:03:52] [INFO ] Flatten gal took : 42 ms
[2023-03-20 22:03:52] [INFO ] Flatten gal took : 45 ms
[2023-03-20 22:03:52] [INFO ] Input system was already deterministic with 1954 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1951 transition count 1951
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1951 transition count 1951
Applied a total of 58 rules in 206 ms. Remains 1951 /1980 variables (removed 29) and now considering 1951/1980 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 1951/1980 places, 1951/1980 transitions.
[2023-03-20 22:03:52] [INFO ] Flatten gal took : 39 ms
[2023-03-20 22:03:52] [INFO ] Flatten gal took : 40 ms
[2023-03-20 22:03:52] [INFO ] Input system was already deterministic with 1951 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1979 transition count 1432
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1432 transition count 1432
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 386 Pre rules applied. Total rules applied 1094 place count 1432 transition count 1046
Deduced a syphon composed of 386 places in 2 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 2 with 772 rules applied. Total rules applied 1866 place count 1046 transition count 1046
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1889 place count 1023 transition count 1023
Iterating global reduction 2 with 23 rules applied. Total rules applied 1912 place count 1023 transition count 1023
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1912 place count 1023 transition count 1004
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1950 place count 1004 transition count 1004
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 2746 place count 606 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2747 place count 606 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2749 place count 605 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2751 place count 603 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2752 place count 602 transition count 602
Applied a total of 2752 rules in 223 ms. Remains 602 /1980 variables (removed 1378) and now considering 602/1980 (removed 1378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 223 ms. Remains : 602/1980 places, 602/1980 transitions.
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 15 ms
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 16 ms
[2023-03-20 22:03:53] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1953 transition count 1953
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1953 transition count 1953
Applied a total of 54 rules in 161 ms. Remains 1953 /1980 variables (removed 27) and now considering 1953/1980 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1953/1980 places, 1953/1980 transitions.
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 27 ms
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 28 ms
[2023-03-20 22:03:53] [INFO ] Input system was already deterministic with 1953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1952 transition count 1952
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1952 transition count 1952
Applied a total of 56 rules in 149 ms. Remains 1952 /1980 variables (removed 28) and now considering 1952/1980 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 1952/1980 places, 1952/1980 transitions.
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 27 ms
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 28 ms
[2023-03-20 22:03:53] [INFO ] Input system was already deterministic with 1952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1980/1980 places, 1980/1980 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1954 transition count 1954
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1954 transition count 1954
Applied a total of 52 rules in 152 ms. Remains 1954 /1980 variables (removed 26) and now considering 1954/1980 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 1954/1980 places, 1954/1980 transitions.
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 27 ms
[2023-03-20 22:03:53] [INFO ] Flatten gal took : 28 ms
[2023-03-20 22:03:54] [INFO ] Input system was already deterministic with 1954 transitions.
[2023-03-20 22:03:54] [INFO ] Flatten gal took : 29 ms
[2023-03-20 22:03:54] [INFO ] Flatten gal took : 30 ms
[2023-03-20 22:03:54] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2023-03-20 22:03:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1980 places, 1980 transitions and 4860 arcs took 18 ms.
Total runtime 56010 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1980 NrTr: 1980 NrArc: 4860)

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

net check time: 0m 0.001sec

init dd package: 0m 3.111sec


before gc: list nodes free: 37587

after gc: idd nodes used:44045205, unused:19954795; list nodes free:87002287

RS generation: 27m42.708sec


-> last computed set: #nodes 44043227 (4.4e+07) #states 38,009,927,549,760,851,124,470 (22)


CANNOT_COMPUTE


BK_STOP 1679351528582

--------------------
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 CTLCardinality -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="ShieldRVt-PT-050B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVt-PT-050B, examination is CTLCardinality"
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-167905978800329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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