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.r106-tall-167814483400946.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DNAwalker-PT-10ringRL, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483400946
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 112K Mar 5 18:22 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 DNAwalker-PT-10ringRL-CTLFireability-00
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-01
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-02
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-03
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-04
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-05
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-06
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-07
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-08
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-09
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-10
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-11
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-12
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-13
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-14
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678500391656

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-10ringRL
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 02:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:06:33] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-11 02:06:33] [INFO ] Transformed 27 places.
[2023-03-11 02:06:33] [INFO ] Transformed 260 transitions.
[2023-03-11 02:06:33] [INFO ] Parsed PT model containing 27 places and 260 transitions and 760 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 23 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:06:33] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2023-03-11 02:06:33] [INFO ] Computed 0 place invariants in 16 ms
[2023-03-11 02:06:33] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
[2023-03-11 02:06:33] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:06:33] [INFO ] Invariant cache hit.
[2023-03-11 02:06:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 02:06:33] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:06:33] [INFO ] Invariant cache hit.
[2023-03-11 02:06:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-11 02:06:33] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-11 02:06:33] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:06:33] [INFO ] Invariant cache hit.
[2023-03-11 02:06:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 27/27 places, 260/260 transitions.
Support contains 23 out of 27 places after structural reductions.
[2023-03-11 02:06:34] [INFO ] Flatten gal took : 36 ms
[2023-03-11 02:06:34] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:06:34] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 831 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 97) seen :76
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-11 02:06:34] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:06:34] [INFO ] Invariant cache hit.
[2023-03-11 02:06:35] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-11 02:07:00] [INFO ] After 24948ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :12
[2023-03-11 02:07:00] [INFO ] State equation strengthened by 72 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-11 02:07:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:07:00] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 260/260 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 26 transition count 251
Applied a total of 9 rules in 33 ms. Remains 26 /27 variables (removed 1) and now considering 251/260 (removed 9) transitions.
// Phase 1: matrix 251 rows 26 cols
[2023-03-11 02:07:00] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-11 02:07:00] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 26/27 places, 251/260 transitions.
Incomplete random walk after 10000 steps, including 852 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 685079 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685079 steps, saw 124968 distinct states, run finished after 3002 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-11 02:07:03] [INFO ] Invariant cache hit.
[2023-03-11 02:07:04] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 02:07:29] [INFO ] After 24966ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-11 02:07:29] [INFO ] State equation strengthened by 60 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-11 02:07:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:07:29] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 250
Applied a total of 1 rules in 14 ms. Remains 25 /26 variables (removed 1) and now considering 250/251 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 25/26 places, 250/251 transitions.
Incomplete random walk after 10000 steps, including 907 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1014099 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1014099 steps, saw 183690 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 250 rows 25 cols
[2023-03-11 02:07:32] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-11 02:07:32] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:07:38] [INFO ] After 6319ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
[2023-03-11 02:07:38] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:07:38] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:07:38] [INFO ] Input system was already deterministic with 260 transitions.
Computed a total of 27 stabilizing places and 258 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:38] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2023-03-11 02:07:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 02:07:38] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 19 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:39] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:39] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:39] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 10 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:07:40] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:07:40] [INFO ] Invariant cache hit.
[2023-03-11 02:07:40] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:07:40] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:07:40] [INFO ] Input system was already deterministic with 260 transitions.
[2023-03-11 02:07:41] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:07:41] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:07:41] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 02:07:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 260 transitions and 760 arcs took 1 ms.
Total runtime 67652 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 27 NrTr: 260 NrArc: 760)

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

net check time: 0m 0.000sec

init dd package: 0m 2.734sec


RS generation: 0m28.150sec


-> reachability set: #nodes 21660 (2.2e+04) #states 27,950,678 (7)



starting MCC model checker
--------------------------

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.350sec

checking: AF [[1<=p22 & 2<=p24]]
normalized: ~ [EG [~ [[1<=p22 & 2<=p24]]]]

