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-167903717700314.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 ShieldIIPt-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 686K 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 ShieldIIPt-PT-040B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679503845143

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=ShieldIIPt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:50:48] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2023-03-22 16:50:48] [INFO ] Transformed 2803 places.
[2023-03-22 16:50:48] [INFO ] Transformed 2603 transitions.
[2023-03-22 16:50:48] [INFO ] Found NUPN structural information;
[2023-03-22 16:50:48] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 152 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 404 places :
Symmetric choice reduction at 0 with 404 rule applications. Total rules 404 place count 2399 transition count 2199
Iterating global reduction 0 with 404 rules applied. Total rules applied 808 place count 2399 transition count 2199
Applied a total of 808 rules in 588 ms. Remains 2399 /2803 variables (removed 404) and now considering 2199/2603 (removed 404) transitions.
// Phase 1: matrix 2199 rows 2399 cols
[2023-03-22 16:50:49] [INFO ] Computed 361 place invariants in 49 ms
[2023-03-22 16:50:52] [INFO ] Implicit Places using invariants in 2694 ms returned []
[2023-03-22 16:50:52] [INFO ] Invariant cache hit.
[2023-03-22 16:50:54] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 4915 ms to find 0 implicit places.
[2023-03-22 16:50:54] [INFO ] Invariant cache hit.
[2023-03-22 16:50:56] [INFO ] Dead Transitions using invariants and state equation in 2297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2399/2803 places, 2199/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7804 ms. Remains : 2399/2803 places, 2199/2603 transitions.
Support contains 152 out of 2399 places after structural reductions.
[2023-03-22 16:50:57] [INFO ] Flatten gal took : 178 ms
[2023-03-22 16:50:57] [INFO ] Flatten gal took : 82 ms
[2023-03-22 16:50:57] [INFO ] Input system was already deterministic with 2199 transitions.
Support contains 149 out of 2399 places (down from 152) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 88) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) 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 47) 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 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) seen :0
Running SMT prover for 47 properties.
[2023-03-22 16:50:58] [INFO ] Invariant cache hit.
[2023-03-22 16:51:01] [INFO ] [Real]Absence check using 361 positive place invariants in 195 ms returned sat
[2023-03-22 16:51:04] [INFO ] After 5772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:47
[2023-03-22 16:51:07] [INFO ] [Nat]Absence check using 361 positive place invariants in 301 ms returned sat
[2023-03-22 16:51:19] [INFO ] After 8498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :47
[2023-03-22 16:51:20] [INFO ] Deduced a trap composed of 24 places in 1385 ms of which 27 ms to minimize.
[2023-03-22 16:51:22] [INFO ] Deduced a trap composed of 17 places in 1865 ms of which 41 ms to minimize.
[2023-03-22 16:51:24] [INFO ] Deduced a trap composed of 22 places in 1497 ms of which 10 ms to minimize.
[2023-03-22 16:51:25] [INFO ] Deduced a trap composed of 19 places in 1154 ms of which 2 ms to minimize.
[2023-03-22 16:51:27] [INFO ] Deduced a trap composed of 21 places in 1478 ms of which 9 ms to minimize.
[2023-03-22 16:51:28] [INFO ] Deduced a trap composed of 18 places in 1081 ms of which 2 ms to minimize.
[2023-03-22 16:51:29] [INFO ] Deduced a trap composed of 20 places in 1019 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-22 16:51:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:51:29] [INFO ] After 25248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:47
Parikh walk visited 2 properties in 4978 ms.
Support contains 76 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 2399 transition count 1754
Reduce places removed 445 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 453 rules applied. Total rules applied 898 place count 1954 transition count 1746
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 906 place count 1946 transition count 1746
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 906 place count 1946 transition count 1460
Deduced a syphon composed of 286 places in 5 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 1478 place count 1660 transition count 1460
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1489 place count 1649 transition count 1449
Iterating global reduction 3 with 11 rules applied. Total rules applied 1500 place count 1649 transition count 1449
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1500 place count 1649 transition count 1441
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1516 place count 1641 transition count 1441
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 2 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 3 with 1354 rules applied. Total rules applied 2870 place count 964 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3072 place count 863 transition count 820
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3080 place count 859 transition count 823
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3081 place count 859 transition count 822
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3087 place count 859 transition count 816
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3093 place count 853 transition count 816
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 3129 place count 853 transition count 816
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3130 place count 852 transition count 815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3131 place count 851 transition count 815
Applied a total of 3131 rules in 813 ms. Remains 851 /2399 variables (removed 1548) and now considering 815/2199 (removed 1384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 813 ms. Remains : 851/2399 places, 815/2199 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 45) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 815 rows 851 cols
[2023-03-22 16:51:36] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-22 16:51:37] [INFO ] [Real]Absence check using 360 positive place invariants in 114 ms returned sat
[2023-03-22 16:51:37] [INFO ] After 1645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-22 16:51:38] [INFO ] [Nat]Absence check using 360 positive place invariants in 119 ms returned sat
[2023-03-22 16:51:42] [INFO ] After 2320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-22 16:51:42] [INFO ] State equation strengthened by 261 read => feed constraints.
[2023-03-22 16:51:44] [INFO ] After 2562ms SMT Verify possible using 261 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-03-22 16:51:44] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:51:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-22 16:51:47] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-22 16:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-22 16:51:48] [INFO ] After 6540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 2406 ms.
[2023-03-22 16:51:51] [INFO ] After 13232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 0 properties in 1581 ms.
Support contains 47 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 815/815 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 851 transition count 806
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 842 transition count 806
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 842 transition count 799
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 835 transition count 799
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 62 place count 820 transition count 784
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 2 with 2 rules applied. Total rules applied 64 place count 819 transition count 785
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 819 transition count 784
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 819 transition count 784
Applied a total of 68 rules in 342 ms. Remains 819 /851 variables (removed 32) and now considering 784/815 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 819/851 places, 784/815 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Interrupted probabilistic random walk after 64812 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64812 steps, saw 44699 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 784 rows 819 cols
[2023-03-22 16:51:56] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-22 16:51:57] [INFO ] [Real]Absence check using 360 positive place invariants in 122 ms returned sat
[2023-03-22 16:51:57] [INFO ] After 1080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-22 16:51:58] [INFO ] [Nat]Absence check using 360 positive place invariants in 97 ms returned sat
[2023-03-22 16:52:01] [INFO ] After 1762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-22 16:52:01] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-22 16:52:03] [INFO ] After 2047ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-03-22 16:52:05] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 40 ms to minimize.
[2023-03-22 16:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-22 16:52:06] [INFO ] After 5356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 1794 ms.
[2023-03-22 16:52:08] [INFO ] After 10608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 892 ms.
Support contains 43 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 784/784 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 819 transition count 782
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 817 transition count 782
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 13 place count 812 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 812 transition count 777
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 811 transition count 777
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 810 transition count 776
Applied a total of 16 rules in 56 ms. Remains 810 /819 variables (removed 9) and now considering 776/784 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 810/819 places, 776/784 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 776 rows 810 cols
[2023-03-22 16:52:10] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-22 16:52:11] [INFO ] [Real]Absence check using 359 positive place invariants in 107 ms returned sat
[2023-03-22 16:52:13] [INFO ] After 3524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-22 16:52:14] [INFO ] [Nat]Absence check using 359 positive place invariants in 142 ms returned sat
[2023-03-22 16:52:17] [INFO ] After 2178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-22 16:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:52:19] [INFO ] After 1501ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-22 16:52:21] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-22 16:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-22 16:52:22] [INFO ] After 4203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1379 ms.
[2023-03-22 16:52:23] [INFO ] After 9544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 663 ms.
Support contains 38 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 776/776 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 810 transition count 773
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 807 transition count 773
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 806 transition count 772
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 805 transition count 774
Applied a total of 10 rules in 43 ms. Remains 805 /810 variables (removed 5) and now considering 774/776 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 805/810 places, 774/776 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 74882 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74882 steps, saw 46483 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 774 rows 805 cols
[2023-03-22 16:52:27] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-22 16:52:28] [INFO ] [Real]Absence check using 359 positive place invariants in 90 ms returned sat
[2023-03-22 16:52:30] [INFO ] After 2696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-22 16:52:30] [INFO ] [Nat]Absence check using 359 positive place invariants in 86 ms returned sat
[2023-03-22 16:52:33] [INFO ] After 1811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-22 16:52:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:52:35] [INFO ] After 1454ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-22 16:52:37] [INFO ] After 3977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1590 ms.
[2023-03-22 16:52:39] [INFO ] After 8843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 689 ms.
Support contains 38 out of 805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 774/774 transitions.
Applied a total of 0 rules in 16 ms. Remains 805 /805 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 805/805 places, 774/774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 774/774 transitions.
Applied a total of 0 rules in 16 ms. Remains 805 /805 variables (removed 0) and now considering 774/774 (removed 0) transitions.
[2023-03-22 16:52:39] [INFO ] Invariant cache hit.
[2023-03-22 16:52:40] [INFO ] Implicit Places using invariants in 681 ms returned [794]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 690 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 804/805 places, 774/774 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 803 transition count 773
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 803 transition count 773
Applied a total of 2 rules in 33 ms. Remains 803 /804 variables (removed 1) and now considering 773/774 (removed 1) transitions.
// Phase 1: matrix 773 rows 803 cols
[2023-03-22 16:52:40] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-22 16:52:41] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2023-03-22 16:52:41] [INFO ] Invariant cache hit.
[2023-03-22 16:52:43] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 803/805 places, 773/774 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3612 ms. Remains : 803/805 places, 773/774 transitions.
[2023-03-22 16:52:43] [INFO ] Flatten gal took : 94 ms
[2023-03-22 16:52:43] [INFO ] Flatten gal took : 76 ms
[2023-03-22 16:52:43] [INFO ] Input system was already deterministic with 2199 transitions.
Computed a total of 647 stabilizing places and 647 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2362 transition count 2162
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2362 transition count 2162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2361 transition count 2161
Applied a total of 76 rules in 543 ms. Remains 2361 /2399 variables (removed 38) and now considering 2161/2199 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 2361/2399 places, 2161/2199 transitions.
[2023-03-22 16:52:44] [INFO ] Flatten gal took : 52 ms
[2023-03-22 16:52:44] [INFO ] Flatten gal took : 64 ms
[2023-03-22 16:52:44] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2362 transition count 2162
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2362 transition count 2162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2361 transition count 2161
Applied a total of 76 rules in 560 ms. Remains 2361 /2399 variables (removed 38) and now considering 2161/2199 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 2361/2399 places, 2161/2199 transitions.
[2023-03-22 16:52:45] [INFO ] Flatten gal took : 63 ms
[2023-03-22 16:52:45] [INFO ] Flatten gal took : 51 ms
[2023-03-22 16:52:45] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2363 transition count 2163
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2363 transition count 2163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2362 transition count 2162
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2362 transition count 2162
Applied a total of 74 rules in 410 ms. Remains 2362 /2399 variables (removed 37) and now considering 2162/2199 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 2362/2399 places, 2162/2199 transitions.
[2023-03-22 16:52:46] [INFO ] Flatten gal took : 62 ms
[2023-03-22 16:52:46] [INFO ] Flatten gal took : 51 ms
[2023-03-22 16:52:46] [INFO ] Input system was already deterministic with 2162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2362 transition count 2162
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2362 transition count 2162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2361 transition count 2161
Applied a total of 76 rules in 405 ms. Remains 2361 /2399 variables (removed 38) and now considering 2161/2199 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 2361/2399 places, 2161/2199 transitions.
[2023-03-22 16:52:46] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:52:46] [INFO ] Flatten gal took : 48 ms
[2023-03-22 16:52:46] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2362 transition count 2162
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2362 transition count 2162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2361 transition count 2161
Applied a total of 76 rules in 372 ms. Remains 2361 /2399 variables (removed 38) and now considering 2161/2199 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 2361/2399 places, 2161/2199 transitions.
[2023-03-22 16:52:47] [INFO ] Flatten gal took : 42 ms
[2023-03-22 16:52:47] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:52:47] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 481 place count 2398 transition count 1717
Reduce places removed 481 places and 0 transitions.
Iterating post reduction 1 with 481 rules applied. Total rules applied 962 place count 1917 transition count 1717
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 962 place count 1917 transition count 1417
Deduced a syphon composed of 300 places in 2 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1562 place count 1617 transition count 1417
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 1592 place count 1587 transition count 1387
Iterating global reduction 2 with 30 rules applied. Total rules applied 1622 place count 1587 transition count 1387
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 1622 place count 1587 transition count 1363
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 1670 place count 1563 transition count 1363
Performed 633 Post agglomeration using F-continuation condition.Transition count delta: 633
Deduced a syphon composed of 633 places in 1 ms
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 2 with 1266 rules applied. Total rules applied 2936 place count 930 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2937 place count 930 transition count 729
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 2939 place count 929 transition count 728
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2940 place count 929 transition count 728
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2942 place count 927 transition count 726
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2944 place count 925 transition count 726
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2944 place count 925 transition count 725
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 2946 place count 924 transition count 725
Applied a total of 2946 rules in 444 ms. Remains 924 /2399 variables (removed 1475) and now considering 725/2199 (removed 1474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 444 ms. Remains : 924/2399 places, 725/2199 transitions.
[2023-03-22 16:52:48] [INFO ] Flatten gal took : 18 ms
[2023-03-22 16:52:48] [INFO ] Flatten gal took : 20 ms
[2023-03-22 16:52:48] [INFO ] Input system was already deterministic with 725 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2367 transition count 2167
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2367 transition count 2167
Applied a total of 64 rules in 306 ms. Remains 2367 /2399 variables (removed 32) and now considering 2167/2199 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 2367/2399 places, 2167/2199 transitions.
[2023-03-22 16:52:48] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:52:48] [INFO ] Flatten gal took : 63 ms
[2023-03-22 16:52:48] [INFO ] Input system was already deterministic with 2167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2365 transition count 2165
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2365 transition count 2165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 2364 transition count 2164
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 2364 transition count 2164
Applied a total of 70 rules in 375 ms. Remains 2364 /2399 variables (removed 35) and now considering 2164/2199 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 2364/2399 places, 2164/2199 transitions.
[2023-03-22 16:52:49] [INFO ] Flatten gal took : 43 ms
[2023-03-22 16:52:49] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:52:49] [INFO ] Input system was already deterministic with 2164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2368 transition count 2168
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2368 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2367 transition count 2167
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2367 transition count 2167
Applied a total of 64 rules in 428 ms. Remains 2367 /2399 variables (removed 32) and now considering 2167/2199 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 2367/2399 places, 2167/2199 transitions.
[2023-03-22 16:52:49] [INFO ] Flatten gal took : 48 ms
[2023-03-22 16:52:49] [INFO ] Flatten gal took : 50 ms
[2023-03-22 16:52:49] [INFO ] Input system was already deterministic with 2167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2364 transition count 2164
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2364 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2363 transition count 2163
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2363 transition count 2163
Applied a total of 72 rules in 414 ms. Remains 2363 /2399 variables (removed 36) and now considering 2163/2199 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 2363/2399 places, 2163/2199 transitions.
[2023-03-22 16:52:50] [INFO ] Flatten gal took : 50 ms
[2023-03-22 16:52:50] [INFO ] Flatten gal took : 45 ms
[2023-03-22 16:52:50] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 482 place count 2398 transition count 1716
Reduce places removed 482 places and 0 transitions.
Iterating post reduction 1 with 482 rules applied. Total rules applied 964 place count 1916 transition count 1716
Performed 302 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 302 Pre rules applied. Total rules applied 964 place count 1916 transition count 1414
Deduced a syphon composed of 302 places in 2 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 2 with 604 rules applied. Total rules applied 1568 place count 1614 transition count 1414
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1596 place count 1586 transition count 1386
Iterating global reduction 2 with 28 rules applied. Total rules applied 1624 place count 1586 transition count 1386
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 1624 place count 1586 transition count 1364
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 1668 place count 1564 transition count 1364
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Deduced a syphon composed of 636 places in 0 ms
Reduce places removed 636 places and 0 transitions.
Iterating global reduction 2 with 1272 rules applied. Total rules applied 2940 place count 928 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2941 place count 928 transition count 727
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 2943 place count 927 transition count 726
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2945 place count 925 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2947 place count 923 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2947 place count 923 transition count 723
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 2949 place count 922 transition count 723
Applied a total of 2949 rules in 495 ms. Remains 922 /2399 variables (removed 1477) and now considering 723/2199 (removed 1476) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 495 ms. Remains : 922/2399 places, 723/2199 transitions.
[2023-03-22 16:52:51] [INFO ] Flatten gal took : 19 ms
[2023-03-22 16:52:51] [INFO ] Flatten gal took : 31 ms
[2023-03-22 16:52:51] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2367 transition count 2167
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2367 transition count 2167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 2366 transition count 2166
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 2366 transition count 2166
Applied a total of 66 rules in 414 ms. Remains 2366 /2399 variables (removed 33) and now considering 2166/2199 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 2366/2399 places, 2166/2199 transitions.
[2023-03-22 16:52:51] [INFO ] Flatten gal took : 58 ms
[2023-03-22 16:52:51] [INFO ] Flatten gal took : 62 ms
[2023-03-22 16:52:51] [INFO ] Input system was already deterministic with 2166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2364 transition count 2164
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2364 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2363 transition count 2163
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2363 transition count 2163
Applied a total of 72 rules in 421 ms. Remains 2363 /2399 variables (removed 36) and now considering 2163/2199 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 2363/2399 places, 2163/2199 transitions.
[2023-03-22 16:52:52] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:52:52] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:52:52] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2366 transition count 2166
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2366 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 2365 transition count 2165
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 2365 transition count 2165
Applied a total of 68 rules in 432 ms. Remains 2365 /2399 variables (removed 34) and now considering 2165/2199 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 2365/2399 places, 2165/2199 transitions.
[2023-03-22 16:52:53] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:52:53] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:52:53] [INFO ] Input system was already deterministic with 2165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2364 transition count 2164
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2364 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 2363 transition count 2163
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 2363 transition count 2163
Applied a total of 72 rules in 489 ms. Remains 2363 /2399 variables (removed 36) and now considering 2163/2199 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 2363/2399 places, 2163/2199 transitions.
[2023-03-22 16:52:53] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:52:53] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:52:53] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2399/2399 places, 2199/2199 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2369 transition count 2169
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2369 transition count 2169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2368 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2368 transition count 2168
Applied a total of 62 rules in 363 ms. Remains 2368 /2399 variables (removed 31) and now considering 2168/2199 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 2368/2399 places, 2168/2199 transitions.
[2023-03-22 16:52:54] [INFO ] Flatten gal took : 40 ms
[2023-03-22 16:52:54] [INFO ] Flatten gal took : 41 ms
[2023-03-22 16:52:54] [INFO ] Input system was already deterministic with 2168 transitions.
[2023-03-22 16:52:54] [INFO ] Flatten gal took : 57 ms
[2023-03-22 16:52:54] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:52:54] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 16:52:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2399 places, 2199 transitions and 5678 arcs took 9 ms.
Total runtime 126445 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: 2399 NrTr: 2199 NrArc: 5678)

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

net check time: 0m 0.001sec

init dd package: 0m 3.171sec


before gc: list nodes free: 127799

after gc: idd nodes used:52468630, unused:11531370; list nodes free:49619504

RS generation: 32m59.334sec


-> last computed set: #nodes 52466233 (5.2e+07) #states 13,572,676,881,108,018,851,075,789 (25)


CANNOT_COMPUTE


BK_STOP 1679505989926

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

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="ShieldIIPt-PT-040B"
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 ShieldIIPt-PT-040B, 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-167903717700314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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