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.r489-tall-167912707100666.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 ltsminxred
Input is TokenRing-PT-015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707100666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 369K Feb 25 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 25 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4M Feb 25 14:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 25 14:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 134K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 472K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 274K Feb 25 15:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 15:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Feb 25 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 25 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679297486290

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-015
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:31:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:31:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:31:29] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-20 07:31:29] [INFO ] Transformed 256 places.
[2023-03-20 07:31:29] [INFO ] Transformed 3616 transitions.
[2023-03-20 07:31:29] [INFO ] Found NUPN structural information;
[2023-03-20 07:31:29] [INFO ] Completing missing partition info from NUPN : creating a component with [State_14_5, State_12_6, State_14_7, State_12_2, State_1_11, State_10_3, State_8_5, State_15_5, State_1_14, State_0_10, State_10_15, State_6_4, State_8_14, State_2_3, State_3_12, State_15_13, State_4_7, State_2_11, State_6_8, State_0_6, State_7_1, State_3_7, State_5_0, State_13_12, State_11_15, State_11_11, State_9_14, State_5_4, State_13_8, State_4_8, State_7_3, State_9_2, State_14_9, State_13_15, State_12_4, State_10_5, State_3_10, State_14_3, State_12_14, State_2_1, State_6_15, State_5_14, State_13_6, State_6_6, State_10_8, State_11_0, State_1_13, State_15_3, State_8_0, State_1_0, State_11_5, State_3_13, State_15_8, State_9_4, State_4_10, State_9_9, State_7_11, State_8_3, State_0_12, State_2_9, State_7_8, State_5_6, State_4_5, State_0_7]
[2023-03-20 07:31:29] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 230 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 92 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:31:31] [INFO ] Computed 16 place invariants in 46 ms
[2023-03-20 07:31:31] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-20 07:31:31] [INFO ] Invariant cache hit.
[2023-03-20 07:31:32] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:31:32] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
[2023-03-20 07:31:32] [INFO ] Invariant cache hit.
[2023-03-20 07:31:33] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2726 ms. Remains : 256/256 places, 3616/3616 transitions.
Support contains 256 out of 256 places after structural reductions.
[2023-03-20 07:31:35] [INFO ] Flatten gal took : 838 ms
[2023-03-20 07:31:45] [INFO ] Flatten gal took : 1130 ms
[2023-03-20 07:31:55] [INFO ] Input system was already deterministic with 3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7960 ms. (steps per millisecond=1 ) properties (out of 57) seen :15
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=1 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=1 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 898 ms. (steps per millisecond=1 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=1 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=5 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=4 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=5 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=5 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=4 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=5 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=3 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=6 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=5 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=7 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=5 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=5 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=4 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=4 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=3 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
[2023-03-20 07:32:14] [INFO ] Invariant cache hit.
[2023-03-20 07:33:41] [INFO ] [Real]Absence check using 16 positive place invariants in 37 ms returned sat
[2023-03-20 07:33:57] [INFO ] After 15647ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:32
[2023-03-20 07:33:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:33:58] [INFO ] After 771ms SMT Verify possible using 3390 Read/Feed constraints in real domain returned unsat :2 sat :0 real:34
[2023-03-20 07:33:58] [INFO ] After 20107ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:34
[2023-03-20 07:33:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2023-03-20 07:34:13] [INFO ] After 13628ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :29
[2023-03-20 07:34:17] [INFO ] After 4243ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :7 sat :29
[2023-03-20 07:34:25] [INFO ] Deduced a trap composed of 143 places in 8087 ms of which 25 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 07:34:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:34:25] [INFO ] After 27365ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:34
Fused 36 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 1787 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 298 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 256/256 places, 3616/3616 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA TokenRing-PT-015-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 07:34:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 07:34:32] [INFO ] Flatten gal took : 3589 ms
FORMULA TokenRing-PT-015-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 07:34:59] [INFO ] Flatten gal took : 1037 ms
[2023-03-20 07:35:12] [INFO ] Input system was already deterministic with 3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:13] [INFO ] Flatten gal took : 237 ms
[2023-03-20 07:35:14] [INFO ] Flatten gal took : 371 ms
[2023-03-20 07:35:14] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:15] [INFO ] Flatten gal took : 105 ms
[2023-03-20 07:35:15] [INFO ] Flatten gal took : 150 ms
[2023-03-20 07:35:15] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 76 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:16] [INFO ] Flatten gal took : 77 ms
[2023-03-20 07:35:16] [INFO ] Flatten gal took : 120 ms
[2023-03-20 07:35:16] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 56 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:16] [INFO ] Flatten gal took : 87 ms
[2023-03-20 07:35:16] [INFO ] Flatten gal took : 119 ms
[2023-03-20 07:35:17] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:17] [INFO ] Flatten gal took : 181 ms
[2023-03-20 07:35:17] [INFO ] Flatten gal took : 274 ms
[2023-03-20 07:35:18] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 53 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:18] [INFO ] Flatten gal took : 90 ms
[2023-03-20 07:35:18] [INFO ] Flatten gal took : 123 ms
[2023-03-20 07:35:19] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 55 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:19] [INFO ] Flatten gal took : 90 ms
[2023-03-20 07:35:19] [INFO ] Flatten gal took : 123 ms
[2023-03-20 07:35:19] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:20] [INFO ] Flatten gal took : 59 ms
[2023-03-20 07:35:20] [INFO ] Flatten gal took : 69 ms
[2023-03-20 07:35:20] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 155 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:20] [INFO ] Flatten gal took : 53 ms
[2023-03-20 07:35:20] [INFO ] Flatten gal took : 64 ms
[2023-03-20 07:35:20] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 82 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:20] [INFO ] Flatten gal took : 53 ms
[2023-03-20 07:35:20] [INFO ] Flatten gal took : 61 ms
[2023-03-20 07:35:21] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 21 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:21] [INFO ] Flatten gal took : 55 ms
[2023-03-20 07:35:21] [INFO ] Flatten gal took : 60 ms
[2023-03-20 07:35:21] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 76 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:21] [INFO ] Flatten gal took : 55 ms
[2023-03-20 07:35:21] [INFO ] Flatten gal took : 63 ms
[2023-03-20 07:35:21] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 108 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:21] [INFO ] Flatten gal took : 79 ms
[2023-03-20 07:35:22] [INFO ] Flatten gal took : 272 ms
[2023-03-20 07:35:22] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 78 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 07:35:22] [INFO ] Flatten gal took : 58 ms
[2023-03-20 07:35:22] [INFO ] Flatten gal took : 68 ms
[2023-03-20 07:35:22] [INFO ] Input system was already deterministic with 3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 111630 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111630 steps, saw 22127 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:35:26] [INFO ] Invariant cache hit.
[2023-03-20 07:35:26] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-20 07:35:26] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:35:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:35:27] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:35:27] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:35:28] [INFO ] After 748ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:35:28] [INFO ] After 1410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-20 07:35:28] [INFO ] After 2189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 255 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 85 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 256/256 places, 3616/3616 transitions.
Finished random walk after 193 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=7 )
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5508 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4833 ms. (steps per millisecond=206 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1653495 steps, run timeout after 30001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 1653495 steps, saw 265775 distinct states, run finished after 30001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:36:09] [INFO ] Invariant cache hit.
[2023-03-20 07:36:09] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2023-03-20 07:36:10] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:36:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:36:11] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:36:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:36:11] [INFO ] After 876ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:36:12] [INFO ] After 1028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-20 07:36:12] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 191 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 60 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 59 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:36:12] [INFO ] Invariant cache hit.
[2023-03-20 07:36:12] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-20 07:36:12] [INFO ] Invariant cache hit.
[2023-03-20 07:36:13] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:36:20] [INFO ] Implicit Places using invariants and state equation in 7464 ms returned []
Implicit Place search using SMT with State Equation took 7886 ms to find 0 implicit places.
[2023-03-20 07:36:20] [INFO ] Redundant transitions in 287 ms returned []
[2023-03-20 07:36:20] [INFO ] Invariant cache hit.
[2023-03-20 07:36:21] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9468 ms. Remains : 256/256 places, 3616/3616 transitions.
Finished random walk after 193 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=16 )
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 4 ms
Free SCC test removed 238 places
Drop transitions removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 17 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-20 07:36:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 07:36:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 07:36:22] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 07:36:22] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 07:36:22] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:36:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-20 07:36:22] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:36:22] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 07:36:22] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:36:23] [INFO ] Flatten gal took : 806 ms
[2023-03-20 07:36:29] [INFO ] Flatten gal took : 701 ms
[2023-03-20 07:36:35] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 363 ms.
[2023-03-20 07:36:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 256 places, 3616 transitions and 14464 arcs took 15 ms.
Total runtime 306115 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/528/ctl_0_ --ctl=/tmp/528/ctl_1_ --ctl=/tmp/528/ctl_2_ --ctl=/tmp/528/ctl_3_ --ctl=/tmp/528/ctl_4_ --ctl=/tmp/528/ctl_5_ --ctl=/tmp/528/ctl_6_ --ctl=/tmp/528/ctl_7_ --ctl=/tmp/528/ctl_8_ --ctl=/tmp/528/ctl_9_ --ctl=/tmp/528/ctl_10_ --ctl=/tmp/528/ctl_11_ --ctl=/tmp/528/ctl_12_ --ctl=/tmp/528/ctl_13_ --mu-par --mu-opt
FORMULA TokenRing-PT-015-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-015-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679298055901

--------------------
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
mcc2023
ctl formula name TokenRing-PT-015-CTLFireability-00
ctl formula formula --ctl=/tmp/528/ctl_0_
ctl formula name TokenRing-PT-015-CTLFireability-02
ctl formula formula --ctl=/tmp/528/ctl_1_
ctl formula name TokenRing-PT-015-CTLFireability-03
ctl formula formula --ctl=/tmp/528/ctl_2_
ctl formula name TokenRing-PT-015-CTLFireability-04
ctl formula formula --ctl=/tmp/528/ctl_3_
ctl formula name TokenRing-PT-015-CTLFireability-05
ctl formula formula --ctl=/tmp/528/ctl_4_
ctl formula name TokenRing-PT-015-CTLFireability-06
ctl formula formula --ctl=/tmp/528/ctl_5_
ctl formula name TokenRing-PT-015-CTLFireability-07
ctl formula formula --ctl=/tmp/528/ctl_6_
ctl formula name TokenRing-PT-015-CTLFireability-08
ctl formula formula --ctl=/tmp/528/ctl_7_
ctl formula name TokenRing-PT-015-CTLFireability-09
ctl formula formula --ctl=/tmp/528/ctl_8_
ctl formula name TokenRing-PT-015-CTLFireability-10
ctl formula formula --ctl=/tmp/528/ctl_9_
ctl formula name TokenRing-PT-015-CTLFireability-11
ctl formula formula --ctl=/tmp/528/ctl_10_
ctl formula name TokenRing-PT-015-CTLFireability-13
ctl formula formula --ctl=/tmp/528/ctl_11_
ctl formula name TokenRing-PT-015-CTLFireability-14
ctl formula formula --ctl=/tmp/528/ctl_12_
ctl formula name TokenRing-PT-015-CTLFireability-15
ctl formula formula --ctl=/tmp/528/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 256 places, 3616 transitions and 14464 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.030 real 0.020 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 3616->3616 groups
pnml2lts-sym: Regrouping took 1.920 real 1.920 user 0.000 sys
pnml2lts-sym: state vector length is 256; there are 3616 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 2651835 group checks and 0 next state calls
pnml2lts-sym: reachability took 19.420 real 71.780 user 5.540 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 35357924 states, 18662 nodes
pnml2lts-sym: Formula /tmp/528/ctl_13_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/528/ctl_2_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/528/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_4_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/528/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_9_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/528/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/528/ctl_10_ does not hold for the initial state
pnml2lts-sym: group_next: 6545 nodes total
pnml2lts-sym: group_explored: 28119 nodes, 18893 short vectors total
pnml2lts-sym: max token count: 1
free(): invalid pointer
free(): invalid pointer
free(): invalid pointer
free(): invalid pointer

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is TokenRing-PT-015, 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 r489-tall-167912707100666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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