abstracting: (2<=p24)
states: 1,401,142 (6)
abstracting: (1<=p22)
states: 27,950,678 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.217sec

checking: EX [EF [AG [[1<=p13 & 2<=p21]]]]
normalized: EX [E [true U ~ [E [true U ~ [[1<=p13 & 2<=p21]]]]]]

abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (1<=p13)
states: 9,815,332 (6)
.-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.352sec

checking: AF [AG [[p1<=1 | p3<=0]]]
normalized: ~ [EG [E [true U ~ [[p1<=1 | p3<=0]]]]]

abstracting: (p3<=0)
states: 18,113,900 (7)
abstracting: (p1<=1)
states: 26,596,204 (7)
.........................
EG iterations: 25
-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.364sec

checking: EX [EG [AF [~ [E [[1<=p1 & 2<=p7] U [1<=p12 & 2<=p17]]]]]]
normalized: EX [EG [~ [EG [E [[1<=p1 & 2<=p7] U [1<=p12 & 2<=p17]]]]]]

abstracting: (2<=p17)
states: 932,808 (5)
abstracting: (1<=p12)
states: 14,564,282 (7)
abstracting: (2<=p7)
states: 1,383,796 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
.......
EG iterations: 7

EG iterations: 0
.-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.180sec

checking: AG [[E [[1<=p1 & 2<=p2] U EX [AX [1<=0]]] | [p1<=1 | p23<=0]]]
normalized: ~ [E [true U ~ [[[p1<=1 | p23<=0] | E [[1<=p1 & 2<=p2] U EX [~ [EX [~ [1<=0]]]]]]]]]

abstracting: (1<=0)
states: 0
..abstracting: (2<=p2)
states: 1,391,832 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
abstracting: (p23<=0)
states: 13,631,912 (7)
abstracting: (p1<=1)
states: 26,596,204 (7)
-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.313sec

