Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Feb 26 19:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 19:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 19:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 19:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 652K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-100A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679302564248

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=ShieldRVs-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:56:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:56:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:56:06] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-20 08:56:06] [INFO ] Transformed 1403 places.
[2023-03-20 08:56:06] [INFO ] Transformed 1903 transitions.
[2023-03-20 08:56:06] [INFO ] Found NUPN structural information;
[2023-03-20 08:56:06] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
FORMULA ShieldRVs-PT-100A-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 143 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2023-03-20 08:56:06] [INFO ] Computed 401 place invariants in 33 ms
[2023-03-20 08:56:07] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-20 08:56:07] [INFO ] Invariant cache hit.
[2023-03-20 08:56:08] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
[2023-03-20 08:56:08] [INFO ] Invariant cache hit.
[2023-03-20 08:56:09] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3770 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Support contains 97 out of 1403 places after structural reductions.
[2023-03-20 08:56:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 08:56:10] [INFO ] Flatten gal took : 283 ms
FORMULA ShieldRVs-PT-100A-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 08:56:10] [INFO ] Flatten gal took : 142 ms
[2023-03-20 08:56:10] [INFO ] Input system was already deterministic with 1903 transitions.
Support contains 91 out of 1403 places (down from 97) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 50) seen :41
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 08:56:12] [INFO ] Invariant cache hit.
[2023-03-20 08:56:12] [INFO ] [Real]Absence check using 401 positive place invariants in 69 ms returned sat
[2023-03-20 08:56:14] [INFO ] After 2186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 08:56:14] [INFO ] [Nat]Absence check using 401 positive place invariants in 77 ms returned sat
[2023-03-20 08:56:17] [INFO ] After 2838ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 6 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1420 ms
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 2 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4815 ms
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2702 ms
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 1 ms to minimize.
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 8 places in 419 ms of which 1 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 8 places in 472 ms of which 1 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 2 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 11 places in 435 ms of which 1 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 8 places in 410 ms of which 1 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 1 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 12 places in 423 ms of which 1 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 1 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 8 places in 446 ms of which 1 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 1 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 11 places in 426 ms of which 0 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 1 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 15 places in 382 ms of which 1 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 1 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 2 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 23 places in 365 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-20 08:56:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:56:39] [INFO ] After 25194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1418 ms.
Support contains 25 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 198 place count 1402 transition count 1902
Applied a total of 198 rules in 602 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 08:56:42] [INFO ] Computed 401 place invariants in 10 ms
[2023-03-20 08:56:43] [INFO ] [Real]Absence check using 401 positive place invariants in 58 ms returned sat
[2023-03-20 08:56:44] [INFO ] After 1680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 08:56:45] [INFO ] [Nat]Absence check using 401 positive place invariants in 76 ms returned sat
[2023-03-20 08:56:46] [INFO ] After 1392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 2 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 0 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 8712 ms
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-20 08:56:56] [INFO ] After 11417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 755 ms.
[2023-03-20 08:56:57] [INFO ] After 12838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 1278 ms.
Support contains 21 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 133 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 94665 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{5=1}
Probabilistic random walk after 94665 steps, saw 92105 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 08:57:02] [INFO ] Computed 401 place invariants in 16 ms
[2023-03-20 08:57:03] [INFO ] [Real]Absence check using 401 positive place invariants in 69 ms returned sat
[2023-03-20 08:57:04] [INFO ] After 1596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 08:57:04] [INFO ] [Nat]Absence check using 401 positive place invariants in 73 ms returned sat
[2023-03-20 08:57:06] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1558 ms
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 0 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3044 ms
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2023-03-20 08:57:12] [INFO ] After 7236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 785 ms.
[2023-03-20 08:57:13] [INFO ] After 8606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 966 ms.
Support contains 19 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1402 transition count 1902
Applied a total of 1 rules in 234 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 51262 steps, run timeout after 3002 ms. (steps per millisecond=17 ) properties seen :{2=1, 6=1}
Probabilistic random walk after 51262 steps, saw 49961 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :2
Running SMT prover for 5 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 08:57:18] [INFO ] Computed 401 place invariants in 12 ms
[2023-03-20 08:57:18] [INFO ] [Real]Absence check using 401 positive place invariants in 70 ms returned sat
[2023-03-20 08:57:19] [INFO ] After 1409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 08:57:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 61 ms returned sat
[2023-03-20 08:57:21] [INFO ] After 1253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 2 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 32 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3959 ms
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 592 ms
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 598 ms
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2542 ms
[2023-03-20 08:57:29] [INFO ] After 9345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 528 ms.
[2023-03-20 08:57:30] [INFO ] After 10319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1128 ms.
Support contains 14 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1402 transition count 1902
Applied a total of 1 rules in 113 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 107125 steps, run timeout after 3003 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107125 steps, saw 105328 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 08:57:35] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 08:57:35] [INFO ] [Real]Absence check using 401 positive place invariants in 106 ms returned sat
[2023-03-20 08:57:36] [INFO ] After 1476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 08:57:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 69 ms returned sat
[2023-03-20 08:57:38] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2386 ms
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-20 08:57:41] [INFO ] After 4624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 474 ms.
[2023-03-20 08:57:42] [INFO ] After 5607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 371 ms.
Support contains 14 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 81 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 77 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-20 08:57:42] [INFO ] Invariant cache hit.
[2023-03-20 08:57:43] [INFO ] Implicit Places using invariants in 919 ms returned []
[2023-03-20 08:57:43] [INFO ] Invariant cache hit.
[2023-03-20 08:57:45] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2793 ms to find 0 implicit places.
[2023-03-20 08:57:46] [INFO ] Redundant transitions in 481 ms returned []
[2023-03-20 08:57:46] [INFO ] Invariant cache hit.
[2023-03-20 08:57:47] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4391 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 51 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-20 08:57:47] [INFO ] Invariant cache hit.
[2023-03-20 08:57:47] [INFO ] [Real]Absence check using 401 positive place invariants in 57 ms returned sat
[2023-03-20 08:57:48] [INFO ] After 1410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 08:57:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2023-03-20 08:57:50] [INFO ] After 1171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 08:57:50] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 0 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 2 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3346 ms
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-20 08:57:54] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-20 08:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2023-03-20 08:57:54] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-20 08:57:55] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-20 08:57:55] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-20 08:57:55] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-20 08:57:55] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:57:56] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-20 08:57:56] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:57:56] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:57:56] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:57:56] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:57:57] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:57:57] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-20 08:57:57] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-20 08:57:57] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-20 08:57:57] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-20 08:57:57] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-20 08:57:58] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:57:58] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 3 ms to minimize.
[2023-03-20 08:57:58] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:57:58] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3826 ms
[2023-03-20 08:57:58] [INFO ] After 9291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 804 ms.
[2023-03-20 08:57:59] [INFO ] After 10608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 08:57:59] [INFO ] Flatten gal took : 131 ms
[2023-03-20 08:57:59] [INFO ] Flatten gal took : 124 ms
[2023-03-20 08:57:59] [INFO ] Input system was already deterministic with 1903 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 121 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 1402/1403 places, 1902/1903 transitions.
[2023-03-20 08:58:00] [INFO ] Flatten gal took : 108 ms
[2023-03-20 08:58:00] [INFO ] Flatten gal took : 108 ms
[2023-03-20 08:58:00] [INFO ] Input system was already deterministic with 1902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 32 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:00] [INFO ] Flatten gal took : 78 ms
[2023-03-20 08:58:00] [INFO ] Flatten gal took : 80 ms
[2023-03-20 08:58:00] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 32 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:00] [INFO ] Flatten gal took : 76 ms
[2023-03-20 08:58:01] [INFO ] Flatten gal took : 76 ms
[2023-03-20 08:58:01] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:01] [INFO ] Flatten gal took : 76 ms
[2023-03-20 08:58:01] [INFO ] Flatten gal took : 70 ms
[2023-03-20 08:58:01] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 101 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 1402/1403 places, 1902/1903 transitions.
[2023-03-20 08:58:01] [INFO ] Flatten gal took : 66 ms
[2023-03-20 08:58:01] [INFO ] Flatten gal took : 74 ms
[2023-03-20 08:58:01] [INFO ] Input system was already deterministic with 1902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 31 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:02] [INFO ] Flatten gal took : 72 ms
[2023-03-20 08:58:02] [INFO ] Flatten gal took : 77 ms
[2023-03-20 08:58:02] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 37 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:02] [INFO ] Flatten gal took : 73 ms
[2023-03-20 08:58:02] [INFO ] Flatten gal took : 81 ms
[2023-03-20 08:58:02] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 35 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:02] [INFO ] Flatten gal took : 71 ms
[2023-03-20 08:58:02] [INFO ] Flatten gal took : 75 ms
[2023-03-20 08:58:02] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 32 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:03] [INFO ] Flatten gal took : 62 ms
[2023-03-20 08:58:03] [INFO ] Flatten gal took : 70 ms
[2023-03-20 08:58:03] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:03] [INFO ] Flatten gal took : 65 ms
[2023-03-20 08:58:03] [INFO ] Flatten gal took : 68 ms
[2023-03-20 08:58:03] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 33 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:03] [INFO ] Flatten gal took : 68 ms
[2023-03-20 08:58:03] [INFO ] Flatten gal took : 78 ms
[2023-03-20 08:58:03] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 104 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105 ms. Remains : 1401/1403 places, 1901/1903 transitions.
[2023-03-20 08:58:04] [INFO ] Flatten gal took : 54 ms
[2023-03-20 08:58:04] [INFO ] Flatten gal took : 97 ms
[2023-03-20 08:58:04] [INFO ] Input system was already deterministic with 1901 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151652 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151652 steps, saw 110714 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1901 rows 1401 cols
[2023-03-20 08:58:07] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 08:58:07] [INFO ] [Real]Absence check using 401 positive place invariants in 69 ms returned sat
[2023-03-20 08:58:08] [INFO ] After 1082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:58:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 60 ms returned sat
[2023-03-20 08:58:09] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:58:10] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:58:10] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-20 08:58:10] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:58:10] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:58:10] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:58:11] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:58:11] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:58:11] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2023-03-20 08:58:11] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:58:11] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2023-03-20 08:58:11] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:58:12] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:58:12] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-20 08:58:12] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-20 08:58:12] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:58:12] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:58:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:58:13] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:58:13] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2023-03-20 08:58:13] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-20 08:58:13] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2023-03-20 08:58:13] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:58:14] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:58:14] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:58:14] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:58:14] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-20 08:58:14] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:58:14] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-20 08:58:15] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:58:15] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5353 ms
[2023-03-20 08:58:15] [INFO ] After 6211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-20 08:58:15] [INFO ] After 6724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35092 steps, including 998 resets, run visited all 1 properties in 357 ms. (steps per millisecond=98 )
FORMULA ShieldRVs-PT-100A-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 364 ms.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 39 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:15] [INFO ] Flatten gal took : 82 ms
[2023-03-20 08:58:15] [INFO ] Flatten gal took : 87 ms
[2023-03-20 08:58:16] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 40 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 08:58:16] [INFO ] Flatten gal took : 81 ms
[2023-03-20 08:58:16] [INFO ] Flatten gal took : 69 ms
[2023-03-20 08:58:16] [INFO ] Input system was already deterministic with 1903 transitions.
[2023-03-20 08:58:16] [INFO ] Flatten gal took : 75 ms
[2023-03-20 08:58:16] [INFO ] Flatten gal took : 75 ms
[2023-03-20 08:58:16] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 08:58:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1403 places, 1903 transitions and 9200 arcs took 11 ms.
Total runtime 130819 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/1299/ctl_0_ --ctl=/tmp/1299/ctl_1_ --ctl=/tmp/1299/ctl_2_ --ctl=/tmp/1299/ctl_3_ --ctl=/tmp/1299/ctl_4_ --ctl=/tmp/1299/ctl_5_ --ctl=/tmp/1299/ctl_6_ --ctl=/tmp/1299/ctl_7_ --ctl=/tmp/1299/ctl_8_ --ctl=/tmp/1299/ctl_9_ --ctl=/tmp/1299/ctl_10_ --ctl=/tmp/1299/ctl_11_ --ctl=/tmp/1299/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15935048 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098528 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100A"
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 ShieldRVs-PT-100A, 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 r425-tajo-167905977800161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100A.tgz
mv ShieldRVs-PT-100A 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 ;