fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856418600225
Last Updated
May 14, 2023

About the Execution of LTSMin+red for JoinFreeModules-PT-5000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16142.955 1897994.00 2391888.00 25348.70 ?TT???TT??FT???? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418600225.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 JoinFreeModules-PT-5000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418600225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 JoinFreeModules-PT-5000-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679476634545

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 09:17:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:17:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:17:17] [INFO ] Load time of PNML (sax parser for PT used): 769 ms
[2023-03-22 09:17:17] [INFO ] Transformed 25001 places.
[2023-03-22 09:17:17] [INFO ] Transformed 40001 transitions.
[2023-03-22 09:17:17] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 980 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Initial state reduction rules removed 6 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 7638 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:17:25] [INFO ] Computed 5000 place invariants in 222 ms
[2023-03-22 09:17:27] [INFO ] Dead Transitions using invariants and state equation in 2612 ms found 0 transitions.
[2023-03-22 09:17:27] [INFO ] Invariant cache hit.
[2023-03-22 09:17:34] [INFO ] Implicit Places using invariants in 6401 ms returned []
Implicit Place search using SMT only with invariants took 6402 ms to find 0 implicit places.
[2023-03-22 09:17:34] [INFO ] Invariant cache hit.
[2023-03-22 09:17:36] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18620 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Support contains 108 out of 25000 places after structural reductions.
[2023-03-22 09:17:37] [INFO ] Flatten gal took : 1158 ms
[2023-03-22 09:17:38] [INFO ] Flatten gal took : 890 ms
[2023-03-22 09:17:40] [INFO ] Input system was already deterministic with 40001 transitions.
Incomplete random walk after 12505 steps, including 2 resets, run finished after 2666 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 265 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 264 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 264 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 263 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 311 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 293 ms. (steps per millisecond=3 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 225 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 216 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 230 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 219 ms. (steps per millisecond=4 ) properties (out of 61) seen :0
Probabilistic random walk after 65014 steps, saw 64993 distinct states, run finished after 55047 ms. (steps per millisecond=1 ) properties seen :5
Running SMT prover for 56 properties.
[2023-03-22 09:18:49] [INFO ] Invariant cache hit.
[2023-03-22 09:19:15] [INFO ] [Real]Absence check using 5000 positive place invariants in 1773 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-22 09:19:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:19:15] [INFO ] After 25146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 56 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 97 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 480 are kept as prefixes of interest. Removing 24520 places using SCC suffix rule.55 ms
Discarding 24520 places :
Also discarding 39232 output transitions
Drop transitions removed 39232 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 480 transition count 768
Applied a total of 2 rules in 407 ms. Remains 480 /25000 variables (removed 24520) and now considering 768/40001 (removed 39233) transitions.
// Phase 1: matrix 768 rows 480 cols
[2023-03-22 09:19:15] [INFO ] Computed 96 place invariants in 3 ms
[2023-03-22 09:19:16] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 846 ms. Remains : 480/25000 places, 768/40001 transitions.
Incomplete random walk after 10004 steps, including 1 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-22 09:19:16] [INFO ] Invariant cache hit.
[2023-03-22 09:19:17] [INFO ] [Real]Absence check using 96 positive place invariants in 15 ms returned sat
[2023-03-22 09:19:17] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:50
[2023-03-22 09:19:17] [INFO ] [Nat]Absence check using 96 positive place invariants in 21 ms returned sat
[2023-03-22 09:19:20] [INFO ] After 2722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :50
[2023-03-22 09:19:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 09:19:23] [INFO ] After 3169ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :50
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-22 09:19:27] [INFO ] After 6914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :50
Attempting to minimize the solution found.
Minimization took 2503 ms.
[2023-03-22 09:19:30] [INFO ] After 12991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :50
Parikh walk visited 9 properties in 30004 ms.
Support contains 57 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 768/768 transitions.
Graph (complete) has 1152 edges and 480 vertex of which 285 are kept as prefixes of interest. Removing 195 places using SCC suffix rule.1 ms
Discarding 195 places :
Also discarding 312 output transitions
Drop transitions removed 312 transitions
Applied a total of 1 rules in 14 ms. Remains 285 /480 variables (removed 195) and now considering 456/768 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 285/480 places, 456/768 transitions.
[2023-03-22 09:20:01] [INFO ] Flatten gal took : 780 ms
[2023-03-22 09:20:02] [INFO ] Flatten gal took : 1418 ms
[2023-03-22 09:20:04] [INFO ] Input system was already deterministic with 40001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4190 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:20:19] [INFO ] Computed 5000 place invariants in 86 ms
[2023-03-22 09:20:21] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6297 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:20:22] [INFO ] Flatten gal took : 727 ms
[2023-03-22 09:20:23] [INFO ] Flatten gal took : 775 ms
[2023-03-22 09:20:24] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6270 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:20:31] [INFO ] Invariant cache hit.
[2023-03-22 09:20:33] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8282 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:20:33] [INFO ] Flatten gal took : 754 ms
[2023-03-22 09:20:34] [INFO ] Flatten gal took : 745 ms
[2023-03-22 09:20:36] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6646 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:20:42] [INFO ] Invariant cache hit.
[2023-03-22 09:20:44] [INFO ] Dead Transitions using invariants and state equation in 2020 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8675 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:20:45] [INFO ] Flatten gal took : 715 ms
[2023-03-22 09:20:46] [INFO ] Flatten gal took : 760 ms
[2023-03-22 09:20:47] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6066 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:20:54] [INFO ] Invariant cache hit.
[2023-03-22 09:20:56] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8037 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:20:56] [INFO ] Flatten gal took : 715 ms
[2023-03-22 09:20:57] [INFO ] Flatten gal took : 761 ms
[2023-03-22 09:20:59] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 5694 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:21:04] [INFO ] Invariant cache hit.
[2023-03-22 09:21:06] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7691 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:21:07] [INFO ] Flatten gal took : 712 ms
[2023-03-22 09:21:08] [INFO ] Flatten gal took : 759 ms
[2023-03-22 09:21:09] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 5767 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:21:15] [INFO ] Invariant cache hit.
[2023-03-22 09:21:17] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7693 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:21:18] [INFO ] Flatten gal took : 698 ms
[2023-03-22 09:21:18] [INFO ] Flatten gal took : 736 ms
[2023-03-22 09:21:20] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 23952 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:21:44] [INFO ] Invariant cache hit.
[2023-03-22 09:21:46] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25915 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:21:47] [INFO ] Flatten gal took : 698 ms
[2023-03-22 09:21:47] [INFO ] Flatten gal took : 743 ms
[2023-03-22 09:21:49] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6231 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:21:55] [INFO ] Invariant cache hit.
[2023-03-22 09:21:57] [INFO ] Dead Transitions using invariants and state equation in 1985 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8217 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:21:58] [INFO ] Flatten gal took : 707 ms
[2023-03-22 09:21:58] [INFO ] Flatten gal took : 757 ms
[2023-03-22 09:22:00] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6756 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:22:07] [INFO ] Invariant cache hit.
[2023-03-22 09:22:09] [INFO ] Dead Transitions using invariants and state equation in 2022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8779 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:22:09] [INFO ] Flatten gal took : 708 ms
[2023-03-22 09:22:10] [INFO ] Flatten gal took : 757 ms
[2023-03-22 09:22:12] [INFO ] Input system was already deterministic with 40001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 7317 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:22:19] [INFO ] Invariant cache hit.
[2023-03-22 09:22:21] [INFO ] Dead Transitions using invariants and state equation in 2036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9354 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2023-03-22 09:22:22] [INFO ] Flatten gal took : 765 ms
[2023-03-22 09:22:23] [INFO ] Flatten gal took : 810 ms
[2023-03-22 09:22:24] [INFO ] Input system was already deterministic with 40001 transitions.
[2023-03-22 09:22:25] [INFO ] Flatten gal took : 713 ms
[2023-03-22 09:22:26] [INFO ] Flatten gal took : 750 ms
[2023-03-22 09:22:26] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-22 09:22:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25000 places, 40001 transitions and 115000 arcs took 136 ms.
Total runtime 310376 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/622/ctl_0_ --ctl=/tmp/622/ctl_1_ --ctl=/tmp/622/ctl_2_ --ctl=/tmp/622/ctl_3_ --ctl=/tmp/622/ctl_4_ --ctl=/tmp/622/ctl_5_ --ctl=/tmp/622/ctl_6_ --ctl=/tmp/622/ctl_7_ --ctl=/tmp/622/ctl_8_ --ctl=/tmp/622/ctl_9_ --mu-par --mu-opt
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-00
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-03
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-04
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-05
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-08
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-09
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-12
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-13
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-14
Could not compute solution for formula : JoinFreeModules-PT-5000-CTLCardinality-15

BK_STOP 1679478532539

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-00
ctl formula formula --ctl=/tmp/622/ctl_0_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-03
ctl formula formula --ctl=/tmp/622/ctl_1_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-04
ctl formula formula --ctl=/tmp/622/ctl_2_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-05
ctl formula formula --ctl=/tmp/622/ctl_3_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-08
ctl formula formula --ctl=/tmp/622/ctl_4_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-09
ctl formula formula --ctl=/tmp/622/ctl_5_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-12
ctl formula formula --ctl=/tmp/622/ctl_6_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-13
ctl formula formula --ctl=/tmp/622/ctl_7_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-14
ctl formula formula --ctl=/tmp/622/ctl_8_
ctl formula name JoinFreeModules-PT-5000-CTLCardinality-15
ctl formula formula --ctl=/tmp/622/ctl_9_
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 25000 places, 40001 transitions and 115000 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 1.170 real 0.510 user 0.660 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: 40001->15001 groups
pnml2lts-sym: Regrouping took 1441.790 real 1438.030 user 3.010 sys
pnml2lts-sym: state vector length is 25000; there are 15001 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: vset_sylvan: starting garbage collection

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-5000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418600225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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