checking: [EX [AG [[EF [[p5<=1 | p8<=0]] | [1<=p15 & 2<=p24]]]] & EX [0<=0]]
normalized: [EX [~ [E [true U ~ [[E [true U [p5<=1 | p8<=0]] | [1<=p15 & 2<=p24]]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 27,950,678 (7)
.abstracting: (2<=p24)
states: 1,401,142 (6)
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (p8<=0)
states: 0
abstracting: (p5<=1)
states: 27,019,824 (7)
.-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: EG [[EF [[p1<=0 | p23<=1]] & [p12<=1 | p17<=0]]]
normalized: EG [[[p12<=1 | p17<=0] & E [true U [p1<=0 | p23<=1]]]]

abstracting: (p23<=1)
states: 26,560,296 (7)
abstracting: (p1<=0)
states: 14,146,808 (7)
abstracting: (p17<=0)
states: 18,134,624 (7)
abstracting: (p12<=1)
states: 26,556,618 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.747sec

checking: AX [[~ [E [EX [EX [1<=p16]] U A [~ [[2<=p12 & 1<=p15]] U EG [[1<=p1 & 2<=p10]]]]] & AX [EX [0<=0]]]]
normalized: ~ [EX [~ [[~ [EX [~ [EX [0<=0]]]] & ~ [E [EX [EX [1<=p16]] U [~ [EG [~ [EG [[1<=p1 & 2<=p10]]]]] & ~ [E [~ [EG [[1<=p1 & 2<=p10]]] U [[2<=p12 & 1<=p15] & ~ [EG [[1<=p1 & 2<=p10]]]]]]]]]]]]]

abstracting: (2<=p10)
states: 1,400,270 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
........
EG iterations: 8
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p12)
states: 1,394,060 (6)
abstracting: (2<=p10)
states: 1,400,270 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
........
EG iterations: 8
abstracting: (2<=p10)
states: 1,400,270 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
........
EG iterations: 8

EG iterations: 0
abstracting: (1<=p16)
states: 8,711,177 (6)
..abstracting: (0<=0)
states: 27,950,678 (7)
...-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.185sec

checking: E [~ [[EG [AX [EF [[2<=p0 & 1<=p3]]]] | AG [[[1<=p8 & 2<=p11] | [1<=p7 & 2<=p9]]]]] U [1<=p23 & 2<=p24]]
normalized: E [~ [[~ [E [true U ~ [[[1<=p7 & 2<=p9] | [1<=p8 & 2<=p11]]]]] | EG [~ [EX [~ [E [true U [2<=p0 & 1<=p3]]]]]]]] U [1<=p23 & 2<=p24]]

abstracting: (2<=p24)
states: 1,401,142 (6)
abstracting: (1<=p23)
states: 14,318,766 (7)
abstracting: (1<=p3)
states: 9,836,778 (6)
abstracting: (2<=p0)
states: 729
..
EG iterations: 1
abstracting: (2<=p11)
states: 1,400,936 (6)
abstracting: (1<=p8)
states: 27,950,678 (7)
abstracting: (2<=p9)
states: 1,386,082 (6)
abstracting: (1<=p7)
states: 14,351,940 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.311sec

checking: A [~ [EX [[2<=p17 & 1<=p23]]] U ~ [AF [[AG [[1<=p7 & 2<=p10]] & A [[2<=p1 & 1<=p19] U [2<=p0 & 1<=p13]]]]]]
normalized: [~ [EG [~ [EG [~ [[[~ [EG [~ [[2<=p0 & 1<=p13]]]] & ~ [E [~ [[2<=p0 & 1<=p13]] U [~ [[2<=p1 & 1<=p19]] & ~ [[2<=p0 & 1<=p13]]]]]] & ~ [E [true U ~ [[1<=p7 & 2<=p10]]]]]]]]]] & ~ [E [~ [EG [~ [[[~ [EG [~ [[2<=p0 & 1<=p13]]]] & ~ [E [~ [[2<=p0 & 1<=p13]] U [~ [[2<=p1 & 1<=p19]] & ~ [[2<=p0 & 1<=p13]]]]]] & ~ [E [true U ~ [[1<=p7 & 2<=p10]]]]]]]] U [EX [[2<=p17 & 1<=p23]] & ~ [EG [~ [[[~ [EG [~ [[2<=p0 & 1<=p13]]]] & ~ [E [~ [[2<=p0 & 1<=p13]] U [~ [[2<=p1 & 1<=p19]] & ~ [[2<=p0 & 1<=p13]]]]]] & ~ [E [true U ~ [[1<=p7 & 2<=p10]]]]]]]]]]]]

abstracting: (2<=p10)
states: 1,400,270 (6)
abstracting: (1<=p7)
states: 14,351,940 (7)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p19)
states: 9,806,331 (6)
abstracting: (2<=p1)
states: 1,354,474 (6)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p23)
states: 14,318,766 (7)
abstracting: (2<=p17)
states: 932,808 (5)
.abstracting: (2<=p10)
states: 1,400,270 (6)
abstracting: (1<=p7)
states: 14,351,940 (7)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p19)
states: 9,806,331 (6)
abstracting: (2<=p1)
states: 1,354,474 (6)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
.
EG iterations: 1

EG iterations: 0
abstracting: (2<=p10)
states: 1,400,270 (6)
abstracting: (1<=p7)
states: 14,351,940 (7)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p19)
states: 9,806,331 (6)
abstracting: (2<=p1)
states: 1,354,474 (6)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p0)
states: 729
.
EG iterations: 1

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.210sec

