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.r393-oct2-167903716900329.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 ltsminxred
Input is ShieldIIPt-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 860K 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-050B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-050B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679440109619

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:08:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 23:08:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:08:32] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-21 23:08:33] [INFO ] Transformed 3503 places.
[2023-03-21 23:08:33] [INFO ] Transformed 3253 transitions.
[2023-03-21 23:08:33] [INFO ] Found NUPN structural information;
[2023-03-21 23:08:33] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-050B-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 525 places :
Symmetric choice reduction at 0 with 525 rule applications. Total rules 525 place count 2978 transition count 2728
Iterating global reduction 0 with 525 rules applied. Total rules applied 1050 place count 2978 transition count 2728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1051 place count 2977 transition count 2727
Iterating global reduction 0 with 1 rules applied. Total rules applied 1052 place count 2977 transition count 2727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1053 place count 2976 transition count 2726
Iterating global reduction 0 with 1 rules applied. Total rules applied 1054 place count 2976 transition count 2726
Applied a total of 1054 rules in 1444 ms. Remains 2976 /3503 variables (removed 527) and now considering 2726/3253 (removed 527) transitions.
// Phase 1: matrix 2726 rows 2976 cols
[2023-03-21 23:08:34] [INFO ] Computed 451 place invariants in 84 ms
[2023-03-21 23:08:37] [INFO ] Implicit Places using invariants in 3077 ms returned []
[2023-03-21 23:08:37] [INFO ] Invariant cache hit.
[2023-03-21 23:08:42] [INFO ] Implicit Places using invariants and state equation in 5024 ms returned []
Implicit Place search using SMT with State Equation took 8175 ms to find 0 implicit places.
[2023-03-21 23:08:43] [INFO ] Invariant cache hit.
[2023-03-21 23:08:46] [INFO ] Dead Transitions using invariants and state equation in 3005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2976/3503 places, 2726/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12628 ms. Remains : 2976/3503 places, 2726/3253 transitions.
Support contains 117 out of 2976 places after structural reductions.
[2023-03-21 23:08:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-21 23:08:46] [INFO ] Flatten gal took : 209 ms
FORMULA ShieldIIPt-PT-050B-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 23:08:46] [INFO ] Flatten gal took : 116 ms
[2023-03-21 23:08:46] [INFO ] Input system was already deterministic with 2726 transitions.
Support contains 116 out of 2976 places (down from 117) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 68) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) seen :0
Running SMT prover for 35 properties.
[2023-03-21 23:08:47] [INFO ] Invariant cache hit.
[2023-03-21 23:08:51] [INFO ] [Real]Absence check using 451 positive place invariants in 272 ms returned sat
[2023-03-21 23:08:51] [INFO ] After 3315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-21 23:08:53] [INFO ] [Nat]Absence check using 451 positive place invariants in 204 ms returned sat
[2023-03-21 23:09:03] [INFO ] After 7520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-21 23:09:04] [INFO ] Deduced a trap composed of 18 places in 838 ms of which 15 ms to minimize.
[2023-03-21 23:09:05] [INFO ] Deduced a trap composed of 16 places in 1084 ms of which 3 ms to minimize.
[2023-03-21 23:09:06] [INFO ] Deduced a trap composed of 20 places in 824 ms of which 2 ms to minimize.
[2023-03-21 23:09:07] [INFO ] Deduced a trap composed of 19 places in 805 ms of which 17 ms to minimize.
[2023-03-21 23:09:08] [INFO ] Deduced a trap composed of 20 places in 914 ms of which 14 ms to minimize.
[2023-03-21 23:09:09] [INFO ] Deduced a trap composed of 16 places in 679 ms of which 1 ms to minimize.
[2023-03-21 23:09:10] [INFO ] Deduced a trap composed of 31 places in 824 ms of which 4 ms to minimize.
[2023-03-21 23:09:10] [INFO ] Deduced a trap composed of 28 places in 795 ms of which 2 ms to minimize.
[2023-03-21 23:09:11] [INFO ] Deduced a trap composed of 20 places in 866 ms of which 1 ms to minimize.
[2023-03-21 23:09:12] [INFO ] Deduced a trap composed of 33 places in 597 ms of which 2 ms to minimize.
[2023-03-21 23:09:14] [INFO ] Deduced a trap composed of 32 places in 1392 ms of which 1 ms to minimize.
[2023-03-21 23:09:14] [INFO ] Deduced a trap composed of 22 places in 721 ms of which 1 ms to minimize.
[2023-03-21 23:09:15] [INFO ] Deduced a trap composed of 28 places in 608 ms of which 2 ms to minimize.
[2023-03-21 23:09:16] [INFO ] Deduced a trap composed of 33 places in 594 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.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-21 23:09:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:09:16] [INFO ] After 25217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:35
Fused 35 Parikh solutions to 34 different solutions.
Parikh walk visited 0 properties in 5198 ms.
Support contains 57 out of 2976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Drop transitions removed 565 transitions
Trivial Post-agglo rules discarded 565 transitions
Performed 565 trivial Post agglomeration. Transition count delta: 565
Iterating post reduction 0 with 565 rules applied. Total rules applied 565 place count 2976 transition count 2161
Reduce places removed 565 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 571 rules applied. Total rules applied 1136 place count 2411 transition count 2155
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1142 place count 2405 transition count 2155
Performed 384 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 384 Pre rules applied. Total rules applied 1142 place count 2405 transition count 1771
Deduced a syphon composed of 384 places in 3 ms
Reduce places removed 384 places and 0 transitions.
Iterating global reduction 3 with 768 rules applied. Total rules applied 1910 place count 2021 transition count 1771
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1918 place count 2013 transition count 1763
Iterating global reduction 3 with 8 rules applied. Total rules applied 1926 place count 2013 transition count 1763
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1926 place count 2013 transition count 1755
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1942 place count 2005 transition count 1755
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 3 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3634 place count 1159 transition count 909
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3635 place count 1159 transition count 908
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3637 place count 1158 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3839 place count 1057 transition count 963
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 3909 place count 1022 transition count 985
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3910 place count 1022 transition count 984
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3913 place count 1022 transition count 981
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3916 place count 1019 transition count 981
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 6 with 47 rules applied. Total rules applied 3963 place count 1019 transition count 981
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3964 place count 1018 transition count 980
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3966 place count 1016 transition count 980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3966 place count 1016 transition count 979
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3968 place count 1015 transition count 979
Applied a total of 3968 rules in 984 ms. Remains 1015 /2976 variables (removed 1961) and now considering 979/2726 (removed 1747) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 1015/2976 places, 979/2726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 35) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) 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 32) seen :0
Interrupted probabilistic random walk after 72968 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72968 steps, saw 47362 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 979 rows 1015 cols
[2023-03-21 23:09:26] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:09:27] [INFO ] [Real]Absence check using 449 positive place invariants in 100 ms returned sat
[2023-03-21 23:09:27] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-21 23:09:27] [INFO ] [Nat]Absence check using 449 positive place invariants in 52 ms returned sat
[2023-03-21 23:09:30] [INFO ] After 2524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-21 23:09:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-21 23:09:31] [INFO ] After 1177ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-21 23:09:32] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-21 23:09:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-21 23:09:33] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-21 23:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-21 23:09:34] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 1 ms to minimize.
[2023-03-21 23:09:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-21 23:09:35] [INFO ] After 4480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1745 ms.
[2023-03-21 23:09:37] [INFO ] After 9878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 0 properties in 1155 ms.
Support contains 51 out of 1015 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1015/1015 places, 979/979 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 1015 transition count 977
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1013 transition count 977
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1013 transition count 976
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 6 place count 1012 transition count 976
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1011 transition count 975
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1009 transition count 976
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 1008 transition count 975
Applied a total of 13 rules in 135 ms. Remains 1008 /1015 variables (removed 7) and now considering 975/979 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1008/1015 places, 975/979 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Interrupted probabilistic random walk after 68691 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68691 steps, saw 43808 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 975 rows 1008 cols
[2023-03-21 23:09:42] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:09:43] [INFO ] [Real]Absence check using 449 positive place invariants in 97 ms returned sat
[2023-03-21 23:09:43] [INFO ] After 1030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-21 23:09:44] [INFO ] [Nat]Absence check using 449 positive place invariants in 127 ms returned sat
[2023-03-21 23:09:46] [INFO ] After 2000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-21 23:09:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 23:09:48] [INFO ] After 1791ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-21 23:09:48] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2023-03-21 23:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-21 23:09:52] [INFO ] After 5333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 2037 ms.
[2023-03-21 23:09:54] [INFO ] After 11182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 894 ms.
Support contains 51 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 975/975 transitions.
Applied a total of 0 rules in 24 ms. Remains 1008 /1008 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1008/1008 places, 975/975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 975/975 transitions.
Applied a total of 0 rules in 20 ms. Remains 1008 /1008 variables (removed 0) and now considering 975/975 (removed 0) transitions.
[2023-03-21 23:09:55] [INFO ] Invariant cache hit.
[2023-03-21 23:09:55] [INFO ] Implicit Places using invariants in 629 ms returned [997]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 635 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1007/1008 places, 975/975 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1006 transition count 974
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1006 transition count 974
Applied a total of 2 rules in 38 ms. Remains 1006 /1007 variables (removed 1) and now considering 974/975 (removed 1) transitions.
// Phase 1: matrix 974 rows 1006 cols
[2023-03-21 23:09:55] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:09:56] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-21 23:09:56] [INFO ] Invariant cache hit.
[2023-03-21 23:09:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:09:58] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1006/1008 places, 974/975 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3643 ms. Remains : 1006/1008 places, 974/975 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Interrupted probabilistic random walk after 89430 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89430 steps, saw 58206 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 32 properties.
[2023-03-21 23:10:02] [INFO ] Invariant cache hit.
[2023-03-21 23:10:04] [INFO ] [Real]Absence check using 448 positive place invariants in 137 ms returned sat
[2023-03-21 23:10:04] [INFO ] After 1398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-21 23:10:05] [INFO ] [Nat]Absence check using 448 positive place invariants in 127 ms returned sat
[2023-03-21 23:10:08] [INFO ] After 2228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-21 23:10:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:10:10] [INFO ] After 2032ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-21 23:10:13] [INFO ] After 4935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1646 ms.
[2023-03-21 23:10:14] [INFO ] After 10641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 0 properties in 874 ms.
Support contains 51 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 974/974 transitions.
Applied a total of 0 rules in 23 ms. Remains 1006 /1006 variables (removed 0) and now considering 974/974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1006/1006 places, 974/974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 974/974 transitions.
Applied a total of 0 rules in 20 ms. Remains 1006 /1006 variables (removed 0) and now considering 974/974 (removed 0) transitions.
[2023-03-21 23:10:15] [INFO ] Invariant cache hit.
[2023-03-21 23:10:16] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-21 23:10:16] [INFO ] Invariant cache hit.
[2023-03-21 23:10:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:10:18] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2506 ms to find 0 implicit places.
[2023-03-21 23:10:18] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-21 23:10:18] [INFO ] Invariant cache hit.
[2023-03-21 23:10:18] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3206 ms. Remains : 1006/1006 places, 974/974 transitions.
Partial Free-agglomeration rule applied 91 times.
Drop transitions removed 91 transitions
Iterating global reduction 0 with 91 rules applied. Total rules applied 91 place count 1006 transition count 974
Applied a total of 91 rules in 55 ms. Remains 1006 /1006 variables (removed 0) and now considering 974/974 (removed 0) transitions.
Running SMT prover for 32 properties.
// Phase 1: matrix 974 rows 1006 cols
[2023-03-21 23:10:18] [INFO ] Computed 448 place invariants in 14 ms
[2023-03-21 23:10:19] [INFO ] [Real]Absence check using 448 positive place invariants in 169 ms returned sat
[2023-03-21 23:10:19] [INFO ] After 967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-21 23:10:20] [INFO ] [Nat]Absence check using 448 positive place invariants in 115 ms returned sat
[2023-03-21 23:10:23] [INFO ] After 2169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-21 23:10:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-21 23:10:26] [INFO ] After 2297ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-21 23:10:29] [INFO ] After 5753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 2155 ms.
[2023-03-21 23:10:31] [INFO ] After 11878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
[2023-03-21 23:10:31] [INFO ] Flatten gal took : 114 ms
[2023-03-21 23:10:32] [INFO ] Flatten gal took : 120 ms
[2023-03-21 23:10:32] [INFO ] Input system was already deterministic with 2726 transitions.
Computed a total of 803 stabilizing places and 803 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2975 transition count 2129
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2379 transition count 2129
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 386 Pre rules applied. Total rules applied 1192 place count 2379 transition count 1743
Deduced a syphon composed of 386 places in 5 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 2 with 772 rules applied. Total rules applied 1964 place count 1993 transition count 1743
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1982 place count 1975 transition count 1725
Iterating global reduction 2 with 18 rules applied. Total rules applied 2000 place count 1975 transition count 1725
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 2000 place count 1975 transition count 1708
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 2034 place count 1958 transition count 1708
Performed 792 Post agglomeration using F-continuation condition.Transition count delta: 792
Deduced a syphon composed of 792 places in 2 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3618 place count 1166 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3619 place count 1166 transition count 915
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 3621 place count 1165 transition count 914
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3622 place count 1165 transition count 914
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3624 place count 1163 transition count 912
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3626 place count 1161 transition count 912
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3626 place count 1161 transition count 911
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 3628 place count 1160 transition count 911
Applied a total of 3628 rules in 742 ms. Remains 1160 /2976 variables (removed 1816) and now considering 911/2726 (removed 1815) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 759 ms. Remains : 1160/2976 places, 911/2726 transitions.
[2023-03-21 23:10:33] [INFO ] Flatten gal took : 39 ms
[2023-03-21 23:10:33] [INFO ] Flatten gal took : 41 ms
[2023-03-21 23:10:33] [INFO ] Input system was already deterministic with 911 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 2952 transition count 2702
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 2952 transition count 2702
Applied a total of 48 rules in 535 ms. Remains 2952 /2976 variables (removed 24) and now considering 2702/2726 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 2952/2976 places, 2702/2726 transitions.
[2023-03-21 23:10:33] [INFO ] Flatten gal took : 58 ms
[2023-03-21 23:10:34] [INFO ] Flatten gal took : 119 ms
[2023-03-21 23:10:34] [INFO ] Input system was already deterministic with 2702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 2975 transition count 2126
Reduce places removed 599 places and 0 transitions.
Iterating post reduction 1 with 599 rules applied. Total rules applied 1198 place count 2376 transition count 2126
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 386 Pre rules applied. Total rules applied 1198 place count 2376 transition count 1740
Deduced a syphon composed of 386 places in 4 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 2 with 772 rules applied. Total rules applied 1970 place count 1990 transition count 1740
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1989 place count 1971 transition count 1721
Iterating global reduction 2 with 19 rules applied. Total rules applied 2008 place count 1971 transition count 1721
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 2008 place count 1971 transition count 1703
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 2044 place count 1953 transition count 1703
Performed 799 Post agglomeration using F-continuation condition.Transition count delta: 799
Deduced a syphon composed of 799 places in 1 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3642 place count 1154 transition count 904
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3643 place count 1154 transition count 903
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 3645 place count 1153 transition count 902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3647 place count 1151 transition count 900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3649 place count 1149 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3649 place count 1149 transition count 899
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 3651 place count 1148 transition count 899
Applied a total of 3651 rules in 760 ms. Remains 1148 /2976 variables (removed 1828) and now considering 899/2726 (removed 1827) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 760 ms. Remains : 1148/2976 places, 899/2726 transitions.
[2023-03-21 23:10:35] [INFO ] Flatten gal took : 37 ms
[2023-03-21 23:10:35] [INFO ] Flatten gal took : 25 ms
[2023-03-21 23:10:35] [INFO ] Input system was already deterministic with 899 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2975 transition count 2132
Reduce places removed 593 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 594 rules applied. Total rules applied 1187 place count 2382 transition count 2131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1188 place count 2381 transition count 2131
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 386 Pre rules applied. Total rules applied 1188 place count 2381 transition count 1745
Deduced a syphon composed of 386 places in 4 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 3 with 772 rules applied. Total rules applied 1960 place count 1995 transition count 1745
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1977 place count 1978 transition count 1728
Iterating global reduction 3 with 17 rules applied. Total rules applied 1994 place count 1978 transition count 1728
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1994 place count 1978 transition count 1712
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 2026 place count 1962 transition count 1712
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 800
Deduced a syphon composed of 800 places in 1 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3626 place count 1162 transition count 912
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3627 place count 1162 transition count 911
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3629 place count 1161 transition count 910
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3631 place count 1159 transition count 908
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3633 place count 1157 transition count 908
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3633 place count 1157 transition count 907
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3635 place count 1156 transition count 907
Applied a total of 3635 rules in 634 ms. Remains 1156 /2976 variables (removed 1820) and now considering 907/2726 (removed 1819) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 634 ms. Remains : 1156/2976 places, 907/2726 transitions.
[2023-03-21 23:10:35] [INFO ] Flatten gal took : 25 ms
[2023-03-21 23:10:35] [INFO ] Flatten gal took : 34 ms
[2023-03-21 23:10:35] [INFO ] Input system was already deterministic with 907 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2951 transition count 2701
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2951 transition count 2701
Applied a total of 50 rules in 567 ms. Remains 2951 /2976 variables (removed 25) and now considering 2701/2726 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 2951/2976 places, 2701/2726 transitions.
[2023-03-21 23:10:36] [INFO ] Flatten gal took : 89 ms
[2023-03-21 23:10:36] [INFO ] Flatten gal took : 72 ms
[2023-03-21 23:10:36] [INFO ] Input system was already deterministic with 2701 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2955 transition count 2705
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2955 transition count 2705
Applied a total of 42 rules in 669 ms. Remains 2955 /2976 variables (removed 21) and now considering 2705/2726 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 2955/2976 places, 2705/2726 transitions.
[2023-03-21 23:10:37] [INFO ] Flatten gal took : 73 ms
[2023-03-21 23:10:37] [INFO ] Flatten gal took : 64 ms
[2023-03-21 23:10:37] [INFO ] Input system was already deterministic with 2705 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2975 transition count 2127
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2377 transition count 2127
Performed 388 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 388 Pre rules applied. Total rules applied 1196 place count 2377 transition count 1739
Deduced a syphon composed of 388 places in 3 ms
Reduce places removed 388 places and 0 transitions.
Iterating global reduction 2 with 776 rules applied. Total rules applied 1972 place count 1989 transition count 1739
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1992 place count 1969 transition count 1719
Iterating global reduction 2 with 20 rules applied. Total rules applied 2012 place count 1969 transition count 1719
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 2012 place count 1969 transition count 1700
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 2050 place count 1950 transition count 1700
Performed 796 Post agglomeration using F-continuation condition.Transition count delta: 796
Deduced a syphon composed of 796 places in 1 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3642 place count 1154 transition count 904
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3643 place count 1154 transition count 903
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 3645 place count 1153 transition count 902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3647 place count 1151 transition count 900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3649 place count 1149 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3649 place count 1149 transition count 899
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 3651 place count 1148 transition count 899
Applied a total of 3651 rules in 625 ms. Remains 1148 /2976 variables (removed 1828) and now considering 899/2726 (removed 1827) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 626 ms. Remains : 1148/2976 places, 899/2726 transitions.
[2023-03-21 23:10:38] [INFO ] Flatten gal took : 23 ms
[2023-03-21 23:10:38] [INFO ] Flatten gal took : 25 ms
[2023-03-21 23:10:38] [INFO ] Input system was already deterministic with 899 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
FORMULA ShieldIIPt-PT-050B-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2954 transition count 2704
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2954 transition count 2704
Applied a total of 44 rules in 526 ms. Remains 2954 /2976 variables (removed 22) and now considering 2704/2726 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 2954/2976 places, 2704/2726 transitions.
[2023-03-21 23:10:39] [INFO ] Flatten gal took : 57 ms
[2023-03-21 23:10:39] [INFO ] Flatten gal took : 63 ms
[2023-03-21 23:10:39] [INFO ] Input system was already deterministic with 2704 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2955 transition count 2705
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2955 transition count 2705
Applied a total of 42 rules in 524 ms. Remains 2955 /2976 variables (removed 21) and now considering 2705/2726 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 2955/2976 places, 2705/2726 transitions.
[2023-03-21 23:10:40] [INFO ] Flatten gal took : 60 ms
[2023-03-21 23:10:40] [INFO ] Flatten gal took : 94 ms
[2023-03-21 23:10:40] [INFO ] Input system was already deterministic with 2705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2951 transition count 2701
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2951 transition count 2701
Applied a total of 50 rules in 629 ms. Remains 2951 /2976 variables (removed 25) and now considering 2701/2726 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 2951/2976 places, 2701/2726 transitions.
[2023-03-21 23:10:40] [INFO ] Flatten gal took : 55 ms
[2023-03-21 23:10:41] [INFO ] Flatten gal took : 58 ms
[2023-03-21 23:10:41] [INFO ] Input system was already deterministic with 2701 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2955 transition count 2705
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2955 transition count 2705
Applied a total of 42 rules in 507 ms. Remains 2955 /2976 variables (removed 21) and now considering 2705/2726 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 2955/2976 places, 2705/2726 transitions.
[2023-03-21 23:10:41] [INFO ] Flatten gal took : 51 ms
[2023-03-21 23:10:41] [INFO ] Flatten gal took : 53 ms
[2023-03-21 23:10:41] [INFO ] Input system was already deterministic with 2705 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2975 transition count 2127
Reduce places removed 598 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 599 rules applied. Total rules applied 1197 place count 2377 transition count 2126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1198 place count 2376 transition count 2126
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1198 place count 2376 transition count 1739
Deduced a syphon composed of 387 places in 4 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1972 place count 1989 transition count 1739
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1992 place count 1969 transition count 1719
Iterating global reduction 3 with 20 rules applied. Total rules applied 2012 place count 1969 transition count 1719
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 2012 place count 1969 transition count 1700
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 2050 place count 1950 transition count 1700
Performed 796 Post agglomeration using F-continuation condition.Transition count delta: 796
Deduced a syphon composed of 796 places in 1 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 3642 place count 1154 transition count 904
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3643 place count 1154 transition count 903
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3645 place count 1153 transition count 902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3647 place count 1151 transition count 900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3649 place count 1149 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3649 place count 1149 transition count 899
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3651 place count 1148 transition count 899
Applied a total of 3651 rules in 624 ms. Remains 1148 /2976 variables (removed 1828) and now considering 899/2726 (removed 1827) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 624 ms. Remains : 1148/2976 places, 899/2726 transitions.
[2023-03-21 23:10:42] [INFO ] Flatten gal took : 23 ms
[2023-03-21 23:10:42] [INFO ] Flatten gal took : 24 ms
[2023-03-21 23:10:42] [INFO ] Input system was already deterministic with 899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2976/2976 places, 2726/2726 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2953 transition count 2703
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2953 transition count 2703
Applied a total of 46 rules in 562 ms. Remains 2953 /2976 variables (removed 23) and now considering 2703/2726 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 2953/2976 places, 2703/2726 transitions.
[2023-03-21 23:10:43] [INFO ] Flatten gal took : 64 ms
[2023-03-21 23:10:43] [INFO ] Flatten gal took : 71 ms
[2023-03-21 23:10:43] [INFO ] Input system was already deterministic with 2703 transitions.
[2023-03-21 23:10:43] [INFO ] Flatten gal took : 54 ms
[2023-03-21 23:10:43] [INFO ] Flatten gal took : 57 ms
[2023-03-21 23:10:43] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-21 23:10:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2976 places, 2726 transitions and 7052 arcs took 12 ms.
Total runtime 131035 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/611/ctl_0_ --ctl=/tmp/611/ctl_1_ --ctl=/tmp/611/ctl_2_ --ctl=/tmp/611/ctl_3_ --ctl=/tmp/611/ctl_4_ --ctl=/tmp/611/ctl_5_ --ctl=/tmp/611/ctl_6_ --ctl=/tmp/611/ctl_7_ --ctl=/tmp/611/ctl_8_ --ctl=/tmp/611/ctl_9_ --ctl=/tmp/611/ctl_10_ --ctl=/tmp/611/ctl_11_ --mu-par --mu-opt
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-01
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-02
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-03
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-05
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-06
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-07
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-09
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-10
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-11
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-12
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-14
Could not compute solution for formula : ShieldIIPt-PT-050B-CTLCardinality-15

