About the Execution of Marcie+red for DNAwalker-PT-11ringRR
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7881.707 | 155524.00 | 171805.00 | 906.70 | FTFTTTFFTFFTFTTT | normal |
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-167814483400954.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-11ringRR, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483400954
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:59 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.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:00 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-11ringRR-CTLFireability-00
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-01
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-02
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-03
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-04
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-05
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-06
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-07
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-08
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-09
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-10
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-11
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-12
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-13
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-14
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678500523812
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-11ringRR
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 02:08:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:08:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:08:45] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-11 02:08:45] [INFO ] Transformed 27 places.
[2023-03-11 02:08:45] [INFO ] Transformed 260 transitions.
[2023-03-11 02:08:45] [INFO ] Parsed PT model containing 27 places and 260 transitions and 760 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 25 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:08:45] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2023-03-11 02:08:45] [INFO ] Computed 0 place invariants in 14 ms
[2023-03-11 02:08:45] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
[2023-03-11 02:08:45] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:08:45] [INFO ] Invariant cache hit.
[2023-03-11 02:08:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 02:08:45] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:08:45] [INFO ] Invariant cache hit.
[2023-03-11 02:08:45] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-11 02:08:45] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-11 02:08:45] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:08:45] [INFO ] Invariant cache hit.
[2023-03-11 02:08:45] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 27/27 places, 260/260 transitions.
Support contains 25 out of 27 places after structural reductions.
[2023-03-11 02:08:46] [INFO ] Flatten gal took : 36 ms
[2023-03-11 02:08:46] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:08:46] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 791 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 73) seen :62
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 02:08:46] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:08:46] [INFO ] Invariant cache hit.
[2023-03-11 02:08:46] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 02:09:11] [INFO ] After 24967ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-11 02:09:11] [INFO ] State equation strengthened by 70 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:09:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:09:11] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 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 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 25 transition count 250
Applied a total of 10 rules in 20 ms. Remains 25 /27 variables (removed 2) and now considering 250/260 (removed 10) transitions.
// Phase 1: matrix 250 rows 25 cols
[2023-03-11 02:09:12] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-11 02:09:12] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 25/27 places, 250/260 transitions.
Incomplete random walk after 10000 steps, including 913 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 901116 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 901116 steps, saw 159109 distinct states, run finished after 3002 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-11 02:09:15] [INFO ] Invariant cache hit.
[2023-03-11 02:09:15] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:09:40] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 250/250 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 249
Applied a total of 1 rules in 15 ms. Remains 24 /25 variables (removed 1) and now considering 249/250 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 24/25 places, 249/250 transitions.
Incomplete random walk after 10000 steps, including 965 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1233668 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 1233668 steps, saw 221010 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 249 rows 24 cols
[2023-03-11 02:09:43] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-11 02:09:43] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:10:01] [INFO ] After 18098ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 249/249 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 247
Applied a total of 2 rules in 19 ms. Remains 22 /24 variables (removed 2) and now considering 247/249 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 22/24 places, 247/249 transitions.
Incomplete random walk after 10000 steps, including 1175 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2034997 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :{}
Probabilistic random walk after 2034997 steps, saw 376887 distinct states, run finished after 3001 ms. (steps per millisecond=678 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 247 rows 22 cols
[2023-03-11 02:10:05] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-11 02:10:05] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:10:05] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA DNAwalker-PT-11ringRR-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 02:10:05] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:10:05] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:10:05] [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 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:10:05] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2023-03-11 02:10:05] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 02:10:06] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 22 ms
[2023-03-11 02:10:06] [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 8 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:06] [INFO ] Invariant cache hit.
[2023-03-11 02:10:06] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:10:06] [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:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:06] [INFO ] Invariant cache hit.
[2023-03-11 02:10:06] [INFO ] Dead Transitions using invariants and state equation in 111 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:10:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:10:06] [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:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:06] [INFO ] Invariant cache hit.
[2023-03-11 02:10:06] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:10:06] [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:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:06] [INFO ] Invariant cache hit.
[2023-03-11 02:10:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:10:06] [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 9 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:06] [INFO ] Invariant cache hit.
[2023-03-11 02:10:06] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:06] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [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:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:10:07] [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 2 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [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:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [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:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [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:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [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:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 108 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:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [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 4 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 221 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:07] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:10:07] [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 4 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 02:10:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:07] [INFO ] Invariant cache hit.
[2023-03-11 02:10:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:08] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:10:08] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:10:08] [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:10:08] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2023-03-11 02:10:08] [INFO ] Invariant cache hit.
[2023-03-11 02:10:08] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 27/27 places, 260/260 transitions.
[2023-03-11 02:10:08] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:08] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:08] [INFO ] Input system was already deterministic with 260 transitions.
[2023-03-11 02:10:08] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:08] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:10:08] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 02:10:08] [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 83173 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.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.677sec
RS generation: 0m20.719sec
-> reachability set: #nodes 12319 (1.2e+04) #states 28,209,796 (7)
starting MCC model checker
--------------------------
checking: EX [0<=0]
normalized: EX [0<=0]
abstracting: (0<=0)
states: 28,209,796 (7)
.-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.542sec
checking: EF [AG [AX [[2<=p7 & 1<=p17]]]]
normalized: E [true U ~ [E [true U EX [~ [[2<=p7 & 1<=p17]]]]]]
abstracting: (1<=p17)
states: 14,606,608 (7)
abstracting: (2<=p7)
states: 1,399,356 (6)
.-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.715sec
checking: AX [AF [[2<=p1 & 1<=p19]]]
normalized: ~ [EX [EG [~ [[2<=p1 & 1<=p19]]]]]
abstracting: (1<=p19)
states: 14,698,688 (7)
abstracting: (2<=p1)
states: 1,375,538 (6)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: EG [[AF [p24<=0] | [2<=p0 & 1<=p8]]]
normalized: EG [[~ [EG [~ [p24<=0]]] | [2<=p0 & 1<=p8]]]
abstracting: (1<=p8)
states: 14,672,396 (7)
abstracting: (2<=p0)
states: 729
abstracting: (p24<=0)
states: 19,219,305 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.250sec
checking: AX [[AG [[p25<=0 | p3<=1]] | EX [[[1<=p3 & 2<=p7] | [2<=p4 & 1<=p7]]]]]
normalized: ~ [EX [~ [[EX [[[2<=p4 & 1<=p7] | [1<=p3 & 2<=p7]]] | ~ [E [true U ~ [[p25<=0 | p3<=1]]]]]]]]
abstracting: (p3<=1)
states: 26,801,196 (7)
abstracting: (p25<=0)
states: 18,243,306 (7)
abstracting: (2<=p7)
states: 1,399,356 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
abstracting: (1<=p7)
states: 14,411,560 (7)
abstracting: (2<=p4)
states: 1,412,948 (6)
..-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.155sec
checking: EX [[EX [[EG [[p2<=0 | p7<=1]] & [p2<=1 | p5<=0]]] | [1<=p7 & 2<=p13]]]
normalized: EX [[[1<=p7 & 2<=p13] | EX [[[p2<=1 | p5<=0] & EG [[p2<=0 | p7<=1]]]]]]
abstracting: (p7<=1)
states: 26,810,440 (7)
abstracting: (p2<=0)
states: 13,598,676 (7)
.
EG iterations: 1
abstracting: (p5<=0)
states: 13,563,920 (7)
abstracting: (p2<=1)
states: 26,801,196 (7)
.abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p7)
states: 14,411,560 (7)
.-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.189sec
checking: EF [[~ [E [EG [[2<=p17 & 1<=p18]] U [2<=p4 & 1<=p5]]] & EF [AG [[p5<=1 | p6<=0]]]]]
normalized: E [true U [E [true U ~ [E [true U ~ [[p5<=1 | p6<=0]]]]] & ~ [E [EG [[2<=p17 & 1<=p18]] U [2<=p4 & 1<=p5]]]]]
abstracting: (1<=p5)
states: 14,645,876 (7)
abstracting: (2<=p4)
states: 1,412,948 (6)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (2<=p17)
states: 1,403,008 (6)
........
EG iterations: 8
abstracting: (p6<=0)
states: 0
abstracting: (p5<=1)
states: 26,797,634 (7)
-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.092sec
checking: EG [EX [[AX [[[p2<=1 | p22<=0] & [p19<=1 | p20<=0]]] & [AG [[2<=p3 & 1<=p5]] | EX [[p5<=0 | p9<=1]]]]]]
normalized: EG [EX [[[EX [[p5<=0 | p9<=1]] | ~ [E [true U ~ [[2<=p3 & 1<=p5]]]]] & ~ [EX [~ [[[p19<=1 | p20<=0] & [p2<=1 | p22<=0]]]]]]]]
abstracting: (p22<=0)
states: 13,625,188 (7)
abstracting: (p2<=1)
states: 26,801,196 (7)
abstracting: (p20<=0)
states: 0
abstracting: (p19<=1)
states: 26,797,958 (7)
.abstracting: (1<=p5)
states: 14,645,876 (7)
abstracting: (2<=p3)
states: 1,408,600 (6)
abstracting: (p9<=1)
states: 27,271,258 (7)
abstracting: (p5<=0)
states: 13,563,920 (7)
..
EG iterations: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.522sec
checking: ~ [E [[1<=p9 & 2<=p11] U AF [[[1<=p6 & 2<=p9] | [A [[1<=p6 & 2<=p13] U [2<=p18 & 1<=p22]] & EF [[1<=p7 & 2<=p13]]]]]]]
normalized: ~ [E [[1<=p9 & 2<=p11] U ~ [EG [~ [[[E [true U [1<=p7 & 2<=p13]] & [~ [EG [~ [[2<=p18 & 1<=p22]]]] & ~ [E [~ [[2<=p18 & 1<=p22]] U [~ [[1<=p6 & 2<=p13]] & ~ [[2<=p18 & 1<=p22]]]]]]] | [1<=p6 & 2<=p9]]]]]]]
abstracting: (2<=p9)
states: 938,538 (5)
abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (1<=p22)
states: 14,584,608 (7)
abstracting: (2<=p18)
states: 1,411,976 (6)
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (1<=p22)
states: 14,584,608 (7)
abstracting: (2<=p18)
states: 1,411,976 (6)
abstracting: (1<=p22)
states: 14,584,608 (7)
abstracting: (2<=p18)
states: 1,411,976 (6)
.
EG iterations: 1
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p7)
states: 14,411,560 (7)
.
EG iterations: 1
abstracting: (2<=p11)
states: 939,780 (5)
abstracting: (1<=p9)
states: 9,932,919 (6)
-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.776sec
checking: [EF [[1<=p17 & 2<=p19]] & AX [E [EX [[2<=p18 & 1<=p22]] U ~ [E [[[1<=p8 & 2<=p17] | [1<=p5 & 2<=p8]] U AG [[2<=p1 & 1<=p15]]]]]]]
normalized: [~ [EX [~ [E [EX [[2<=p18 & 1<=p22]] U ~ [E [[[1<=p5 & 2<=p8] | [1<=p8 & 2<=p17]] U ~ [E [true U ~ [[2<=p1 & 1<=p15]]]]]]]]]] & E [true U [1<=p17 & 2<=p19]]]
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p17)
states: 14,606,608 (7)
abstracting: (1<=p15)
states: 9,769,271 (6)
abstracting: (2<=p1)
states: 1,375,538 (6)
abstracting: (2<=p17)
states: 1,403,008 (6)
abstracting: (1<=p8)
states: 14,672,396 (7)
abstracting: (2<=p8)
states: 1,404,612 (6)
abstracting: (1<=p5)
states: 14,645,876 (7)
abstracting: (1<=p22)
states: 14,584,608 (7)
abstracting: (2<=p18)
states: 1,411,976 (6)
..-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.552sec
checking: A [1<=p12 U EG [[[AF [[[1<=p1 & 2<=p11] | [2<=p11 & 1<=p13]]] | AF [[2<=p3 & 1<=p4]]] | [AG [[1<=p7 & 2<=p13]] | [[2<=p13 & 1<=p18] | [2<=p3 & 1<=p23]]]]]]
normalized: [~ [EG [~ [EG [[[[[2<=p3 & 1<=p23] | [2<=p13 & 1<=p18]] | ~ [E [true U ~ [[1<=p7 & 2<=p13]]]]] | [~ [EG [~ [[2<=p3 & 1<=p4]]]] | ~ [EG [~ [[[2<=p11 & 1<=p13] | [1<=p1 & 2<=p11]]]]]]]]]]] & ~ [E [~ [EG [[[[[2<=p3 & 1<=p23] | [2<=p13 & 1<=p18]] | ~ [E [true U ~ [[1<=p7 & 2<=p13]]]]] | [~ [EG [~ [[2<=p3 & 1<=p4]]]] | ~ [EG [~ [[[2<=p11 & 1<=p13] | [1<=p1 & 2<=p11]]]]]]]]] U [~ [1<=p12] & ~ [EG [[[[[2<=p3 & 1<=p23] | [2<=p13 & 1<=p18]] | ~ [E [true U ~ [[1<=p7 & 2<=p13]]]]] | [~ [EG [~ [[2<=p3 & 1<=p4]]]] | ~ [EG [~ [[[2<=p11 & 1<=p13] | [1<=p1 & 2<=p11]]]]]]]]]]]]]
abstracting: (2<=p11)
states: 939,780 (5)
abstracting: (1<=p1)
states: 14,054,156 (7)
abstracting: (1<=p13)
states: 9,935,604 (6)
abstracting: (2<=p11)
states: 939,780 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (2<=p3)
states: 1,408,600 (6)
.
EG iterations: 1
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p7)
states: 14,411,560 (7)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p23)
states: 9,931,089 (6)
abstracting: (2<=p3)
states: 1,408,600 (6)
........
EG iterations: 8
abstracting: (1<=p12)
states: 9,011,068 (6)
abstracting: (2<=p11)
states: 939,780 (5)
abstracting: (1<=p1)
states: 14,054,156 (7)
abstracting: (1<=p13)
states: 9,935,604 (6)
abstracting: (2<=p11)
states: 939,780 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (2<=p3)
states: 1,408,600 (6)
.
EG iterations: 1
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p7)
states: 14,411,560 (7)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p23)
states: 9,931,089 (6)
abstracting: (2<=p3)
states: 1,408,600 (6)
........
EG iterations: 8
abstracting: (2<=p11)
states: 939,780 (5)
abstracting: (1<=p1)
states: 14,054,156 (7)
abstracting: (1<=p13)
states: 9,935,604 (6)
abstracting: (2<=p11)
states: 939,780 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (2<=p3)
states: 1,408,600 (6)
.
EG iterations: 1
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p7)
states: 14,411,560 (7)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (2<=p13)
states: 942,332 (5)
abstracting: (1<=p23)
states: 9,931,089 (6)
abstracting: (2<=p3)
states: 1,408,600 (6)
........
EG iterations: 8
EG iterations: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.260sec
checking: EG [[EF [[E [E [[1<=p4 & 2<=p5] U [1<=p18 & 2<=p19]] U EF [[1<=p21 & 2<=p23]]] | [[2<=p4 & 1<=p6] | A [[2<=p1 & 1<=p7] U [1<=p4 & 2<=p25]]]]] & AX [[p1<=1 | p13<=0]]]]
normalized: EG [[~ [EX [~ [[p1<=1 | p13<=0]]]] & E [true U [[[~ [EG [~ [[1<=p4 & 2<=p25]]]] & ~ [E [~ [[1<=p4 & 2<=p25]] U [~ [[2<=p1 & 1<=p7]] & ~ [[1<=p4 & 2<=p25]]]]]] | [2<=p4 & 1<=p6]] | E [E [[1<=p4 & 2<=p5] U [1<=p18 & 2<=p19]] U E [true U [1<=p21 & 2<=p23]]]]]]]
abstracting: (2<=p23)
states: 940,598 (5)
abstracting: (1<=p21)
states: 14,397,124 (7)
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (2<=p5)
states: 1,412,162 (6)
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (2<=p4)
states: 1,412,948 (6)
abstracting: (2<=p25)
states: 942,760 (5)
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (1<=p7)
states: 14,411,560 (7)
abstracting: (2<=p1)
states: 1,375,538 (6)
abstracting: (2<=p25)
states: 942,760 (5)
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (2<=p25)
states: 942,760 (5)
abstracting: (1<=p4)
states: 14,660,092 (7)
.
EG iterations: 1
abstracting: (p13<=0)
states: 18,274,192 (7)
abstracting: (p1<=1)
states: 26,834,258 (7)
..........................
EG iterations: 25
-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.063sec
checking: AG [[EG [EX [[p21<=0 | p25<=1]]] | [[1<=p20 & 2<=p23] | [[2<=p5 & 1<=p7] & [2<=p15 & [1<=p20 & [[p15<=0 | [p17<=1 | p2<=1]] | [p21<=0 | [p15<=1 | p23<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[2<=p15 & [1<=p20 & [[p21<=0 | [p15<=1 | p23<=0]] | [p15<=0 | [p17<=1 | p2<=1]]]]] & [2<=p5 & 1<=p7]] | [1<=p20 & 2<=p23]] | EG [EX [[p21<=0 | p25<=1]]]]]]]
abstracting: (p25<=1)
states: 27,267,036 (7)
abstracting: (p21<=0)
states: 13,812,672 (7)
.
EG iterations: 0
abstracting: (2<=p23)
states: 940,598 (5)
abstracting: (1<=p20)
states: 28,209,796 (7)
abstracting: (1<=p7)
states: 14,411,560 (7)
abstracting: (2<=p5)
states: 1,412,162 (6)
abstracting: (p2<=1)
states: 26,801,196 (7)
abstracting: (p17<=1)
states: 26,806,788 (7)
abstracting: (p15<=0)
states: 18,440,525 (7)
abstracting: (p23<=0)
states: 18,278,707 (7)
abstracting: (p15<=1)
states: 27,273,627 (7)
abstracting: (p21<=0)
states: 13,812,672 (7)
abstracting: (1<=p20)
states: 28,209,796 (7)
abstracting: (2<=p15)
states: 936,169 (5)
-> the formula is TRUE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: [AG [[[2<=p19 & 1<=p21] | [[[p21<=1 | p25<=0] & AF [[1<=p11 & 2<=p17]]] | EF [[[[p13<=1 | p20<=0] & p16<=0] & [[p5<=1 | p6<=0] & [p15<=1 | p19<=0]]]]]]] & EG [[2<=p0 & 1<=p20]]]
normalized: [EG [[2<=p0 & 1<=p20]] & ~ [E [true U ~ [[[E [true U [[[p15<=1 | p19<=0] & [p5<=1 | p6<=0]] & [p16<=0 & [p13<=1 | p20<=0]]]] | [~ [EG [~ [[1<=p11 & 2<=p17]]]] & [p21<=1 | p25<=0]]] | [2<=p19 & 1<=p21]]]]]]
abstracting: (1<=p21)
states: 14,397,124 (7)
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (p25<=0)
states: 18,243,306 (7)
abstracting: (p21<=1)
states: 26,811,886 (7)
abstracting: (2<=p17)
states: 1,403,008 (6)
abstracting: (1<=p11)
states: 9,950,848 (6)
.
EG iterations: 1
abstracting: (p20<=0)
states: 0
abstracting: (p13<=1)
states: 27,267,464 (7)
abstracting: (p16<=0)
states: 19,376,694 (7)
abstracting: (p6<=0)
states: 0
abstracting: (p5<=1)
states: 26,797,634 (7)
abstracting: (p19<=0)
states: 13,511,108 (7)
abstracting: (p15<=1)
states: 27,273,627 (7)
abstracting: (1<=p20)
states: 28,209,796 (7)
abstracting: (2<=p0)
states: 729
........
EG iterations: 8
-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.683sec
checking: E [AF [[[AF [[1<=p23 & 2<=p25]] & A [E [[2<=p3 & 1<=p6] U [1<=p17 & 2<=p19]] U [[2<=p0 & 1<=p2] | [1<=p21 & 2<=p23]]]] & [2<=p0 & 1<=p4]]] U A [AX [AF [[2<=p15 & 1<=p18]]] U [~ [AX [[2<=p4 & 1<=p6]]] & [AF [[1<=p3 & 2<=p21]] | [[1<=p11 & 2<=p19] | [[1<=p3 & 2<=p22] & [2<=p11 & 1<=p17]]]]]]]
normalized: E [~ [EG [~ [[[2<=p0 & 1<=p4] & [[~ [EG [~ [[[1<=p21 & 2<=p23] | [2<=p0 & 1<=p2]]]]] & ~ [E [~ [[[1<=p21 & 2<=p23] | [2<=p0 & 1<=p2]]] U [~ [E [[2<=p3 & 1<=p6] U [1<=p17 & 2<=p19]]] & ~ [[[1<=p21 & 2<=p23] | [2<=p0 & 1<=p2]]]]]]] & ~ [EG [~ [[1<=p23 & 2<=p25]]]]]]]]] U [~ [EG [~ [[[[[[2<=p11 & 1<=p17] & [1<=p3 & 2<=p22]] | [1<=p11 & 2<=p19]] | ~ [EG [~ [[1<=p3 & 2<=p21]]]]] & EX [~ [[2<=p4 & 1<=p6]]]]]]] & ~ [E [~ [[[[[[2<=p11 & 1<=p17] & [1<=p3 & 2<=p22]] | [1<=p11 & 2<=p19]] | ~ [EG [~ [[1<=p3 & 2<=p21]]]]] & EX [~ [[2<=p4 & 1<=p6]]]]] U [EX [EG [~ [[2<=p15 & 1<=p18]]]] & ~ [[[[[[2<=p11 & 1<=p17] & [1<=p3 & 2<=p22]] | [1<=p11 & 2<=p19]] | ~ [EG [~ [[1<=p3 & 2<=p21]]]]] & EX [~ [[2<=p4 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (2<=p4)
states: 1,412,948 (6)
.abstracting: (2<=p21)
states: 1,397,910 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
.
EG iterations: 1
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p11)
states: 9,950,848 (6)
abstracting: (2<=p22)
states: 1,403,292 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
abstracting: (1<=p17)
states: 14,606,608 (7)
abstracting: (2<=p11)
states: 939,780 (5)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (2<=p15)
states: 936,169 (5)
.
EG iterations: 1
.abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (2<=p4)
states: 1,412,948 (6)
.abstracting: (2<=p21)
states: 1,397,910 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
.
EG iterations: 1
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p11)
states: 9,950,848 (6)
abstracting: (2<=p22)
states: 1,403,292 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
abstracting: (1<=p17)
states: 14,606,608 (7)
abstracting: (2<=p11)
states: 939,780 (5)
abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (2<=p4)
states: 1,412,948 (6)
.abstracting: (2<=p21)
states: 1,397,910 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
.
EG iterations: 1
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p11)
states: 9,950,848 (6)
abstracting: (2<=p22)
states: 1,403,292 (6)
abstracting: (1<=p3)
states: 14,615,184 (7)
abstracting: (1<=p17)
states: 14,606,608 (7)
abstracting: (2<=p11)
states: 939,780 (5)
.
EG iterations: 1
abstracting: (2<=p25)
states: 942,760 (5)
abstracting: (1<=p23)
states: 9,931,089 (6)
.
EG iterations: 1
abstracting: (1<=p2)
states: 14,611,120 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p23)
states: 940,598 (5)
abstracting: (1<=p21)
states: 14,397,124 (7)
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p17)
states: 14,606,608 (7)
abstracting: (1<=p6)
states: 28,209,796 (7)
abstracting: (2<=p3)
states: 1,408,600 (6)
abstracting: (1<=p2)
states: 14,611,120 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p23)
states: 940,598 (5)
abstracting: (1<=p21)
states: 14,397,124 (7)
abstracting: (1<=p2)
states: 14,611,120 (7)
abstracting: (2<=p0)
states: 729
abstracting: (2<=p23)
states: 940,598 (5)
abstracting: (1<=p21)
states: 14,397,124 (7)
.
EG iterations: 1
abstracting: (1<=p4)
states: 14,660,092 (7)
abstracting: (2<=p0)
states: 729
EG iterations: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-11ringRR-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.855sec
totally nodes used: 25332805 (2.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 138180031 135788239 273968270
used/not used/entry size/cache size: 59816892 7291972 16 1024MB
basic ops cache: hits/miss/sum: 28808657 24021379 52830036
used/not used/entry size/cache size: 15458490 1318726 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: 109823 97048 206871
used/not used/entry size/cache size: 96477 8292131 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 47988350
1 15128894
2 2947775
3 590210
4 197665
5 109273
6 60310
7 30039
8 17389
9 10955
>= 10 28004
Total processing time: 1m 9.785sec
BK_STOP 1678500679336
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
972 1236 1339 1462 1356 1528 1395 1859 1434 1307 3827 13293 11630 12213 12761 12744 13851 13565 13754 14909 14092 12906
iterations count:2215491 (8521), effective:50775 (195)
initing FirstDep: 0m 0.000sec
iterations count:260 (1), effective:0 (0)
iterations count:18248 (70), effective:508 (1)
iterations count:260 (1), effective:0 (0)
iterations count:23189 (89), effective:491 (1)
iterations count:12023 (46), effective:152 (0)
iterations count:387 (1), effective:1 (0)
iterations count:400 (1), effective:1 (0)
iterations count:274 (1), effective:1 (0)
iterations count:12033 (46), effective:176 (0)
iterations count:266 (1), effective:1 (0)
iterations count:21971 (84), effective:362 (1)
iterations count:353 (1), effective:1 (0)
iterations count:260 (1), effective:0 (0)
iterations count:274 (1), effective:1 (0)
iterations count:274 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:274 (1), effective:1 (0)
iterations count:23222 (89), effective:614 (2)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:353 (1), effective:1 (0)
iterations count:24081 (92), effective:631 (2)
iterations count:438 (1), effective:4 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:443 (1), effective:5 (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-11ringRR"
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-11ringRR, 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-167814483400954"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-11ringRR.tgz
mv DNAwalker-PT-11ringRR 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 '
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 ;