checking: E [[AF [[[2<=p0 & 1<=p9] | [2<=p24 & 1<=p25]]] | AX [AG [~ [[2<=p1 & 1<=p15]]]]] U ~ [AX [[[[1<=p5 & 2<=p25] | [2<=p0 & 1<=p3]] & ~ [[2<=p2 & 1<=p3]]]]]]
normalized: E [[~ [EX [E [true U [2<=p1 & 1<=p15]]]] | ~ [EG [~ [[[2<=p24 & 1<=p25] | [2<=p0 & 1<=p9]]]]]] U EX [~ [[~ [[2<=p2 & 1<=p3]] & [[2<=p0 & 1<=p3] | [1<=p5 & 2<=p25]]]]]]

abstracting: (2<=p25)
states: 1,402,288 (6)
abstracting: (1<=p5)
states: 9,807,505 (6)
abstracting: (1<=p3)
states: 9,836,778 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p3)
states: 9,836,778 (6)
abstracting: (2<=p2)
states: 1,391,832 (6)
.abstracting: (1<=p9)
states: 14,273,374 (7)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p24)
states: 1,401,142 (6)
.
EG iterations: 1
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p1)
states: 1,354,474 (6)
.-> the formula is TRUE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.095sec

checking: [EF [[[EF [[1<=p15 & 2<=p25]] & [[[AF [[1<=p1 & 2<=p13]] | [p13<=1 | p22<=0]] & [1<=p1 & 2<=p25]] | EG [[[1<=p1 & 2<=p11] | [1<=p22 & 2<=p23]]]]] & [2<=p7 & 1<=p11]]] | AX [EF [[1<=p10 & 2<=p11]]]]
normalized: [~ [EX [~ [E [true U [1<=p10 & 2<=p11]]]]] | E [true U [[2<=p7 & 1<=p11] & [[EG [[[1<=p22 & 2<=p23] | [1<=p1 & 2<=p11]]] | [[1<=p1 & 2<=p25] & [[p13<=1 | p22<=0] | ~ [EG [~ [[1<=p1 & 2<=p13]]]]]]] & E [true U [1<=p15 & 2<=p25]]]]]]

abstracting: (2<=p25)
states: 1,402,288 (6)
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p13)
states: 932,808 (5)
abstracting: (1<=p1)
states: 13,803,870 (7)
.
EG iterations: 1
abstracting: (p22<=0)
states: 0
abstracting: (p13<=1)
states: 27,017,870 (7)
abstracting: (2<=p25)
states: 1,402,288 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
abstracting: (2<=p11)
states: 1,400,936 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
abstracting: (2<=p23)
states: 1,390,382 (6)
abstracting: (1<=p22)
states: 27,950,678 (7)
........
EG iterations: 8
abstracting: (1<=p11)
states: 14,579,446 (7)
abstracting: (2<=p7)
states: 1,383,796 (6)
abstracting: (2<=p11)
states: 1,400,936 (6)
abstracting: (1<=p10)
states: 14,559,474 (7)
.-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.510sec

checking: A [[~ [[[AX [[2<=p0 & 1<=p10]] & 2<=p9] & [1<=p11 & ~ [[~ [[1<=p13 & 2<=p21]] & AF [[2<=p13 & 1<=p19]]]]]]] | [1<=p17 & 2<=p21]] U [[AG [EF [[2<=p2 & 1<=p25]]] & EX [EF [[2<=p19 & 1<=p21]]]] | [[1<=p5 & 2<=p26] | [1<=p3 & 2<=p5]]]]
normalized: [~ [EG [~ [[[[1<=p3 & 2<=p5] | [1<=p5 & 2<=p26]] | [EX [E [true U [2<=p19 & 1<=p21]]] & ~ [E [true U ~ [E [true U [2<=p2 & 1<=p25]]]]]]]]]] & ~ [E [~ [[[[1<=p3 & 2<=p5] | [1<=p5 & 2<=p26]] | [EX [E [true U [2<=p19 & 1<=p21]]] & ~ [E [true U ~ [E [true U [2<=p2 & 1<=p25]]]]]]]] U [~ [[~ [[[1<=p11 & ~ [[~ [[1<=p13 & 2<=p21]] & ~ [EG [~ [[2<=p13 & 1<=p19]]]]]]] & [2<=p9 & ~ [EX [~ [[2<=p0 & 1<=p10]]]]]]] | [1<=p17 & 2<=p21]]] & ~ [[[[1<=p3 & 2<=p5] | [1<=p5 & 2<=p26]] | [EX [E [true U [2<=p19 & 1<=p21]]] & ~ [E [true U ~ [E [true U [2<=p2 & 1<=p25]]]]]]]]]]]]

abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p2)
states: 1,391,832 (6)
abstracting: (1<=p21)
states: 14,432,734 (7)
abstracting: (2<=p19)
states: 928,914 (5)
.abstracting: (2<=p26)
states: 1,399,304 (6)
abstracting: (1<=p5)
states: 9,807,505 (6)
abstracting: (2<=p5)
states: 930,854 (5)
abstracting: (1<=p3)
states: 9,836,778 (6)
abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (1<=p17)
states: 9,816,054 (6)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p0)
states: 729
.abstracting: (2<=p9)
states: 1,386,082 (6)
abstracting: (1<=p19)
states: 9,806,331 (6)
abstracting: (2<=p13)
states: 932,808 (5)
.
EG iterations: 1
abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (1<=p11)
states: 14,579,446 (7)
abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p2)
states: 1,391,832 (6)
abstracting: (1<=p21)
states: 14,432,734 (7)
abstracting: (2<=p19)
states: 928,914 (5)
.abstracting: (2<=p26)
states: 1,399,304 (6)
abstracting: (1<=p5)
states: 9,807,505 (6)
abstracting: (2<=p5)
states: 930,854 (5)
abstracting: (1<=p3)
states: 9,836,778 (6)
abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p2)
states: 1,391,832 (6)
abstracting: (1<=p21)
states: 14,432,734 (7)
abstracting: (2<=p19)
states: 928,914 (5)
.abstracting: (2<=p26)
states: 1,399,304 (6)
abstracting: (1<=p5)
states: 9,807,505 (6)
abstracting: (2<=p5)
states: 930,854 (5)
abstracting: (1<=p3)
states: 9,836,778 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.227sec

checking: ~ [E [[[EG [~ [[2<=p11 & 1<=p15]]] & [AX [[2<=p3 & 1<=p9]] | [EF [[2<=p2 & 1<=p5]] | ~ [[1<=p1 & 2<=p21]]]]] & [~ [[~ [[2<=p0 & 1<=p5]] & ~ [[2<=p7 & 1<=p9]]]] & AG [EF [[1<=p1 & 2<=p19]]]]] U A [[[EX [[2<=p17 & 1<=p21]] | [[[2<=p0 & 1<=p21] | [1<=p10 & 2<=p12]] & [2<=p12 & 1<=p15]]] & [[1<=p13 & 2<=p17] | A [[1<=p15 & 2<=p26] U [1<=p2 & 2<=p3]]]] U ~ [AF [[2<=p7 & 1<=p15]]]]]]
normalized: ~ [E [[[~ [E [true U ~ [E [true U [1<=p1 & 2<=p19]]]]] & ~ [[~ [[2<=p7 & 1<=p9]] & ~ [[2<=p0 & 1<=p5]]]]] & [[[~ [[1<=p1 & 2<=p21]] | E [true U [2<=p2 & 1<=p5]]] | ~ [EX [~ [[2<=p3 & 1<=p9]]]]] & EG [~ [[2<=p11 & 1<=p15]]]]] U [~ [EG [~ [EG [~ [[2<=p7 & 1<=p15]]]]]] & ~ [E [~ [EG [~ [[2<=p7 & 1<=p15]]]] U [~ [[[[~ [EG [~ [[1<=p2 & 2<=p3]]]] & ~ [E [~ [[1<=p2 & 2<=p3]] U [~ [[1<=p15 & 2<=p26]] & ~ [[1<=p2 & 2<=p3]]]]]] | [1<=p13 & 2<=p17]] & [[[2<=p12 & 1<=p15] & [[1<=p10 & 2<=p12] | [2<=p0 & 1<=p21]]] | EX [[2<=p17 & 1<=p21]]]]] & ~ [EG [~ [[2<=p7 & 1<=p15]]]]]]]]]]

abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p7)
states: 1,383,796 (6)
.
EG iterations: 1
abstracting: (1<=p21)
states: 14,432,734 (7)
abstracting: (2<=p17)
states: 932,808 (5)
.abstracting: (1<=p21)
states: 14,432,734 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p12)
states: 1,394,060 (6)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p12)
states: 1,394,060 (6)
abstracting: (2<=p17)
states: 932,808 (5)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p3)
states: 935,704 (5)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (2<=p26)
states: 1,399,304 (6)
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p3)
states: 935,704 (5)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (2<=p3)
states: 935,704 (5)
abstracting: (1<=p2)
states: 14,404,986 (7)
.
EG iterations: 1
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p7)
states: 1,383,796 (6)
.
EG iterations: 1
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p7)
states: 1,383,796 (6)
.
EG iterations: 1
.......
EG iterations: 7
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p11)
states: 1,400,936 (6)
.
EG iterations: 1
abstracting: (1<=p9)
states: 14,273,374 (7)
abstracting: (2<=p3)
states: 935,704 (5)
.abstracting: (1<=p5)
states: 9,807,505 (6)
abstracting: (2<=p2)
states: 1,391,832 (6)
abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (1<=p1)
states: 13,803,870 (7)
abstracting: (1<=p5)
states: 9,807,505 (6)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p9)
states: 14,273,374 (7)
abstracting: (2<=p7)
states: 1,383,796 (6)
abstracting: (2<=p19)
states: 928,914 (5)
abstracting: (1<=p1)
states: 13,803,870 (7)
-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.715sec

checking: A [[[AX [1<=0] | ~ [[A [p16<=0 U AX [1<=0]] | [2<=p2 & 1<=p23]]]] | [1<=p16 | [[~ [AF [[2<=p11 & 1<=p15]]] & 1<=p6] | [2<=p19 & 1<=p24]]]] U AG [[[EG [[2<=p13 & 1<=p22]] & 1<=p22] & [2<=p25 & [[1<=p2 | [[EG [[2<=p0 & 1<=p10]] & [[2<=p23 & 1<=p25] | [2<=p0 & 1<=p8]]] | [~ [[1<=p17 & 2<=p19]] & E [[1<=p10 & 2<=p17] U [1<=p10 & 2<=p12]]]]] & [~ [[2<=p0 & 1<=p9]] | [[2<=p21 & 1<=p23] & [1<=p13 & [1<=p2 & 2<=p9]]]]]]]]]
normalized: [~ [EG [E [true U ~ [[[2<=p25 & [[[[1<=p13 & [1<=p2 & 2<=p9]] & [2<=p21 & 1<=p23]] | ~ [[2<=p0 & 1<=p9]]] & [1<=p2 | [[E [[1<=p10 & 2<=p17] U [1<=p10 & 2<=p12]] & ~ [[1<=p17 & 2<=p19]]] | [[[2<=p0 & 1<=p8] | [2<=p23 & 1<=p25]] & EG [[2<=p0 & 1<=p10]]]]]]] & [1<=p22 & EG [[2<=p13 & 1<=p22]]]]]]]] & ~ [E [E [true U ~ [[[2<=p25 & [[[[1<=p13 & [1<=p2 & 2<=p9]] & [2<=p21 & 1<=p23]] | ~ [[2<=p0 & 1<=p9]]] & [1<=p2 | [[E [[1<=p10 & 2<=p17] U [1<=p10 & 2<=p12]] & ~ [[1<=p17 & 2<=p19]]] | [[[2<=p0 & 1<=p8] | [2<=p23 & 1<=p25]] & EG [[2<=p0 & 1<=p10]]]]]]] & [1<=p22 & EG [[2<=p13 & 1<=p22]]]]]] U [~ [[[1<=p16 | [[2<=p19 & 1<=p24] | [1<=p6 & EG [~ [[2<=p11 & 1<=p15]]]]]] | [~ [[[2<=p2 & 1<=p23] | [~ [EG [EX [~ [1<=0]]]] & ~ [E [EX [~ [1<=0]] U [~ [p16<=0] & EX [~ [1<=0]]]]]]]] | ~ [EX [~ [1<=0]]]]]] & E [true U ~ [[[2<=p25 & [[[[1<=p13 & [1<=p2 & 2<=p9]] & [2<=p21 & 1<=p23]] | ~ [[2<=p0 & 1<=p9]]] & [1<=p2 | [[E [[1<=p10 & 2<=p17] U [1<=p10 & 2<=p12]] & ~ [[1<=p17 & 2<=p19]]] | [[[2<=p0 & 1<=p8] | [2<=p23 & 1<=p25]] & EG [[2<=p0 & 1<=p10]]]]]]] & [1<=p22 & EG [[2<=p13 & 1<=p22]]]]]]]]]]