BK_STOP 1679440374105

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-01
ctl formula formula --ctl=/tmp/611/ctl_0_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-02
ctl formula formula --ctl=/tmp/611/ctl_1_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-03
ctl formula formula --ctl=/tmp/611/ctl_2_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-05
ctl formula formula --ctl=/tmp/611/ctl_3_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-06
ctl formula formula --ctl=/tmp/611/ctl_4_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-07
ctl formula formula --ctl=/tmp/611/ctl_5_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-09
ctl formula formula --ctl=/tmp/611/ctl_6_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-10
ctl formula formula --ctl=/tmp/611/ctl_7_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-11
ctl formula formula --ctl=/tmp/611/ctl_8_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-12
ctl formula formula --ctl=/tmp/611/ctl_9_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-14
ctl formula formula --ctl=/tmp/611/ctl_10_
ctl formula name ShieldIIPt-PT-050B-CTLCardinality-15
ctl formula formula --ctl=/tmp/611/ctl_11_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 2976 places, 2726 transitions and 7052 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 2726->2726 groups
pnml2lts-sym: Regrouping took 2.060 real 2.040 user 0.020 sys
pnml2lts-sym: state vector length is 2976; there are 2726 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 19696883 group checks and 0 next state calls
pnml2lts-sym: reachability took 125.720 real 499.980 user 2.510 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.060 real 0.270 user 0.000 sys
pnml2lts-sym: state space has 1.64615661222563e+283 states, 140743 nodes
double free or corruption (out)

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-050B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-050B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716900329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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