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.r170-tall-167838856700098.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 Echo-PT-d03r07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856700098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 9.4K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.2M 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 Echo-PT-d03r07-CTLFireability-00
FORMULA_NAME Echo-PT-d03r07-CTLFireability-01
FORMULA_NAME Echo-PT-d03r07-CTLFireability-02
FORMULA_NAME Echo-PT-d03r07-CTLFireability-03
FORMULA_NAME Echo-PT-d03r07-CTLFireability-04
FORMULA_NAME Echo-PT-d03r07-CTLFireability-05
FORMULA_NAME Echo-PT-d03r07-CTLFireability-06
FORMULA_NAME Echo-PT-d03r07-CTLFireability-07
FORMULA_NAME Echo-PT-d03r07-CTLFireability-08
FORMULA_NAME Echo-PT-d03r07-CTLFireability-09
FORMULA_NAME Echo-PT-d03r07-CTLFireability-10
FORMULA_NAME Echo-PT-d03r07-CTLFireability-11
FORMULA_NAME Echo-PT-d03r07-CTLFireability-12
FORMULA_NAME Echo-PT-d03r07-CTLFireability-13
FORMULA_NAME Echo-PT-d03r07-CTLFireability-14
FORMULA_NAME Echo-PT-d03r07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678481493439

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=Echo-PT-d03r07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 20:51:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 20:51:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:51:35] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2023-03-10 20:51:35] [INFO ] Transformed 4209 places.
[2023-03-10 20:51:35] [INFO ] Transformed 3518 transitions.
[2023-03-10 20:51:35] [INFO ] Found NUPN structural information;
[2023-03-10 20:51:35] [INFO ] Parsed PT model containing 4209 places and 3518 transitions and 25540 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 349 out of 4209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4209/4209 places, 3518/3518 transitions.
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3866 transition count 3518
Applied a total of 343 rules in 438 ms. Remains 3866 /4209 variables (removed 343) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 20:51:43] [INFO ] Invariants computation overflowed in 7162 ms
[2023-03-10 20:51:43] [INFO ] Implicit Places using invariants in 7802 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 20:51:51] [INFO ] Invariants computation overflowed in 7375 ms
[2023-03-10 20:51:51] [INFO ] Implicit Places using invariants and state equation in 8194 ms returned []
Implicit Place search using SMT with State Equation took 16024 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 20:51:59] [INFO ] Invariants computation overflowed in 7228 ms
[2023-03-10 20:52:01] [INFO ] Dead Transitions using invariants and state equation in 9606 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/4209 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26073 ms. Remains : 3866/4209 places, 3518/3518 transitions.
Support contains 349 out of 3866 places after structural reductions.
[2023-03-10 20:52:02] [INFO ] Flatten gal took : 419 ms
[2023-03-10 20:52:02] [INFO ] Flatten gal took : 257 ms
[2023-03-10 20:52:02] [INFO ] Input system was already deterministic with 3518 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 840 ms. (steps per millisecond=11 ) properties (out of 76) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 20:52:12] [INFO ] Invariants computation overflowed in 7683 ms
[2023-03-10 20:52:37] [INFO ] After 23445ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-03-10 20:52:37] [INFO ] After 23460ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-10 20:52:37] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 77 out of 3866 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3853 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.16 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 512 ms. Remains 3852 /3866 variables (removed 14) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 3852/3866 places, 3510/3518 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3510 rows 3852 cols
[2023-03-10 20:52:45] [INFO ] Invariants computation overflowed in 6561 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-10 20:53:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 20:53:10] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 3852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 239 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 3852/3852 places, 3510/3510 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3510 rows 3852 cols
[2023-03-10 20:53:18] [INFO ] Invariants computation overflowed in 6459 ms
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-10 20:53:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 20:53:43] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 50 out of 3852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 177 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 3852/3852 places, 3510/3510 transitions.
[2023-03-10 20:53:44] [INFO ] Flatten gal took : 185 ms
[2023-03-10 20:53:44] [INFO ] Flatten gal took : 203 ms
[2023-03-10 20:53:44] [INFO ] Input system was already deterministic with 3518 transitions.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA Echo-PT-d03r07-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 161 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:45] [INFO ] Flatten gal took : 163 ms
[2023-03-10 20:53:45] [INFO ] Flatten gal took : 172 ms
[2023-03-10 20:53:45] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 344 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 347 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:46] [INFO ] Flatten gal took : 160 ms
[2023-03-10 20:53:46] [INFO ] Flatten gal took : 167 ms
[2023-03-10 20:53:46] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 215 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:46] [INFO ] Flatten gal took : 157 ms
[2023-03-10 20:53:47] [INFO ] Flatten gal took : 164 ms
[2023-03-10 20:53:47] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 177 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:47] [INFO ] Flatten gal took : 158 ms
[2023-03-10 20:53:48] [INFO ] Flatten gal took : 167 ms
[2023-03-10 20:53:48] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 224 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 224 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:48] [INFO ] Flatten gal took : 154 ms
[2023-03-10 20:53:48] [INFO ] Flatten gal took : 175 ms
[2023-03-10 20:53:49] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 184 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:49] [INFO ] Flatten gal took : 153 ms
[2023-03-10 20:53:49] [INFO ] Flatten gal took : 160 ms
[2023-03-10 20:53:49] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 246 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 247 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:50] [INFO ] Flatten gal took : 168 ms
[2023-03-10 20:53:50] [INFO ] Flatten gal took : 163 ms
[2023-03-10 20:53:50] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 171 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:51] [INFO ] Flatten gal took : 153 ms
[2023-03-10 20:53:51] [INFO ] Flatten gal took : 162 ms
[2023-03-10 20:53:51] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 186 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:52] [INFO ] Flatten gal took : 150 ms
[2023-03-10 20:53:52] [INFO ] Flatten gal took : 163 ms
[2023-03-10 20:53:52] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 180 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:52] [INFO ] Flatten gal took : 149 ms
[2023-03-10 20:53:53] [INFO ] Flatten gal took : 160 ms
[2023-03-10 20:53:53] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 189 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:53] [INFO ] Flatten gal took : 165 ms
[2023-03-10 20:53:53] [INFO ] Flatten gal took : 178 ms
[2023-03-10 20:53:54] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 147 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:54] [INFO ] Flatten gal took : 177 ms
[2023-03-10 20:53:54] [INFO ] Flatten gal took : 154 ms
[2023-03-10 20:53:54] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 146 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:55] [INFO ] Flatten gal took : 151 ms
[2023-03-10 20:53:55] [INFO ] Flatten gal took : 164 ms
[2023-03-10 20:53:55] [INFO ] Input system was already deterministic with 3518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 182 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 182 ms. Remains : 3858/3866 places, 3516/3518 transitions.
[2023-03-10 20:53:56] [INFO ] Flatten gal took : 151 ms
[2023-03-10 20:53:56] [INFO ] Flatten gal took : 164 ms
[2023-03-10 20:53:56] [INFO ] Input system was already deterministic with 3516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 147 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 3866/3866 places, 3518/3518 transitions.
[2023-03-10 20:53:56] [INFO ] Flatten gal took : 153 ms
[2023-03-10 20:53:57] [INFO ] Flatten gal took : 169 ms
[2023-03-10 20:53:57] [INFO ] Input system was already deterministic with 3518 transitions.
[2023-03-10 20:53:57] [INFO ] Flatten gal took : 176 ms
[2023-03-10 20:53:57] [INFO ] Flatten gal took : 180 ms
[2023-03-10 20:53:57] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-10 20:53:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3866 places, 3518 transitions and 23781 arcs took 25 ms.
Total runtime 142864 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: 3866 NrTr: 3518 NrArc: 23781)

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

net check time: 0m 0.004sec

init dd package: 0m 2.658sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8180500 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16099268 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.140sec

4856230

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="Echo-PT-d03r07"
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 Echo-PT-d03r07, 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 r170-tall-167838856700098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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