abstracting: (1<=p22)
states: 27,950,678 (7)
abstracting: (2<=p13)
states: 932,808 (5)
.......
EG iterations: 7
abstracting: (1<=p22)
states: 27,950,678 (7)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p0)
states: 729
........
EG iterations: 8
abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p23)
states: 1,390,382 (6)
abstracting: (1<=p8)
states: 27,950,678 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p19)
states: 928,914 (5)
abstracting: (1<=p17)
states: 9,816,054 (6)
abstracting: (2<=p12)
states: 1,394,060 (6)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p17)
states: 932,808 (5)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (1<=p9)
states: 14,273,374 (7)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p23)
states: 14,318,766 (7)
abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (2<=p9)
states: 1,386,082 (6)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p25)
states: 1,402,288 (6)
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
.abstracting: (p16<=0)
states: 19,239,501 (7)
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (1<=p23)
states: 14,318,766 (7)
abstracting: (2<=p2)
states: 1,391,832 (6)
abstracting: (1<=p15)
states: 9,636,654 (6)
abstracting: (2<=p11)
states: 1,400,936 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 8,876,651 (6)
abstracting: (1<=p24)
states: 14,512,734 (7)
abstracting: (2<=p19)
states: 928,914 (5)
abstracting: (1<=p16)
states: 8,711,177 (6)
abstracting: (1<=p22)
states: 27,950,678 (7)
abstracting: (2<=p13)
states: 932,808 (5)
.......
EG iterations: 7
abstracting: (1<=p22)
states: 27,950,678 (7)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p0)
states: 729
........
EG iterations: 8
abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p23)
states: 1,390,382 (6)
abstracting: (1<=p8)
states: 27,950,678 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p19)
states: 928,914 (5)
abstracting: (1<=p17)
states: 9,816,054 (6)
abstracting: (2<=p12)
states: 1,394,060 (6)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p17)
states: 932,808 (5)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (1<=p9)
states: 14,273,374 (7)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p23)
states: 14,318,766 (7)
abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (2<=p9)
states: 1,386,082 (6)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p25)
states: 1,402,288 (6)
abstracting: (1<=p22)
states: 27,950,678 (7)
abstracting: (2<=p13)
states: 932,808 (5)
.......
EG iterations: 7
abstracting: (1<=p22)
states: 27,950,678 (7)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p0)
states: 729
........
EG iterations: 8
abstracting: (1<=p25)
states: 14,528,830 (7)
abstracting: (2<=p23)
states: 1,390,382 (6)
abstracting: (1<=p8)
states: 27,950,678 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p19)
states: 928,914 (5)
abstracting: (1<=p17)
states: 9,816,054 (6)
abstracting: (2<=p12)
states: 1,394,060 (6)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (2<=p17)
states: 932,808 (5)
abstracting: (1<=p10)
states: 14,559,474 (7)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (1<=p9)
states: 14,273,374 (7)
abstracting: (2<=p0)
states: 729
abstracting: (1<=p23)
states: 14,318,766 (7)
abstracting: (2<=p21)
states: 1,385,344 (6)
abstracting: (2<=p9)
states: 1,386,082 (6)
abstracting: (1<=p2)
states: 14,404,986 (7)
abstracting: (1<=p13)
states: 9,815,332 (6)
abstracting: (2<=p25)
states: 1,402,288 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-10ringRL-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.784sec

totally nodes used: 45856329 (4.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 199245755 216549768 415795523
used/not used/entry size/cache size: 65217799 1891065 16 1024MB
basic ops cache: hits/miss/sum: 57383488 47983926 105367414
used/not used/entry size/cache size: 16647480 129736 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 187487 175340 362827
used/not used/entry size/cache size: 173204 8215404 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 36758491
1 20763361
2 6604206
3 1784627
4 588119
5 251965
6 143056
7 73735
8 45437
9 27496
>= 10 68371

Total processing time: 2m 8.819sec


BK_STOP 1678500590915

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

557 736 1207 1846 1871 1758 2363 13980 17012 18597 18334 19487 18939 21291
iterations count:1452357 (5585), effective:42598 (163)

initing FirstDep: 0m 0.000sec


iterations count:1270 (4), effective:7 (0)

iterations count:6475 (24), effective:106 (0)

iterations count:260 (1), effective:0 (0)

iterations count:5705 (21), effective:103 (0)

iterations count:263 (1), effective:1 (0)

iterations count:621 (2), effective:9 (0)

iterations count:25840 (99), effective:839 (3)

iterations count:270 (1), effective:1 (0)

iterations count:512 (1), effective:2 (0)

iterations count:19337 (74), effective:297 (1)

iterations count:387 (1), effective:1 (0)

iterations count:351 (1), effective:1 (0)

iterations count:387 (1), effective:1 (0)

iterations count:351 (1), effective:1 (0)

iterations count:387 (1), effective:1 (0)

iterations count:351 (1), effective:1 (0)

iterations count:4929 (18), effective:89 (0)

iterations count:260 (1), effective:0 (0)

iterations count:20521 (78), effective:256 (0)

iterations count:21038 (80), effective:581 (2)

iterations count:12967 (49), effective:171 (0)

iterations count:3885 (14), effective:53 (0)

iterations count:35135 (135), effective:712 (2)

iterations count:12967 (49), effective:171 (0)

iterations count:3885 (14), effective:53 (0)

iterations count:35135 (135), effective:712 (2)

iterations count:12967 (49), effective:171 (0)

iterations count:3885 (14), effective:53 (0)

iterations count:35135 (135), effective:712 (2)

iterations count:424 (1), effective:9 (0)

iterations count:260 (1), effective:0 (0)

iterations count:13715 (52), effective:170 (0)

iterations count:33985 (130), effective:729 (2)

iterations count:4657 (17), effective:82 (0)

iterations count:260 (1), effective:0 (0)

iterations count:294 (1), effective:1 (0)

iterations count:260 (1), effective:0 (0)

iterations count:260 (1), effective:0 (0)

iterations count:294 (1), effective:1 (0)

iterations count:260 (1), effective:0 (0)

iterations count:12229 (47), effective:168 (0)

iterations count:294 (1), effective:1 (0)

iterations count:260 (1), effective:0 (0)

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="DNAwalker-PT-10ringRL"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DNAwalker-PT-10ringRL, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483400946"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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